/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.c /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- Ultimate: Cannot open display: This is Ultimate 0.1.25-34f2e62 [2020-07-01 11:01:09,881 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-01 11:01:09,883 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-01 11:01:09,895 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-01 11:01:09,895 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-01 11:01:09,896 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-01 11:01:09,897 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-01 11:01:09,899 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-01 11:01:09,901 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-01 11:01:09,901 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-01 11:01:09,902 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-01 11:01:09,903 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-01 11:01:09,903 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-01 11:01:09,904 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-01 11:01:09,905 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-01 11:01:09,906 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-01 11:01:09,907 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-01 11:01:09,908 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-01 11:01:09,909 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-01 11:01:09,911 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-01 11:01:09,912 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-01 11:01:09,913 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-01 11:01:09,915 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-01 11:01:09,915 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-01 11:01:09,917 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-01 11:01:09,918 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-01 11:01:09,918 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-01 11:01:09,919 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-01 11:01:09,919 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-01 11:01:09,920 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-01 11:01:09,920 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-01 11:01:09,921 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-01 11:01:09,922 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-01 11:01:09,922 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-01 11:01:09,923 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-01 11:01:09,923 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-01 11:01:09,924 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-01 11:01:09,924 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-01 11:01:09,924 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-01 11:01:09,925 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-01 11:01:09,926 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-01 11:01:09,927 INFO L101 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf [2020-07-01 11:01:09,941 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-01 11:01:09,941 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-01 11:01:09,942 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-01 11:01:09,942 INFO L138 SettingsManager]: * Rewrite not-equals=true [2020-07-01 11:01:09,942 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-01 11:01:09,943 INFO L138 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-07-01 11:01:09,943 INFO L138 SettingsManager]: * Use SBE=true [2020-07-01 11:01:09,943 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-01 11:01:09,943 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-01 11:01:09,943 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-01 11:01:09,944 INFO L138 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-07-01 11:01:09,944 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-01 11:01:09,944 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-01 11:01:09,944 INFO L138 SettingsManager]: * Construct termination proof for TermComp=true [2020-07-01 11:01:09,944 INFO L138 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:01:09,944 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-01 11:01:09,945 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-01 11:01:09,945 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-01 11:01:09,945 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-01 11:01:09,945 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-01 11:01:09,945 INFO L138 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-07-01 11:01:09,945 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-01 11:01:09,946 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-01 11:01:09,946 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-01 11:01:09,946 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 11:01:09,946 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-01 11:01:09,946 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-01 11:01:09,947 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-01 11:01:09,947 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-01 11:01:10,114 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-01 11:01:10,129 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-01 11:01:10,133 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-01 11:01:10,134 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-01 11:01:10,135 INFO L275 PluginConnector]: CDTParser initialized [2020-07-01 11:01:10,136 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-07-01 11:01:10,204 INFO L220 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/BenchExec_run_nQrMfG/tmp/011548b6133f492a875ddd59af907cb0/FLAG80f1a3a64 [2020-07-01 11:01:10,548 INFO L306 CDTParser]: Found 1 translation units. [2020-07-01 11:01:10,549 INFO L160 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-07-01 11:01:10,549 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-07-01 11:01:10,556 INFO L349 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/BenchExec_run_nQrMfG/tmp/011548b6133f492a875ddd59af907cb0/FLAG80f1a3a64 [2020-07-01 11:01:10,942 INFO L357 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/BenchExec_run_nQrMfG/tmp/011548b6133f492a875ddd59af907cb0 [2020-07-01 11:01:10,955 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-01 11:01:10,956 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-07-01 11:01:10,957 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-01 11:01:10,957 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-01 11:01:10,961 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-01 11:01:10,962 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 11:01:10" (1/1) ... [2020-07-01 11:01:10,965 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ad4e32b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:01:10, skipping insertion in model container [2020-07-01 11:01:10,965 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 11:01:10" (1/1) ... [2020-07-01 11:01:10,974 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-01 11:01:10,992 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-01 11:01:11,234 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 11:01:11,247 INFO L203 MainTranslator]: Completed pre-run [2020-07-01 11:01:11,268 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 11:01:11,285 INFO L208 MainTranslator]: Completed translation [2020-07-01 11:01:11,285 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:01:11 WrapperNode [2020-07-01 11:01:11,285 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-01 11:01:11,286 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-01 11:01:11,286 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-01 11:01:11,287 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-01 11:01:11,296 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:01:11" (1/1) ... [2020-07-01 11:01:11,306 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:01:11" (1/1) ... [2020-07-01 11:01:11,330 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-01 11:01:11,331 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-01 11:01:11,331 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-01 11:01:11,331 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-01 11:01:11,341 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:01:11" (1/1) ... [2020-07-01 11:01:11,341 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:01:11" (1/1) ... [2020-07-01 11:01:11,344 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:01:11" (1/1) ... [2020-07-01 11:01:11,344 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:01:11" (1/1) ... [2020-07-01 11:01:11,350 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:01:11" (1/1) ... [2020-07-01 11:01:11,356 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:01:11" (1/1) ... [2020-07-01 11:01:11,357 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:01:11" (1/1) ... [2020-07-01 11:01:11,360 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-01 11:01:11,361 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-01 11:01:11,361 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-01 11:01:11,361 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-01 11:01:11,362 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:01:11" (1/1) ... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 11:01:11,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-01 11:01:11,435 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-01 11:01:11,435 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-01 11:01:11,435 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-01 11:01:11,435 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-01 11:01:11,731 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-01 11:01:11,732 INFO L295 CfgBuilder]: Removed 11 assume(true) statements. [2020-07-01 11:01:11,736 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 11:01:11 BoogieIcfgContainer [2020-07-01 11:01:11,736 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-01 11:01:11,737 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-07-01 11:01:11,737 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-07-01 11:01:11,739 INFO L275 PluginConnector]: BlockEncodingV2 initialized [2020-07-01 11:01:11,740 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 11:01:11" (1/1) ... [2020-07-01 11:01:11,757 INFO L313 BlockEncoder]: Initial Icfg 47 locations, 55 edges [2020-07-01 11:01:11,758 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-07-01 11:01:11,759 INFO L263 BlockEncoder]: Using Maximize final states [2020-07-01 11:01:11,759 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-07-01 11:01:11,760 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-07-01 11:01:11,762 INFO L296 BlockEncoder]: Using Remove sink states [2020-07-01 11:01:11,763 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-07-01 11:01:11,763 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-07-01 11:01:11,791 INFO L185 BlockEncoder]: Using Use SBE [2020-07-01 11:01:11,823 INFO L200 BlockEncoder]: SBE split 22 edges [2020-07-01 11:01:11,828 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-07-01 11:01:11,830 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 11:01:11,879 INFO L100 BaseMinimizeStates]: Removed 18 edges and 9 locations by large block encoding [2020-07-01 11:01:11,882 INFO L70 RemoveSinkStates]: Removed 8 edges and 4 locations by removing sink states [2020-07-01 11:01:11,883 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 11:01:11,883 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 11:01:11,884 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-07-01 11:01:11,884 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-07-01 11:01:11,885 INFO L313 BlockEncoder]: Encoded RCFG 34 locations, 62 edges [2020-07-01 11:01:11,885 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 11:01:11 BasicIcfg [2020-07-01 11:01:11,885 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-07-01 11:01:11,887 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-01 11:01:11,887 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-01 11:01:11,890 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-01 11:01:11,890 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.07 11:01:10" (1/4) ... [2020-07-01 11:01:11,891 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ea0fcab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 11:01:11, skipping insertion in model container [2020-07-01 11:01:11,892 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:01:11" (2/4) ... [2020-07-01 11:01:11,892 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ea0fcab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 11:01:11, skipping insertion in model container [2020-07-01 11:01:11,892 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 11:01:11" (3/4) ... [2020-07-01 11:01:11,893 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ea0fcab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 11:01:11, skipping insertion in model container [2020-07-01 11:01:11,893 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 11:01:11" (4/4) ... [2020-07-01 11:01:11,895 INFO L109 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 11:01:11,905 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-07-01 11:01:11,913 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 14 error locations. [2020-07-01 11:01:11,927 INFO L251 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2020-07-01 11:01:11,951 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-01 11:01:11,951 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-01 11:01:11,951 INFO L377 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 11:01:11,951 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 11:01:11,951 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 11:01:11,952 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-01 11:01:11,952 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 11:01:11,952 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-01 11:01:11,968 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2020-07-01 11:01:11,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 11:01:11,974 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 11:01:11,975 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 11:01:11,975 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 11:01:11,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:01:11,981 INFO L82 PathProgramCache]: Analyzing trace with hash 7657052, now seen corresponding path program 1 times [2020-07-01 11:01:11,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:01:11,992 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360586482] [2020-07-01 11:01:11,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:01:12,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:01:12,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:01:12,154 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360586482] [2020-07-01 11:01:12,155 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 11:01:12,155 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 11:01:12,156 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779749536] [2020-07-01 11:01:12,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 11:01:12,161 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:01:12,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 11:01:12,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 11:01:12,179 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 3 states. [2020-07-01 11:01:12,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:01:12,310 INFO L93 Difference]: Finished difference Result 34 states and 62 transitions. [2020-07-01 11:01:12,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 11:01:12,312 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 11:01:12,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 11:01:12,326 INFO L225 Difference]: With dead ends: 34 [2020-07-01 11:01:12,326 INFO L226 Difference]: Without dead ends: 32 [2020-07-01 11:01:12,329 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 11:01:12,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-07-01 11:01:12,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-07-01 11:01:12,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-01 11:01:12,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 58 transitions. [2020-07-01 11:01:12,371 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 58 transitions. Word has length 4 [2020-07-01 11:01:12,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 11:01:12,371 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 58 transitions. [2020-07-01 11:01:12,372 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 11:01:12,372 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 58 transitions. [2020-07-01 11:01:12,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 11:01:12,372 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 11:01:12,372 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 11:01:12,374 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-01 11:01:12,374 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 11:01:12,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:01:12,375 INFO L82 PathProgramCache]: Analyzing trace with hash 7657054, now seen corresponding path program 1 times [2020-07-01 11:01:12,375 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:01:12,375 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864706313] [2020-07-01 11:01:12,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:01:12,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:01:12,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:01:12,406 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864706313] [2020-07-01 11:01:12,406 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 11:01:12,406 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 11:01:12,406 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831017870] [2020-07-01 11:01:12,408 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 11:01:12,408 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:01:12,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 11:01:12,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 11:01:12,409 INFO L87 Difference]: Start difference. First operand 32 states and 58 transitions. Second operand 3 states. [2020-07-01 11:01:12,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:01:12,494 INFO L93 Difference]: Finished difference Result 34 states and 58 transitions. [2020-07-01 11:01:12,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 11:01:12,494 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 11:01:12,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 11:01:12,495 INFO L225 Difference]: With dead ends: 34 [2020-07-01 11:01:12,495 INFO L226 Difference]: Without dead ends: 32 [2020-07-01 11:01:12,496 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 11:01:12,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-07-01 11:01:12,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-07-01 11:01:12,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-01 11:01:12,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 56 transitions. [2020-07-01 11:01:12,502 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 56 transitions. Word has length 4 [2020-07-01 11:01:12,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 11:01:12,503 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 56 transitions. [2020-07-01 11:01:12,503 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 11:01:12,503 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 56 transitions. [2020-07-01 11:01:12,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 11:01:12,503 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 11:01:12,504 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 11:01:12,504 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-01 11:01:12,504 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 11:01:12,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:01:12,504 INFO L82 PathProgramCache]: Analyzing trace with hash 7657055, now seen corresponding path program 1 times [2020-07-01 11:01:12,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:01:12,505 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347363604] [2020-07-01 11:01:12,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:01:12,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:01:12,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:01:12,550 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347363604] [2020-07-01 11:01:12,550 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 11:01:12,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 11:01:12,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715944870] [2020-07-01 11:01:12,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 11:01:12,551 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:01:12,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 11:01:12,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-01 11:01:12,552 INFO L87 Difference]: Start difference. First operand 32 states and 56 transitions. Second operand 4 states. [2020-07-01 11:01:12,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:01:12,645 INFO L93 Difference]: Finished difference Result 32 states and 56 transitions. [2020-07-01 11:01:12,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 11:01:12,645 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2020-07-01 11:01:12,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 11:01:12,646 INFO L225 Difference]: With dead ends: 32 [2020-07-01 11:01:12,646 INFO L226 Difference]: Without dead ends: 30 [2020-07-01 11:01:12,647 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-01 11:01:12,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-01 11:01:12,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-07-01 11:01:12,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-01 11:01:12,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 54 transitions. [2020-07-01 11:01:12,652 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 54 transitions. Word has length 4 [2020-07-01 11:01:12,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 11:01:12,652 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 54 transitions. [2020-07-01 11:01:12,652 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 11:01:12,653 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 54 transitions. [2020-07-01 11:01:12,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-01 11:01:12,653 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 11:01:12,653 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 11:01:12,653 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-01 11:01:12,654 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 11:01:12,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:01:12,654 INFO L82 PathProgramCache]: Analyzing trace with hash 773565417, now seen corresponding path program 1 times [2020-07-01 11:01:12,654 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:01:12,654 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573524708] [2020-07-01 11:01:12,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:01:12,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:01:12,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:01:12,697 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573524708] [2020-07-01 11:01:12,697 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 11:01:12,697 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 11:01:12,698 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623345666] [2020-07-01 11:01:12,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 11:01:12,698 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:01:12,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 11:01:12,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 11:01:12,699 INFO L87 Difference]: Start difference. First operand 30 states and 54 transitions. Second operand 3 states. [2020-07-01 11:01:12,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:01:12,811 INFO L93 Difference]: Finished difference Result 54 states and 101 transitions. [2020-07-01 11:01:12,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 11:01:12,811 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-07-01 11:01:12,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 11:01:12,812 INFO L225 Difference]: With dead ends: 54 [2020-07-01 11:01:12,813 INFO L226 Difference]: Without dead ends: 32 [2020-07-01 11:01:12,813 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 11:01:12,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-07-01 11:01:12,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-07-01 11:01:12,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-01 11:01:12,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 56 transitions. [2020-07-01 11:01:12,819 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 56 transitions. Word has length 11 [2020-07-01 11:01:12,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 11:01:12,820 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 56 transitions. [2020-07-01 11:01:12,820 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 11:01:12,820 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 56 transitions. [2020-07-01 11:01:12,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-01 11:01:12,820 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 11:01:12,821 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 11:01:12,821 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-01 11:01:12,821 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 11:01:12,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:01:12,821 INFO L82 PathProgramCache]: Analyzing trace with hash 773566378, now seen corresponding path program 1 times [2020-07-01 11:01:12,822 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:01:12,822 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439812528] [2020-07-01 11:01:12,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:01:12,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:01:12,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:01:12,863 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439812528] [2020-07-01 11:01:12,863 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 11:01:12,863 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 11:01:12,863 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467117997] [2020-07-01 11:01:12,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 11:01:12,864 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:01:12,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 11:01:12,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 11:01:12,865 INFO L87 Difference]: Start difference. First operand 32 states and 56 transitions. Second operand 3 states. [2020-07-01 11:01:12,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:01:12,985 INFO L93 Difference]: Finished difference Result 70 states and 122 transitions. [2020-07-01 11:01:12,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 11:01:12,985 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-07-01 11:01:12,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 11:01:12,986 INFO L225 Difference]: With dead ends: 70 [2020-07-01 11:01:12,986 INFO L226 Difference]: Without dead ends: 46 [2020-07-01 11:01:12,987 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 11:01:12,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-07-01 11:01:12,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 37. [2020-07-01 11:01:12,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-07-01 11:01:12,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 68 transitions. [2020-07-01 11:01:12,993 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 68 transitions. Word has length 11 [2020-07-01 11:01:12,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 11:01:12,993 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 68 transitions. [2020-07-01 11:01:12,993 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 11:01:12,994 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 68 transitions. [2020-07-01 11:01:12,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-01 11:01:12,994 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 11:01:12,994 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 11:01:12,995 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-01 11:01:12,995 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 11:01:12,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:01:12,995 INFO L82 PathProgramCache]: Analyzing trace with hash 773596169, now seen corresponding path program 1 times [2020-07-01 11:01:12,995 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:01:12,996 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474461086] [2020-07-01 11:01:12,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:01:13,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:01:13,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:01:13,079 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474461086] [2020-07-01 11:01:13,099 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 11:01:13,099 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-01 11:01:13,099 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089202941] [2020-07-01 11:01:13,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-01 11:01:13,100 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:01:13,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-01 11:01:13,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-01 11:01:13,101 INFO L87 Difference]: Start difference. First operand 37 states and 68 transitions. Second operand 6 states. [2020-07-01 11:01:13,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:01:13,464 INFO L93 Difference]: Finished difference Result 124 states and 247 transitions. [2020-07-01 11:01:13,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-01 11:01:13,464 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2020-07-01 11:01:13,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 11:01:13,466 INFO L225 Difference]: With dead ends: 124 [2020-07-01 11:01:13,466 INFO L226 Difference]: Without dead ends: 121 [2020-07-01 11:01:13,467 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2020-07-01 11:01:13,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2020-07-01 11:01:13,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 34. [2020-07-01 11:01:13,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-07-01 11:01:13,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 60 transitions. [2020-07-01 11:01:13,475 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 60 transitions. Word has length 11 [2020-07-01 11:01:13,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 11:01:13,475 INFO L479 AbstractCegarLoop]: Abstraction has 34 states and 60 transitions. [2020-07-01 11:01:13,475 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-01 11:01:13,475 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 60 transitions. [2020-07-01 11:01:13,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-01 11:01:13,476 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 11:01:13,476 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 11:01:13,476 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-01 11:01:13,476 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 11:01:13,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:01:13,477 INFO L82 PathProgramCache]: Analyzing trace with hash 773596171, now seen corresponding path program 1 times [2020-07-01 11:01:13,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:01:13,477 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856928665] [2020-07-01 11:01:13,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:01:13,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:01:13,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:01:13,525 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856928665] [2020-07-01 11:01:13,525 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 11:01:13,525 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-01 11:01:13,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217836347] [2020-07-01 11:01:13,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-01 11:01:13,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:01:13,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-01 11:01:13,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-01 11:01:13,527 INFO L87 Difference]: Start difference. First operand 34 states and 60 transitions. Second operand 5 states. [2020-07-01 11:01:13,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:01:13,652 INFO L93 Difference]: Finished difference Result 63 states and 107 transitions. [2020-07-01 11:01:13,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-01 11:01:13,653 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-07-01 11:01:13,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 11:01:13,654 INFO L225 Difference]: With dead ends: 63 [2020-07-01 11:01:13,654 INFO L226 Difference]: Without dead ends: 60 [2020-07-01 11:01:13,655 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-07-01 11:01:13,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2020-07-01 11:01:13,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 48. [2020-07-01 11:01:13,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-07-01 11:01:13,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 91 transitions. [2020-07-01 11:01:13,662 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 91 transitions. Word has length 11 [2020-07-01 11:01:13,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 11:01:13,663 INFO L479 AbstractCegarLoop]: Abstraction has 48 states and 91 transitions. [2020-07-01 11:01:13,663 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-01 11:01:13,663 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 91 transitions. [2020-07-01 11:01:13,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-01 11:01:13,663 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 11:01:13,664 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 11:01:13,664 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-01 11:01:13,664 INFO L427 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 11:01:13,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:01:13,664 INFO L82 PathProgramCache]: Analyzing trace with hash 773596172, now seen corresponding path program 1 times [2020-07-01 11:01:13,664 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:01:13,665 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847248953] [2020-07-01 11:01:13,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:01:13,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:01:13,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:01:13,757 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847248953] [2020-07-01 11:01:13,758 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 11:01:13,758 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-01 11:01:13,758 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155216194] [2020-07-01 11:01:13,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-01 11:01:13,759 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:01:13,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-01 11:01:13,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-01 11:01:13,759 INFO L87 Difference]: Start difference. First operand 48 states and 91 transitions. Second operand 7 states. [2020-07-01 11:01:14,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:01:14,269 INFO L93 Difference]: Finished difference Result 198 states and 363 transitions. [2020-07-01 11:01:14,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-01 11:01:14,269 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2020-07-01 11:01:14,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 11:01:14,271 INFO L225 Difference]: With dead ends: 198 [2020-07-01 11:01:14,271 INFO L226 Difference]: Without dead ends: 195 [2020-07-01 11:01:14,272 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2020-07-01 11:01:14,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2020-07-01 11:01:14,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 67. [2020-07-01 11:01:14,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2020-07-01 11:01:14,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 126 transitions. [2020-07-01 11:01:14,284 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 126 transitions. Word has length 11 [2020-07-01 11:01:14,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 11:01:14,284 INFO L479 AbstractCegarLoop]: Abstraction has 67 states and 126 transitions. [2020-07-01 11:01:14,284 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-01 11:01:14,284 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 126 transitions. [2020-07-01 11:01:14,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-01 11:01:14,285 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 11:01:14,285 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 11:01:14,285 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-01 11:01:14,286 INFO L427 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 11:01:14,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:01:14,286 INFO L82 PathProgramCache]: Analyzing trace with hash -1033858291, now seen corresponding path program 1 times [2020-07-01 11:01:14,286 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:01:14,286 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819681425] [2020-07-01 11:01:14,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:01:14,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:01:14,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:01:14,377 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819681425] [2020-07-01 11:01:14,377 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 11:01:14,377 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-01 11:01:14,377 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866091900] [2020-07-01 11:01:14,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-01 11:01:14,378 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:01:14,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-01 11:01:14,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-01 11:01:14,379 INFO L87 Difference]: Start difference. First operand 67 states and 126 transitions. Second operand 7 states. [2020-07-01 11:01:14,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:01:14,561 INFO L93 Difference]: Finished difference Result 79 states and 138 transitions. [2020-07-01 11:01:14,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-01 11:01:14,561 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2020-07-01 11:01:14,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 11:01:14,562 INFO L225 Difference]: With dead ends: 79 [2020-07-01 11:01:14,562 INFO L226 Difference]: Without dead ends: 76 [2020-07-01 11:01:14,563 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2020-07-01 11:01:14,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2020-07-01 11:01:14,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 48. [2020-07-01 11:01:14,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-07-01 11:01:14,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 87 transitions. [2020-07-01 11:01:14,570 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 87 transitions. Word has length 11 [2020-07-01 11:01:14,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 11:01:14,570 INFO L479 AbstractCegarLoop]: Abstraction has 48 states and 87 transitions. [2020-07-01 11:01:14,570 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-01 11:01:14,570 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 87 transitions. [2020-07-01 11:01:14,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-01 11:01:14,571 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 11:01:14,571 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 11:01:14,571 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-01 11:01:14,571 INFO L427 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 11:01:14,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:01:14,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1788325119, now seen corresponding path program 1 times [2020-07-01 11:01:14,572 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:01:14,572 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739225058] [2020-07-01 11:01:14,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:01:14,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:01:14,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:01:14,630 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739225058] [2020-07-01 11:01:14,630 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 11:01:14,631 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-01 11:01:14,631 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106310997] [2020-07-01 11:01:14,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-01 11:01:14,631 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:01:14,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-01 11:01:14,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-01 11:01:14,632 INFO L87 Difference]: Start difference. First operand 48 states and 87 transitions. Second operand 5 states. [2020-07-01 11:01:14,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:01:14,843 INFO L93 Difference]: Finished difference Result 102 states and 181 transitions. [2020-07-01 11:01:14,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-01 11:01:14,843 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-07-01 11:01:14,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 11:01:14,844 INFO L225 Difference]: With dead ends: 102 [2020-07-01 11:01:14,844 INFO L226 Difference]: Without dead ends: 100 [2020-07-01 11:01:14,845 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-07-01 11:01:14,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2020-07-01 11:01:14,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 62. [2020-07-01 11:01:14,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-07-01 11:01:14,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 113 transitions. [2020-07-01 11:01:14,854 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 113 transitions. Word has length 12 [2020-07-01 11:01:14,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 11:01:14,854 INFO L479 AbstractCegarLoop]: Abstraction has 62 states and 113 transitions. [2020-07-01 11:01:14,854 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-01 11:01:14,854 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 113 transitions. [2020-07-01 11:01:14,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-01 11:01:14,855 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 11:01:14,855 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 11:01:14,855 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-01 11:01:14,856 INFO L427 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 11:01:14,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:01:14,856 INFO L82 PathProgramCache]: Analyzing trace with hash -1788325122, now seen corresponding path program 1 times [2020-07-01 11:01:14,856 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:01:14,856 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356415084] [2020-07-01 11:01:14,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:01:14,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:01:14,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:01:14,893 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356415084] [2020-07-01 11:01:14,894 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 11:01:14,894 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 11:01:14,894 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803477676] [2020-07-01 11:01:14,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 11:01:14,895 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:01:14,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 11:01:14,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-01 11:01:14,895 INFO L87 Difference]: Start difference. First operand 62 states and 113 transitions. Second operand 4 states. [2020-07-01 11:01:14,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:01:14,968 INFO L93 Difference]: Finished difference Result 62 states and 113 transitions. [2020-07-01 11:01:14,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 11:01:14,969 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-07-01 11:01:14,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 11:01:14,970 INFO L225 Difference]: With dead ends: 62 [2020-07-01 11:01:14,970 INFO L226 Difference]: Without dead ends: 55 [2020-07-01 11:01:14,970 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-01 11:01:14,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-07-01 11:01:14,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2020-07-01 11:01:14,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-07-01 11:01:14,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 93 transitions. [2020-07-01 11:01:14,977 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 93 transitions. Word has length 12 [2020-07-01 11:01:14,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 11:01:14,983 INFO L479 AbstractCegarLoop]: Abstraction has 55 states and 93 transitions. [2020-07-01 11:01:14,984 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 11:01:14,984 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 93 transitions. [2020-07-01 11:01:14,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-01 11:01:14,984 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 11:01:14,985 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 11:01:14,985 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-01 11:01:14,985 INFO L427 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 11:01:14,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:01:14,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1012066008, now seen corresponding path program 1 times [2020-07-01 11:01:14,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:01:14,986 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756814463] [2020-07-01 11:01:14,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:01:14,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:01:15,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:01:15,037 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756814463] [2020-07-01 11:01:15,038 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 11:01:15,038 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-01 11:01:15,038 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235859996] [2020-07-01 11:01:15,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-01 11:01:15,038 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:01:15,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-01 11:01:15,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-01 11:01:15,039 INFO L87 Difference]: Start difference. First operand 55 states and 93 transitions. Second operand 5 states. [2020-07-01 11:01:15,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:01:15,155 INFO L93 Difference]: Finished difference Result 62 states and 103 transitions. [2020-07-01 11:01:15,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-01 11:01:15,156 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-07-01 11:01:15,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 11:01:15,156 INFO L225 Difference]: With dead ends: 62 [2020-07-01 11:01:15,157 INFO L226 Difference]: Without dead ends: 55 [2020-07-01 11:01:15,157 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-07-01 11:01:15,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-07-01 11:01:15,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 42. [2020-07-01 11:01:15,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-07-01 11:01:15,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 69 transitions. [2020-07-01 11:01:15,162 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 69 transitions. Word has length 12 [2020-07-01 11:01:15,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 11:01:15,162 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 69 transitions. [2020-07-01 11:01:15,163 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-01 11:01:15,163 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 69 transitions. [2020-07-01 11:01:15,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-01 11:01:15,163 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 11:01:15,163 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 11:01:15,164 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-07-01 11:01:15,164 INFO L427 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 11:01:15,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:01:15,164 INFO L82 PathProgramCache]: Analyzing trace with hash 1508406551, now seen corresponding path program 1 times [2020-07-01 11:01:15,164 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:01:15,165 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102987398] [2020-07-01 11:01:15,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:01:15,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:01:15,197 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:01:15,197 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102987398] [2020-07-01 11:01:15,197 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 11:01:15,197 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 11:01:15,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86633848] [2020-07-01 11:01:15,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 11:01:15,198 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:01:15,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 11:01:15,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 11:01:15,199 INFO L87 Difference]: Start difference. First operand 42 states and 69 transitions. Second operand 3 states. [2020-07-01 11:01:15,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:01:15,258 INFO L93 Difference]: Finished difference Result 71 states and 119 transitions. [2020-07-01 11:01:15,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 11:01:15,259 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2020-07-01 11:01:15,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 11:01:15,259 INFO L225 Difference]: With dead ends: 71 [2020-07-01 11:01:15,260 INFO L226 Difference]: Without dead ends: 42 [2020-07-01 11:01:15,260 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 11:01:15,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-07-01 11:01:15,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2020-07-01 11:01:15,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-07-01 11:01:15,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 61 transitions. [2020-07-01 11:01:15,265 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 61 transitions. Word has length 19 [2020-07-01 11:01:15,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 11:01:15,265 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 61 transitions. [2020-07-01 11:01:15,265 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 11:01:15,265 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 61 transitions. [2020-07-01 11:01:15,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-01 11:01:15,266 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 11:01:15,266 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 11:01:15,266 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-07-01 11:01:15,266 INFO L427 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 11:01:15,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:01:15,267 INFO L82 PathProgramCache]: Analyzing trace with hash -292390018, now seen corresponding path program 1 times [2020-07-01 11:01:15,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:01:15,267 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783707] [2020-07-01 11:01:15,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:01:15,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:01:15,318 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:01:15,319 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783707] [2020-07-01 11:01:15,319 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [809810838] [2020-07-01 11:01:15,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 11:01:15,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:01:15,375 INFO L264 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-01 11:01:15,381 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:01:15,412 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:01:15,413 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-01 11:01:15,413 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2020-07-01 11:01:15,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253433807] [2020-07-01 11:01:15,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 11:01:15,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:01:15,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 11:01:15,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-01 11:01:15,415 INFO L87 Difference]: Start difference. First operand 42 states and 61 transitions. Second operand 4 states. [2020-07-01 11:01:15,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:01:15,491 INFO L93 Difference]: Finished difference Result 49 states and 67 transitions. [2020-07-01 11:01:15,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 11:01:15,491 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2020-07-01 11:01:15,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 11:01:15,492 INFO L225 Difference]: With dead ends: 49 [2020-07-01 11:01:15,492 INFO L226 Difference]: Without dead ends: 46 [2020-07-01 11:01:15,493 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-01 11:01:15,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-07-01 11:01:15,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 42. [2020-07-01 11:01:15,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-07-01 11:01:15,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 57 transitions. [2020-07-01 11:01:15,498 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 57 transitions. Word has length 21 [2020-07-01 11:01:15,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 11:01:15,498 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 57 transitions. [2020-07-01 11:01:15,498 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 11:01:15,498 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 57 transitions. [2020-07-01 11:01:15,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-01 11:01:15,499 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 11:01:15,499 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 11:01:15,700 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2020-07-01 11:01:15,700 INFO L427 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 11:01:15,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:01:15,701 INFO L82 PathProgramCache]: Analyzing trace with hash -292390017, now seen corresponding path program 1 times [2020-07-01 11:01:15,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:01:15,701 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803126084] [2020-07-01 11:01:15,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:01:15,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:01:15,816 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:01:15,816 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803126084] [2020-07-01 11:01:15,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 11:01:15,817 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-01 11:01:15,817 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018293189] [2020-07-01 11:01:15,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-01 11:01:15,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:01:15,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-01 11:01:15,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-07-01 11:01:15,818 INFO L87 Difference]: Start difference. First operand 42 states and 57 transitions. Second operand 9 states. [2020-07-01 11:01:16,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:01:16,146 INFO L93 Difference]: Finished difference Result 83 states and 113 transitions. [2020-07-01 11:01:16,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-01 11:01:16,146 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-07-01 11:01:16,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 11:01:16,147 INFO L225 Difference]: With dead ends: 83 [2020-07-01 11:01:16,147 INFO L226 Difference]: Without dead ends: 44 [2020-07-01 11:01:16,148 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2020-07-01 11:01:16,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-07-01 11:01:16,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2020-07-01 11:01:16,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-07-01 11:01:16,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 56 transitions. [2020-07-01 11:01:16,152 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 56 transitions. Word has length 21 [2020-07-01 11:01:16,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 11:01:16,152 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 56 transitions. [2020-07-01 11:01:16,152 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-01 11:01:16,152 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 56 transitions. [2020-07-01 11:01:16,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-01 11:01:16,153 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 11:01:16,153 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 11:01:16,153 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-07-01 11:01:16,154 INFO L427 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 11:01:16,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:01:16,154 INFO L82 PathProgramCache]: Analyzing trace with hash -997504632, now seen corresponding path program 1 times [2020-07-01 11:01:16,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:01:16,154 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560671986] [2020-07-01 11:01:16,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:01:16,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:01:16,385 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:01:16,385 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560671986] [2020-07-01 11:01:16,386 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [271589719] [2020-07-01 11:01:16,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 11:01:16,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:01:16,437 INFO L264 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 25 conjunts are in the unsatisfiable core [2020-07-01 11:01:16,439 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:01:16,476 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 11:01:16,527 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2020-07-01 11:01:16,527 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 11:01:16,536 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-07-01 11:01:16,537 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-01 11:01:16,564 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:01:16,567 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2020-07-01 11:01:16,568 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:57, output treesize:49 [2020-07-01 11:01:16,682 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-07-01 11:01:16,684 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2020-07-01 11:01:16,685 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 11:01:16,698 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:01:16,700 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-07-01 11:01:16,700 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:33, output treesize:32 [2020-07-01 11:01:16,764 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-07-01 11:01:16,766 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2020-07-01 11:01:16,767 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 11:01:16,789 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:01:16,792 INFO L539 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-07-01 11:01:16,792 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:43, output treesize:39 [2020-07-01 11:01:16,888 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-07-01 11:01:16,896 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:01:16,896 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 18 [2020-07-01 11:01:16,897 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 11:01:16,898 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-01 11:01:16,914 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:01:16,915 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-01 11:01:16,918 INFO L539 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 11:01:16,918 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:31 [2020-07-01 11:01:16,967 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 11:01:17,029 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:01:17,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 11:01:17,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2020-07-01 11:01:17,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729619024] [2020-07-01 11:01:17,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-07-01 11:01:17,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:01:17,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-07-01 11:01:17,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2020-07-01 11:01:17,032 INFO L87 Difference]: Start difference. First operand 42 states and 56 transitions. Second operand 17 states. [2020-07-01 11:01:17,907 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2020-07-01 11:01:18,157 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 57 [2020-07-01 11:01:19,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:01:19,411 INFO L93 Difference]: Finished difference Result 196 states and 269 transitions. [2020-07-01 11:01:19,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-07-01 11:01:19,412 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 21 [2020-07-01 11:01:19,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 11:01:19,415 INFO L225 Difference]: With dead ends: 196 [2020-07-01 11:01:19,415 INFO L226 Difference]: Without dead ends: 193 [2020-07-01 11:01:19,417 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=252, Invalid=870, Unknown=0, NotChecked=0, Total=1122 [2020-07-01 11:01:19,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2020-07-01 11:01:19,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 63. [2020-07-01 11:01:19,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-07-01 11:01:19,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 82 transitions. [2020-07-01 11:01:19,431 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 82 transitions. Word has length 21 [2020-07-01 11:01:19,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 11:01:19,431 INFO L479 AbstractCegarLoop]: Abstraction has 63 states and 82 transitions. [2020-07-01 11:01:19,431 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-07-01 11:01:19,432 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 82 transitions. [2020-07-01 11:01:19,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-01 11:01:19,433 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 11:01:19,433 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 11:01:19,633 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2020-07-01 11:01:19,634 INFO L427 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 11:01:19,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:01:19,635 INFO L82 PathProgramCache]: Analyzing trace with hash -1841976503, now seen corresponding path program 1 times [2020-07-01 11:01:19,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:01:19,636 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864317803] [2020-07-01 11:01:19,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:01:19,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:01:19,855 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:01:19,855 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864317803] [2020-07-01 11:01:19,855 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [113643482] [2020-07-01 11:01:19,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 11:01:19,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:01:19,910 INFO L264 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 26 conjunts are in the unsatisfiable core [2020-07-01 11:01:19,912 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:01:19,920 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 11:01:19,933 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-07-01 11:01:19,934 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 11:01:19,940 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2020-07-01 11:01:19,941 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-01 11:01:19,966 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:01:19,968 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2020-07-01 11:01:19,968 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:61, output treesize:53 [2020-07-01 11:01:20,035 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:01:20,035 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-07-01 11:01:20,037 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 11:01:20,037 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 11:01:20,038 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 11:01:20,049 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:01:20,054 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2020-07-01 11:01:20,055 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-01 11:01:20,063 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:01:20,064 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-01 11:01:20,064 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:27 [2020-07-01 11:01:20,108 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2020-07-01 11:01:20,109 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 11:01:20,121 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:01:20,123 INFO L539 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-07-01 11:01:20,123 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:38, output treesize:34 [2020-07-01 11:01:20,190 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:01:20,191 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 18 [2020-07-01 11:01:20,192 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 11:01:20,192 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-01 11:01:20,203 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:01:20,204 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-01 11:01:20,205 INFO L539 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-07-01 11:01:20,205 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:41, output treesize:27 [2020-07-01 11:01:20,246 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 11:01:20,272 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:01:20,272 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 11:01:20,272 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2020-07-01 11:01:20,273 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602993651] [2020-07-01 11:01:20,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-01 11:01:20,273 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:01:20,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-01 11:01:20,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2020-07-01 11:01:20,274 INFO L87 Difference]: Start difference. First operand 63 states and 82 transitions. Second operand 15 states. [2020-07-01 11:01:30,682 WARN L192 SmtUtils]: Spent 10.15 s on a formula simplification. DAG size of input: 67 DAG size of output: 61 [2020-07-01 11:01:36,427 WARN L192 SmtUtils]: Spent 5.66 s on a formula simplification. DAG size of input: 77 DAG size of output: 67 [2020-07-01 11:01:41,912 WARN L192 SmtUtils]: Spent 5.47 s on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2020-07-01 11:01:42,077 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2020-07-01 11:01:42,484 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2020-07-01 11:01:42,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:01:42,529 INFO L93 Difference]: Finished difference Result 82 states and 105 transitions. [2020-07-01 11:01:42,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-01 11:01:42,530 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 21 [2020-07-01 11:01:42,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 11:01:42,532 INFO L225 Difference]: With dead ends: 82 [2020-07-01 11:01:42,532 INFO L226 Difference]: Without dead ends: 80 [2020-07-01 11:01:42,533 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 22.1s TimeCoverageRelationStatistics Valid=142, Invalid=364, Unknown=0, NotChecked=0, Total=506 [2020-07-01 11:01:42,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2020-07-01 11:01:42,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 52. [2020-07-01 11:01:42,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-07-01 11:01:42,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 69 transitions. [2020-07-01 11:01:42,545 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 69 transitions. Word has length 21 [2020-07-01 11:01:42,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 11:01:42,546 INFO L479 AbstractCegarLoop]: Abstraction has 52 states and 69 transitions. [2020-07-01 11:01:42,546 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-01 11:01:42,546 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 69 transitions. [2020-07-01 11:01:42,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-01 11:01:42,547 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 11:01:42,548 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 11:01:42,748 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2020-07-01 11:01:42,749 INFO L427 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 11:01:42,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:01:42,750 INFO L82 PathProgramCache]: Analyzing trace with hash -857875195, now seen corresponding path program 1 times [2020-07-01 11:01:42,750 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:01:42,751 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070327938] [2020-07-01 11:01:42,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:01:42,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:01:43,002 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:01:43,002 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070327938] [2020-07-01 11:01:43,003 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [406810183] [2020-07-01 11:01:43,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 11:01:43,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:01:43,046 INFO L264 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 28 conjunts are in the unsatisfiable core [2020-07-01 11:01:43,048 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:01:43,066 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-07-01 11:01:43,067 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 11:01:43,072 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-07-01 11:01:43,072 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-01 11:01:43,091 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:01:43,092 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2020-07-01 11:01:43,092 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:25 [2020-07-01 11:01:43,145 INFO L296 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-07-01 11:01:43,145 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 11:01:43,146 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 11:01:43,157 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2020-07-01 11:01:43,157 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 11:01:43,164 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2020-07-01 11:01:43,164 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-01 11:01:43,187 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:01:43,188 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2020-07-01 11:01:43,188 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:57, output treesize:49 [2020-07-01 11:01:43,350 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 11:01:43,432 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 11:01:43,446 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-07-01 11:01:43,471 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:01:43,472 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 39 [2020-07-01 11:01:43,473 INFO L477 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-07-01 11:01:43,474 INFO L477 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-07-01 11:01:43,475 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2020-07-01 11:01:43,507 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:01:43,508 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 52 [2020-07-01 11:01:43,509 INFO L477 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-07-01 11:01:43,510 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 11:01:43,511 INFO L477 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-07-01 11:01:43,511 INFO L477 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-07-01 11:01:43,512 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 11:01:43,513 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2020-07-01 11:01:43,603 INFO L619 ElimStorePlain]: treesize reduction 72, result has 54.7 percent of original size [2020-07-01 11:01:43,604 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-01 11:01:43,606 INFO L539 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-07-01 11:01:43,607 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:85, output treesize:44 [2020-07-01 11:01:43,671 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 11:01:43,672 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 11:01:43,712 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 11:01:43,751 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:01:43,752 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 11:01:43,752 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2020-07-01 11:01:43,753 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042131473] [2020-07-01 11:01:43,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-07-01 11:01:43,754 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:01:43,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-07-01 11:01:43,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2020-07-01 11:01:43,756 INFO L87 Difference]: Start difference. First operand 52 states and 69 transitions. Second operand 19 states. [2020-07-01 11:01:44,107 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 48 [2020-07-01 11:01:44,445 WARN L192 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2020-07-01 11:01:44,783 WARN L192 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 63 [2020-07-01 11:01:45,171 WARN L192 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 66 [2020-07-01 11:01:45,397 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2020-07-01 11:01:45,592 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 52 [2020-07-01 11:01:46,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:01:46,318 INFO L93 Difference]: Finished difference Result 72 states and 94 transitions. [2020-07-01 11:01:46,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-01 11:01:46,318 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 22 [2020-07-01 11:01:46,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 11:01:46,319 INFO L225 Difference]: With dead ends: 72 [2020-07-01 11:01:46,320 INFO L226 Difference]: Without dead ends: 70 [2020-07-01 11:01:46,320 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=222, Invalid=648, Unknown=0, NotChecked=0, Total=870 [2020-07-01 11:01:46,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-07-01 11:01:46,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 54. [2020-07-01 11:01:46,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-07-01 11:01:46,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 72 transitions. [2020-07-01 11:01:46,329 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 72 transitions. Word has length 22 [2020-07-01 11:01:46,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 11:01:46,329 INFO L479 AbstractCegarLoop]: Abstraction has 54 states and 72 transitions. [2020-07-01 11:01:46,329 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-07-01 11:01:46,329 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 72 transitions. [2020-07-01 11:01:46,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-01 11:01:46,330 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 11:01:46,330 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 11:01:46,531 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2020-07-01 11:01:46,532 INFO L427 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 11:01:46,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:01:46,532 INFO L82 PathProgramCache]: Analyzing trace with hash -857875196, now seen corresponding path program 1 times [2020-07-01 11:01:46,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:01:46,533 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614552726] [2020-07-01 11:01:46,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:01:46,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:01:46,582 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:01:46,582 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614552726] [2020-07-01 11:01:46,583 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1688468682] [2020-07-01 11:01:46,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 11:01:46,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:01:46,634 INFO L264 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-01 11:01:46,635 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:01:46,644 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:01:46,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-01 11:01:46,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2020-07-01 11:01:46,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158499899] [2020-07-01 11:01:46,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 11:01:46,646 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:01:46,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 11:01:46,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-01 11:01:46,646 INFO L87 Difference]: Start difference. First operand 54 states and 72 transitions. Second operand 4 states. [2020-07-01 11:01:46,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:01:46,714 INFO L93 Difference]: Finished difference Result 56 states and 72 transitions. [2020-07-01 11:01:46,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 11:01:46,714 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2020-07-01 11:01:46,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 11:01:46,715 INFO L225 Difference]: With dead ends: 56 [2020-07-01 11:01:46,715 INFO L226 Difference]: Without dead ends: 45 [2020-07-01 11:01:46,716 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-01 11:01:46,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-07-01 11:01:46,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2020-07-01 11:01:46,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-07-01 11:01:46,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 53 transitions. [2020-07-01 11:01:46,722 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 53 transitions. Word has length 22 [2020-07-01 11:01:46,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 11:01:46,722 INFO L479 AbstractCegarLoop]: Abstraction has 45 states and 53 transitions. [2020-07-01 11:01:46,722 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 11:01:46,722 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2020-07-01 11:01:46,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-01 11:01:46,723 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 11:01:46,723 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 11:01:46,923 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 11:01:46,925 INFO L427 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 11:01:46,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:01:46,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1294076421, now seen corresponding path program 2 times [2020-07-01 11:01:46,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:01:46,926 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428068633] [2020-07-01 11:01:46,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:01:46,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:01:47,254 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:01:47,255 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428068633] [2020-07-01 11:01:47,255 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [274554808] [2020-07-01 11:01:47,255 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 11:01:47,318 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-01 11:01:47,318 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-01 11:01:47,320 INFO L264 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 30 conjunts are in the unsatisfiable core [2020-07-01 11:01:47,322 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:01:47,329 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-07-01 11:01:47,330 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 11:01:47,336 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:01:47,336 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-01 11:01:47,337 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2020-07-01 11:01:47,352 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2020-07-01 11:01:47,353 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 11:01:47,358 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:01:47,358 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 11:01:47,358 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2020-07-01 11:01:47,386 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-07-01 11:01:47,387 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2020-07-01 11:01:47,388 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 11:01:47,399 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:01:47,400 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-01 11:01:47,401 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:28 [2020-07-01 11:01:47,444 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-07-01 11:01:47,446 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2020-07-01 11:01:47,446 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 11:01:47,459 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:01:47,460 INFO L539 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-07-01 11:01:47,461 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:35 [2020-07-01 11:01:47,598 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-07-01 11:01:47,604 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:01:47,605 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 22 [2020-07-01 11:01:47,605 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 11:01:47,606 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-01 11:01:47,619 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:01:47,620 INFO L539 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 11:01:47,620 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:49, output treesize:25 [2020-07-01 11:01:47,652 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 11:01:47,720 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-07-01 11:01:47,720 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 11:01:47,720 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2020-07-01 11:01:47,721 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559125820] [2020-07-01 11:01:47,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-07-01 11:01:47,721 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:01:47,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-07-01 11:01:47,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2020-07-01 11:01:47,722 INFO L87 Difference]: Start difference. First operand 45 states and 53 transitions. Second operand 18 states. [2020-07-01 11:01:49,192 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2020-07-01 11:01:50,103 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2020-07-01 11:01:50,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:01:50,342 INFO L93 Difference]: Finished difference Result 205 states and 241 transitions. [2020-07-01 11:01:50,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-07-01 11:01:50,342 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 31 [2020-07-01 11:01:50,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 11:01:50,344 INFO L225 Difference]: With dead ends: 205 [2020-07-01 11:01:50,344 INFO L226 Difference]: Without dead ends: 203 [2020-07-01 11:01:50,345 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=334, Invalid=1306, Unknown=0, NotChecked=0, Total=1640 [2020-07-01 11:01:50,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2020-07-01 11:01:50,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 119. [2020-07-01 11:01:50,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2020-07-01 11:01:50,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 146 transitions. [2020-07-01 11:01:50,360 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 146 transitions. Word has length 31 [2020-07-01 11:01:50,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 11:01:50,360 INFO L479 AbstractCegarLoop]: Abstraction has 119 states and 146 transitions. [2020-07-01 11:01:50,360 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-07-01 11:01:50,360 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 146 transitions. [2020-07-01 11:01:50,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-01 11:01:50,361 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 11:01:50,361 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 11:01:50,562 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 11:01:50,562 INFO L427 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 11:01:50,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:01:50,563 INFO L82 PathProgramCache]: Analyzing trace with hash -600974724, now seen corresponding path program 2 times [2020-07-01 11:01:50,564 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:01:50,564 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035435621] [2020-07-01 11:01:50,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:01:50,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:01:50,870 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:01:50,870 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035435621] [2020-07-01 11:01:50,871 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1829309024] [2020-07-01 11:01:50,871 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 11:01:50,944 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-01 11:01:50,944 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-01 11:01:50,946 INFO L264 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 28 conjunts are in the unsatisfiable core [2020-07-01 11:01:50,949 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:01:50,956 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-07-01 11:01:50,956 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 11:01:50,962 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:01:50,963 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-01 11:01:50,963 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-07-01 11:01:50,996 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2020-07-01 11:01:50,997 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 11:01:51,010 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:01:51,011 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-01 11:01:51,012 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2020-07-01 11:01:51,059 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-07-01 11:01:51,061 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2020-07-01 11:01:51,061 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 11:01:51,097 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:01:51,110 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:01:51,111 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-07-01 11:01:51,112 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 11:01:51,113 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 11:01:51,114 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-01 11:01:51,129 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:01:51,130 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-01 11:01:51,130 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:35, output treesize:28 [2020-07-01 11:01:51,188 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2020-07-01 11:01:51,189 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 11:01:51,205 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:01:51,207 INFO L539 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-07-01 11:01:51,207 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:35 [2020-07-01 11:01:51,374 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:01:51,374 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 23 [2020-07-01 11:01:51,375 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 11:01:51,376 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-01 11:01:51,390 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:01:51,391 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-01 11:01:51,392 INFO L539 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 11:01:51,393 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:49, output treesize:24 [2020-07-01 11:01:51,435 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 11:01:51,457 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-07-01 11:01:51,458 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 11:01:51,458 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2020-07-01 11:01:51,458 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923762626] [2020-07-01 11:01:51,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-07-01 11:01:51,459 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:01:51,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-07-01 11:01:51,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2020-07-01 11:01:51,459 INFO L87 Difference]: Start difference. First operand 119 states and 146 transitions. Second operand 17 states. [2020-07-01 11:01:52,469 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 57 [2020-07-01 11:01:52,954 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 55 [2020-07-01 11:01:53,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:01:53,139 INFO L93 Difference]: Finished difference Result 150 states and 182 transitions. [2020-07-01 11:01:53,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-07-01 11:01:53,140 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 31 [2020-07-01 11:01:53,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 11:01:53,142 INFO L225 Difference]: With dead ends: 150 [2020-07-01 11:01:53,142 INFO L226 Difference]: Without dead ends: 148 [2020-07-01 11:01:53,143 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=253, Invalid=617, Unknown=0, NotChecked=0, Total=870 [2020-07-01 11:01:53,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2020-07-01 11:01:53,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 62. [2020-07-01 11:01:53,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-07-01 11:01:53,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 75 transitions. [2020-07-01 11:01:53,155 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 75 transitions. Word has length 31 [2020-07-01 11:01:53,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 11:01:53,155 INFO L479 AbstractCegarLoop]: Abstraction has 62 states and 75 transitions. [2020-07-01 11:01:53,156 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-07-01 11:01:53,156 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 75 transitions. [2020-07-01 11:01:53,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-07-01 11:01:53,156 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 11:01:53,157 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 11:01:53,358 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 11:01:53,359 INFO L427 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 11:01:53,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:01:53,359 INFO L82 PathProgramCache]: Analyzing trace with hash -1461666062, now seen corresponding path program 2 times [2020-07-01 11:01:53,360 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:01:53,360 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998916258] [2020-07-01 11:01:53,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:01:53,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:01:53,806 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:01:53,807 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998916258] [2020-07-01 11:01:53,807 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [707171361] [2020-07-01 11:01:53,808 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 11:01:53,898 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-01 11:01:53,898 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-01 11:01:53,901 INFO L264 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 28 conjunts are in the unsatisfiable core [2020-07-01 11:01:53,904 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:01:53,914 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-07-01 11:01:53,915 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 11:01:53,922 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:01:53,923 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-01 11:01:53,923 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-07-01 11:01:53,961 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2020-07-01 11:01:53,961 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 11:01:53,969 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:01:53,970 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 11:01:53,970 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2020-07-01 11:01:54,141 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:01:54,143 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 50 [2020-07-01 11:01:54,145 INFO L477 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-07-01 11:01:54,145 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 11:01:54,147 INFO L477 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-07-01 11:01:54,148 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-01 11:01:54,148 INFO L477 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-07-01 11:01:54,149 INFO L477 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-07-01 11:01:54,151 INFO L477 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-07-01 11:01:54,152 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2020-07-01 11:01:54,247 INFO L619 ElimStorePlain]: treesize reduction 111, result has 23.4 percent of original size [2020-07-01 11:01:54,248 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 11:01:54,249 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2020-07-01 11:01:54,298 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 11:01:54,346 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-07-01 11:01:54,346 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 11:01:54,346 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2020-07-01 11:01:54,346 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528639739] [2020-07-01 11:01:54,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-07-01 11:01:54,347 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:01:54,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-07-01 11:01:54,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2020-07-01 11:01:54,348 INFO L87 Difference]: Start difference. First operand 62 states and 75 transitions. Second operand 18 states. [2020-07-01 11:01:55,710 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2020-07-01 11:01:56,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:01:56,539 INFO L93 Difference]: Finished difference Result 73 states and 85 transitions. [2020-07-01 11:01:56,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-07-01 11:01:56,541 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 32 [2020-07-01 11:01:56,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 11:01:56,542 INFO L225 Difference]: With dead ends: 73 [2020-07-01 11:01:56,542 INFO L226 Difference]: Without dead ends: 61 [2020-07-01 11:01:56,544 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 438 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=391, Invalid=1415, Unknown=0, NotChecked=0, Total=1806 [2020-07-01 11:01:56,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2020-07-01 11:01:56,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 55. [2020-07-01 11:01:56,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-07-01 11:01:56,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2020-07-01 11:01:56,557 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 32 [2020-07-01 11:01:56,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 11:01:56,558 INFO L479 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2020-07-01 11:01:56,558 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-07-01 11:01:56,558 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2020-07-01 11:01:56,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-07-01 11:01:56,559 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 11:01:56,559 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 11:01:56,760 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2020-07-01 11:01:56,761 INFO L427 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 11:01:56,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:01:56,762 INFO L82 PathProgramCache]: Analyzing trace with hash -309066193, now seen corresponding path program 1 times [2020-07-01 11:01:56,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:01:56,763 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737523115] [2020-07-01 11:01:56,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:01:56,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:01:56,951 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-07-01 11:01:56,951 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737523115] [2020-07-01 11:01:56,951 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2060332570] [2020-07-01 11:01:56,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 11:01:57,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:01:57,005 INFO L264 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 30 conjunts are in the unsatisfiable core [2020-07-01 11:01:57,007 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:01:57,013 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-07-01 11:01:57,014 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 11:01:57,020 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:01:57,020 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-01 11:01:57,020 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2020-07-01 11:01:57,027 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2020-07-01 11:01:57,027 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 11:01:57,032 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:01:57,032 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 11:01:57,032 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2020-07-01 11:01:57,040 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-07-01 11:01:57,041 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2020-07-01 11:01:57,042 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 11:01:57,053 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:01:57,054 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-01 11:01:57,054 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:28 [2020-07-01 11:01:57,096 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-07-01 11:01:57,097 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2020-07-01 11:01:57,098 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 11:01:57,110 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:01:57,111 INFO L539 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-07-01 11:01:57,112 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:35 [2020-07-01 11:01:57,236 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-07-01 11:01:57,244 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:01:57,245 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 22 [2020-07-01 11:01:57,245 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 11:01:57,246 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-01 11:01:57,261 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:01:57,261 INFO L539 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 11:01:57,262 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:49, output treesize:25 [2020-07-01 11:01:57,288 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 11:01:57,360 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 10 proven. 13 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-07-01 11:01:57,361 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 11:01:57,361 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2020-07-01 11:01:57,361 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168747906] [2020-07-01 11:01:57,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-07-01 11:01:57,362 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:01:57,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-07-01 11:01:57,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2020-07-01 11:01:57,362 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand 17 states. [2020-07-01 11:01:58,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:01:58,798 INFO L93 Difference]: Finished difference Result 203 states and 229 transitions. [2020-07-01 11:01:58,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-07-01 11:01:58,798 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 41 [2020-07-01 11:01:58,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 11:01:58,800 INFO L225 Difference]: With dead ends: 203 [2020-07-01 11:01:58,801 INFO L226 Difference]: Without dead ends: 201 [2020-07-01 11:01:58,802 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=176, Invalid=580, Unknown=0, NotChecked=0, Total=756 [2020-07-01 11:01:58,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2020-07-01 11:01:58,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 102. [2020-07-01 11:01:58,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2020-07-01 11:01:58,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 118 transitions. [2020-07-01 11:01:58,822 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 118 transitions. Word has length 41 [2020-07-01 11:01:58,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 11:01:58,822 INFO L479 AbstractCegarLoop]: Abstraction has 102 states and 118 transitions. [2020-07-01 11:01:58,822 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-07-01 11:01:58,823 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 118 transitions. [2020-07-01 11:01:58,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-07-01 11:01:58,823 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 11:01:58,824 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 11:01:59,025 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 11:01:59,026 INFO L427 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 11:01:59,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:01:59,026 INFO L82 PathProgramCache]: Analyzing trace with hash -1231749776, now seen corresponding path program 1 times [2020-07-01 11:01:59,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:01:59,027 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113255810] [2020-07-01 11:01:59,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:01:59,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:01:59,192 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-07-01 11:01:59,192 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113255810] [2020-07-01 11:01:59,193 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1545985225] [2020-07-01 11:01:59,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 11:01:59,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:01:59,268 INFO L264 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 38 conjunts are in the unsatisfiable core [2020-07-01 11:01:59,271 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:01:59,277 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-07-01 11:01:59,277 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 11:01:59,282 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:01:59,282 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-01 11:01:59,283 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-07-01 11:01:59,302 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2020-07-01 11:01:59,302 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 11:01:59,309 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:01:59,310 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-01 11:01:59,310 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2020-07-01 11:01:59,351 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:01:59,351 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-07-01 11:01:59,352 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 11:01:59,352 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 11:01:59,353 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 11:01:59,366 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:01:59,369 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2020-07-01 11:01:59,370 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-01 11:01:59,380 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:01:59,380 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-01 11:01:59,380 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:35, output treesize:28 [2020-07-01 11:01:59,415 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2020-07-01 11:01:59,415 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 11:01:59,427 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:01:59,429 INFO L539 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-07-01 11:01:59,429 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:35 [2020-07-01 11:01:59,566 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:01:59,567 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 23 [2020-07-01 11:01:59,567 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 11:01:59,568 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-01 11:01:59,581 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:01:59,582 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-01 11:01:59,583 INFO L539 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 11:01:59,583 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:49, output treesize:24 [2020-07-01 11:01:59,615 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 11:01:59,642 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 10 proven. 13 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-07-01 11:01:59,643 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 11:01:59,643 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2020-07-01 11:01:59,643 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090622702] [2020-07-01 11:01:59,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-07-01 11:01:59,644 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:01:59,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-07-01 11:01:59,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2020-07-01 11:01:59,644 INFO L87 Difference]: Start difference. First operand 102 states and 118 transitions. Second operand 17 states. [2020-07-01 11:02:00,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:02:00,205 INFO L93 Difference]: Finished difference Result 102 states and 118 transitions. [2020-07-01 11:02:00,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-01 11:02:00,206 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 41 [2020-07-01 11:02:00,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 11:02:00,207 INFO L225 Difference]: With dead ends: 102 [2020-07-01 11:02:00,207 INFO L226 Difference]: Without dead ends: 100 [2020-07-01 11:02:00,208 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=127, Invalid=335, Unknown=0, NotChecked=0, Total=462 [2020-07-01 11:02:00,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2020-07-01 11:02:00,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 53. [2020-07-01 11:02:00,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-07-01 11:02:00,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2020-07-01 11:02:00,218 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 41 [2020-07-01 11:02:00,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 11:02:00,219 INFO L479 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2020-07-01 11:02:00,219 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-07-01 11:02:00,219 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2020-07-01 11:02:00,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-07-01 11:02:00,219 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 11:02:00,220 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 11:02:00,420 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 11:02:00,421 INFO L427 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 11:02:00,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:02:00,421 INFO L82 PathProgramCache]: Analyzing trace with hash -991120066, now seen corresponding path program 1 times [2020-07-01 11:02:00,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:02:00,422 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865269156] [2020-07-01 11:02:00,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:02:00,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:02:00,629 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-07-01 11:02:00,630 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865269156] [2020-07-01 11:02:00,630 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [545148794] [2020-07-01 11:02:00,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 11:02:00,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:02:00,692 INFO L264 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 30 conjunts are in the unsatisfiable core [2020-07-01 11:02:00,695 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:02:00,700 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-07-01 11:02:00,700 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 11:02:00,705 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:02:00,706 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-01 11:02:00,706 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-07-01 11:02:00,710 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2020-07-01 11:02:00,710 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 11:02:00,720 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:02:00,729 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 11:02:00,730 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2020-07-01 11:02:00,828 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:02:00,829 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 50 [2020-07-01 11:02:00,830 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-01 11:02:00,831 INFO L477 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-07-01 11:02:00,831 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-01 11:02:00,832 INFO L477 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-07-01 11:02:00,832 INFO L477 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-07-01 11:02:00,833 INFO L477 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-07-01 11:02:00,834 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2020-07-01 11:02:00,880 INFO L619 ElimStorePlain]: treesize reduction 61, result has 35.8 percent of original size [2020-07-01 11:02:00,881 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 11:02:00,881 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2020-07-01 11:02:00,910 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 11:02:00,932 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 10 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-07-01 11:02:00,932 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 11:02:00,932 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 14 [2020-07-01 11:02:00,932 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749316352] [2020-07-01 11:02:00,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-01 11:02:00,933 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:02:00,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-01 11:02:00,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2020-07-01 11:02:00,934 INFO L87 Difference]: Start difference. First operand 53 states and 61 transitions. Second operand 15 states. [2020-07-01 11:02:01,343 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 40 [2020-07-01 11:02:01,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:02:01,640 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2020-07-01 11:02:01,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-01 11:02:01,641 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 42 [2020-07-01 11:02:01,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 11:02:01,642 INFO L225 Difference]: With dead ends: 53 [2020-07-01 11:02:01,642 INFO L226 Difference]: Without dead ends: 0 [2020-07-01 11:02:01,643 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=126, Invalid=336, Unknown=0, NotChecked=0, Total=462 [2020-07-01 11:02:01,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-01 11:02:01,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-01 11:02:01,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-01 11:02:01,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-01 11:02:01,645 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 42 [2020-07-01 11:02:01,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 11:02:01,645 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 11:02:01,645 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-01 11:02:01,645 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-01 11:02:01,646 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-01 11:02:01,846 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2020-07-01 11:02:01,852 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-01 11:02:02,492 WARN L192 SmtUtils]: Spent 584.00 ms on a formula simplification. DAG size of input: 409 DAG size of output: 373 [2020-07-01 11:02:12,876 WARN L192 SmtUtils]: Spent 10.23 s on a formula simplification. DAG size of input: 366 DAG size of output: 137 [2020-07-01 11:02:13,512 WARN L192 SmtUtils]: Spent 633.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 41 [2020-07-01 11:02:13,519 INFO L268 CegarLoopResult]: For program point L31-1(line 31) no Hoare annotation was computed. [2020-07-01 11:02:13,519 INFO L268 CegarLoopResult]: For program point L31-2(line 31) no Hoare annotation was computed. [2020-07-01 11:02:13,520 INFO L268 CegarLoopResult]: For program point L31-3(line 31) no Hoare annotation was computed. [2020-07-01 11:02:13,520 INFO L268 CegarLoopResult]: For program point L31-4(line 31) no Hoare annotation was computed. [2020-07-01 11:02:13,520 INFO L268 CegarLoopResult]: For program point L31-6(lines 31 38) no Hoare annotation was computed. [2020-07-01 11:02:13,521 INFO L264 CegarLoopResult]: At program point L31-8(lines 31 38) the Hoare annotation is: (let ((.cse14 (select |#length| |ULTIMATE.start_main_#t~ret13.base|)) (.cse24 (select |#length| ULTIMATE.start_cstrncmp_~s1.base)) (.cse20 (select |#length| ULTIMATE.start_cstrncmp_~s2.base))) (let ((.cse16 (exists ((v_prenex_2 Int)) (and (<= (+ v_prenex_2 1) (select |#length| |ULTIMATE.start_main_#t~ret13.base|)) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_#t~ret13.base|) v_prenex_2)) (<= |ULTIMATE.start_main_#t~ret13.offset| v_prenex_2)))) (.cse13 (<= (+ ULTIMATE.start_cstrncmp_~n 1) 0)) (.cse0 (= 0 ULTIMATE.start_cstrncmp_~s2.offset)) (.cse1 (= 0 ULTIMATE.start_cstrncmp_~s1.offset)) (.cse5 (<= 1 .cse20)) (.cse8 (<= 1 .cse24)) (.cse23 (select |#memory_int| ULTIMATE.start_cstrncmp_~s2.base)) (.cse19 (<= 1 ULTIMATE.start_cstrncmp_~s1.offset)) (.cse2 (= 1 (select |#valid| ULTIMATE.start_cstrncmp_~s2.base))) (.cse3 (<= 1 .cse14)) (.cse4 (= 1 (select |#valid| |ULTIMATE.start_main_#t~ret13.base|))) (.cse15 (not (= ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base |ULTIMATE.start_main_#t~ret13.base|))) (.cse6 (= (select |#length| ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base) ULTIMATE.start___VERIFIER_nondet_String_~length~0)) (.cse7 (= 0 |ULTIMATE.start_main_#t~ret13.offset|)) (.cse9 (= ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset 0)) (.cse21 (<= 1 ULTIMATE.start_cstrncmp_~s2.offset)) (.cse17 (<= (+ ULTIMATE.start_cstrncmp_~s2.offset 1) .cse20)) (.cse10 (= 1 (select |#valid| ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base))) (.cse18 (exists ((v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20 Int)) (and (= 0 (select (select |#memory_int| ULTIMATE.start_cstrncmp_~s1.base) (+ (select |#length| ULTIMATE.start_cstrncmp_~s1.base) v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20 (- 1)))) (<= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20 0) (<= 0 v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20)))) (.cse11 (<= 1 ULTIMATE.start___VERIFIER_nondet_String_~length~0)) (.cse22 (<= (+ ULTIMATE.start_cstrncmp_~s1.offset 1) .cse24)) (.cse12 (= 1 (select |#valid| ULTIMATE.start_cstrncmp_~s1.base)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 (= 0 (select (select |#memory_int| |ULTIMATE.start_main_#t~ret13.base|) (+ .cse14 (- 1)))) .cse1 .cse2 .cse4 (exists ((v_prenex_2 Int)) (and (= 0 (select (select |#memory_int| ULTIMATE.start_cstrncmp_~s1.base) v_prenex_2)) (<= (+ v_prenex_2 1) (select |#length| ULTIMATE.start_cstrncmp_~s1.base)) (<= ULTIMATE.start_cstrncmp_~s1.offset v_prenex_2))) .cse15 .cse6 (exists ((v_prenex_3 Int)) (and (<= v_prenex_3 0) (<= ULTIMATE.start_cstrncmp_~s2.offset v_prenex_3) (= 0 (select (select |#memory_int| ULTIMATE.start_cstrncmp_~s2.base) (+ (select |#length| ULTIMATE.start_cstrncmp_~s2.base) v_prenex_3 (- 1)))))) .cse7 .cse16 (exists ((ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset Int) (|ULTIMATE.start___VERIFIER_nondet_String_#res.base| Int)) (and (not (= ULTIMATE.start_cstrncmp_~s1.base |ULTIMATE.start___VERIFIER_nondet_String_#res.base|)) (= 0 (select (select |#memory_int| |ULTIMATE.start___VERIFIER_nondet_String_#res.base|) (+ ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset (select |#length| |ULTIMATE.start___VERIFIER_nondet_String_#res.base|) (- 1)))))) .cse9 .cse17 .cse10 .cse11 .cse18 .cse12) (and (<= ULTIMATE.start_cstrncmp_~s2.offset 1) .cse19 .cse2 .cse4 .cse15 .cse6 .cse7 .cse16 .cse9 (< 1 .cse20) .cse21 .cse10 .cse11 .cse22 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= (select .cse23 ULTIMATE.start_cstrncmp_~s2.offset) 0) .cse7 .cse9 .cse8 (<= (+ ULTIMATE.start___VERIFIER_nondet_String_~length~0 ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset) 1) .cse10 .cse11 .cse12) (and (exists ((v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20 Int)) (and (= 0 (select (select |#memory_int| |ULTIMATE.start_main_#t~ret13.base|) (+ (select |#length| |ULTIMATE.start_main_#t~ret13.base|) v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20 (- 1)))) (<= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20 0) (<= 0 v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20))) (= 0 (select .cse23 (+ .cse20 (- 1)))) .cse19 .cse2 .cse3 .cse4 .cse15 .cse6 .cse7 .cse9 .cse21 .cse17 .cse10 .cse18 (exists ((ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset Int) (ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base Int)) (and (= 0 (select (select |#memory_int| ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base) (+ ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset (select |#length| ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base) (- 1)))) (not (= ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base ULTIMATE.start_cstrncmp_~s1.base)))) .cse11 .cse22 .cse12)))) [2020-07-01 11:02:13,522 INFO L268 CegarLoopResult]: For program point L31-9(lines 31 38) no Hoare annotation was computed. [2020-07-01 11:02:13,522 INFO L268 CegarLoopResult]: For program point L40(line 40) no Hoare annotation was computed. [2020-07-01 11:02:13,522 INFO L268 CegarLoopResult]: For program point L34(line 34) no Hoare annotation was computed. [2020-07-01 11:02:13,522 INFO L268 CegarLoopResult]: For program point L34-2(line 34) no Hoare annotation was computed. [2020-07-01 11:02:13,523 INFO L268 CegarLoopResult]: For program point L34-3(line 34) no Hoare annotation was computed. [2020-07-01 11:02:13,523 INFO L268 CegarLoopResult]: For program point L34-4(lines 34 35) no Hoare annotation was computed. [2020-07-01 11:02:13,523 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-01 11:02:13,523 INFO L268 CegarLoopResult]: For program point L28(lines 28 29) no Hoare annotation was computed. [2020-07-01 11:02:13,523 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 40) no Hoare annotation was computed. [2020-07-01 11:02:13,524 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 39) no Hoare annotation was computed. [2020-07-01 11:02:13,524 INFO L264 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: (and (= ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset 0) (= 1 (select |#valid| ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base)) (= (select |#length| ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base) ULTIMATE.start___VERIFIER_nondet_String_~length~0) (<= 1 ULTIMATE.start___VERIFIER_nondet_String_~length~0)) [2020-07-01 11:02:13,524 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 34) no Hoare annotation was computed. [2020-07-01 11:02:13,524 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 40) no Hoare annotation was computed. [2020-07-01 11:02:13,525 INFO L264 CegarLoopResult]: At program point L16-2(line 16) the Hoare annotation is: (let ((.cse0 (= 0 |ULTIMATE.start_main_#t~ret13.offset|)) (.cse1 (= ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset 0)) (.cse2 (<= 1 (select |#length| |ULTIMATE.start_main_#t~ret13.base|))) (.cse3 (= 1 (select |#valid| |ULTIMATE.start_main_#t~ret13.base|))) (.cse4 (= 1 (select |#valid| ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base))) (.cse5 (= (select |#length| ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base) ULTIMATE.start___VERIFIER_nondet_String_~length~0)) (.cse6 (<= 1 ULTIMATE.start___VERIFIER_nondet_String_~length~0))) (or (and .cse0 .cse1 .cse2 .cse3 (<= (+ ULTIMATE.start___VERIFIER_nondet_String_~length~0 ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset) 1) .cse4 .cse5 .cse6) (and (exists ((v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20 Int)) (and (= 0 (select (select |#memory_int| |ULTIMATE.start_main_#t~ret13.base|) (+ (select |#length| |ULTIMATE.start_main_#t~ret13.base|) v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20 (- 1)))) (<= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20 0) (<= 0 v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20))) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base |ULTIMATE.start_main_#t~ret13.base|)) .cse4 .cse5 .cse6))) [2020-07-01 11:02:13,525 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 39) no Hoare annotation was computed. [2020-07-01 11:02:13,525 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 31) no Hoare annotation was computed. [2020-07-01 11:02:13,525 INFO L268 CegarLoopResult]: For program point L12(lines 12 14) no Hoare annotation was computed. [2020-07-01 11:02:13,526 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 31) no Hoare annotation was computed. [2020-07-01 11:02:13,526 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 34) no Hoare annotation was computed. [2020-07-01 11:02:13,526 INFO L268 CegarLoopResult]: For program point L12-2(lines 12 14) no Hoare annotation was computed. [2020-07-01 11:02:13,526 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 31) no Hoare annotation was computed. [2020-07-01 11:02:13,526 INFO L268 CegarLoopResult]: For program point L12-3(lines 12 14) no Hoare annotation was computed. [2020-07-01 11:02:13,527 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 11:02:13,527 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 11:02:13,527 INFO L268 CegarLoopResult]: For program point L12-5(lines 12 14) no Hoare annotation was computed. [2020-07-01 11:02:13,527 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 31) no Hoare annotation was computed. [2020-07-01 11:02:13,527 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 11:02:13,528 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 11:02:13,532 INFO L308 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-07-01 11:02:13,546 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:02:13,558 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:02:13,567 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 11:02:13,568 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 11:02:13,569 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 11:02:13,569 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2020-07-01 11:02:13,570 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2020-07-01 11:02:13,570 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2020-07-01 11:02:13,571 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 11:02:13,571 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 11:02:13,572 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 11:02:13,572 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_#res.base,QUANTIFIED] [2020-07-01 11:02:13,573 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_#res.base,QUANTIFIED] [2020-07-01 11:02:13,573 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-07-01 11:02:13,574 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_#res.base,QUANTIFIED] [2020-07-01 11:02:13,575 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] [2020-07-01 11:02:13,575 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] [2020-07-01 11:02:13,576 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] [2020-07-01 11:02:13,576 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 11:02:13,577 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 11:02:13,577 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 11:02:13,578 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] [2020-07-01 11:02:13,579 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] [2020-07-01 11:02:13,579 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] [2020-07-01 11:02:13,580 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] [2020-07-01 11:02:13,580 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] [2020-07-01 11:02:13,581 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] [2020-07-01 11:02:13,581 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-07-01 11:02:13,581 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-07-01 11:02:13,581 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-07-01 11:02:13,582 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-07-01 11:02:13,586 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:02:13,587 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:02:13,587 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:02:13,588 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:02:13,588 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:02:13,589 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:02:13,589 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:02:13,590 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:02:13,590 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:02:13,590 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:02:13,591 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:02:13,591 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:02:13,592 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:02:13,592 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:02:13,592 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:02:13,593 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:02:13,593 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:02:13,594 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:02:13,595 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:02:13,595 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:02:13,595 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:02:13,596 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:02:13,596 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:02:13,597 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:02:13,597 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:02:13,597 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:02:13,598 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:02:13,598 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:02:13,598 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:02:13,599 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:02:13,599 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:02:13,600 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:02:13,600 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:02:13,600 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:02:13,601 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:02:13,601 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:02:13,601 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:02:13,602 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:02:13,602 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:02:13,602 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:02:13,610 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 11:02:13,610 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 11:02:13,611 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 11:02:13,611 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2020-07-01 11:02:13,611 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2020-07-01 11:02:13,612 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2020-07-01 11:02:13,612 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 11:02:13,613 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 11:02:13,613 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 11:02:13,614 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_#res.base,QUANTIFIED] [2020-07-01 11:02:13,615 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_#res.base,QUANTIFIED] [2020-07-01 11:02:13,615 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-07-01 11:02:13,615 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_#res.base,QUANTIFIED] [2020-07-01 11:02:13,616 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] [2020-07-01 11:02:13,616 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] [2020-07-01 11:02:13,616 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] [2020-07-01 11:02:13,617 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 11:02:13,618 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 11:02:13,618 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 11:02:13,619 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] [2020-07-01 11:02:13,619 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] [2020-07-01 11:02:13,619 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] [2020-07-01 11:02:13,620 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] [2020-07-01 11:02:13,628 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] [2020-07-01 11:02:13,628 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] [2020-07-01 11:02:13,628 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-07-01 11:02:13,629 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-07-01 11:02:13,629 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-07-01 11:02:13,629 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-07-01 11:02:13,632 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:02:13,633 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:02:13,633 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:02:13,634 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:02:13,634 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:02:13,635 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:02:13,635 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:02:13,635 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:02:13,636 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:02:13,636 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:02:13,636 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:02:13,637 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:02:13,637 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:02:13,637 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:02:13,637 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:02:13,638 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:02:13,638 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:02:13,638 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:02:13,639 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:02:13,639 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:02:13,639 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:02:13,640 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:02:13,640 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:02:13,640 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:02:13,641 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:02:13,641 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:02:13,641 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:02:13,641 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:02:13,642 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:02:13,642 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:02:13,642 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:02:13,643 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:02:13,643 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:02:13,644 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:02:13,644 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:02:13,644 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:02:13,644 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:02:13,645 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:02:13,645 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:02:13,645 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:02:13,647 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] [2020-07-01 11:02:13,648 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] [2020-07-01 11:02:13,648 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] [2020-07-01 11:02:13,649 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:02:13,649 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:02:13,649 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:02:13,650 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:02:13,650 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:02:13,650 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:02:13,651 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] [2020-07-01 11:02:13,651 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] [2020-07-01 11:02:13,651 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] [2020-07-01 11:02:13,652 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:02:13,652 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:02:13,653 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:02:13,653 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:02:13,654 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:02:13,654 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:02:13,657 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 11:02:13 BasicIcfg [2020-07-01 11:02:13,657 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-01 11:02:13,658 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-01 11:02:13,658 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-01 11:02:13,662 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-01 11:02:13,663 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 11:02:13,663 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.07 11:01:10" (1/5) ... [2020-07-01 11:02:13,664 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3cdde047 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 11:02:13, skipping insertion in model container [2020-07-01 11:02:13,664 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 11:02:13,664 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:01:11" (2/5) ... [2020-07-01 11:02:13,664 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3cdde047 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 11:02:13, skipping insertion in model container [2020-07-01 11:02:13,665 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 11:02:13,665 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 11:01:11" (3/5) ... [2020-07-01 11:02:13,665 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3cdde047 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 11:02:13, skipping insertion in model container [2020-07-01 11:02:13,665 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 11:02:13,665 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 11:01:11" (4/5) ... [2020-07-01 11:02:13,666 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3cdde047 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 11:02:13, skipping insertion in model container [2020-07-01 11:02:13,666 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 11:02:13,666 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 11:02:13" (5/5) ... [2020-07-01 11:02:13,668 INFO L371 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 11:02:13,694 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-01 11:02:13,694 INFO L357 BuchiCegarLoop]: Hoare is true [2020-07-01 11:02:13,694 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 11:02:13,694 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 11:02:13,695 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 11:02:13,695 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-01 11:02:13,695 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 11:02:13,695 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-01 11:02:13,699 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states. [2020-07-01 11:02:13,704 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2020-07-01 11:02:13,705 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 11:02:13,705 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 11:02:13,709 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 11:02:13,709 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-07-01 11:02:13,710 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-01 11:02:13,710 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states. [2020-07-01 11:02:13,711 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2020-07-01 11:02:13,712 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 11:02:13,712 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 11:02:13,712 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 11:02:13,712 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-07-01 11:02:13,719 INFO L794 eck$LassoCheckResult]: Stem: 36#ULTIMATE.startENTRYtrue [221] ULTIMATE.startENTRY-->L12: Formula: (and (< 0 |v_#StackHeapBarrier_4|) (= 0 |v_#NULL.base_2|) (= 0 |v_#NULL.offset_2|) (= |v_#valid_21| (store |v_#valid_22| 0 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_4|, #valid=|v_#valid_22|} OutVars{ULTIMATE.start___VERIFIER_nondet_String_#res.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_7|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_5|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~ret13.base=|v_ULTIMATE.start_main_#t~ret13.base_5|, ULTIMATE.start_main_#t~ret14.base=|v_ULTIMATE.start_main_#t~ret14.base_4|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~ret16=|v_ULTIMATE.start_main_#t~ret16_4|, ULTIMATE.start_main_#t~ret13.offset=|v_ULTIMATE.start_main_#t~ret13.offset_5|, #StackHeapBarrier=|v_#StackHeapBarrier_4|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_11, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_21|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_4|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_18, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0_8|, ULTIMATE.start___VERIFIER_nondet_String_#res.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_7|, ULTIMATE.start_main_#t~ret14.offset=|v_ULTIMATE.start_main_#t~ret14.offset_4|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_5|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_13} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_#res.offset, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset, #NULL.offset, ULTIMATE.start_main_#t~ret13.base, ULTIMATE.start_main_#t~ret14.base, #NULL.base, ULTIMATE.start_main_#t~ret16, ULTIMATE.start_main_#t~ret13.offset, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start___VERIFIER_nondet_String_~length~0, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0, ULTIMATE.start___VERIFIER_nondet_String_#res.base, ULTIMATE.start_main_#t~ret14.offset, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base] 21#L12true [121] L12-->L12-2: Formula: (and (< v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_5 1) (= v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_4 1)) InVars {ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_5} OutVars{ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_4} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_~length~0] 16#L12-2true [175] L12-2-->L16: Formula: (and (= (store |v_#length_2| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2| v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_7) |v_#length_1|) (= 0 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_2|) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_2 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_2 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_2|) (= (store |v_#valid_4| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2| 1) |v_#valid_3|) (< |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2| |v_#StackHeapBarrier_2|) (= 0 (select |v_#valid_4| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|)) (< 0 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_7, #length=|v_#length_2|, #valid=|v_#valid_4|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_2|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_2, #valid=|v_#valid_3|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_7, #length=|v_#length_1|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_2} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset, #valid, #length, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base] 4#L16true [223] L16-->L12-3: Formula: (let ((.cse0 (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_14 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_21))) (and (= |v_ULTIMATE.start_main_#t~ret13.offset_6| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_14) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16 |v_ULTIMATE.start_main_#t~ret13.base_6|) (<= 1 .cse0) (<= .cse0 (select |v_#length_20| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16)) (= 1 (select |v_#valid_24| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16)) (= (store |v_#memory_int_13| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16 (store (select |v_#memory_int_13| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16) (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_14 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_21 (- 1)) 0)) |v_#memory_int_12|))) InVars {ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_14, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_13|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_21, #length=|v_#length_20|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16} OutVars{ULTIMATE.start___VERIFIER_nondet_String_#res.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_9|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_6|, ULTIMATE.start_main_#t~ret13.base=|v_ULTIMATE.start_main_#t~ret13.base_6|, ULTIMATE.start_main_#t~ret13.offset=|v_ULTIMATE.start_main_#t~ret13.offset_6|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_13, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_12|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_20, #length=|v_#length_20|, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0_10|, ULTIMATE.start___VERIFIER_nondet_String_#res.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_9|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_6|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_15} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_#res.offset, ULTIMATE.start_main_#t~ret13.offset, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset, #memory_int, ULTIMATE.start___VERIFIER_nondet_String_~length~0, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0, ULTIMATE.start_main_#t~ret13.base, ULTIMATE.start___VERIFIER_nondet_String_#res.base, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base] 34#L12-3true [154] L12-3-->L12-5: Formula: (>= v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_14 1) InVars {ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_14} OutVars{ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_14} AuxVars[] AssignedVars[] 32#L12-5true [181] L12-5-->L16-2: Formula: (and (> 0 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|) (= 0 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_4|) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_7 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_4|) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_8 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|) (= |v_#length_5| (store |v_#length_6| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4| v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_15)) (= 0 (select |v_#valid_8| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|)) (< |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4| |v_#StackHeapBarrier_3|) (= (store |v_#valid_8| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4| 1) |v_#valid_7|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_15, #length=|v_#length_6|, #valid=|v_#valid_8|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_4|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_7, #valid=|v_#valid_7|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_15, #length=|v_#length_5|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_8} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset, #valid, #length, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base] 25#L16-2true [225] L16-2-->L28: Formula: (let ((.cse0 (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_23))) (and (= |v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_12| |v_ULTIMATE.start_main_#t~ret14.base_5|) (= |v_ULTIMATE.start_cstrncmp_#in~s1.offset_2| |v_ULTIMATE.start_main_#t~ret13.offset_7|) (= |v_ULTIMATE.start_main_#t~ret14.base_5| |v_ULTIMATE.start_cstrncmp_#in~s2.base_2|) (= |v_ULTIMATE.start_cstrncmp_#in~s2.offset_2| |v_ULTIMATE.start_main_#t~ret14.offset_5|) (= |v_ULTIMATE.start_main_#t~nondet15_5| |v_ULTIMATE.start_cstrncmp_#in~n_2|) (= v_ULTIMATE.start_cstrncmp_~s2.base_11 |v_ULTIMATE.start_cstrncmp_#in~s2.base_2|) (= |v_ULTIMATE.start_cstrncmp_#in~s1.base_2| |v_ULTIMATE.start_main_#t~ret13.base_7|) (= |v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_12| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18) (= v_ULTIMATE.start_cstrncmp_~n_8 |v_ULTIMATE.start_cstrncmp_#in~n_2|) (= v_ULTIMATE.start_cstrncmp_~s2.offset_9 |v_ULTIMATE.start_cstrncmp_#in~s2.offset_2|) (= (store |v_#memory_int_17| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18 (store (select |v_#memory_int_17| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18) (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_23 (- 1)) 0)) |v_#memory_int_16|) (= v_ULTIMATE.start_cstrncmp_~s1.base_14 |v_ULTIMATE.start_cstrncmp_#in~s1.base_2|) (= |v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_12| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16) (<= .cse0 (select |v_#length_22| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18)) (= 1 (select |v_#valid_26| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18)) (= |v_ULTIMATE.start_cstrncmp_#in~s1.offset_2| v_ULTIMATE.start_cstrncmp_~s1.offset_11) (= |v_ULTIMATE.start_main_#t~ret14.offset_5| |v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_12|) (<= 1 .cse0))) InVars {ULTIMATE.start_main_#t~ret13.offset=|v_ULTIMATE.start_main_#t~ret13.offset_7|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16, #valid=|v_#valid_26|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #memory_int=|v_#memory_int_17|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_23, #length=|v_#length_22|, ULTIMATE.start_main_#t~ret13.base=|v_ULTIMATE.start_main_#t~ret13.base_7|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18} OutVars{ULTIMATE.start_cstrncmp_#t~mem6=|v_ULTIMATE.start_cstrncmp_#t~mem6_6|, ULTIMATE.start_cstrncmp_~s2.base=v_ULTIMATE.start_cstrncmp_~s2.base_11, ULTIMATE.start_cstrncmp_#res=|v_ULTIMATE.start_cstrncmp_#res_6|, ULTIMATE.start_cstrncmp_#t~mem3=|v_ULTIMATE.start_cstrncmp_#t~mem3_6|, ULTIMATE.start_cstrncmp_#t~mem4=|v_ULTIMATE.start_cstrncmp_#t~mem4_6|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_14, ULTIMATE.start_cstrncmp_#t~post9.offset=|v_ULTIMATE.start_cstrncmp_#t~post9.offset_4|, ULTIMATE.start_cstrncmp_#t~post8.offset=|v_ULTIMATE.start_cstrncmp_#t~post8.offset_4|, ULTIMATE.start_cstrncmp_#t~post8.base=|v_ULTIMATE.start_cstrncmp_#t~post8.base_4|, ULTIMATE.start_cstrncmp_#t~post9.base=|v_ULTIMATE.start_cstrncmp_#t~post9.base_4|, ULTIMATE.start_cstrncmp_#in~s2.offset=|v_ULTIMATE.start_cstrncmp_#in~s2.offset_2|, ULTIMATE.start_cstrncmp_#t~ite12=|v_ULTIMATE.start_cstrncmp_#t~ite12_6|, #length=|v_#length_22|, ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_8, ULTIMATE.start_main_#t~ret14.offset=|v_ULTIMATE.start_main_#t~ret14.offset_5|, ULTIMATE.start___VERIFIER_nondet_String_#res.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_12|, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_11, ULTIMATE.start_cstrncmp_#t~post2=|v_ULTIMATE.start_cstrncmp_#t~post2_5|, ULTIMATE.start___VERIFIER_nondet_String_#res.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_12|, ULTIMATE.start_cstrncmp_~uc2~0=v_ULTIMATE.start_cstrncmp_~uc2~0_6, ULTIMATE.start_cstrncmp_#in~n=|v_ULTIMATE.start_cstrncmp_#in~n_2|, ULTIMATE.start_cstrncmp_~uc1~0=v_ULTIMATE.start_cstrncmp_~uc1~0_6, ULTIMATE.start_main_#t~ret13.base=|v_ULTIMATE.start_main_#t~ret13.base_7|, ULTIMATE.start_cstrncmp_#in~s1.offset=|v_ULTIMATE.start_cstrncmp_#in~s1.offset_2|, ULTIMATE.start_cstrncmp_#t~mem11=|v_ULTIMATE.start_cstrncmp_#t~mem11_5|, ULTIMATE.start_main_#t~ret14.base=|v_ULTIMATE.start_main_#t~ret14.base_5|, ULTIMATE.start_cstrncmp_~s2.offset=v_ULTIMATE.start_cstrncmp_~s2.offset_9, ULTIMATE.start_main_#t~ret13.offset=|v_ULTIMATE.start_main_#t~ret13.offset_7|, ULTIMATE.start_cstrncmp_#t~mem10=|v_ULTIMATE.start_cstrncmp_#t~mem10_5|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16, ULTIMATE.start_cstrncmp_#in~s2.base=|v_ULTIMATE.start_cstrncmp_#in~s2.base_2|, ULTIMATE.start_cstrncmp_#in~s1.base=|v_ULTIMATE.start_cstrncmp_#in~s1.base_2|, #valid=|v_#valid_26|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #memory_int=|v_#memory_int_16|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_23, ULTIMATE.start_cstrncmp_#t~short5=|v_ULTIMATE.start_cstrncmp_#t~short5_10|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18, ULTIMATE.start_cstrncmp_#t~short7=|v_ULTIMATE.start_cstrncmp_#t~short7_10|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~mem6, ULTIMATE.start_cstrncmp_~s2.base, ULTIMATE.start_cstrncmp_#res, ULTIMATE.start_cstrncmp_#t~mem3, ULTIMATE.start_cstrncmp_#t~mem4, ULTIMATE.start_cstrncmp_~s1.base, ULTIMATE.start_cstrncmp_#t~post9.offset, ULTIMATE.start_cstrncmp_#t~post8.offset, ULTIMATE.start_cstrncmp_#t~post8.base, ULTIMATE.start_cstrncmp_#t~post9.base, ULTIMATE.start_cstrncmp_#in~s2.offset, ULTIMATE.start_cstrncmp_#t~ite12, ULTIMATE.start_cstrncmp_~n, ULTIMATE.start_main_#t~ret14.offset, ULTIMATE.start___VERIFIER_nondet_String_#res.base, ULTIMATE.start_cstrncmp_~s1.offset, ULTIMATE.start_cstrncmp_#t~post2, ULTIMATE.start___VERIFIER_nondet_String_#res.offset, ULTIMATE.start_cstrncmp_~uc2~0, ULTIMATE.start_cstrncmp_#in~n, ULTIMATE.start_cstrncmp_~uc1~0, ULTIMATE.start_cstrncmp_#in~s1.offset, ULTIMATE.start_cstrncmp_#t~mem11, ULTIMATE.start_main_#t~ret14.base, ULTIMATE.start_cstrncmp_~s2.offset, ULTIMATE.start_cstrncmp_#t~mem10, ULTIMATE.start_cstrncmp_#in~s2.base, ULTIMATE.start_cstrncmp_#in~s1.base, #memory_int, ULTIMATE.start_cstrncmp_#t~short5, ULTIMATE.start_cstrncmp_#t~short7] 30#L28true [187] L28-->L31-8: Formula: (< 0 v_ULTIMATE.start_cstrncmp_~n_4) InVars {ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_4} OutVars{ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_4} AuxVars[] AssignedVars[] 22#L31-8true [2020-07-01 11:02:13,719 INFO L796 eck$LassoCheckResult]: Loop: 22#L31-8true [188] L31-8-->L31-1: Formula: (and (= v_ULTIMATE.start_cstrncmp_~n_5 (+ |v_ULTIMATE.start_cstrncmp_#t~post2_2| (- 1))) (not |v_ULTIMATE.start_cstrncmp_#t~short5_2|) (>= 0 |v_ULTIMATE.start_cstrncmp_#t~post2_2|) (= |v_ULTIMATE.start_cstrncmp_#t~post2_2| v_ULTIMATE.start_cstrncmp_~n_6)) InVars {ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_6} OutVars{ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_5, ULTIMATE.start_cstrncmp_#t~short5=|v_ULTIMATE.start_cstrncmp_#t~short5_2|, ULTIMATE.start_cstrncmp_#t~post2=|v_ULTIMATE.start_cstrncmp_#t~post2_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_~n, ULTIMATE.start_cstrncmp_#t~short5, ULTIMATE.start_cstrncmp_#t~post2] 12#L31-1true [111] L31-1-->L31-6: Formula: (not |v_ULTIMATE.start_cstrncmp_#t~short5_5|) InVars {ULTIMATE.start_cstrncmp_#t~short5=|v_ULTIMATE.start_cstrncmp_#t~short5_5|} OutVars{ULTIMATE.start_cstrncmp_#t~short5=|v_ULTIMATE.start_cstrncmp_#t~short5_5|} AuxVars[] AssignedVars[] 27#L31-6true [198] L31-6-->L34: Formula: (and |v_ULTIMATE.start_cstrncmp_#t~short5_9| (= 0 v_ULTIMATE.start_cstrncmp_~n_7) |v_ULTIMATE.start_cstrncmp_#t~short7_2|) InVars {ULTIMATE.start_cstrncmp_#t~short5=|v_ULTIMATE.start_cstrncmp_#t~short5_9|, ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_7} OutVars{ULTIMATE.start_cstrncmp_#t~mem4=|v_ULTIMATE.start_cstrncmp_#t~mem4_5|, ULTIMATE.start_cstrncmp_#t~mem3=|v_ULTIMATE.start_cstrncmp_#t~mem3_5|, ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_7, ULTIMATE.start_cstrncmp_#t~short5=|v_ULTIMATE.start_cstrncmp_#t~short5_8|, ULTIMATE.start_cstrncmp_#t~post2=|v_ULTIMATE.start_cstrncmp_#t~post2_4|, ULTIMATE.start_cstrncmp_#t~short7=|v_ULTIMATE.start_cstrncmp_#t~short7_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~mem4, ULTIMATE.start_cstrncmp_#t~mem3, ULTIMATE.start_cstrncmp_#t~short5, ULTIMATE.start_cstrncmp_#t~post2, ULTIMATE.start_cstrncmp_#t~short7] 23#L34true [125] L34-->L34-4: Formula: |v_ULTIMATE.start_cstrncmp_#t~short7_3| InVars {ULTIMATE.start_cstrncmp_#t~short7=|v_ULTIMATE.start_cstrncmp_#t~short7_3|} OutVars{ULTIMATE.start_cstrncmp_#t~short7=|v_ULTIMATE.start_cstrncmp_#t~short7_3|} AuxVars[] AssignedVars[] 33#L34-4true [144] L34-4-->L31-8: Formula: (and (not |v_ULTIMATE.start_cstrncmp_#t~short7_9|) (= v_ULTIMATE.start_cstrncmp_~s1.base_9 v_ULTIMATE.start_cstrncmp_~s1.base_10) (= v_ULTIMATE.start_cstrncmp_~s1.offset_7 (+ v_ULTIMATE.start_cstrncmp_~s1.offset_8 1)) (= v_ULTIMATE.start_cstrncmp_~s2.base_7 v_ULTIMATE.start_cstrncmp_~s2.base_6) (= v_ULTIMATE.start_cstrncmp_~s2.offset_5 (+ v_ULTIMATE.start_cstrncmp_~s2.offset_6 1))) InVars {ULTIMATE.start_cstrncmp_~s2.offset=v_ULTIMATE.start_cstrncmp_~s2.offset_6, ULTIMATE.start_cstrncmp_~s2.base=v_ULTIMATE.start_cstrncmp_~s2.base_7, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_10, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_8, ULTIMATE.start_cstrncmp_#t~short7=|v_ULTIMATE.start_cstrncmp_#t~short7_9|} OutVars{ULTIMATE.start_cstrncmp_~s2.offset=v_ULTIMATE.start_cstrncmp_~s2.offset_5, ULTIMATE.start_cstrncmp_#t~post8.offset=|v_ULTIMATE.start_cstrncmp_#t~post8.offset_2|, ULTIMATE.start_cstrncmp_#t~mem6=|v_ULTIMATE.start_cstrncmp_#t~mem6_5|, ULTIMATE.start_cstrncmp_#t~post9.base=|v_ULTIMATE.start_cstrncmp_#t~post9.base_2|, ULTIMATE.start_cstrncmp_~s2.base=v_ULTIMATE.start_cstrncmp_~s2.base_6, ULTIMATE.start_cstrncmp_#t~post8.base=|v_ULTIMATE.start_cstrncmp_#t~post8.base_2|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_9, ULTIMATE.start_cstrncmp_#t~post9.offset=|v_ULTIMATE.start_cstrncmp_#t~post9.offset_2|, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_7, ULTIMATE.start_cstrncmp_#t~short7=|v_ULTIMATE.start_cstrncmp_#t~short7_8|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_~s2.offset, ULTIMATE.start_cstrncmp_#t~post8.offset, ULTIMATE.start_cstrncmp_#t~mem6, ULTIMATE.start_cstrncmp_#t~post9.base, ULTIMATE.start_cstrncmp_~s2.base, ULTIMATE.start_cstrncmp_#t~post8.base, ULTIMATE.start_cstrncmp_~s1.base, ULTIMATE.start_cstrncmp_#t~post9.offset, ULTIMATE.start_cstrncmp_~s1.offset, ULTIMATE.start_cstrncmp_#t~short7] 22#L31-8true [2020-07-01 11:02:13,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:02:13,720 INFO L82 PathProgramCache]: Analyzing trace with hash 2041151458, now seen corresponding path program 1 times [2020-07-01 11:02:13,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:02:13,721 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847119114] [2020-07-01 11:02:13,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:02:13,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:02:13,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:02:13,754 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:02:13,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:02:13,755 INFO L82 PathProgramCache]: Analyzing trace with hash 205752197, now seen corresponding path program 1 times [2020-07-01 11:02:13,755 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:02:13,755 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842014652] [2020-07-01 11:02:13,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:02:13,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:02:13,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:02:13,764 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842014652] [2020-07-01 11:02:13,764 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 11:02:13,764 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 11:02:13,764 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410494321] [2020-07-01 11:02:13,765 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-01 11:02:13,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:02:13,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 11:02:13,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 11:02:13,766 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 3 states. [2020-07-01 11:02:13,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:02:13,898 INFO L93 Difference]: Finished difference Result 56 states and 100 transitions. [2020-07-01 11:02:13,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 11:02:13,902 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: unknown kind of automaton at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.toString(AutomatonDefinitionPrinter.java:186) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.TermcompProofBenchmark.reportFiniteModule(TermcompProofBenchmark.java:61) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.refineFinite(BuchiCegarLoop.java:978) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:532) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-01 11:02:13,906 INFO L168 Benchmark]: Toolchain (without parser) took 62950.28 ms. Allocated memory was 514.9 MB in the beginning and 785.9 MB in the end (delta: 271.1 MB). Free memory was 438.8 MB in the beginning and 710.0 MB in the end (delta: -271.1 MB). There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 11:02:13,907 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 514.9 MB. Free memory is still 458.4 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 11:02:13,907 INFO L168 Benchmark]: CACSL2BoogieTranslator took 328.55 ms. Allocated memory was 514.9 MB in the beginning and 564.7 MB in the end (delta: 49.8 MB). Free memory was 438.2 MB in the beginning and 530.8 MB in the end (delta: -92.6 MB). Peak memory consumption was 27.9 MB. Max. memory is 50.3 GB. [2020-07-01 11:02:13,908 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.53 ms. Allocated memory is still 564.7 MB. Free memory was 530.8 MB in the beginning and 528.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 50.3 GB. [2020-07-01 11:02:13,908 INFO L168 Benchmark]: Boogie Preprocessor took 29.04 ms. Allocated memory is still 564.7 MB. Free memory was 528.7 MB in the beginning and 526.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 50.3 GB. [2020-07-01 11:02:13,908 INFO L168 Benchmark]: RCFGBuilder took 376.11 ms. Allocated memory is still 564.7 MB. Free memory was 526.7 MB in the beginning and 502.5 MB in the end (delta: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 50.3 GB. [2020-07-01 11:02:13,909 INFO L168 Benchmark]: BlockEncodingV2 took 148.55 ms. Allocated memory is still 564.7 MB. Free memory was 501.9 MB in the beginning and 490.4 MB in the end (delta: 11.5 MB). Peak memory consumption was 11.5 MB. Max. memory is 50.3 GB. [2020-07-01 11:02:13,910 INFO L168 Benchmark]: TraceAbstraction took 61770.16 ms. Allocated memory was 564.7 MB in the beginning and 785.9 MB in the end (delta: 221.2 MB). Free memory was 489.7 MB in the beginning and 739.3 MB in the end (delta: -249.5 MB). Peak memory consumption was 309.5 MB. Max. memory is 50.3 GB. [2020-07-01 11:02:13,910 INFO L168 Benchmark]: BuchiAutomizer took 247.00 ms. Allocated memory is still 785.9 MB. Free memory was 739.3 MB in the beginning and 710.0 MB in the end (delta: 29.3 MB). Peak memory consumption was 29.3 MB. Max. memory is 50.3 GB. [2020-07-01 11:02:13,914 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 47 locations, 55 edges - StatisticsResult: Encoded RCFG 34 locations, 62 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 514.9 MB. Free memory is still 458.4 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 328.55 ms. Allocated memory was 514.9 MB in the beginning and 564.7 MB in the end (delta: 49.8 MB). Free memory was 438.2 MB in the beginning and 530.8 MB in the end (delta: -92.6 MB). Peak memory consumption was 27.9 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 44.53 ms. Allocated memory is still 564.7 MB. Free memory was 530.8 MB in the beginning and 528.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 29.04 ms. Allocated memory is still 564.7 MB. Free memory was 528.7 MB in the beginning and 526.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 50.3 GB. * RCFGBuilder took 376.11 ms. Allocated memory is still 564.7 MB. Free memory was 526.7 MB in the beginning and 502.5 MB in the end (delta: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 148.55 ms. Allocated memory is still 564.7 MB. Free memory was 501.9 MB in the beginning and 490.4 MB in the end (delta: 11.5 MB). Peak memory consumption was 11.5 MB. Max. memory is 50.3 GB. * TraceAbstraction took 61770.16 ms. Allocated memory was 564.7 MB in the beginning and 785.9 MB in the end (delta: 221.2 MB). Free memory was 489.7 MB in the beginning and 739.3 MB in the end (delta: -249.5 MB). Peak memory consumption was 309.5 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 247.00 ms. Allocated memory is still 785.9 MB. Free memory was 739.3 MB in the beginning and 710.0 MB in the end (delta: 29.3 MB). Peak memory consumption was 29.3 MB. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_#res.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_#res.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_#res.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_#res.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_#res.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_#res.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 40]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 39]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 39]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 31]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 40]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 31]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 31]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 31]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 34]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 34]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 14 specifications checked. All of them hold - InvariantResult [Line: 16]: Loop Invariant [2020-07-01 11:02:13,926 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:02:13,926 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((nondetString == 0 && 1 == \valid[nondetString]) && unknown-#length-unknown[nondetString] == length) && 1 <= length - InvariantResult [Line: 31]: Loop Invariant [2020-07-01 11:02:13,927 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 11:02:13,927 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 11:02:13,927 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 11:02:13,928 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2020-07-01 11:02:13,928 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2020-07-01 11:02:13,928 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2020-07-01 11:02:13,928 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 11:02:13,929 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 11:02:13,929 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 11:02:13,929 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_#res.base,QUANTIFIED] [2020-07-01 11:02:13,930 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_#res.base,QUANTIFIED] [2020-07-01 11:02:13,930 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-07-01 11:02:13,930 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_#res.base,QUANTIFIED] [2020-07-01 11:02:13,930 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] [2020-07-01 11:02:13,931 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] [2020-07-01 11:02:13,931 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] [2020-07-01 11:02:13,931 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 11:02:13,931 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 11:02:13,932 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 11:02:13,932 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] [2020-07-01 11:02:13,933 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] [2020-07-01 11:02:13,933 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] [2020-07-01 11:02:13,934 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] [2020-07-01 11:02:13,934 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] [2020-07-01 11:02:13,934 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] [2020-07-01 11:02:13,934 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-07-01 11:02:13,934 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-07-01 11:02:13,935 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-07-01 11:02:13,935 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-07-01 11:02:13,936 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:02:13,936 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:02:13,937 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:02:13,937 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:02:13,937 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:02:13,937 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:02:13,938 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:02:13,938 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:02:13,938 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:02:13,938 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:02:13,939 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:02:13,939 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:02:13,939 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:02:13,939 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:02:13,940 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:02:13,940 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:02:13,940 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:02:13,940 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:02:13,941 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:02:13,941 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:02:13,941 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:02:13,941 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:02:13,942 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:02:13,942 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:02:13,942 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:02:13,942 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:02:13,942 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:02:13,943 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:02:13,943 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:02:13,943 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:02:13,943 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:02:13,944 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:02:13,944 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:02:13,944 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:02:13,945 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:02:13,945 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:02:13,945 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:02:13,945 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:02:13,945 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:02:13,946 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:02:13,947 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 11:02:13,947 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 11:02:13,948 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 11:02:13,948 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2020-07-01 11:02:13,948 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2020-07-01 11:02:13,949 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2020-07-01 11:02:13,949 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 11:02:13,949 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 11:02:13,949 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 11:02:13,950 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_#res.base,QUANTIFIED] [2020-07-01 11:02:13,950 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_#res.base,QUANTIFIED] [2020-07-01 11:02:13,950 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-07-01 11:02:13,950 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_#res.base,QUANTIFIED] [2020-07-01 11:02:13,951 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] [2020-07-01 11:02:13,951 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] [2020-07-01 11:02:13,951 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] [2020-07-01 11:02:13,951 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 11:02:13,952 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 11:02:13,952 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 11:02:13,952 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] [2020-07-01 11:02:13,952 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] [2020-07-01 11:02:13,953 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] [2020-07-01 11:02:13,953 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] [2020-07-01 11:02:13,954 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] [2020-07-01 11:02:13,954 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] [2020-07-01 11:02:13,954 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-07-01 11:02:13,954 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-07-01 11:02:13,954 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-07-01 11:02:13,955 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-07-01 11:02:13,956 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:02:13,956 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:02:13,957 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:02:13,957 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:02:13,957 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:02:13,957 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:02:13,958 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:02:13,958 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:02:13,958 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:02:13,958 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:02:13,959 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:02:13,959 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:02:13,959 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:02:13,959 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:02:13,959 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:02:13,960 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:02:13,960 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:02:13,960 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:02:13,960 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:02:13,961 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:02:13,961 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:02:13,961 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:02:13,961 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:02:13,961 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:02:13,962 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:02:13,962 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:02:13,962 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:02:13,962 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:02:13,962 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:02:13,963 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:02:13,963 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:02:13,963 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:02:13,963 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:02:13,964 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:02:13,964 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:02:13,964 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:02:13,964 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:02:13,964 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:02:13,965 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:02:13,965 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((((((((((((((0 == s2 && 0 == s1) && 1 == \valid[s2]) && 1 <= unknown-#length-unknown[__VERIFIER_nondet_String()]) && 1 == \valid[__VERIFIER_nondet_String()]) && 1 <= unknown-#length-unknown[s2]) && unknown-#length-unknown[nondetString] == length) && 0 == __VERIFIER_nondet_String()) && 1 <= unknown-#length-unknown[s1]) && nondetString == 0) && 1 == \valid[nondetString]) && 1 <= length) && 1 == \valid[s1]) && n + 1 <= 0) || (((((((((((((((((0 == s2 && 0 == unknown-#memory_int-unknown[__VERIFIER_nondet_String()][unknown-#length-unknown[__VERIFIER_nondet_String()] + -1]) && 0 == s1) && 1 == \valid[s2]) && 1 == \valid[__VERIFIER_nondet_String()]) && (\exists v_prenex_2 : int :: (0 == unknown-#memory_int-unknown[s1][v_prenex_2] && v_prenex_2 + 1 <= unknown-#length-unknown[s1]) && s1 <= v_prenex_2)) && !(nondetString == __VERIFIER_nondet_String())) && unknown-#length-unknown[nondetString] == length) && (\exists v_prenex_3 : int :: (v_prenex_3 <= 0 && s2 <= v_prenex_3) && 0 == unknown-#memory_int-unknown[s2][unknown-#length-unknown[s2] + v_prenex_3 + -1])) && 0 == __VERIFIER_nondet_String()) && (\exists v_prenex_2 : int :: (v_prenex_2 + 1 <= unknown-#length-unknown[__VERIFIER_nondet_String()] && 0 == unknown-#memory_int-unknown[__VERIFIER_nondet_String()][v_prenex_2]) && __VERIFIER_nondet_String() <= v_prenex_2)) && (\exists ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset : int, ULTIMATE.start___VERIFIER_nondet_String_#res.base : int :: !(s1 == ULTIMATE.start___VERIFIER_nondet_String_#res.base) && 0 == unknown-#memory_int-unknown[ULTIMATE.start___VERIFIER_nondet_String_#res.base][ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset + unknown-#length-unknown[ULTIMATE.start___VERIFIER_nondet_String_#res.base] + -1])) && nondetString == 0) && s2 + 1 <= unknown-#length-unknown[s2]) && 1 == \valid[nondetString]) && 1 <= length) && (\exists v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20 : int :: (0 == unknown-#memory_int-unknown[s1][unknown-#length-unknown[s1] + v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20 + -1] && v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20 <= 0) && 0 <= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20)) && 1 == \valid[s1])) || (((((((((((((((s2 <= 1 && 1 <= s1) && 1 == \valid[s2]) && 1 == \valid[__VERIFIER_nondet_String()]) && !(nondetString == __VERIFIER_nondet_String())) && unknown-#length-unknown[nondetString] == length) && 0 == __VERIFIER_nondet_String()) && (\exists v_prenex_2 : int :: (v_prenex_2 + 1 <= unknown-#length-unknown[__VERIFIER_nondet_String()] && 0 == unknown-#memory_int-unknown[__VERIFIER_nondet_String()][v_prenex_2]) && __VERIFIER_nondet_String() <= v_prenex_2)) && nondetString == 0) && 1 < unknown-#length-unknown[s2]) && 1 <= s2) && 1 == \valid[nondetString]) && 1 <= length) && s1 + 1 <= unknown-#length-unknown[s1]) && 1 == \valid[s1]) && n + 1 <= 0)) || ((((((((((((((0 == s2 && 0 == s1) && 1 == \valid[s2]) && 1 <= unknown-#length-unknown[__VERIFIER_nondet_String()]) && 1 == \valid[__VERIFIER_nondet_String()]) && 1 <= unknown-#length-unknown[s2]) && unknown-#length-unknown[nondetString] == length) && unknown-#memory_int-unknown[s2][s2] == 0) && 0 == __VERIFIER_nondet_String()) && nondetString == 0) && 1 <= unknown-#length-unknown[s1]) && length + nondetString <= 1) && 1 == \valid[nondetString]) && 1 <= length) && 1 == \valid[s1])) || ((((((((((((((((((\exists v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20 : int :: (0 == unknown-#memory_int-unknown[__VERIFIER_nondet_String()][unknown-#length-unknown[__VERIFIER_nondet_String()] + v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20 + -1] && v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20 <= 0) && 0 <= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20) && 0 == unknown-#memory_int-unknown[s2][unknown-#length-unknown[s2] + -1]) && 1 <= s1) && 1 == \valid[s2]) && 1 <= unknown-#length-unknown[__VERIFIER_nondet_String()]) && 1 == \valid[__VERIFIER_nondet_String()]) && !(nondetString == __VERIFIER_nondet_String())) && unknown-#length-unknown[nondetString] == length) && 0 == __VERIFIER_nondet_String()) && nondetString == 0) && 1 <= s2) && s2 + 1 <= unknown-#length-unknown[s2]) && 1 == \valid[nondetString]) && (\exists v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20 : int :: (0 == unknown-#memory_int-unknown[s1][unknown-#length-unknown[s1] + v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20 + -1] && v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20 <= 0) && 0 <= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20)) && (\exists ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset : int, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base : int :: 0 == unknown-#memory_int-unknown[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base][ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset + unknown-#length-unknown[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base] + -1] && !(ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base == s1))) && 1 <= length) && s1 + 1 <= unknown-#length-unknown[s1]) && 1 == \valid[s1]) - InvariantResult [Line: 16]: Loop Invariant [2020-07-01 11:02:13,966 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] [2020-07-01 11:02:13,966 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] [2020-07-01 11:02:13,966 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] [2020-07-01 11:02:13,967 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:02:13,967 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:02:13,967 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:02:13,968 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:02:13,968 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:02:13,968 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:02:13,968 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] [2020-07-01 11:02:13,969 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] [2020-07-01 11:02:13,969 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] [2020-07-01 11:02:13,969 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:02:13,969 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:02:13,970 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:02:13,970 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:02:13,970 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:02:13,970 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((0 == __VERIFIER_nondet_String() && nondetString == 0) && 1 <= unknown-#length-unknown[__VERIFIER_nondet_String()]) && 1 == \valid[__VERIFIER_nondet_String()]) && length + nondetString <= 1) && 1 == \valid[nondetString]) && unknown-#length-unknown[nondetString] == length) && 1 <= length) || (((((((((\exists v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20 : int :: (0 == unknown-#memory_int-unknown[__VERIFIER_nondet_String()][unknown-#length-unknown[__VERIFIER_nondet_String()] + v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20 + -1] && v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20 <= 0) && 0 <= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20) && 0 == __VERIFIER_nondet_String()) && nondetString == 0) && 1 <= unknown-#length-unknown[__VERIFIER_nondet_String()]) && 1 == \valid[__VERIFIER_nondet_String()]) && !(nondetString == __VERIFIER_nondet_String())) && 1 == \valid[nondetString]) && unknown-#length-unknown[nondetString] == length) && 1 <= length) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 34 locations, 14 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 49.8s, OverallIterations: 25, TraceHistogramMax: 4, AutomataDifference: 39.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 11.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 264 SDtfs, 3483 SDslu, 2316 SDs, 0 SdLazy, 4627 SolverSat, 421 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 5.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 620 GetRequests, 282 SyntacticMatches, 9 SemanticMatches, 329 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1650 ImplicationChecksByTransitivity, 35.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=119occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 25 MinimizatonAttempts, 817 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 14 NumberOfFragments, 613 HoareAnnotationTreeSize, 3 FomulaSimplifications, 1091028 FormulaSimplificationTreeSizeReduction, 0.6s HoareSimplificationTime, 3 FomulaSimplificationsInter, 96426 FormulaSimplificationTreeSizeReductionInter, 10.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 6.8s InterpolantComputationTime, 804 NumberOfCodeBlocks, 804 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 768 ConstructedInterpolants, 137 QuantifiedInterpolants, 359279 SizeOfPredicates, 111 NumberOfNonLiveVariables, 1821 ConjunctsInSsa, 269 ConjunctsInUnsatCore, 36 InterpolantComputations, 16 PerfectInterpolantSequences, 145/380 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: unknown kind of automaton de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: unknown kind of automaton: de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) RESULT: Ultimate could not prove your program: Toolchain returned no result. !SESSION 2020-07-01 11:01:07.665 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox2/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox2/tmp/BenchExec_run_nQrMfG/tmp -i /export/starexec/sandbox2/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-07-01 11:02:14.199 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check