/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc config/AutomizerReach.xml -s config/svcomp-Reach-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/ldv-regression/ex3_forlist.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-4f750a8 [2020-12-22 03:52:09,670 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-22 03:52:09,675 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-22 03:52:09,720 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-22 03:52:09,720 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-22 03:52:09,722 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-22 03:52:09,723 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-22 03:52:09,726 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-22 03:52:09,738 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-22 03:52:09,739 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-22 03:52:09,740 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-22 03:52:09,742 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-22 03:52:09,742 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-22 03:52:09,743 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-22 03:52:09,744 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-22 03:52:09,746 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-22 03:52:09,747 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-22 03:52:09,748 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-22 03:52:09,750 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-22 03:52:09,752 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-22 03:52:09,754 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-22 03:52:09,755 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-22 03:52:09,757 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-22 03:52:09,758 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-22 03:52:09,761 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-22 03:52:09,761 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-22 03:52:09,762 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-22 03:52:09,763 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-22 03:52:09,763 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-22 03:52:09,764 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-22 03:52:09,765 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-22 03:52:09,765 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-22 03:52:09,766 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-22 03:52:09,767 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-22 03:52:09,768 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-22 03:52:09,769 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-22 03:52:09,769 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-22 03:52:09,770 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-22 03:52:09,770 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-22 03:52:09,771 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-22 03:52:09,772 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-22 03:52:09,773 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2020-12-22 03:52:09,800 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-22 03:52:09,800 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-22 03:52:09,802 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-22 03:52:09,802 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-22 03:52:09,802 INFO L138 SettingsManager]: * Use SBE=true [2020-12-22 03:52:09,802 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-22 03:52:09,803 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-22 03:52:09,803 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-22 03:52:09,803 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-22 03:52:09,803 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-22 03:52:09,803 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-22 03:52:09,804 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-22 03:52:09,804 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-22 03:52:09,804 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-22 03:52:09,804 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-22 03:52:09,805 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-22 03:52:09,805 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-22 03:52:09,805 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-22 03:52:09,805 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-22 03:52:09,805 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-22 03:52:09,806 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-22 03:52:09,806 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-22 03:52:09,806 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-22 03:52:09,806 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-22 03:52:09,806 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-22 03:52:09,807 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-12-22 03:52:10,164 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-22 03:52:10,196 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-22 03:52:10,199 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-22 03:52:10,200 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-22 03:52:10,203 INFO L275 PluginConnector]: CDTParser initialized [2020-12-22 03:52:10,204 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-regression/ex3_forlist.i [2020-12-22 03:52:10,272 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0928f118d/4d3eebdf058f4af7997c7c9b342fa72b/FLAG123f52f64 [2020-12-22 03:52:10,835 INFO L306 CDTParser]: Found 1 translation units. [2020-12-22 03:52:10,835 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/ex3_forlist.i [2020-12-22 03:52:10,850 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0928f118d/4d3eebdf058f4af7997c7c9b342fa72b/FLAG123f52f64 [2020-12-22 03:52:11,201 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0928f118d/4d3eebdf058f4af7997c7c9b342fa72b [2020-12-22 03:52:11,204 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-22 03:52:11,212 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-22 03:52:11,215 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-22 03:52:11,215 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-22 03:52:11,219 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-22 03:52:11,220 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 03:52:11" (1/1) ... [2020-12-22 03:52:11,222 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1255d263 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 03:52:11, skipping insertion in model container [2020-12-22 03:52:11,222 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 03:52:11" (1/1) ... [2020-12-22 03:52:11,231 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-22 03:52:11,251 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-22 03:52:11,447 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/ex3_forlist.i[293,306] [2020-12-22 03:52:11,502 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-22 03:52:11,516 INFO L203 MainTranslator]: Completed pre-run [2020-12-22 03:52:11,532 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/ex3_forlist.i[293,306] [2020-12-22 03:52:11,560 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-22 03:52:11,583 INFO L208 MainTranslator]: Completed translation [2020-12-22 03:52:11,584 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 03:52:11 WrapperNode [2020-12-22 03:52:11,584 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-22 03:52:11,586 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-22 03:52:11,586 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-22 03:52:11,587 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-22 03:52:11,595 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 03:52:11" (1/1) ... [2020-12-22 03:52:11,611 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 03:52:11" (1/1) ... [2020-12-22 03:52:11,640 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-22 03:52:11,642 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-22 03:52:11,643 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-22 03:52:11,643 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-22 03:52:11,652 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 03:52:11" (1/1) ... [2020-12-22 03:52:11,653 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 03:52:11" (1/1) ... [2020-12-22 03:52:11,656 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 03:52:11" (1/1) ... [2020-12-22 03:52:11,656 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 03:52:11" (1/1) ... [2020-12-22 03:52:11,665 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 03:52:11" (1/1) ... [2020-12-22 03:52:11,670 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 03:52:11" (1/1) ... [2020-12-22 03:52:11,672 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 03:52:11" (1/1) ... [2020-12-22 03:52:11,675 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-22 03:52:11,676 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-22 03:52:11,676 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-22 03:52:11,677 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-22 03:52:11,678 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 03:52:11" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-22 03:52:11,768 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-12-22 03:52:11,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2020-12-22 03:52:11,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-22 03:52:11,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-12-22 03:52:11,769 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-22 03:52:11,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-22 03:52:11,769 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-22 03:52:11,769 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-22 03:52:11,769 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-12-22 03:52:12,270 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-22 03:52:12,271 INFO L299 CfgBuilder]: Removed 27 assume(true) statements. [2020-12-22 03:52:12,272 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 03:52:12 BoogieIcfgContainer [2020-12-22 03:52:12,273 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-22 03:52:12,274 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-22 03:52:12,274 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-22 03:52:12,278 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-22 03:52:12,278 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.12 03:52:11" (1/3) ... [2020-12-22 03:52:12,279 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a6de32a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 03:52:12, skipping insertion in model container [2020-12-22 03:52:12,279 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 03:52:11" (2/3) ... [2020-12-22 03:52:12,279 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a6de32a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 03:52:12, skipping insertion in model container [2020-12-22 03:52:12,280 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 03:52:12" (3/3) ... [2020-12-22 03:52:12,281 INFO L111 eAbstractionObserver]: Analyzing ICFG ex3_forlist.i [2020-12-22 03:52:12,288 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-22 03:52:12,292 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-12-22 03:52:12,312 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2020-12-22 03:52:12,341 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-22 03:52:12,341 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-22 03:52:12,342 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-22 03:52:12,342 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-22 03:52:12,342 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-22 03:52:12,342 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-22 03:52:12,342 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-22 03:52:12,342 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-22 03:52:12,358 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2020-12-22 03:52:12,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-22 03:52:12,364 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 03:52:12,364 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 03:52:12,365 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 03:52:12,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 03:52:12,371 INFO L82 PathProgramCache]: Analyzing trace with hash 409945024, now seen corresponding path program 1 times [2020-12-22 03:52:12,382 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 03:52:12,382 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730825109] [2020-12-22 03:52:12,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 03:52:12,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 03:52:12,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 03:52:12,580 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730825109] [2020-12-22 03:52:12,581 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 03:52:12,581 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 03:52:12,582 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551158614] [2020-12-22 03:52:12,587 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 03:52:12,587 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 03:52:12,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 03:52:12,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 03:52:12,605 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 3 states. [2020-12-22 03:52:12,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 03:52:12,646 INFO L93 Difference]: Finished difference Result 68 states and 100 transitions. [2020-12-22 03:52:12,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 03:52:12,648 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2020-12-22 03:52:12,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 03:52:12,658 INFO L225 Difference]: With dead ends: 68 [2020-12-22 03:52:12,658 INFO L226 Difference]: Without dead ends: 33 [2020-12-22 03:52:12,661 INFO L677 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-12-22 03:52:12,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-12-22 03:52:12,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2020-12-22 03:52:12,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-12-22 03:52:12,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2020-12-22 03:52:12,698 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 15 [2020-12-22 03:52:12,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 03:52:12,699 INFO L481 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2020-12-22 03:52:12,699 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 03:52:12,699 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2020-12-22 03:52:12,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-12-22 03:52:12,700 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 03:52:12,700 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 03:52:12,700 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-22 03:52:12,701 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 03:52:12,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 03:52:12,702 INFO L82 PathProgramCache]: Analyzing trace with hash -1658708759, now seen corresponding path program 1 times [2020-12-22 03:52:12,702 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 03:52:12,702 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929178917] [2020-12-22 03:52:12,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 03:52:12,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 03:52:12,820 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 03:52:12,821 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929178917] [2020-12-22 03:52:12,822 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [132751918] [2020-12-22 03:52:12,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-12-22 03:52:12,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 03:52:12,924 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-22 03:52:12,930 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 03:52:12,959 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-22 03:52:12,959 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-22 03:52:12,960 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2020-12-22 03:52:12,961 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263992248] [2020-12-22 03:52:12,961 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 03:52:12,962 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 03:52:12,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 03:52:12,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-22 03:52:12,963 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand 3 states. [2020-12-22 03:52:13,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 03:52:13,003 INFO L93 Difference]: Finished difference Result 75 states and 95 transitions. [2020-12-22 03:52:13,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 03:52:13,004 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2020-12-22 03:52:13,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 03:52:13,006 INFO L225 Difference]: With dead ends: 75 [2020-12-22 03:52:13,006 INFO L226 Difference]: Without dead ends: 55 [2020-12-22 03:52:13,007 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-22 03:52:13,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-12-22 03:52:13,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 34. [2020-12-22 03:52:13,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-12-22 03:52:13,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2020-12-22 03:52:13,014 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 17 [2020-12-22 03:52:13,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 03:52:13,015 INFO L481 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2020-12-22 03:52:13,015 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 03:52:13,015 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2020-12-22 03:52:13,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-12-22 03:52:13,016 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 03:52:13,016 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 03:52:13,230 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2020-12-22 03:52:13,232 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 03:52:13,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 03:52:13,233 INFO L82 PathProgramCache]: Analyzing trace with hash 1382422530, now seen corresponding path program 1 times [2020-12-22 03:52:13,234 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 03:52:13,234 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415266675] [2020-12-22 03:52:13,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 03:52:13,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 03:52:13,324 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 03:52:13,325 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415266675] [2020-12-22 03:52:13,325 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1236557902] [2020-12-22 03:52:13,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-12-22 03:52:13,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 03:52:13,428 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-22 03:52:13,430 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 03:52:13,484 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 03:52:13,485 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-22 03:52:13,485 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2020-12-22 03:52:13,485 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906670469] [2020-12-22 03:52:13,486 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-22 03:52:13,486 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 03:52:13,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-22 03:52:13,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-12-22 03:52:13,488 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. Second operand 5 states. [2020-12-22 03:52:13,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 03:52:13,516 INFO L93 Difference]: Finished difference Result 65 states and 81 transitions. [2020-12-22 03:52:13,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-22 03:52:13,516 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2020-12-22 03:52:13,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 03:52:13,518 INFO L225 Difference]: With dead ends: 65 [2020-12-22 03:52:13,518 INFO L226 Difference]: Without dead ends: 36 [2020-12-22 03:52:13,519 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-12-22 03:52:13,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-12-22 03:52:13,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2020-12-22 03:52:13,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-12-22 03:52:13,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2020-12-22 03:52:13,525 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 19 [2020-12-22 03:52:13,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 03:52:13,525 INFO L481 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2020-12-22 03:52:13,525 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-22 03:52:13,526 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2020-12-22 03:52:13,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-22 03:52:13,526 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 03:52:13,527 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-12-22 03:52:13,742 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 03:52:13,743 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 03:52:13,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 03:52:13,745 INFO L82 PathProgramCache]: Analyzing trace with hash 1994936256, now seen corresponding path program 2 times [2020-12-22 03:52:13,746 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 03:52:13,747 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603170676] [2020-12-22 03:52:13,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 03:52:13,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 03:52:14,189 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-22 03:52:14,190 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603170676] [2020-12-22 03:52:14,190 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 03:52:14,190 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-22 03:52:14,191 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028957937] [2020-12-22 03:52:14,191 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-22 03:52:14,191 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 03:52:14,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-22 03:52:14,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-12-22 03:52:14,193 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand 9 states. [2020-12-22 03:52:14,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 03:52:14,647 INFO L93 Difference]: Finished difference Result 77 states and 95 transitions. [2020-12-22 03:52:14,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-22 03:52:14,648 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-12-22 03:52:14,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 03:52:14,649 INFO L225 Difference]: With dead ends: 77 [2020-12-22 03:52:14,649 INFO L226 Difference]: Without dead ends: 61 [2020-12-22 03:52:14,650 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2020-12-22 03:52:14,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2020-12-22 03:52:14,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 40. [2020-12-22 03:52:14,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-12-22 03:52:14,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 49 transitions. [2020-12-22 03:52:14,662 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 49 transitions. Word has length 21 [2020-12-22 03:52:14,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 03:52:14,662 INFO L481 AbstractCegarLoop]: Abstraction has 40 states and 49 transitions. [2020-12-22 03:52:14,662 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-22 03:52:14,662 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 49 transitions. [2020-12-22 03:52:14,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-22 03:52:14,665 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 03:52:14,666 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 03:52:14,666 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-22 03:52:14,666 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 03:52:14,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 03:52:14,667 INFO L82 PathProgramCache]: Analyzing trace with hash 902320519, now seen corresponding path program 1 times [2020-12-22 03:52:14,667 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 03:52:14,668 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663934724] [2020-12-22 03:52:14,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 03:52:14,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 03:52:14,769 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-22 03:52:14,769 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663934724] [2020-12-22 03:52:14,769 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [91028713] [2020-12-22 03:52:14,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-12-22 03:52:14,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 03:52:14,853 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-22 03:52:14,855 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 03:52:14,886 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-22 03:52:14,887 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-22 03:52:14,887 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2020-12-22 03:52:14,887 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247106437] [2020-12-22 03:52:14,888 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-22 03:52:14,888 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 03:52:14,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-22 03:52:14,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-12-22 03:52:14,889 INFO L87 Difference]: Start difference. First operand 40 states and 49 transitions. Second operand 5 states. [2020-12-22 03:52:14,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 03:52:14,934 INFO L93 Difference]: Finished difference Result 99 states and 122 transitions. [2020-12-22 03:52:14,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-22 03:52:14,935 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2020-12-22 03:52:14,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 03:52:14,936 INFO L225 Difference]: With dead ends: 99 [2020-12-22 03:52:14,936 INFO L226 Difference]: Without dead ends: 78 [2020-12-22 03:52:14,937 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-12-22 03:52:14,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-12-22 03:52:14,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 45. [2020-12-22 03:52:14,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-12-22 03:52:14,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 55 transitions. [2020-12-22 03:52:14,947 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 55 transitions. Word has length 23 [2020-12-22 03:52:14,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 03:52:14,947 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 55 transitions. [2020-12-22 03:52:14,947 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-22 03:52:14,947 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 55 transitions. [2020-12-22 03:52:14,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-22 03:52:14,948 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 03:52:14,948 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 03:52:15,162 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 03:52:15,163 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 03:52:15,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 03:52:15,165 INFO L82 PathProgramCache]: Analyzing trace with hash -554343156, now seen corresponding path program 1 times [2020-12-22 03:52:15,165 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 03:52:15,166 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660143106] [2020-12-22 03:52:15,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 03:52:15,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 03:52:15,431 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-22 03:52:15,432 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660143106] [2020-12-22 03:52:15,432 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [457455991] [2020-12-22 03:52:15,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-12-22 03:52:15,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 03:52:15,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 15 conjunts are in the unsatisfiable core [2020-12-22 03:52:15,520 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 03:52:15,563 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 179 treesize of output 171 [2020-12-22 03:52:15,569 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 03:52:15,588 INFO L625 ElimStorePlain]: treesize reduction 14, result has 58.8 percent of original size [2020-12-22 03:52:15,592 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-22 03:52:15,592 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:24, output treesize:8 [2020-12-22 03:52:15,628 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-12-22 03:52:15,629 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 03:52:15,634 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 03:52:15,635 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-22 03:52:15,636 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2020-12-22 03:52:15,742 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-22 03:52:15,754 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 03:52:15,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-22 03:52:15,762 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 33 [2020-12-22 03:52:15,764 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-22 03:52:15,774 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 03:52:15,779 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-22 03:52:15,779 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:56, output treesize:25 [2020-12-22 03:52:19,058 WARN L197 SmtUtils]: Spent 250.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2020-12-22 03:52:19,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-22 03:52:19,083 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 03:52:19,083 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 10 [2020-12-22 03:52:19,085 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 03:52:19,089 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 03:52:19,090 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-22 03:52:19,091 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:3 [2020-12-22 03:52:19,095 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-22 03:52:19,096 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-22 03:52:19,096 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 15 [2020-12-22 03:52:19,096 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878053555] [2020-12-22 03:52:19,097 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-22 03:52:19,097 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 03:52:19,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-22 03:52:19,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=170, Unknown=3, NotChecked=0, Total=240 [2020-12-22 03:52:19,098 INFO L87 Difference]: Start difference. First operand 45 states and 55 transitions. Second operand 10 states. [2020-12-22 03:52:23,687 WARN L197 SmtUtils]: Spent 470.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2020-12-22 03:52:25,067 WARN L197 SmtUtils]: Spent 795.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2020-12-22 03:52:29,652 WARN L197 SmtUtils]: Spent 1.06 s on a formula simplification that was a NOOP. DAG size: 26 [2020-12-22 03:52:46,925 WARN L197 SmtUtils]: Spent 612.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2020-12-22 03:52:51,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 03:52:51,962 INFO L93 Difference]: Finished difference Result 133 states and 162 transitions. [2020-12-22 03:52:51,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-12-22 03:52:51,963 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2020-12-22 03:52:51,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 03:52:51,966 INFO L225 Difference]: With dead ends: 133 [2020-12-22 03:52:51,966 INFO L226 Difference]: Without dead ends: 123 [2020-12-22 03:52:51,967 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=186, Invalid=406, Unknown=8, NotChecked=0, Total=600 [2020-12-22 03:52:51,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2020-12-22 03:52:51,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 61. [2020-12-22 03:52:51,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-12-22 03:52:51,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 77 transitions. [2020-12-22 03:52:51,983 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 77 transitions. Word has length 24 [2020-12-22 03:52:51,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 03:52:51,983 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 77 transitions. [2020-12-22 03:52:51,983 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-22 03:52:51,983 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 77 transitions. [2020-12-22 03:52:51,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-22 03:52:51,984 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 03:52:51,984 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 03:52:52,185 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 03:52:52,186 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 03:52:52,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 03:52:52,187 INFO L82 PathProgramCache]: Analyzing trace with hash 964936531, now seen corresponding path program 1 times [2020-12-22 03:52:52,187 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 03:52:52,188 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115937691] [2020-12-22 03:52:52,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 03:52:52,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 03:52:52,363 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-12-22 03:52:52,364 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115937691] [2020-12-22 03:52:52,364 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 03:52:52,364 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-22 03:52:52,365 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274812937] [2020-12-22 03:52:52,365 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-22 03:52:52,365 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 03:52:52,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-22 03:52:52,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-12-22 03:52:52,366 INFO L87 Difference]: Start difference. First operand 61 states and 77 transitions. Second operand 7 states. [2020-12-22 03:52:52,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 03:52:52,589 INFO L93 Difference]: Finished difference Result 138 states and 173 transitions. [2020-12-22 03:52:52,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-12-22 03:52:52,589 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-12-22 03:52:52,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 03:52:52,591 INFO L225 Difference]: With dead ends: 138 [2020-12-22 03:52:52,591 INFO L226 Difference]: Without dead ends: 128 [2020-12-22 03:52:52,592 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2020-12-22 03:52:52,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2020-12-22 03:52:52,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 61. [2020-12-22 03:52:52,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-12-22 03:52:52,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 77 transitions. [2020-12-22 03:52:52,610 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 77 transitions. Word has length 24 [2020-12-22 03:52:52,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 03:52:52,611 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 77 transitions. [2020-12-22 03:52:52,611 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-22 03:52:52,611 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 77 transitions. [2020-12-22 03:52:52,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-22 03:52:52,612 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 03:52:52,612 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 03:52:52,612 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-22 03:52:52,613 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 03:52:52,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 03:52:52,613 INFO L82 PathProgramCache]: Analyzing trace with hash 93482631, now seen corresponding path program 1 times [2020-12-22 03:52:52,613 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 03:52:52,614 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692391148] [2020-12-22 03:52:52,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 03:52:52,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 03:52:53,136 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-22 03:52:53,137 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692391148] [2020-12-22 03:52:53,137 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [467067668] [2020-12-22 03:52:53,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-12-22 03:52:53,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 03:52:53,214 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 12 conjunts are in the unsatisfiable core [2020-12-22 03:52:53,216 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 03:52:53,261 INFO L382 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 13 treesize of output 9 [2020-12-22 03:52:53,262 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 03:52:53,263 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 03:52:53,264 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-22 03:52:53,264 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2020-12-22 03:52:53,330 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2020-12-22 03:52:53,332 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 03:52:53,333 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 03:52:53,334 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-22 03:52:53,334 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2020-12-22 03:52:53,348 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-22 03:52:53,348 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-22 03:52:53,348 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 18 [2020-12-22 03:52:53,349 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892822823] [2020-12-22 03:52:53,350 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-12-22 03:52:53,350 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 03:52:53,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-12-22 03:52:53,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2020-12-22 03:52:53,351 INFO L87 Difference]: Start difference. First operand 61 states and 77 transitions. Second operand 18 states. [2020-12-22 03:52:55,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 03:52:55,848 INFO L93 Difference]: Finished difference Result 297 states and 377 transitions. [2020-12-22 03:52:55,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2020-12-22 03:52:55,848 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 27 [2020-12-22 03:52:55,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 03:52:55,856 INFO L225 Difference]: With dead ends: 297 [2020-12-22 03:52:55,856 INFO L226 Difference]: Without dead ends: 275 [2020-12-22 03:52:55,858 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 698 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=656, Invalid=2314, Unknown=0, NotChecked=0, Total=2970 [2020-12-22 03:52:55,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2020-12-22 03:52:55,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 100. [2020-12-22 03:52:55,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2020-12-22 03:52:55,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 132 transitions. [2020-12-22 03:52:55,897 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 132 transitions. Word has length 27 [2020-12-22 03:52:55,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 03:52:55,897 INFO L481 AbstractCegarLoop]: Abstraction has 100 states and 132 transitions. [2020-12-22 03:52:55,897 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-12-22 03:52:55,897 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 132 transitions. [2020-12-22 03:52:55,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-22 03:52:55,899 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 03:52:55,899 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 03:52:56,114 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 03:52:56,115 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 03:52:56,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 03:52:56,117 INFO L82 PathProgramCache]: Analyzing trace with hash 589272800, now seen corresponding path program 1 times [2020-12-22 03:52:56,117 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 03:52:56,118 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668156838] [2020-12-22 03:52:56,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 03:52:56,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 03:52:56,361 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-22 03:52:56,362 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668156838] [2020-12-22 03:52:56,362 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1024187032] [2020-12-22 03:52:56,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-12-22 03:52:56,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 03:52:56,423 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 16 conjunts are in the unsatisfiable core [2020-12-22 03:52:56,427 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 03:52:56,447 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 245 treesize of output 229 [2020-12-22 03:52:56,457 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 03:52:56,471 INFO L625 ElimStorePlain]: treesize reduction 14, result has 54.8 percent of original size [2020-12-22 03:52:56,479 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-22 03:52:56,480 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:20, output treesize:4 [2020-12-22 03:52:56,523 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-12-22 03:52:56,524 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 03:52:56,527 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 03:52:56,527 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-22 03:52:56,527 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2020-12-22 03:52:56,570 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-22 03:52:56,579 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 03:52:56,591 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 03:52:56,591 INFO L382 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 1 case distinctions, treesize of input 49 treesize of output 65 [2020-12-22 03:52:56,593 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-22 03:52:56,613 INFO L625 ElimStorePlain]: treesize reduction 22, result has 63.9 percent of original size [2020-12-22 03:52:56,617 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-22 03:52:56,617 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:55, output treesize:24 [2020-12-22 03:52:56,794 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 03:52:56,794 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 30 treesize of output 24 [2020-12-22 03:52:56,796 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 03:52:56,800 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 03:52:56,801 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-22 03:52:56,802 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:33, output treesize:3 [2020-12-22 03:52:56,806 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-22 03:52:56,807 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-22 03:52:56,807 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 19 [2020-12-22 03:52:56,807 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980069722] [2020-12-22 03:52:56,808 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-12-22 03:52:56,808 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 03:52:56,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-12-22 03:52:56,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2020-12-22 03:52:56,809 INFO L87 Difference]: Start difference. First operand 100 states and 132 transitions. Second operand 20 states. [2020-12-22 03:52:58,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 03:52:58,586 INFO L93 Difference]: Finished difference Result 324 states and 426 transitions. [2020-12-22 03:52:58,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2020-12-22 03:52:58,587 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 27 [2020-12-22 03:52:58,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 03:52:58,589 INFO L225 Difference]: With dead ends: 324 [2020-12-22 03:52:58,589 INFO L226 Difference]: Without dead ends: 280 [2020-12-22 03:52:58,591 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 610 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=528, Invalid=2022, Unknown=0, NotChecked=0, Total=2550 [2020-12-22 03:52:58,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2020-12-22 03:52:58,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 110. [2020-12-22 03:52:58,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2020-12-22 03:52:58,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 142 transitions. [2020-12-22 03:52:58,619 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 142 transitions. Word has length 27 [2020-12-22 03:52:58,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 03:52:58,619 INFO L481 AbstractCegarLoop]: Abstraction has 110 states and 142 transitions. [2020-12-22 03:52:58,619 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-12-22 03:52:58,619 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 142 transitions. [2020-12-22 03:52:58,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-22 03:52:58,621 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 03:52:58,621 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 03:52:58,835 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 03:52:58,836 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 03:52:58,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 03:52:58,837 INFO L82 PathProgramCache]: Analyzing trace with hash -2029788007, now seen corresponding path program 1 times [2020-12-22 03:52:58,838 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 03:52:58,838 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113416322] [2020-12-22 03:52:58,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 03:52:58,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 03:52:59,067 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-22 03:52:59,068 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113416322] [2020-12-22 03:52:59,068 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [640731317] [2020-12-22 03:52:59,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-12-22 03:52:59,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 03:52:59,137 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 26 conjunts are in the unsatisfiable core [2020-12-22 03:52:59,140 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 03:52:59,148 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 155 treesize of output 153 [2020-12-22 03:52:59,152 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 03:52:59,172 INFO L625 ElimStorePlain]: treesize reduction 14, result has 62.2 percent of original size [2020-12-22 03:52:59,177 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-22 03:52:59,178 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:27, output treesize:11 [2020-12-22 03:52:59,297 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 9 [2020-12-22 03:52:59,298 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 03:52:59,303 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 03:52:59,305 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-22 03:52:59,305 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:47, output treesize:13 [2020-12-22 03:52:59,377 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-12-22 03:52:59,378 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 03:52:59,379 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 03:52:59,380 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-22 03:52:59,380 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2020-12-22 03:52:59,398 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-22 03:52:59,398 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-22 03:52:59,399 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 20 [2020-12-22 03:52:59,399 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617804653] [2020-12-22 03:52:59,399 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-12-22 03:52:59,400 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 03:52:59,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-12-22 03:52:59,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2020-12-22 03:52:59,401 INFO L87 Difference]: Start difference. First operand 110 states and 142 transitions. Second operand 21 states. [2020-12-22 03:53:00,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 03:53:00,765 INFO L93 Difference]: Finished difference Result 316 states and 405 transitions. [2020-12-22 03:53:00,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-12-22 03:53:00,766 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 27 [2020-12-22 03:53:00,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 03:53:00,769 INFO L225 Difference]: With dead ends: 316 [2020-12-22 03:53:00,769 INFO L226 Difference]: Without dead ends: 260 [2020-12-22 03:53:00,771 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=244, Invalid=1088, Unknown=0, NotChecked=0, Total=1332 [2020-12-22 03:53:00,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2020-12-22 03:53:00,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 121. [2020-12-22 03:53:00,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2020-12-22 03:53:00,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 155 transitions. [2020-12-22 03:53:00,788 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 155 transitions. Word has length 27 [2020-12-22 03:53:00,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 03:53:00,789 INFO L481 AbstractCegarLoop]: Abstraction has 121 states and 155 transitions. [2020-12-22 03:53:00,789 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-12-22 03:53:00,789 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 155 transitions. [2020-12-22 03:53:00,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-12-22 03:53:00,790 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 03:53:00,791 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 03:53:01,005 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-12-22 03:53:01,006 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 03:53:01,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 03:53:01,007 INFO L82 PathProgramCache]: Analyzing trace with hash -1387129824, now seen corresponding path program 1 times [2020-12-22 03:53:01,008 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 03:53:01,008 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425678862] [2020-12-22 03:53:01,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 03:53:01,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 03:53:01,767 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-22 03:53:01,768 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425678862] [2020-12-22 03:53:01,768 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [257052515] [2020-12-22 03:53:01,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-12-22 03:53:01,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 03:53:01,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 30 conjunts are in the unsatisfiable core [2020-12-22 03:53:01,834 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 03:53:01,845 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 45 [2020-12-22 03:53:01,847 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-12-22 03:53:01,871 INFO L625 ElimStorePlain]: treesize reduction 26, result has 46.9 percent of original size [2020-12-22 03:53:01,874 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-22 03:53:01,875 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:27, output treesize:11 [2020-12-22 03:53:01,944 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 11 [2020-12-22 03:53:01,944 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 03:53:01,952 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 03:53:01,953 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-22 03:53:01,953 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:61, output treesize:25 [2020-12-22 03:53:02,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-22 03:53:02,031 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 22 [2020-12-22 03:53:02,032 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 03:53:02,043 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 03:53:02,045 INFO L547 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-12-22 03:53:02,045 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:68, output treesize:32 [2020-12-22 03:53:04,145 WARN L197 SmtUtils]: Spent 689.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2020-12-22 03:53:05,052 WARN L197 SmtUtils]: Spent 859.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2020-12-22 03:53:06,137 WARN L197 SmtUtils]: Spent 1.04 s on a formula simplification that was a NOOP. DAG size: 24 [2020-12-22 03:53:06,950 WARN L197 SmtUtils]: Spent 767.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2020-12-22 03:53:07,769 WARN L197 SmtUtils]: Spent 761.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2020-12-22 03:53:07,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-22 03:53:07,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-22 03:53:07,803 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 03:53:07,804 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 72 [2020-12-22 03:53:07,806 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 03:53:07,840 INFO L625 ElimStorePlain]: treesize reduction 20, result has 73.0 percent of original size [2020-12-22 03:53:07,844 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 03:53:07,848 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 03:53:07,849 INFO L547 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-22 03:53:07,849 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:82, output treesize:14 [2020-12-22 03:53:07,912 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-12-22 03:53:07,913 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 03:53:07,919 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 03:53:07,920 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-22 03:53:07,920 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2020-12-22 03:53:07,953 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-12-22 03:53:07,953 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-22 03:53:07,953 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13] total 29 [2020-12-22 03:53:07,953 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153310108] [2020-12-22 03:53:07,954 INFO L461 AbstractCegarLoop]: Interpolant automaton has 30 states [2020-12-22 03:53:07,954 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 03:53:07,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2020-12-22 03:53:07,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=748, Unknown=2, NotChecked=0, Total=870 [2020-12-22 03:53:07,955 INFO L87 Difference]: Start difference. First operand 121 states and 155 transitions. Second operand 30 states. [2020-12-22 03:53:09,303 WARN L197 SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2020-12-22 03:53:10,132 WARN L197 SmtUtils]: Spent 752.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2020-12-22 03:53:11,822 WARN L197 SmtUtils]: Spent 1.59 s on a formula simplification. DAG size of input: 35 DAG size of output: 27 [2020-12-22 03:53:13,221 WARN L197 SmtUtils]: Spent 1.36 s on a formula simplification. DAG size of input: 38 DAG size of output: 29 [2020-12-22 03:53:14,980 WARN L197 SmtUtils]: Spent 1.71 s on a formula simplification. DAG size of input: 40 DAG size of output: 31 [2020-12-22 03:53:16,692 WARN L197 SmtUtils]: Spent 1.68 s on a formula simplification. DAG size of input: 54 DAG size of output: 40 [2020-12-22 03:53:18,390 WARN L197 SmtUtils]: Spent 1.64 s on a formula simplification. DAG size of input: 52 DAG size of output: 38 [2020-12-22 03:53:19,516 WARN L197 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 51 DAG size of output: 36 [2020-12-22 03:53:36,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 03:53:36,797 INFO L93 Difference]: Finished difference Result 239 states and 307 transitions. [2020-12-22 03:53:36,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-12-22 03:53:36,798 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 29 [2020-12-22 03:53:36,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 03:53:36,799 INFO L225 Difference]: With dead ends: 239 [2020-12-22 03:53:36,800 INFO L226 Difference]: Without dead ends: 185 [2020-12-22 03:53:36,801 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 487 ImplicationChecksByTransitivity, 31.2s TimeCoverageRelationStatistics Valid=351, Invalid=1796, Unknown=15, NotChecked=0, Total=2162 [2020-12-22 03:53:36,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2020-12-22 03:53:36,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 118. [2020-12-22 03:53:36,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2020-12-22 03:53:36,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 146 transitions. [2020-12-22 03:53:36,818 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 146 transitions. Word has length 29 [2020-12-22 03:53:36,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 03:53:36,819 INFO L481 AbstractCegarLoop]: Abstraction has 118 states and 146 transitions. [2020-12-22 03:53:36,819 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2020-12-22 03:53:36,819 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 146 transitions. [2020-12-22 03:53:36,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-12-22 03:53:36,820 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 03:53:36,820 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 03:53:37,035 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2020-12-22 03:53:37,036 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 03:53:37,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 03:53:37,037 INFO L82 PathProgramCache]: Analyzing trace with hash 386508261, now seen corresponding path program 1 times [2020-12-22 03:53:37,037 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 03:53:37,038 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378758042] [2020-12-22 03:53:37,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 03:53:37,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 03:53:37,451 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-22 03:53:37,452 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378758042] [2020-12-22 03:53:37,452 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1745733765] [2020-12-22 03:53:37,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-12-22 03:53:37,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 03:53:37,518 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 33 conjunts are in the unsatisfiable core [2020-12-22 03:53:37,522 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 03:53:37,534 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 45 [2020-12-22 03:53:37,536 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-12-22 03:53:37,559 INFO L625 ElimStorePlain]: treesize reduction 26, result has 46.9 percent of original size [2020-12-22 03:53:37,561 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-22 03:53:37,562 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:27, output treesize:11 [2020-12-22 03:53:37,647 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 9 [2020-12-22 03:53:37,647 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 03:53:37,654 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 03:53:37,655 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-22 03:53:37,655 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:50, output treesize:20 [2020-12-22 03:53:37,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-22 03:53:37,796 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 24 [2020-12-22 03:53:37,797 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 03:53:37,807 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 03:53:37,809 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-22 03:53:37,809 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:70, output treesize:20 [2020-12-22 03:53:37,900 INFO L382 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 33 treesize of output 13 [2020-12-22 03:53:37,901 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 03:53:37,909 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 03:53:37,910 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-22 03:53:37,910 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:46, output treesize:19 [2020-12-22 03:53:37,978 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-12-22 03:53:37,982 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 03:53:37,985 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 03:53:37,986 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-22 03:53:37,986 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2020-12-22 03:53:38,014 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-22 03:53:38,015 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-22 03:53:38,015 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 25 [2020-12-22 03:53:38,015 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11586208] [2020-12-22 03:53:38,015 INFO L461 AbstractCegarLoop]: Interpolant automaton has 26 states [2020-12-22 03:53:38,015 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 03:53:38,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2020-12-22 03:53:38,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=564, Unknown=0, NotChecked=0, Total=650 [2020-12-22 03:53:38,017 INFO L87 Difference]: Start difference. First operand 118 states and 146 transitions. Second operand 26 states. [2020-12-22 03:53:38,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 03:53:38,803 INFO L93 Difference]: Finished difference Result 156 states and 192 transitions. [2020-12-22 03:53:38,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-22 03:53:38,804 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 31 [2020-12-22 03:53:38,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 03:53:38,804 INFO L225 Difference]: With dead ends: 156 [2020-12-22 03:53:38,805 INFO L226 Difference]: Without dead ends: 68 [2020-12-22 03:53:38,806 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=188, Invalid=1002, Unknown=0, NotChecked=0, Total=1190 [2020-12-22 03:53:38,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-12-22 03:53:38,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2020-12-22 03:53:38,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2020-12-22 03:53:38,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 78 transitions. [2020-12-22 03:53:38,814 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 78 transitions. Word has length 31 [2020-12-22 03:53:38,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 03:53:38,814 INFO L481 AbstractCegarLoop]: Abstraction has 68 states and 78 transitions. [2020-12-22 03:53:38,814 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2020-12-22 03:53:38,815 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 78 transitions. [2020-12-22 03:53:38,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-12-22 03:53:38,815 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 03:53:38,815 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 03:53:39,020 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 03:53:39,020 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 03:53:39,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 03:53:39,020 INFO L82 PathProgramCache]: Analyzing trace with hash 591619839, now seen corresponding path program 1 times [2020-12-22 03:53:39,021 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 03:53:39,021 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543092556] [2020-12-22 03:53:39,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 03:53:39,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 03:53:39,414 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-12-22 03:53:39,415 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543092556] [2020-12-22 03:53:39,415 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1124226264] [2020-12-22 03:53:39,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-12-22 03:53:39,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 03:53:39,494 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 38 conjunts are in the unsatisfiable core [2020-12-22 03:53:39,504 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 03:53:39,513 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 113 [2020-12-22 03:53:39,515 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 03:53:39,537 INFO L625 ElimStorePlain]: treesize reduction 18, result has 56.1 percent of original size [2020-12-22 03:53:39,540 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-22 03:53:39,540 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:27, output treesize:11 [2020-12-22 03:53:39,733 INFO L382 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 23 treesize of output 11 [2020-12-22 03:53:39,734 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 03:53:39,742 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 03:53:39,744 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-22 03:53:39,744 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:17 [2020-12-22 03:53:39,810 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-12-22 03:53:39,811 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 03:53:39,817 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 03:53:39,819 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-22 03:53:39,819 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:24, output treesize:7 [2020-12-22 03:53:39,866 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-12-22 03:53:39,866 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-22 03:53:39,866 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 [2020-12-22 03:53:39,867 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787811169] [2020-12-22 03:53:39,867 INFO L461 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-12-22 03:53:39,867 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 03:53:39,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-12-22 03:53:39,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=404, Unknown=0, NotChecked=0, Total=462 [2020-12-22 03:53:39,868 INFO L87 Difference]: Start difference. First operand 68 states and 78 transitions. Second operand 22 states. [2020-12-22 03:53:40,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 03:53:40,454 INFO L93 Difference]: Finished difference Result 113 states and 134 transitions. [2020-12-22 03:53:40,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-22 03:53:40,455 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 34 [2020-12-22 03:53:40,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 03:53:40,457 INFO L225 Difference]: With dead ends: 113 [2020-12-22 03:53:40,457 INFO L226 Difference]: Without dead ends: 100 [2020-12-22 03:53:40,458 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=143, Invalid=669, Unknown=0, NotChecked=0, Total=812 [2020-12-22 03:53:40,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2020-12-22 03:53:40,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 85. [2020-12-22 03:53:40,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-12-22 03:53:40,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 100 transitions. [2020-12-22 03:53:40,474 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 100 transitions. Word has length 34 [2020-12-22 03:53:40,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 03:53:40,474 INFO L481 AbstractCegarLoop]: Abstraction has 85 states and 100 transitions. [2020-12-22 03:53:40,474 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-12-22 03:53:40,474 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 100 transitions. [2020-12-22 03:53:40,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-12-22 03:53:40,477 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 03:53:40,477 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 03:53:40,690 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 03:53:40,691 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 03:53:40,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 03:53:40,692 INFO L82 PathProgramCache]: Analyzing trace with hash 2098228492, now seen corresponding path program 1 times [2020-12-22 03:53:40,693 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 03:53:40,693 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160933447] [2020-12-22 03:53:40,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 03:53:40,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 03:53:40,739 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-12-22 03:53:40,739 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160933447] [2020-12-22 03:53:40,740 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [608268251] [2020-12-22 03:53:40,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-12-22 03:53:40,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 03:53:40,818 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-22 03:53:40,820 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 03:53:40,848 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-12-22 03:53:40,848 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-22 03:53:40,849 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2020-12-22 03:53:40,849 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742890865] [2020-12-22 03:53:40,849 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-22 03:53:40,849 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 03:53:40,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-22 03:53:40,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-12-22 03:53:40,850 INFO L87 Difference]: Start difference. First operand 85 states and 100 transitions. Second operand 5 states. [2020-12-22 03:53:40,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 03:53:40,893 INFO L93 Difference]: Finished difference Result 132 states and 158 transitions. [2020-12-22 03:53:40,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-22 03:53:40,894 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2020-12-22 03:53:40,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 03:53:40,895 INFO L225 Difference]: With dead ends: 132 [2020-12-22 03:53:40,895 INFO L226 Difference]: Without dead ends: 74 [2020-12-22 03:53:40,895 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-12-22 03:53:40,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-12-22 03:53:40,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 69. [2020-12-22 03:53:40,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-12-22 03:53:40,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2020-12-22 03:53:40,906 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 34 [2020-12-22 03:53:40,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 03:53:40,906 INFO L481 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2020-12-22 03:53:40,907 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-22 03:53:40,907 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2020-12-22 03:53:40,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-12-22 03:53:40,907 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 03:53:40,907 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 03:53:41,120 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2020-12-22 03:53:41,121 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 03:53:41,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 03:53:41,122 INFO L82 PathProgramCache]: Analyzing trace with hash -1728552776, now seen corresponding path program 1 times [2020-12-22 03:53:41,123 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 03:53:41,123 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222553571] [2020-12-22 03:53:41,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 03:53:41,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 03:53:41,784 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-12-22 03:53:41,785 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222553571] [2020-12-22 03:53:41,785 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [555290111] [2020-12-22 03:53:41,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 03:53:41,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 03:53:41,848 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 34 conjunts are in the unsatisfiable core [2020-12-22 03:53:41,850 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 03:53:41,859 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 45 [2020-12-22 03:53:41,861 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-12-22 03:53:41,886 INFO L625 ElimStorePlain]: treesize reduction 26, result has 46.9 percent of original size [2020-12-22 03:53:41,890 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-22 03:53:41,890 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:27, output treesize:11 [2020-12-22 03:53:41,936 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 11 [2020-12-22 03:53:41,936 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 03:53:41,944 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 03:53:41,945 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-22 03:53:41,945 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:61, output treesize:25 [2020-12-22 03:53:42,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-22 03:53:42,016 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 22 [2020-12-22 03:53:42,018 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 03:53:42,027 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 03:53:42,029 INFO L547 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-12-22 03:53:42,029 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:68, output treesize:32 [2020-12-22 03:53:45,329 WARN L197 SmtUtils]: Spent 1.07 s on a formula simplification that was a NOOP. DAG size: 24 [2020-12-22 03:53:46,219 WARN L197 SmtUtils]: Spent 831.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2020-12-22 03:53:47,524 WARN L197 SmtUtils]: Spent 1.27 s on a formula simplification that was a NOOP. DAG size: 25 [2020-12-22 03:53:48,647 WARN L197 SmtUtils]: Spent 1.08 s on a formula simplification that was a NOOP. DAG size: 25 [2020-12-22 03:53:49,778 WARN L197 SmtUtils]: Spent 1.09 s on a formula simplification that was a NOOP. DAG size: 27 [2020-12-22 03:53:51,185 WARN L197 SmtUtils]: Spent 1.35 s on a formula simplification that was a NOOP. DAG size: 27 [2020-12-22 03:53:51,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-22 03:53:51,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-22 03:53:51,217 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 03:53:51,217 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 72 [2020-12-22 03:53:51,219 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 03:53:51,256 INFO L625 ElimStorePlain]: treesize reduction 20, result has 73.0 percent of original size [2020-12-22 03:53:51,264 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 03:53:51,266 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 03:53:51,267 INFO L547 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-22 03:53:51,267 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:82, output treesize:14 [2020-12-22 03:53:51,356 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-12-22 03:53:51,357 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 03:53:51,360 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 03:53:51,360 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-22 03:53:51,361 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2020-12-22 03:53:51,401 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-12-22 03:53:51,401 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-22 03:53:51,402 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 27 [2020-12-22 03:53:51,402 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309663148] [2020-12-22 03:53:51,403 INFO L461 AbstractCegarLoop]: Interpolant automaton has 28 states [2020-12-22 03:53:51,403 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 03:53:51,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2020-12-22 03:53:51,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=650, Unknown=2, NotChecked=0, Total=756 [2020-12-22 03:53:51,404 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 28 states. [2020-12-22 03:53:53,814 WARN L197 SmtUtils]: Spent 2.37 s on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2020-12-22 03:53:56,428 WARN L197 SmtUtils]: Spent 2.55 s on a formula simplification. DAG size of input: 30 DAG size of output: 26 [2020-12-22 03:53:57,710 WARN L197 SmtUtils]: Spent 1.21 s on a formula simplification that was a NOOP. DAG size: 24 [2020-12-22 03:54:00,282 WARN L197 SmtUtils]: Spent 2.52 s on a formula simplification. DAG size of input: 47 DAG size of output: 28 [2020-12-22 03:54:02,960 WARN L197 SmtUtils]: Spent 2.65 s on a formula simplification. DAG size of input: 48 DAG size of output: 28 [2020-12-22 03:54:05,700 WARN L197 SmtUtils]: Spent 2.71 s on a formula simplification. DAG size of input: 50 DAG size of output: 30 [2020-12-22 03:54:08,725 WARN L197 SmtUtils]: Spent 3.00 s on a formula simplification. DAG size of input: 52 DAG size of output: 32 [2020-12-22 03:54:10,289 WARN L197 SmtUtils]: Spent 1.49 s on a formula simplification. DAG size of input: 62 DAG size of output: 34 [2020-12-22 03:54:33,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 03:54:33,088 INFO L93 Difference]: Finished difference Result 83 states and 85 transitions. [2020-12-22 03:54:33,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-12-22 03:54:33,089 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 37 [2020-12-22 03:54:33,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 03:54:33,089 INFO L225 Difference]: With dead ends: 83 [2020-12-22 03:54:33,090 INFO L226 Difference]: Without dead ends: 70 [2020-12-22 03:54:33,090 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 25 SyntacticMatches, 4 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 28.8s TimeCoverageRelationStatistics Valid=265, Invalid=1455, Unknown=2, NotChecked=0, Total=1722 [2020-12-22 03:54:33,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-12-22 03:54:33,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 54. [2020-12-22 03:54:33,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-12-22 03:54:33,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2020-12-22 03:54:33,097 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 37 [2020-12-22 03:54:33,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 03:54:33,098 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2020-12-22 03:54:33,098 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2020-12-22 03:54:33,098 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2020-12-22 03:54:33,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-12-22 03:54:33,098 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 03:54:33,098 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 03:54:33,299 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2020-12-22 03:54:33,303 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 03:54:33,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 03:54:33,304 INFO L82 PathProgramCache]: Analyzing trace with hash -1631106707, now seen corresponding path program 1 times [2020-12-22 03:54:33,304 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 03:54:33,304 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795755586] [2020-12-22 03:54:33,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 03:54:33,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 03:54:33,829 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-22 03:54:33,830 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795755586] [2020-12-22 03:54:33,830 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1355883060] [2020-12-22 03:54:33,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 03:54:33,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 03:54:33,897 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 42 conjunts are in the unsatisfiable core [2020-12-22 03:54:33,899 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 03:54:33,905 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 163 treesize of output 161 [2020-12-22 03:54:33,907 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 03:54:33,931 INFO L625 ElimStorePlain]: treesize reduction 14, result has 62.2 percent of original size [2020-12-22 03:54:33,933 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-22 03:54:33,933 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:27, output treesize:11 [2020-12-22 03:54:34,282 INFO L382 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 13 [2020-12-22 03:54:34,283 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 03:54:34,289 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 03:54:34,290 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-22 03:54:34,290 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:39, output treesize:16 [2020-12-22 03:54:34,440 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-12-22 03:54:34,441 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 03:54:34,444 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 03:54:34,445 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-22 03:54:34,445 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2020-12-22 03:54:34,486 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-12-22 03:54:34,486 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-22 03:54:34,487 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13] total 29 [2020-12-22 03:54:34,487 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039537960] [2020-12-22 03:54:34,487 INFO L461 AbstractCegarLoop]: Interpolant automaton has 30 states [2020-12-22 03:54:34,487 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 03:54:34,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2020-12-22 03:54:34,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=802, Unknown=0, NotChecked=0, Total=870 [2020-12-22 03:54:34,488 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand 30 states. [2020-12-22 03:54:36,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 03:54:36,161 INFO L93 Difference]: Finished difference Result 67 states and 68 transitions. [2020-12-22 03:54:36,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-12-22 03:54:36,161 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 39 [2020-12-22 03:54:36,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 03:54:36,161 INFO L225 Difference]: With dead ends: 67 [2020-12-22 03:54:36,161 INFO L226 Difference]: Without dead ends: 0 [2020-12-22 03:54:36,163 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 439 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=267, Invalid=2385, Unknown=0, NotChecked=0, Total=2652 [2020-12-22 03:54:36,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-12-22 03:54:36,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-12-22 03:54:36,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-12-22 03:54:36,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-12-22 03:54:36,163 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 39 [2020-12-22 03:54:36,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 03:54:36,164 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-12-22 03:54:36,164 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2020-12-22 03:54:36,164 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-12-22 03:54:36,164 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-12-22 03:54:36,379 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2020-12-22 03:54:36,383 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-12-22 03:54:37,063 WARN L197 SmtUtils]: Spent 677.00 ms on a formula simplification. DAG size of input: 233 DAG size of output: 218 [2020-12-22 03:54:37,437 WARN L197 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 247 DAG size of output: 207 [2020-12-22 03:54:39,262 WARN L197 SmtUtils]: Spent 1.79 s on a formula simplification. DAG size of input: 215 DAG size of output: 77 [2020-12-22 03:54:39,412 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 30 [2020-12-22 03:54:39,701 WARN L197 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 50 [2020-12-22 03:54:40,850 WARN L197 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 203 DAG size of output: 103 [2020-12-22 03:54:41,290 WARN L197 SmtUtils]: Spent 437.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 69 [2020-12-22 03:54:41,294 INFO L189 CegarLoopUtils]: For program point L27-2(lines 27 33) no Hoare annotation was computed. [2020-12-22 03:54:41,294 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2020-12-22 03:54:41,295 INFO L185 CegarLoopUtils]: At program point L27-3(lines 27 33) the Hoare annotation is: (let ((.cse13 (select |#memory_$Pointer$.offset| |~#pp~0.base|)) (.cse12 (select |#memory_$Pointer$.base| |~#pp~0.base|)) (.cse14 (+ |~#pp~0.offset| 8))) (let ((.cse0 (= (select .cse12 .cse14) 0)) (.cse1 (= (select .cse13 |~#pp~0.offset|) 0)) (.cse2 (= |ULTIMATE.start_malloc_#res.base| 0)) (.cse3 (= |ULTIMATE.start_malloc_#res.offset| 2)) (.cse4 (< 0 ULTIMATE.start_init_~i~0)) (.cse5 (= |~#pstate~0.offset| 0)) (.cse6 (= ULTIMATE.start_main_~b~0.offset (+ ULTIMATE.start_main_~a~0.offset 1))) (.cse7 (= ULTIMATE.start_f_~pointer.offset 1)) (.cse8 (not (= |~#pp~0.base| |~#pstate~0.base|))) (.cse9 (= ULTIMATE.start_main_~a~0.base 0)) (.cse10 (= (select .cse13 .cse14) 0)) (.cse11 (= |~#pp~0.offset| 0))) (or (and .cse0 .cse1 .cse2 (= ULTIMATE.start_f_~pointer.base ULTIMATE.start_main_~a~0.base) .cse3 .cse4 .cse5 .cse6 (= ULTIMATE.start_f_~i~1 0) .cse7 .cse8 .cse9 .cse10 (= ULTIMATE.start_main_~a~0.offset ULTIMATE.start_f_~pointer.offset) .cse11) (and .cse0 (= ULTIMATE.start_main_~a~0.offset 1) .cse1 (= ULTIMATE.start_f_~i~1 1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (not (= (select .cse12 0) ULTIMATE.start_main_~a~0.base)) .cse11)))) [2020-12-22 03:54:41,295 INFO L189 CegarLoopUtils]: For program point L27-6(lines 27 33) no Hoare annotation was computed. [2020-12-22 03:54:41,295 INFO L185 CegarLoopUtils]: At program point L27-7(lines 27 33) the Hoare annotation is: (let ((.cse21 (select |#memory_$Pointer$.offset| |~#pp~0.base|)) (.cse24 (+ |~#pp~0.offset| 8))) (let ((.cse13 (select |#memory_$Pointer$.base| |~#pp~0.base|)) (.cse22 (+ ULTIMATE.start_main_~a~0.offset 1)) (.cse20 (select .cse21 .cse24)) (.cse23 (select |#memory_int| |~#pstate~0.base|))) (let ((.cse0 (= (select .cse21 |~#pp~0.offset|) 0)) (.cse2 (= (select .cse23 (+ |~#pstate~0.offset| 4)) 1)) (.cse8 (= .cse20 1)) (.cse1 (= |ULTIMATE.start_malloc_#res.offset| .cse22)) (.cse15 (= (select .cse13 .cse24) 0)) (.cse16 (= (select .cse23 0) 1)) (.cse3 (= |ULTIMATE.start_malloc_#res.base| 0)) (.cse4 (= |ULTIMATE.start_malloc_#res.offset| 2)) (.cse5 (< 0 ULTIMATE.start_init_~i~0)) (.cse6 (= |~#pstate~0.offset| 0)) (.cse7 (= ULTIMATE.start_main_~b~0.offset .cse22)) (.cse14 (= ULTIMATE.start_f_~i~1 0)) (.cse17 (not (= ULTIMATE.start_f_~pointer.offset 1))) (.cse18 (= (select .cse21 0) ULTIMATE.start_main_~a~0.offset)) (.cse9 (not (= |~#pp~0.base| |~#pstate~0.base|))) (.cse10 (= ULTIMATE.start_main_~a~0.base 0)) (.cse19 (= .cse20 0)) (.cse11 (= (select .cse13 0) ULTIMATE.start_main_~a~0.base)) (.cse12 (= |~#pp~0.offset| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (< 0 ULTIMATE.start_f_~i~1) .cse9 .cse10 (not .cse11) .cse12) (and .cse0 .cse1 (not (= (select .cse13 (+ |~#pp~0.offset| (* ULTIMATE.start_f_~i~1 8))) ULTIMATE.start_main_~a~0.base)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse14 .cse8 .cse9 .cse10 .cse12) (and .cse15 .cse1 .cse16 .cse3 .cse4 .cse5 (<= ULTIMATE.start_f_~i~1 1) .cse6 .cse7 .cse17 .cse18 .cse9 (<= 1 ULTIMATE.start_f_~i~1) .cse10 .cse19 .cse11 .cse12) (and .cse15 (= ULTIMATE.start_main_~a~0.offset 1) .cse16 .cse3 .cse4 .cse5 .cse6 .cse7 .cse14 .cse17 .cse18 .cse9 .cse10 .cse19 .cse11 .cse12))))) [2020-12-22 03:54:41,295 INFO L189 CegarLoopUtils]: For program point L19-2(lines 19 22) no Hoare annotation was computed. [2020-12-22 03:54:41,296 INFO L185 CegarLoopUtils]: At program point L19-3(lines 19 22) the Hoare annotation is: (let ((.cse7 (select |#memory_$Pointer$.offset| |~#pp~0.base|)) (.cse8 (+ |~#pp~0.offset| 8))) (let ((.cse0 (= (select (select |#memory_$Pointer$.base| |~#pp~0.base|) .cse8) 0)) (.cse1 (= |~#pstate~0.offset| 0)) (.cse2 (= (select .cse7 |~#pp~0.offset|) 0)) (.cse3 (not (= |~#pp~0.base| |~#pstate~0.base|))) (.cse4 (= ~counter~0 1)) (.cse5 (= (select .cse7 .cse8) 0)) (.cse6 (= |~#pp~0.offset| 0))) (or (and .cse0 .cse1 (<= 1 ULTIMATE.start_init_~i~0) .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 (= ULTIMATE.start_init_~i~0 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6)))) [2020-12-22 03:54:41,296 INFO L189 CegarLoopUtils]: For program point L36(lines 36 45) no Hoare annotation was computed. [2020-12-22 03:54:41,296 INFO L189 CegarLoopUtils]: For program point L36-1(lines 36 45) no Hoare annotation was computed. [2020-12-22 03:54:41,296 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-12-22 03:54:41,296 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-12-22 03:54:41,296 INFO L189 CegarLoopUtils]: For program point L28(lines 28 32) no Hoare annotation was computed. [2020-12-22 03:54:41,296 INFO L189 CegarLoopUtils]: For program point L28-1(lines 28 32) no Hoare annotation was computed. [2020-12-22 03:54:41,296 INFO L192 CegarLoopUtils]: At program point L70(lines 53 71) the Hoare annotation is: true [2020-12-22 03:54:41,297 INFO L189 CegarLoopUtils]: For program point L38-2(lines 38 44) no Hoare annotation was computed. [2020-12-22 03:54:41,297 INFO L185 CegarLoopUtils]: At program point L38-3(lines 38 44) the Hoare annotation is: (let ((.cse22 (select |#memory_int| |~#pstate~0.base|)) (.cse25 (select |#memory_$Pointer$.offset| |~#pp~0.base|))) (let ((.cse28 (+ ULTIMATE.start_main_~a~0.offset 1)) (.cse10 (< 0 ULTIMATE.start_init_~i~0)) (.cse29 (= |~#pp~0.base| |~#pstate~0.base|)) (.cse30 (select .cse25 |~#pp~0.offset|)) (.cse13 (< 0 ULTIMATE.start_f_~i~1)) (.cse12 (= |~#pstate~0.offset| 0)) (.cse14 (= ULTIMATE.start_f_~i~1 0)) (.cse19 (= (select .cse22 (+ |~#pstate~0.offset| 4)) 1))) (let ((.cse4 (<= 2 ULTIMATE.start_g_~i~2)) (.cse0 (= ULTIMATE.start_main_~a~0.offset 1)) (.cse18 (let ((.cse31 (< 0 ULTIMATE.start_g_~i~2))) (or (and .cse12 .cse13 .cse31 .cse19) (and .cse12 .cse14 .cse31 .cse19)))) (.cse1 (select .cse25 (+ |~#pp~0.offset| 8))) (.cse21 (= ULTIMATE.start_g_~i~2 0)) (.cse8 (= .cse30 1)) (.cse9 (or .cse10 .cse29)) (.cse5 (= ULTIMATE.start_main_~b~0.offset .cse28)) (.cse11 (= .cse30 0)) (.cse2 (not .cse29)) (.cse6 (= ULTIMATE.start_main_~a~0.base 0)) (.cse17 (= |ULTIMATE.start_malloc_#res.offset| .cse28)) (.cse7 (= |ULTIMATE.start_malloc_#res.base| 0)) (.cse20 (= ULTIMATE.start_g_~pointer.offset 1)) (.cse15 (= |ULTIMATE.start_malloc_#res.offset| 2)) (.cse16 (= |~#pp~0.offset| 0))) (or (and .cse0 (= .cse1 1) .cse2 (let ((.cse3 (or (and .cse12 .cse13) (and .cse12 .cse14)))) (or (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse10 .cse3 .cse4 .cse5 .cse11 .cse6 .cse7))) .cse15 .cse16) (and .cse4 .cse5 .cse0 .cse2 .cse6 .cse17 .cse18 .cse7 .cse8 .cse9 .cse16) (and .cse10 .cse4 .cse5 .cse0 .cse11 .cse2 .cse6 .cse17 .cse18 .cse7 .cse16) (and .cse11 .cse17 .cse19 .cse20 .cse7 .cse15 .cse10 .cse12 .cse5 .cse2 .cse13 .cse6 .cse21 .cse16) (let ((.cse24 (+ |~#pp~0.offset| (* ULTIMATE.start_g_~i~2 8))) (.cse23 (select |#memory_$Pointer$.base| |~#pp~0.base|))) (and (= ULTIMATE.start_f_~i~1 1) (= (select .cse22 0) 1) (= ULTIMATE.start_g_~pointer.base (select .cse23 .cse24)) .cse19 .cse7 .cse20 .cse9 .cse15 (= ULTIMATE.start_g_~pointer.offset (select .cse25 .cse24)) .cse5 .cse12 (not (= ULTIMATE.start_f_~pointer.offset 1)) (= (select .cse25 0) ULTIMATE.start_main_~a~0.offset) .cse2 .cse6 (not (= ULTIMATE.start_g_~pointer.offset .cse1)) (= (select .cse23 0) ULTIMATE.start_main_~a~0.base) .cse21 .cse16)) (and (let ((.cse26 (let ((.cse27 (= (* ULTIMATE.start_g_~i~2 4) 4))) (or (and .cse27 .cse12 .cse14 .cse19) (and .cse27 .cse12 .cse13 .cse19))))) (or (and .cse5 .cse26 .cse2 .cse6 .cse17 .cse7 .cse8 .cse9) (and .cse10 .cse5 .cse26 .cse11 .cse2 .cse6 .cse17 .cse7))) .cse20 .cse15 .cse16))))) [2020-12-22 03:54:41,297 INFO L189 CegarLoopUtils]: For program point L38-6(lines 38 44) no Hoare annotation was computed. [2020-12-22 03:54:41,297 INFO L185 CegarLoopUtils]: At program point L38-7(lines 38 44) the Hoare annotation is: (let ((.cse23 (select |#memory_$Pointer$.offset| |~#pp~0.base|)) (.cse20 (= |~#pp~0.base| |~#pstate~0.base|))) (let ((.cse21 (+ ULTIMATE.start_main_~a~0.offset 1)) (.cse19 (= ULTIMATE.start_f_~i~1 0)) (.cse13 (= |~#pstate~0.offset| 0)) (.cse15 (not .cse20)) (.cse14 (< 0 ULTIMATE.start_f_~i~1)) (.cse16 (= ULTIMATE.start_main_~a~0.base 0)) (.cse18 (= (select (select |#memory_int| |~#pstate~0.base|) (+ |~#pstate~0.offset| 4)) 1)) (.cse12 (= ULTIMATE.start_g_~i~2 0)) (.cse22 (select .cse23 |~#pp~0.offset|))) (let ((.cse2 (= (select .cse23 (+ |~#pp~0.offset| 8)) 1)) (.cse10 (= .cse22 1)) (.cse11 (= .cse22 0)) (.cse9 (or (and .cse19 .cse13 .cse15 .cse16 .cse18 .cse12) (and .cse13 .cse15 .cse14 .cse16 .cse18 .cse12))) (.cse4 (= ULTIMATE.start_g_~pointer.offset 2)) (.cse7 (or (and .cse13 .cse14 .cse15 .cse16) (and .cse19 .cse13 .cse15 .cse16))) (.cse0 (= ULTIMATE.start_main_~b~0.offset .cse21)) (.cse1 (= ULTIMATE.start_main_~a~0.offset 1)) (.cse3 (= |ULTIMATE.start_malloc_#res.offset| .cse21)) (.cse5 (= |ULTIMATE.start_malloc_#res.base| 0)) (.cse6 (or (< 0 ULTIMATE.start_init_~i~0) .cse20)) (.cse8 (= |~#pp~0.offset| 0))) (or (and (<= 1 ULTIMATE.start_g_~i~2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse3 .cse9 .cse4 .cse5 .cse6 .cse10 .cse8) (and .cse2 (or (and .cse0 .cse1 .cse4 .cse5 .cse6 .cse10 .cse7 .cse8) (and .cse0 .cse1 .cse11 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8)) .cse12 (= |ULTIMATE.start_malloc_#res.offset| 2)) (and .cse0 .cse1 .cse11 .cse3 .cse9 .cse4 .cse5 .cse6 .cse8) (and .cse0 (<= 2 ULTIMATE.start_g_~i~2) .cse1 .cse3 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 (let ((.cse17 (< 0 ULTIMATE.start_g_~i~2))) (or (and .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse19 .cse13 .cse15 .cse16 .cse17 .cse18))) .cse3 .cse5 .cse6 .cse8))))) [2020-12-22 03:54:41,297 INFO L189 CegarLoopUtils]: For program point L39(lines 39 43) no Hoare annotation was computed. [2020-12-22 03:54:41,298 INFO L189 CegarLoopUtils]: For program point L6(lines 1 71) no Hoare annotation was computed. [2020-12-22 03:54:41,298 INFO L189 CegarLoopUtils]: For program point L39-2(lines 39 43) no Hoare annotation was computed. [2020-12-22 03:54:41,298 INFO L189 CegarLoopUtils]: For program point L6-1(lines 1 71) no Hoare annotation was computed. [2020-12-22 03:54:41,298 INFO L189 CegarLoopUtils]: For program point L-1(line -1) no Hoare annotation was computed. [2020-12-22 03:54:41,298 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2020-12-22 03:54:41,298 INFO L185 CegarLoopUtils]: At program point L49(lines 48 51) the Hoare annotation is: (let ((.cse1 (select |#memory_$Pointer$.offset| |~#pp~0.base|)) (.cse0 (+ |~#pp~0.offset| 8))) (and (< 0 ULTIMATE.start_init_~i~0) (= (select (select |#memory_$Pointer$.base| |~#pp~0.base|) .cse0) 0) (= |~#pstate~0.offset| 0) (= ~counter~0 (+ |ULTIMATE.start_malloc_#res.offset| 1)) (= |ULTIMATE.start_malloc_#res.offset| 1) (= (select .cse1 |~#pp~0.offset|) 0) (not (= |~#pp~0.base| |~#pstate~0.base|)) (= (select .cse1 .cse0) 0) (= |ULTIMATE.start_malloc_#res.base| 0) (= |~#pp~0.offset| 0))) [2020-12-22 03:54:41,298 INFO L185 CegarLoopUtils]: At program point L49-1(lines 48 51) the Hoare annotation is: (let ((.cse1 (select |#memory_$Pointer$.offset| |~#pp~0.base|)) (.cse0 (+ |~#pp~0.offset| 8))) (and (< 0 ULTIMATE.start_init_~i~0) (= (select (select |#memory_$Pointer$.base| |~#pp~0.base|) .cse0) 0) (= |~#pstate~0.offset| 0) (= (select .cse1 |~#pp~0.offset|) 0) (not (= |~#pp~0.base| |~#pstate~0.base|)) (= |ULTIMATE.start_malloc_#res.offset| (+ ULTIMATE.start_main_~a~0.offset 1)) (= ULTIMATE.start_main_~a~0.base 0) (= (select .cse1 .cse0) 0) (= |ULTIMATE.start_malloc_#res.base| 0) (= |ULTIMATE.start_malloc_#res.offset| 2) (= |~#pp~0.offset| 0))) [2020-12-22 03:54:41,298 INFO L189 CegarLoopUtils]: For program point L41(line 41) no Hoare annotation was computed. [2020-12-22 03:54:41,298 INFO L189 CegarLoopUtils]: For program point L8(line 8) no Hoare annotation was computed. [2020-12-22 03:54:41,299 INFO L189 CegarLoopUtils]: For program point L41-2(line 41) no Hoare annotation was computed. [2020-12-22 03:54:41,299 INFO L189 CegarLoopUtils]: For program point L8-1(line 8) no Hoare annotation was computed. [2020-12-22 03:54:41,299 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-12-22 03:54:41,299 INFO L189 CegarLoopUtils]: For program point L25(lines 25 34) no Hoare annotation was computed. [2020-12-22 03:54:41,299 INFO L189 CegarLoopUtils]: For program point L25-1(lines 25 34) no Hoare annotation was computed. [2020-12-22 03:54:41,299 INFO L189 CegarLoopUtils]: For program point L17(lines 17 23) no Hoare annotation was computed. [2020-12-22 03:54:41,299 INFO L189 CegarLoopUtils]: For program point L59(lines 59 60) no Hoare annotation was computed. [2020-12-22 03:54:41,311 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,312 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,313 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,313 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,314 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,314 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,329 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,330 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,330 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,330 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,331 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,336 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,349 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-22 03:54:41,349 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,350 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,350 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-22 03:54:41,351 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,351 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,352 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-22 03:54:41,354 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,354 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,354 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-22 03:54:41,354 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,355 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,358 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-22 03:54:41,359 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,359 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,359 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-22 03:54:41,359 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,360 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,360 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-22 03:54:41,361 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,362 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,363 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-22 03:54:41,364 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,364 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,365 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-22 03:54:41,365 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,365 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,365 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-22 03:54:41,366 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,366 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,366 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-22 03:54:41,367 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-22 03:54:41,368 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,368 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,368 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-22 03:54:41,368 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,369 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,369 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-22 03:54:41,370 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,371 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,371 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,371 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,372 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,372 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,372 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-22 03:54:41,373 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,373 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,373 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,373 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-22 03:54:41,374 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,374 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,377 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,377 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,377 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,378 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,378 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,378 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,379 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-22 03:54:41,379 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,379 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,379 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,380 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-22 03:54:41,380 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,380 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,383 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,383 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,384 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-22 03:54:41,384 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,384 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-22 03:54:41,384 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,385 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-22 03:54:41,385 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,385 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,385 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-22 03:54:41,386 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-22 03:54:41,386 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,386 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,386 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-22 03:54:41,388 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,388 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,388 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-22 03:54:41,388 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,389 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-22 03:54:41,389 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,389 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-22 03:54:41,390 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,390 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,390 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-22 03:54:41,390 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-22 03:54:41,390 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,391 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,391 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-22 03:54:41,398 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.12 03:54:41 BoogieIcfgContainer [2020-12-22 03:54:41,398 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-22 03:54:41,400 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-22 03:54:41,400 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-22 03:54:41,400 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-22 03:54:41,401 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 03:52:12" (3/4) ... [2020-12-22 03:54:41,407 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-12-22 03:54:41,426 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2020-12-22 03:54:41,427 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2020-12-22 03:54:41,427 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-12-22 03:54:41,427 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-12-22 03:54:41,458 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((0 < i && #memory_$Pointer$[pp][pp + 8] == 0) && pstate == 0) && counter == \result + 1) && \result == 1) && #memory_$Pointer$[pp][pp] == 0) && !(pp == pstate)) && #memory_$Pointer$[pp][pp + 8] == 0) && \result == 0) && pp == 0 [2020-12-22 03:54:41,459 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((0 < i && #memory_$Pointer$[pp][pp + 8] == 0) && pstate == 0) && #memory_$Pointer$[pp][pp] == 0) && !(pp == pstate)) && \result == a + 1) && a == 0) && #memory_$Pointer$[pp][pp + 8] == 0) && \result == 0) && \result == 2) && pp == 0 [2020-12-22 03:54:41,459 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((#memory_$Pointer$[pp][pp + 8] == 0 && #memory_$Pointer$[pp][pp] == 0) && \result == 0) && pointer == a) && \result == 2) && 0 < i) && pstate == 0) && b == a + 1) && i == 0) && pointer == 1) && !(pp == pstate)) && a == 0) && #memory_$Pointer$[pp][pp + 8] == 0) && a == pointer) && pp == 0) || ((((((((((((((#memory_$Pointer$[pp][pp + 8] == 0 && a == 1) && #memory_$Pointer$[pp][pp] == 0) && i == 1) && \result == 0) && \result == 2) && 0 < i) && pstate == 0) && b == a + 1) && pointer == 1) && !(pp == pstate)) && a == 0) && #memory_$Pointer$[pp][pp + 8] == 0) && !(#memory_$Pointer$[pp][0] == a)) && pp == 0) [2020-12-22 03:54:41,459 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((#memory_$Pointer$[pp][pp] == 0 && \result == a + 1) && unknown-#memory_int-unknown[pstate][pstate + 4] == 1) && \result == 0) && \result == 2) && 0 < i) && pstate == 0) && b == a + 1) && #memory_$Pointer$[pp][pp + 8] == 1) && 0 < i) && !(pp == pstate)) && a == 0) && !(#memory_$Pointer$[pp][0] == a)) && pp == 0) || (((((((((((((#memory_$Pointer$[pp][pp] == 0 && \result == a + 1) && !(#memory_$Pointer$[pp][pp + i * 8] == a)) && unknown-#memory_int-unknown[pstate][pstate + 4] == 1) && \result == 0) && \result == 2) && 0 < i) && pstate == 0) && b == a + 1) && i == 0) && #memory_$Pointer$[pp][pp + 8] == 1) && !(pp == pstate)) && a == 0) && pp == 0)) || ((((((((((((((((#memory_$Pointer$[pp][pp + 8] == 0 && \result == a + 1) && unknown-#memory_int-unknown[pstate][0] == 1) && \result == 0) && \result == 2) && 0 < i) && i <= 1) && pstate == 0) && b == a + 1) && !(pointer == 1)) && #memory_$Pointer$[pp][0] == a) && !(pp == pstate)) && 1 <= i) && a == 0) && #memory_$Pointer$[pp][pp + 8] == 0) && #memory_$Pointer$[pp][0] == a) && pp == 0)) || (((((((((((((((#memory_$Pointer$[pp][pp + 8] == 0 && a == 1) && unknown-#memory_int-unknown[pstate][0] == 1) && \result == 0) && \result == 2) && 0 < i) && pstate == 0) && b == a + 1) && i == 0) && !(pointer == 1)) && #memory_$Pointer$[pp][0] == a) && !(pp == pstate)) && a == 0) && #memory_$Pointer$[pp][pp + 8] == 0) && #memory_$Pointer$[pp][0] == a) && pp == 0) [2020-12-22 03:54:41,460 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((a == 1 && #memory_$Pointer$[pp][pp + 8] == 1) && !(pp == pstate)) && (((((((((pstate == 0 && 0 < i) || (pstate == 0 && i == 0)) && 2 <= i) && b == a + 1) && a == 0) && \result == 0) && #memory_$Pointer$[pp][pp] == 1) && (0 < i || pp == pstate)) || ((((((0 < i && ((pstate == 0 && 0 < i) || (pstate == 0 && i == 0))) && 2 <= i) && b == a + 1) && #memory_$Pointer$[pp][pp] == 0) && a == 0) && \result == 0))) && \result == 2) && pp == 0) || ((((((((((2 <= i && b == a + 1) && a == 1) && !(pp == pstate)) && a == 0) && \result == a + 1) && ((((pstate == 0 && 0 < i) && 0 < i) && unknown-#memory_int-unknown[pstate][pstate + 4] == 1) || (((pstate == 0 && i == 0) && 0 < i) && unknown-#memory_int-unknown[pstate][pstate + 4] == 1))) && \result == 0) && #memory_$Pointer$[pp][pp] == 1) && (0 < i || pp == pstate)) && pp == 0)) || ((((((((((0 < i && 2 <= i) && b == a + 1) && a == 1) && #memory_$Pointer$[pp][pp] == 0) && !(pp == pstate)) && a == 0) && \result == a + 1) && ((((pstate == 0 && 0 < i) && 0 < i) && unknown-#memory_int-unknown[pstate][pstate + 4] == 1) || (((pstate == 0 && i == 0) && 0 < i) && unknown-#memory_int-unknown[pstate][pstate + 4] == 1))) && \result == 0) && pp == 0)) || (((((((((((((#memory_$Pointer$[pp][pp] == 0 && \result == a + 1) && unknown-#memory_int-unknown[pstate][pstate + 4] == 1) && pointer == 1) && \result == 0) && \result == 2) && 0 < i) && pstate == 0) && b == a + 1) && !(pp == pstate)) && 0 < i) && a == 0) && i == 0) && pp == 0)) || ((((((((((((((((((i == 1 && unknown-#memory_int-unknown[pstate][0] == 1) && pointer == #memory_$Pointer$[pp][pp + i * 8]) && unknown-#memory_int-unknown[pstate][pstate + 4] == 1) && \result == 0) && pointer == 1) && (0 < i || pp == pstate)) && \result == 2) && pointer == #memory_$Pointer$[pp][pp + i * 8]) && b == a + 1) && pstate == 0) && !(pointer == 1)) && #memory_$Pointer$[pp][0] == a) && !(pp == pstate)) && a == 0) && !(pointer == #memory_$Pointer$[pp][pp + 8])) && #memory_$Pointer$[pp][0] == a) && i == 0) && pp == 0)) || (((((((((((b == a + 1 && ((((i * 4 == 4 && pstate == 0) && i == 0) && unknown-#memory_int-unknown[pstate][pstate + 4] == 1) || (((i * 4 == 4 && pstate == 0) && 0 < i) && unknown-#memory_int-unknown[pstate][pstate + 4] == 1))) && !(pp == pstate)) && a == 0) && \result == a + 1) && \result == 0) && #memory_$Pointer$[pp][pp] == 1) && (0 < i || pp == pstate)) || (((((((0 < i && b == a + 1) && ((((i * 4 == 4 && pstate == 0) && i == 0) && unknown-#memory_int-unknown[pstate][pstate + 4] == 1) || (((i * 4 == 4 && pstate == 0) && 0 < i) && unknown-#memory_int-unknown[pstate][pstate + 4] == 1))) && #memory_$Pointer$[pp][pp] == 0) && !(pp == pstate)) && a == 0) && \result == a + 1) && \result == 0)) && pointer == 1) && \result == 2) && pp == 0) [2020-12-22 03:54:41,461 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((1 <= i && b == a + 1) && a == 1) && #memory_$Pointer$[pp][pp + 8] == 1) && \result == a + 1) && pointer == 2) && \result == 0) && (0 < i || pp == pstate)) && ((((pstate == 0 && 0 < i) && !(pp == pstate)) && a == 0) || (((i == 0 && pstate == 0) && !(pp == pstate)) && a == 0))) && pp == 0) || ((((((((b == a + 1 && a == 1) && \result == a + 1) && ((((((i == 0 && pstate == 0) && !(pp == pstate)) && a == 0) && unknown-#memory_int-unknown[pstate][pstate + 4] == 1) && i == 0) || (((((pstate == 0 && !(pp == pstate)) && 0 < i) && a == 0) && unknown-#memory_int-unknown[pstate][pstate + 4] == 1) && i == 0))) && pointer == 2) && \result == 0) && (0 < i || pp == pstate)) && #memory_$Pointer$[pp][pp] == 1) && pp == 0)) || (((#memory_$Pointer$[pp][pp + 8] == 1 && ((((((((b == a + 1 && a == 1) && pointer == 2) && \result == 0) && (0 < i || pp == pstate)) && #memory_$Pointer$[pp][pp] == 1) && ((((pstate == 0 && 0 < i) && !(pp == pstate)) && a == 0) || (((i == 0 && pstate == 0) && !(pp == pstate)) && a == 0))) && pp == 0) || ((((((((b == a + 1 && a == 1) && #memory_$Pointer$[pp][pp] == 0) && \result == a + 1) && pointer == 2) && \result == 0) && (0 < i || pp == pstate)) && ((((pstate == 0 && 0 < i) && !(pp == pstate)) && a == 0) || (((i == 0 && pstate == 0) && !(pp == pstate)) && a == 0))) && pp == 0))) && i == 0) && \result == 2)) || ((((((((b == a + 1 && a == 1) && #memory_$Pointer$[pp][pp] == 0) && \result == a + 1) && ((((((i == 0 && pstate == 0) && !(pp == pstate)) && a == 0) && unknown-#memory_int-unknown[pstate][pstate + 4] == 1) && i == 0) || (((((pstate == 0 && !(pp == pstate)) && 0 < i) && a == 0) && unknown-#memory_int-unknown[pstate][pstate + 4] == 1) && i == 0))) && pointer == 2) && \result == 0) && (0 < i || pp == pstate)) && pp == 0)) || (((((((b == a + 1 && 2 <= i) && a == 1) && \result == a + 1) && \result == 0) && (0 < i || pp == pstate)) && ((((pstate == 0 && 0 < i) && !(pp == pstate)) && a == 0) || (((i == 0 && pstate == 0) && !(pp == pstate)) && a == 0))) && pp == 0)) || ((((((b == a + 1 && a == 1) && ((((((pstate == 0 && 0 < i) && !(pp == pstate)) && a == 0) && 0 < i) && unknown-#memory_int-unknown[pstate][pstate + 4] == 1) || (((((i == 0 && pstate == 0) && !(pp == pstate)) && a == 0) && 0 < i) && unknown-#memory_int-unknown[pstate][pstate + 4] == 1))) && \result == a + 1) && \result == 0) && (0 < i || pp == pstate)) && pp == 0) [2020-12-22 03:54:41,487 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/ldv-regression/ex3_forlist.i-witness.graphml [2020-12-22 03:54:41,487 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-22 03:54:41,488 INFO L168 Benchmark]: Toolchain (without parser) took 150282.59 ms. Allocated memory was 151.0 MB in the beginning and 181.4 MB in the end (delta: 30.4 MB). Free memory was 125.4 MB in the beginning and 74.0 MB in the end (delta: 51.5 MB). Peak memory consumption was 82.7 MB. Max. memory is 8.0 GB. [2020-12-22 03:54:41,488 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 151.0 MB. Free memory is still 122.6 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-12-22 03:54:41,489 INFO L168 Benchmark]: CACSL2BoogieTranslator took 370.09 ms. Allocated memory is still 151.0 MB. Free memory was 125.3 MB in the beginning and 115.3 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.5 MB. Max. memory is 8.0 GB. [2020-12-22 03:54:41,489 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.25 ms. Allocated memory is still 151.0 MB. Free memory was 115.3 MB in the beginning and 113.5 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-12-22 03:54:41,489 INFO L168 Benchmark]: Boogie Preprocessor took 33.05 ms. Allocated memory is still 151.0 MB. Free memory was 113.5 MB in the beginning and 111.9 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2020-12-22 03:54:41,490 INFO L168 Benchmark]: RCFGBuilder took 596.35 ms. Allocated memory is still 151.0 MB. Free memory was 111.9 MB in the beginning and 125.0 MB in the end (delta: -13.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 8.0 GB. [2020-12-22 03:54:41,490 INFO L168 Benchmark]: TraceAbstraction took 149124.01 ms. Allocated memory was 151.0 MB in the beginning and 181.4 MB in the end (delta: 30.4 MB). Free memory was 124.4 MB in the beginning and 77.6 MB in the end (delta: 46.8 MB). Peak memory consumption was 102.4 MB. Max. memory is 8.0 GB. [2020-12-22 03:54:41,491 INFO L168 Benchmark]: Witness Printer took 87.23 ms. Allocated memory is still 181.4 MB. Free memory was 77.6 MB in the beginning and 74.0 MB in the end (delta: 3.7 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2020-12-22 03:54:41,493 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 151.0 MB. Free memory is still 122.6 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 370.09 ms. Allocated memory is still 151.0 MB. Free memory was 125.3 MB in the beginning and 115.3 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.5 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 54.25 ms. Allocated memory is still 151.0 MB. Free memory was 115.3 MB in the beginning and 113.5 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 33.05 ms. Allocated memory is still 151.0 MB. Free memory was 113.5 MB in the beginning and 111.9 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 596.35 ms. Allocated memory is still 151.0 MB. Free memory was 111.9 MB in the beginning and 125.0 MB in the end (delta: -13.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 8.0 GB. * TraceAbstraction took 149124.01 ms. Allocated memory was 151.0 MB in the beginning and 181.4 MB in the end (delta: 30.4 MB). Free memory was 124.4 MB in the beginning and 77.6 MB in the end (delta: 46.8 MB). Peak memory consumption was 102.4 MB. Max. memory is 8.0 GB. * Witness Printer took 87.23 ms. Allocated memory is still 181.4 MB. Free memory was 77.6 MB in the beginning and 74.0 MB in the end (delta: 3.7 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 8]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 8]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: 38]: Loop Invariant [2020-12-22 03:54:41,501 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,502 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,502 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,502 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,503 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,503 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,505 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,506 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,506 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,506 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,506 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,506 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((((((1 <= i && b == a + 1) && a == 1) && #memory_$Pointer$[pp][pp + 8] == 1) && \result == a + 1) && pointer == 2) && \result == 0) && (0 < i || pp == pstate)) && ((((pstate == 0 && 0 < i) && !(pp == pstate)) && a == 0) || (((i == 0 && pstate == 0) && !(pp == pstate)) && a == 0))) && pp == 0) || ((((((((b == a + 1 && a == 1) && \result == a + 1) && ((((((i == 0 && pstate == 0) && !(pp == pstate)) && a == 0) && unknown-#memory_int-unknown[pstate][pstate + 4] == 1) && i == 0) || (((((pstate == 0 && !(pp == pstate)) && 0 < i) && a == 0) && unknown-#memory_int-unknown[pstate][pstate + 4] == 1) && i == 0))) && pointer == 2) && \result == 0) && (0 < i || pp == pstate)) && #memory_$Pointer$[pp][pp] == 1) && pp == 0)) || (((#memory_$Pointer$[pp][pp + 8] == 1 && ((((((((b == a + 1 && a == 1) && pointer == 2) && \result == 0) && (0 < i || pp == pstate)) && #memory_$Pointer$[pp][pp] == 1) && ((((pstate == 0 && 0 < i) && !(pp == pstate)) && a == 0) || (((i == 0 && pstate == 0) && !(pp == pstate)) && a == 0))) && pp == 0) || ((((((((b == a + 1 && a == 1) && #memory_$Pointer$[pp][pp] == 0) && \result == a + 1) && pointer == 2) && \result == 0) && (0 < i || pp == pstate)) && ((((pstate == 0 && 0 < i) && !(pp == pstate)) && a == 0) || (((i == 0 && pstate == 0) && !(pp == pstate)) && a == 0))) && pp == 0))) && i == 0) && \result == 2)) || ((((((((b == a + 1 && a == 1) && #memory_$Pointer$[pp][pp] == 0) && \result == a + 1) && ((((((i == 0 && pstate == 0) && !(pp == pstate)) && a == 0) && unknown-#memory_int-unknown[pstate][pstate + 4] == 1) && i == 0) || (((((pstate == 0 && !(pp == pstate)) && 0 < i) && a == 0) && unknown-#memory_int-unknown[pstate][pstate + 4] == 1) && i == 0))) && pointer == 2) && \result == 0) && (0 < i || pp == pstate)) && pp == 0)) || (((((((b == a + 1 && 2 <= i) && a == 1) && \result == a + 1) && \result == 0) && (0 < i || pp == pstate)) && ((((pstate == 0 && 0 < i) && !(pp == pstate)) && a == 0) || (((i == 0 && pstate == 0) && !(pp == pstate)) && a == 0))) && pp == 0)) || ((((((b == a + 1 && a == 1) && ((((((pstate == 0 && 0 < i) && !(pp == pstate)) && a == 0) && 0 < i) && unknown-#memory_int-unknown[pstate][pstate + 4] == 1) || (((((i == 0 && pstate == 0) && !(pp == pstate)) && a == 0) && 0 < i) && unknown-#memory_int-unknown[pstate][pstate + 4] == 1))) && \result == a + 1) && \result == 0) && (0 < i || pp == pstate)) && pp == 0) - InvariantResult [Line: 48]: Loop Invariant [2020-12-22 03:54:41,509 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-22 03:54:41,509 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,509 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,510 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-22 03:54:41,510 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,510 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((0 < i && #memory_$Pointer$[pp][pp + 8] == 0) && pstate == 0) && #memory_$Pointer$[pp][pp] == 0) && !(pp == pstate)) && \result == a + 1) && a == 0) && #memory_$Pointer$[pp][pp + 8] == 0) && \result == 0) && \result == 2) && pp == 0 - InvariantResult [Line: 19]: Loop Invariant [2020-12-22 03:54:41,510 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-22 03:54:41,511 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,511 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,511 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-22 03:54:41,511 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,511 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,512 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-22 03:54:41,512 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,512 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,512 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-22 03:54:41,513 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,513 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((#memory_$Pointer$[pp][pp + 8] == 0 && pstate == 0) && 1 <= i) && #memory_$Pointer$[pp][pp] == 0) && !(pp == pstate)) && counter == 1) && #memory_$Pointer$[pp][pp + 8] == 0) && pp == 0) || (((((((#memory_$Pointer$[pp][pp + 8] == 0 && i == 0) && pstate == 0) && #memory_$Pointer$[pp][pp] == 0) && !(pp == pstate)) && counter == 1) && #memory_$Pointer$[pp][pp + 8] == 0) && pp == 0) - InvariantResult [Line: 53]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 48]: Loop Invariant [2020-12-22 03:54:41,513 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-22 03:54:41,514 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,514 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,514 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-22 03:54:41,514 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,515 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: ((((((((0 < i && #memory_$Pointer$[pp][pp + 8] == 0) && pstate == 0) && counter == \result + 1) && \result == 1) && #memory_$Pointer$[pp][pp] == 0) && !(pp == pstate)) && #memory_$Pointer$[pp][pp + 8] == 0) && \result == 0) && pp == 0 - InvariantResult [Line: 27]: Loop Invariant [2020-12-22 03:54:41,515 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-22 03:54:41,515 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,515 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,516 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-22 03:54:41,516 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,516 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,516 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-22 03:54:41,517 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-22 03:54:41,517 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,517 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,517 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-22 03:54:41,518 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,518 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,518 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((((((((((#memory_$Pointer$[pp][pp + 8] == 0 && #memory_$Pointer$[pp][pp] == 0) && \result == 0) && pointer == a) && \result == 2) && 0 < i) && pstate == 0) && b == a + 1) && i == 0) && pointer == 1) && !(pp == pstate)) && a == 0) && #memory_$Pointer$[pp][pp + 8] == 0) && a == pointer) && pp == 0) || ((((((((((((((#memory_$Pointer$[pp][pp + 8] == 0 && a == 1) && #memory_$Pointer$[pp][pp] == 0) && i == 1) && \result == 0) && \result == 2) && 0 < i) && pstate == 0) && b == a + 1) && pointer == 1) && !(pp == pstate)) && a == 0) && #memory_$Pointer$[pp][pp + 8] == 0) && !(#memory_$Pointer$[pp][0] == a)) && pp == 0) - InvariantResult [Line: 38]: Loop Invariant [2020-12-22 03:54:41,519 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,519 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,519 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,520 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,520 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,520 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,520 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-22 03:54:41,521 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,521 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,521 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,521 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-22 03:54:41,521 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,522 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,524 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,524 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,524 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,524 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,525 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,525 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,525 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-22 03:54:41,525 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,525 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,526 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,526 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-22 03:54:41,526 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,526 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((a == 1 && #memory_$Pointer$[pp][pp + 8] == 1) && !(pp == pstate)) && (((((((((pstate == 0 && 0 < i) || (pstate == 0 && i == 0)) && 2 <= i) && b == a + 1) && a == 0) && \result == 0) && #memory_$Pointer$[pp][pp] == 1) && (0 < i || pp == pstate)) || ((((((0 < i && ((pstate == 0 && 0 < i) || (pstate == 0 && i == 0))) && 2 <= i) && b == a + 1) && #memory_$Pointer$[pp][pp] == 0) && a == 0) && \result == 0))) && \result == 2) && pp == 0) || ((((((((((2 <= i && b == a + 1) && a == 1) && !(pp == pstate)) && a == 0) && \result == a + 1) && ((((pstate == 0 && 0 < i) && 0 < i) && unknown-#memory_int-unknown[pstate][pstate + 4] == 1) || (((pstate == 0 && i == 0) && 0 < i) && unknown-#memory_int-unknown[pstate][pstate + 4] == 1))) && \result == 0) && #memory_$Pointer$[pp][pp] == 1) && (0 < i || pp == pstate)) && pp == 0)) || ((((((((((0 < i && 2 <= i) && b == a + 1) && a == 1) && #memory_$Pointer$[pp][pp] == 0) && !(pp == pstate)) && a == 0) && \result == a + 1) && ((((pstate == 0 && 0 < i) && 0 < i) && unknown-#memory_int-unknown[pstate][pstate + 4] == 1) || (((pstate == 0 && i == 0) && 0 < i) && unknown-#memory_int-unknown[pstate][pstate + 4] == 1))) && \result == 0) && pp == 0)) || (((((((((((((#memory_$Pointer$[pp][pp] == 0 && \result == a + 1) && unknown-#memory_int-unknown[pstate][pstate + 4] == 1) && pointer == 1) && \result == 0) && \result == 2) && 0 < i) && pstate == 0) && b == a + 1) && !(pp == pstate)) && 0 < i) && a == 0) && i == 0) && pp == 0)) || ((((((((((((((((((i == 1 && unknown-#memory_int-unknown[pstate][0] == 1) && pointer == #memory_$Pointer$[pp][pp + i * 8]) && unknown-#memory_int-unknown[pstate][pstate + 4] == 1) && \result == 0) && pointer == 1) && (0 < i || pp == pstate)) && \result == 2) && pointer == #memory_$Pointer$[pp][pp + i * 8]) && b == a + 1) && pstate == 0) && !(pointer == 1)) && #memory_$Pointer$[pp][0] == a) && !(pp == pstate)) && a == 0) && !(pointer == #memory_$Pointer$[pp][pp + 8])) && #memory_$Pointer$[pp][0] == a) && i == 0) && pp == 0)) || (((((((((((b == a + 1 && ((((i * 4 == 4 && pstate == 0) && i == 0) && unknown-#memory_int-unknown[pstate][pstate + 4] == 1) || (((i * 4 == 4 && pstate == 0) && 0 < i) && unknown-#memory_int-unknown[pstate][pstate + 4] == 1))) && !(pp == pstate)) && a == 0) && \result == a + 1) && \result == 0) && #memory_$Pointer$[pp][pp] == 1) && (0 < i || pp == pstate)) || (((((((0 < i && b == a + 1) && ((((i * 4 == 4 && pstate == 0) && i == 0) && unknown-#memory_int-unknown[pstate][pstate + 4] == 1) || (((i * 4 == 4 && pstate == 0) && 0 < i) && unknown-#memory_int-unknown[pstate][pstate + 4] == 1))) && #memory_$Pointer$[pp][pp] == 0) && !(pp == pstate)) && a == 0) && \result == a + 1) && \result == 0)) && pointer == 1) && \result == 2) && pp == 0) - InvariantResult [Line: 27]: Loop Invariant [2020-12-22 03:54:41,528 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,529 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,529 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-22 03:54:41,529 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,529 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-22 03:54:41,530 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,530 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-22 03:54:41,530 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,530 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,530 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-22 03:54:41,531 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-22 03:54:41,531 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,531 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,531 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-22 03:54:41,532 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,533 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,533 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-22 03:54:41,533 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,533 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-22 03:54:41,533 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,534 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-22 03:54:41,534 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,534 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,534 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-22 03:54:41,534 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-22 03:54:41,535 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,535 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-22 03:54:41,535 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((((((((((((#memory_$Pointer$[pp][pp] == 0 && \result == a + 1) && unknown-#memory_int-unknown[pstate][pstate + 4] == 1) && \result == 0) && \result == 2) && 0 < i) && pstate == 0) && b == a + 1) && #memory_$Pointer$[pp][pp + 8] == 1) && 0 < i) && !(pp == pstate)) && a == 0) && !(#memory_$Pointer$[pp][0] == a)) && pp == 0) || (((((((((((((#memory_$Pointer$[pp][pp] == 0 && \result == a + 1) && !(#memory_$Pointer$[pp][pp + i * 8] == a)) && unknown-#memory_int-unknown[pstate][pstate + 4] == 1) && \result == 0) && \result == 2) && 0 < i) && pstate == 0) && b == a + 1) && i == 0) && #memory_$Pointer$[pp][pp + 8] == 1) && !(pp == pstate)) && a == 0) && pp == 0)) || ((((((((((((((((#memory_$Pointer$[pp][pp + 8] == 0 && \result == a + 1) && unknown-#memory_int-unknown[pstate][0] == 1) && \result == 0) && \result == 2) && 0 < i) && i <= 1) && pstate == 0) && b == a + 1) && !(pointer == 1)) && #memory_$Pointer$[pp][0] == a) && !(pp == pstate)) && 1 <= i) && a == 0) && #memory_$Pointer$[pp][pp + 8] == 0) && #memory_$Pointer$[pp][0] == a) && pp == 0)) || (((((((((((((((#memory_$Pointer$[pp][pp + 8] == 0 && a == 1) && unknown-#memory_int-unknown[pstate][0] == 1) && \result == 0) && \result == 2) && 0 < i) && pstate == 0) && b == a + 1) && i == 0) && !(pointer == 1)) && #memory_$Pointer$[pp][0] == a) && !(pp == pstate)) && a == 0) && #memory_$Pointer$[pp][pp + 8] == 0) && #memory_$Pointer$[pp][0] == a) && pp == 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 35 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 144.0s, OverallIterations: 16, TraceHistogramMax: 3, AutomataDifference: 113.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 4.9s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 585 SDtfs, 3097 SDslu, 3193 SDs, 0 SdLazy, 5019 SolverSat, 995 SolverUnsat, 65 SolverUnknown, 0 SolverNotchecked, 56.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 702 GetRequests, 299 SyntacticMatches, 8 SemanticMatches, 395 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3264 ImplicationChecksByTransitivity, 78.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=121occurred in iteration=10, 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, 16 MinimizatonAttempts, 792 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 8 PreInvPairs, 34 NumberOfFragments, 1761 HoareAnnotationTreeSize, 8 FomulaSimplifications, 21170443 FormulaSimplificationTreeSizeReduction, 1.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 13931982 FormulaSimplificationTreeSizeReductionInter, 3.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 25.9s InterpolantComputationTime, 796 NumberOfCodeBlocks, 796 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 767 ConstructedInterpolants, 31 QuantifiedInterpolants, 281527 SizeOfPredicates, 126 NumberOfNonLiveVariables, 2488 ConjunctsInSsa, 258 ConjunctsInUnsatCore, 29 InterpolantComputations, 6 PerfectInterpolantSequences, 142/248 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 RESULT: Ultimate proved your program to be correct! Received shutdown request...