./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/ldv-regression/ex3_forlist_true-termination.c_true-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/ldv-regression/ex3_forlist_true-termination.c_true-unreach-call.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 35d30cdccac93bddd26c3755048a0b29ad39c8fa ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2018-12-31 04:22:41,611 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 04:22:41,615 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 04:22:41,627 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 04:22:41,628 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 04:22:41,629 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 04:22:41,630 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 04:22:41,632 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 04:22:41,634 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 04:22:41,635 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 04:22:41,636 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 04:22:41,636 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 04:22:41,637 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 04:22:41,638 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 04:22:41,639 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 04:22:41,640 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 04:22:41,641 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 04:22:41,643 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 04:22:41,644 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 04:22:41,646 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 04:22:41,647 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 04:22:41,648 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 04:22:41,651 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 04:22:41,651 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 04:22:41,652 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 04:22:41,653 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 04:22:41,654 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 04:22:41,654 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 04:22:41,655 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 04:22:41,656 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 04:22:41,657 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 04:22:41,657 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 04:22:41,657 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 04:22:41,658 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 04:22:41,659 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 04:22:41,659 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 04:22:41,660 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-31 04:22:41,685 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 04:22:41,685 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 04:22:41,687 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 04:22:41,688 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 04:22:41,689 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 04:22:41,689 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 04:22:41,689 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 04:22:41,689 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 04:22:41,689 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 04:22:41,690 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 04:22:41,690 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 04:22:41,690 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 04:22:41,690 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 04:22:41,690 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 04:22:41,690 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 04:22:41,691 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 04:22:41,691 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 04:22:41,691 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 04:22:41,692 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 04:22:41,692 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 04:22:41,692 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 04:22:41,692 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 04:22:41,692 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 04:22:41,693 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 04:22:41,694 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 04:22:41,694 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 04:22:41,694 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 04:22:41,694 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 04:22:41,695 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 35d30cdccac93bddd26c3755048a0b29ad39c8fa [2018-12-31 04:22:41,748 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 04:22:41,761 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 04:22:41,764 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 04:22:41,766 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 04:22:41,766 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 04:22:41,767 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/ldv-regression/ex3_forlist_true-termination.c_true-unreach-call.i [2018-12-31 04:22:41,820 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fea96c6e6/46755e232bba4cc8aec0c04e6df34263/FLAG4fc606c9b [2018-12-31 04:22:42,320 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 04:22:42,320 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ldv-regression/ex3_forlist_true-termination.c_true-unreach-call.i [2018-12-31 04:22:42,330 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fea96c6e6/46755e232bba4cc8aec0c04e6df34263/FLAG4fc606c9b [2018-12-31 04:22:42,663 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fea96c6e6/46755e232bba4cc8aec0c04e6df34263 [2018-12-31 04:22:42,667 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 04:22:42,669 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 04:22:42,670 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 04:22:42,670 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 04:22:42,676 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 04:22:42,677 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 04:22:42" (1/1) ... [2018-12-31 04:22:42,681 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@814bf51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:22:42, skipping insertion in model container [2018-12-31 04:22:42,681 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 04:22:42" (1/1) ... [2018-12-31 04:22:42,691 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 04:22:42,715 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 04:22:42,905 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 04:22:42,914 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 04:22:42,941 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 04:22:42,969 INFO L195 MainTranslator]: Completed translation [2018-12-31 04:22:42,970 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:22:42 WrapperNode [2018-12-31 04:22:42,970 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 04:22:42,971 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 04:22:42,971 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 04:22:42,971 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 04:22:42,981 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:22:42" (1/1) ... [2018-12-31 04:22:42,992 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:22:42" (1/1) ... [2018-12-31 04:22:43,022 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 04:22:43,023 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 04:22:43,023 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 04:22:43,023 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 04:22:43,105 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:22:42" (1/1) ... [2018-12-31 04:22:43,105 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:22:42" (1/1) ... [2018-12-31 04:22:43,118 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:22:42" (1/1) ... [2018-12-31 04:22:43,119 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:22:42" (1/1) ... [2018-12-31 04:22:43,133 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:22:42" (1/1) ... [2018-12-31 04:22:43,146 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:22:42" (1/1) ... [2018-12-31 04:22:43,148 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:22:42" (1/1) ... [2018-12-31 04:22:43,152 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 04:22:43,152 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 04:22:43,153 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 04:22:43,153 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 04:22:43,154 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:22:42" (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 [2018-12-31 04:22:43,215 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-31 04:22:43,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-31 04:22:43,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-12-31 04:22:43,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-31 04:22:43,216 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2018-12-31 04:22:43,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-31 04:22:43,216 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 04:22:43,217 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 04:22:43,217 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-31 04:22:43,804 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 04:22:43,804 INFO L280 CfgBuilder]: Removed 27 assue(true) statements. [2018-12-31 04:22:43,805 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 04:22:43 BoogieIcfgContainer [2018-12-31 04:22:43,805 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 04:22:43,806 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 04:22:43,806 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 04:22:43,809 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 04:22:43,809 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 04:22:42" (1/3) ... [2018-12-31 04:22:43,810 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28325993 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 04:22:43, skipping insertion in model container [2018-12-31 04:22:43,810 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:22:42" (2/3) ... [2018-12-31 04:22:43,811 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28325993 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 04:22:43, skipping insertion in model container [2018-12-31 04:22:43,811 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 04:22:43" (3/3) ... [2018-12-31 04:22:43,813 INFO L112 eAbstractionObserver]: Analyzing ICFG ex3_forlist_true-termination.c_true-unreach-call.i [2018-12-31 04:22:43,823 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 04:22:43,831 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2018-12-31 04:22:43,850 INFO L257 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2018-12-31 04:22:43,882 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 04:22:43,883 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 04:22:43,883 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 04:22:43,883 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 04:22:43,884 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 04:22:43,884 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 04:22:43,884 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 04:22:43,884 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 04:22:43,884 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 04:22:43,900 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2018-12-31 04:22:43,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-31 04:22:43,908 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:22:43,909 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:22:43,911 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:22:43,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:22:43,916 INFO L82 PathProgramCache]: Analyzing trace with hash 409945024, now seen corresponding path program 1 times [2018-12-31 04:22:43,918 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:22:43,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:22:43,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:22:43,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:22:43,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:22:44,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:22:44,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:22:44,113 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 04:22:44,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 04:22:44,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 04:22:44,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 04:22:44,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 04:22:44,133 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 3 states. [2018-12-31 04:22:44,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:22:44,178 INFO L93 Difference]: Finished difference Result 68 states and 100 transitions. [2018-12-31 04:22:44,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 04:22:44,180 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-12-31 04:22:44,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:22:44,191 INFO L225 Difference]: With dead ends: 68 [2018-12-31 04:22:44,192 INFO L226 Difference]: Without dead ends: 33 [2018-12-31 04:22:44,195 INFO L631 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 [2018-12-31 04:22:44,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-31 04:22:44,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2018-12-31 04:22:44,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-31 04:22:44,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2018-12-31 04:22:44,236 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 15 [2018-12-31 04:22:44,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:22:44,236 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2018-12-31 04:22:44,236 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 04:22:44,236 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2018-12-31 04:22:44,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-31 04:22:44,239 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:22:44,241 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:22:44,241 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:22:44,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:22:44,242 INFO L82 PathProgramCache]: Analyzing trace with hash -1658708759, now seen corresponding path program 1 times [2018-12-31 04:22:44,242 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:22:44,242 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:22:44,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:22:44,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:22:44,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:22:44,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:22:44,314 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-31 04:22:44,315 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 04:22:44,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 04:22:44,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 04:22:44,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 04:22:44,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 04:22:44,317 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand 3 states. [2018-12-31 04:22:44,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:22:44,482 INFO L93 Difference]: Finished difference Result 75 states and 95 transitions. [2018-12-31 04:22:44,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 04:22:44,483 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-12-31 04:22:44,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:22:44,484 INFO L225 Difference]: With dead ends: 75 [2018-12-31 04:22:44,484 INFO L226 Difference]: Without dead ends: 55 [2018-12-31 04:22:44,486 INFO L631 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 [2018-12-31 04:22:44,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-12-31 04:22:44,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 34. [2018-12-31 04:22:44,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-31 04:22:44,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2018-12-31 04:22:44,494 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 17 [2018-12-31 04:22:44,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:22:44,495 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2018-12-31 04:22:44,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 04:22:44,496 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2018-12-31 04:22:44,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-31 04:22:44,497 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:22:44,497 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:22:44,497 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:22:44,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:22:44,499 INFO L82 PathProgramCache]: Analyzing trace with hash 1382422530, now seen corresponding path program 1 times [2018-12-31 04:22:44,499 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:22:44,499 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:22:44,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:22:44,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:22:44,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:22:44,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:22:44,650 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:22:44,651 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 04:22:44,651 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 04:22:44,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:22:44,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:22:44,732 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 04:22:44,763 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:22:44,784 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 04:22:44,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-12-31 04:22:44,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 04:22:44,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 04:22:44,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-31 04:22:44,787 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. Second operand 5 states. [2018-12-31 04:22:44,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:22:44,967 INFO L93 Difference]: Finished difference Result 65 states and 81 transitions. [2018-12-31 04:22:44,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 04:22:44,968 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-12-31 04:22:44,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:22:44,969 INFO L225 Difference]: With dead ends: 65 [2018-12-31 04:22:44,970 INFO L226 Difference]: Without dead ends: 36 [2018-12-31 04:22:44,970 INFO L631 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 [2018-12-31 04:22:44,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-31 04:22:44,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-12-31 04:22:44,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-31 04:22:44,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2018-12-31 04:22:44,988 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 19 [2018-12-31 04:22:44,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:22:44,988 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2018-12-31 04:22:44,988 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 04:22:44,989 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2018-12-31 04:22:44,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-31 04:22:44,990 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:22:44,990 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:22:44,990 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:22:44,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:22:44,992 INFO L82 PathProgramCache]: Analyzing trace with hash 1994936256, now seen corresponding path program 2 times [2018-12-31 04:22:44,992 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:22:44,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:22:44,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:22:44,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:22:44,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:22:45,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:22:45,777 WARN L181 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 15 [2018-12-31 04:22:45,981 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 16 [2018-12-31 04:22:46,183 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-31 04:22:46,184 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 04:22:46,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-31 04:22:46,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-31 04:22:46,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-31 04:22:46,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-12-31 04:22:46,185 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand 11 states. [2018-12-31 04:22:47,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:22:47,160 INFO L93 Difference]: Finished difference Result 75 states and 93 transitions. [2018-12-31 04:22:47,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-31 04:22:47,162 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2018-12-31 04:22:47,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:22:47,164 INFO L225 Difference]: With dead ends: 75 [2018-12-31 04:22:47,164 INFO L226 Difference]: Without dead ends: 60 [2018-12-31 04:22:47,165 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=102, Invalid=204, Unknown=0, NotChecked=0, Total=306 [2018-12-31 04:22:47,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-12-31 04:22:47,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 40. [2018-12-31 04:22:47,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-31 04:22:47,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 49 transitions. [2018-12-31 04:22:47,178 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 49 transitions. Word has length 21 [2018-12-31 04:22:47,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:22:47,178 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 49 transitions. [2018-12-31 04:22:47,178 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-31 04:22:47,179 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 49 transitions. [2018-12-31 04:22:47,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-31 04:22:47,179 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:22:47,181 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:22:47,181 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:22:47,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:22:47,182 INFO L82 PathProgramCache]: Analyzing trace with hash 902320519, now seen corresponding path program 1 times [2018-12-31 04:22:47,182 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:22:47,182 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:22:47,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:22:47,183 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 04:22:47,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:22:47,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:22:47,286 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-31 04:22:47,286 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 04:22:47,287 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 04:22:47,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:22:47,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:22:47,349 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 04:22:47,443 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-31 04:22:47,474 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 04:22:47,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-12-31 04:22:47,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 04:22:47,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 04:22:47,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-31 04:22:47,476 INFO L87 Difference]: Start difference. First operand 40 states and 49 transitions. Second operand 5 states. [2018-12-31 04:22:47,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:22:47,574 INFO L93 Difference]: Finished difference Result 103 states and 127 transitions. [2018-12-31 04:22:47,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 04:22:47,575 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-12-31 04:22:47,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:22:47,577 INFO L225 Difference]: With dead ends: 103 [2018-12-31 04:22:47,577 INFO L226 Difference]: Without dead ends: 78 [2018-12-31 04:22:47,577 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-31 04:22:47,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-12-31 04:22:47,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 45. [2018-12-31 04:22:47,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-31 04:22:47,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 55 transitions. [2018-12-31 04:22:47,588 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 55 transitions. Word has length 23 [2018-12-31 04:22:47,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:22:47,588 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 55 transitions. [2018-12-31 04:22:47,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 04:22:47,588 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 55 transitions. [2018-12-31 04:22:47,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-31 04:22:47,589 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:22:47,589 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:22:47,591 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:22:47,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:22:47,591 INFO L82 PathProgramCache]: Analyzing trace with hash 2064717651, now seen corresponding path program 1 times [2018-12-31 04:22:47,591 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:22:47,592 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:22:47,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:22:47,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:22:47,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:22:47,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:22:48,074 WARN L181 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 14 [2018-12-31 04:22:48,875 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 23 [2018-12-31 04:22:49,042 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:22:49,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 04:22:49,042 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 04:22:49,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:22:49,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:22:49,102 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 04:22:49,150 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-12-31 04:22:49,285 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-12-31 04:22:49,285 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 04:22:49,311 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:22:49,387 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:22:49,388 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:18, output treesize:11 [2018-12-31 04:22:49,556 INFO L478 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2018-12-31 04:22:49,563 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-31 04:22:49,563 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 04:22:49,581 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-12-31 04:22:49,585 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-12-31 04:22:49,585 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-31 04:22:49,589 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:22:49,594 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:22:49,641 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:22:49,642 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:39, output treesize:11 [2018-12-31 04:22:49,826 INFO L478 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 11 [2018-12-31 04:22:49,846 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-31 04:22:49,847 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 04:22:49,851 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:22:49,853 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:22:49,853 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-12-31 04:22:49,912 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-31 04:22:49,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-31 04:22:49,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [12] total 19 [2018-12-31 04:22:49,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-31 04:22:49,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-31 04:22:49,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=337, Unknown=0, NotChecked=0, Total=380 [2018-12-31 04:22:49,933 INFO L87 Difference]: Start difference. First operand 45 states and 55 transitions. Second operand 20 states. [2018-12-31 04:22:50,899 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 34 [2018-12-31 04:22:51,075 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2018-12-31 04:22:52,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:22:52,925 INFO L93 Difference]: Finished difference Result 120 states and 149 transitions. [2018-12-31 04:22:52,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-31 04:22:52,926 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 24 [2018-12-31 04:22:52,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:22:52,930 INFO L225 Difference]: With dead ends: 120 [2018-12-31 04:22:52,930 INFO L226 Difference]: Without dead ends: 102 [2018-12-31 04:22:52,932 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=311, Invalid=1249, Unknown=0, NotChecked=0, Total=1560 [2018-12-31 04:22:52,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-12-31 04:22:52,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 66. [2018-12-31 04:22:52,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-12-31 04:22:52,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 82 transitions. [2018-12-31 04:22:52,948 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 82 transitions. Word has length 24 [2018-12-31 04:22:52,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:22:52,948 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 82 transitions. [2018-12-31 04:22:52,948 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-31 04:22:52,949 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 82 transitions. [2018-12-31 04:22:52,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-31 04:22:52,951 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:22:52,952 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:22:52,952 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:22:52,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:22:52,952 INFO L82 PathProgramCache]: Analyzing trace with hash -554343156, now seen corresponding path program 1 times [2018-12-31 04:22:52,954 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:22:52,954 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:22:52,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:22:52,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:22:52,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:22:52,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:22:53,340 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-31 04:22:53,341 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 04:22:53,341 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 04:22:53,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:22:53,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:22:53,390 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 04:22:53,397 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-12-31 04:22:53,415 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-12-31 04:22:53,415 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 04:22:53,420 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:22:53,431 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:22:53,431 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:18, output treesize:11 [2018-12-31 04:22:53,500 INFO L478 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 11 treesize of output 8 [2018-12-31 04:22:53,502 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-31 04:22:53,503 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 04:22:53,504 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:22:53,509 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:22:53,509 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2018-12-31 04:22:53,880 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 32 [2018-12-31 04:22:53,884 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2018-12-31 04:22:53,885 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 04:22:53,891 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:22:53,907 INFO L478 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 18 [2018-12-31 04:22:53,911 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:22:53,912 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-12-31 04:22:53,914 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-31 04:22:53,919 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:22:53,932 INFO L267 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. [2018-12-31 04:22:53,932 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:59, output treesize:28 [2018-12-31 04:22:54,249 INFO L478 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 26 treesize of output 20 [2018-12-31 04:22:54,273 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:22:54,285 INFO L683 Elim1Store]: detected equality via solver [2018-12-31 04:22:54,287 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2018-12-31 04:22:54,287 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 04:22:54,372 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:22:54,384 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:22:54,384 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:35, output treesize:3 [2018-12-31 04:22:54,449 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-31 04:22:54,468 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-31 04:22:54,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [9] total 15 [2018-12-31 04:22:54,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-31 04:22:54,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-31 04:22:54,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2018-12-31 04:22:54,470 INFO L87 Difference]: Start difference. First operand 66 states and 82 transitions. Second operand 16 states. [2018-12-31 04:22:59,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:22:59,093 INFO L93 Difference]: Finished difference Result 157 states and 195 transitions. [2018-12-31 04:22:59,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-31 04:22:59,094 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 24 [2018-12-31 04:22:59,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:22:59,095 INFO L225 Difference]: With dead ends: 157 [2018-12-31 04:22:59,097 INFO L226 Difference]: Without dead ends: 147 [2018-12-31 04:22:59,098 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 14 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=170, Invalid=532, Unknown=0, NotChecked=0, Total=702 [2018-12-31 04:22:59,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-12-31 04:22:59,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 89. [2018-12-31 04:22:59,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-12-31 04:22:59,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 113 transitions. [2018-12-31 04:22:59,134 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 113 transitions. Word has length 24 [2018-12-31 04:22:59,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:22:59,134 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 113 transitions. [2018-12-31 04:22:59,135 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-31 04:22:59,135 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 113 transitions. [2018-12-31 04:22:59,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-31 04:22:59,137 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:22:59,137 INFO L402 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] [2018-12-31 04:22:59,138 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:22:59,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:22:59,138 INFO L82 PathProgramCache]: Analyzing trace with hash 93482631, now seen corresponding path program 1 times [2018-12-31 04:22:59,138 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:22:59,138 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:22:59,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:22:59,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:22:59,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:22:59,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:22:59,386 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-12-31 04:22:59,591 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-12-31 04:23:00,036 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-31 04:23:00,037 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 04:23:00,037 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 04:23:00,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:23:00,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:23:00,088 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 04:23:00,177 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 13 treesize of output 10 [2018-12-31 04:23:00,184 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-31 04:23:00,185 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 04:23:00,187 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:23:00,196 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:23:00,197 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-12-31 04:23:00,267 INFO L478 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 11 [2018-12-31 04:23:00,272 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-31 04:23:00,273 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 04:23:00,276 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:23:00,277 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:23:00,277 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-12-31 04:23:00,291 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-31 04:23:00,319 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 04:23:00,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 19 [2018-12-31 04:23:00,320 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-31 04:23:00,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-31 04:23:00,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2018-12-31 04:23:00,321 INFO L87 Difference]: Start difference. First operand 89 states and 113 transitions. Second operand 20 states. [2018-12-31 04:23:05,495 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2018-12-31 04:23:05,913 WARN L181 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2018-12-31 04:23:06,314 WARN L181 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2018-12-31 04:23:06,500 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2018-12-31 04:23:07,096 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2018-12-31 04:23:08,015 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2018-12-31 04:23:08,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:23:08,425 INFO L93 Difference]: Finished difference Result 299 states and 386 transitions. [2018-12-31 04:23:08,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-12-31 04:23:08,426 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 27 [2018-12-31 04:23:08,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:23:08,429 INFO L225 Difference]: With dead ends: 299 [2018-12-31 04:23:08,429 INFO L226 Difference]: Without dead ends: 260 [2018-12-31 04:23:08,432 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1863 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=1313, Invalid=5659, Unknown=0, NotChecked=0, Total=6972 [2018-12-31 04:23:08,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2018-12-31 04:23:08,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 136. [2018-12-31 04:23:08,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-12-31 04:23:08,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 173 transitions. [2018-12-31 04:23:08,457 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 173 transitions. Word has length 27 [2018-12-31 04:23:08,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:23:08,458 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 173 transitions. [2018-12-31 04:23:08,458 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-31 04:23:08,458 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 173 transitions. [2018-12-31 04:23:08,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-31 04:23:08,459 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:23:08,459 INFO L402 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] [2018-12-31 04:23:08,459 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:23:08,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:23:08,460 INFO L82 PathProgramCache]: Analyzing trace with hash -2029788007, now seen corresponding path program 1 times [2018-12-31 04:23:08,460 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:23:08,460 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:23:08,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:23:08,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:23:08,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:23:08,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:23:08,989 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-31 04:23:08,989 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 04:23:08,989 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 04:23:09,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:23:09,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:23:09,041 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 04:23:09,060 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-12-31 04:23:09,122 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-12-31 04:23:09,122 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 04:23:09,126 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:23:09,140 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:23:09,140 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:18, output treesize:11 [2018-12-31 04:23:09,291 INFO L478 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2018-12-31 04:23:09,298 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-31 04:23:09,298 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 04:23:09,311 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-12-31 04:23:09,315 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2018-12-31 04:23:09,316 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-31 04:23:09,319 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:23:09,321 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:23:09,328 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:23:09,329 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:47, output treesize:13 [2018-12-31 04:23:09,407 INFO L478 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 11 [2018-12-31 04:23:09,409 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-31 04:23:09,409 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 04:23:09,411 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:23:09,412 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:23:09,413 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-12-31 04:23:09,438 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-31 04:23:09,458 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 04:23:09,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 20 [2018-12-31 04:23:09,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-31 04:23:09,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-31 04:23:09,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=377, Unknown=0, NotChecked=0, Total=420 [2018-12-31 04:23:09,460 INFO L87 Difference]: Start difference. First operand 136 states and 173 transitions. Second operand 21 states. [2018-12-31 04:23:11,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:23:11,742 INFO L93 Difference]: Finished difference Result 287 states and 353 transitions. [2018-12-31 04:23:11,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-31 04:23:11,742 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 27 [2018-12-31 04:23:11,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:23:11,744 INFO L225 Difference]: With dead ends: 287 [2018-12-31 04:23:11,745 INFO L226 Difference]: Without dead ends: 239 [2018-12-31 04:23:11,746 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=278, Invalid=1282, Unknown=0, NotChecked=0, Total=1560 [2018-12-31 04:23:11,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-12-31 04:23:11,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 135. [2018-12-31 04:23:11,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-12-31 04:23:11,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 170 transitions. [2018-12-31 04:23:11,769 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 170 transitions. Word has length 27 [2018-12-31 04:23:11,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:23:11,770 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 170 transitions. [2018-12-31 04:23:11,770 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-31 04:23:11,770 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 170 transitions. [2018-12-31 04:23:11,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-31 04:23:11,773 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:23:11,773 INFO L402 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] [2018-12-31 04:23:11,774 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:23:11,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:23:11,775 INFO L82 PathProgramCache]: Analyzing trace with hash -1387129824, now seen corresponding path program 1 times [2018-12-31 04:23:11,775 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:23:11,775 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:23:11,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:23:11,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:23:11,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:23:11,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:23:12,438 WARN L181 SmtUtils]: Spent 404.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 24 [2018-12-31 04:23:13,283 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:23:13,283 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 04:23:13,283 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 04:23:13,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:23:13,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:23:13,325 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 04:23:13,332 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-12-31 04:23:13,344 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-12-31 04:23:13,345 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 04:23:13,350 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:23:13,360 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:23:13,360 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2018-12-31 04:23:13,411 INFO L478 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 36 [2018-12-31 04:23:13,413 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-31 04:23:13,414 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 04:23:13,426 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 36 [2018-12-31 04:23:13,430 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2018-12-31 04:23:13,430 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-31 04:23:13,437 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:23:13,439 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:23:13,452 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:23:13,452 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:64, output treesize:28 [2018-12-31 04:23:13,525 INFO L478 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 35 [2018-12-31 04:23:13,539 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:23:13,540 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-12-31 04:23:13,541 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 04:23:13,557 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2018-12-31 04:23:13,560 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2018-12-31 04:23:13,561 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-31 04:23:13,569 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:23:13,576 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:23:13,587 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:23:13,588 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:60, output treesize:30 [2018-12-31 04:23:13,800 INFO L478 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 38 [2018-12-31 04:23:13,804 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:23:13,806 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 26 [2018-12-31 04:23:13,807 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 04:23:13,825 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 33 [2018-12-31 04:23:13,829 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-12-31 04:23:13,830 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-31 04:23:13,836 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:23:13,840 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:23:13,850 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:23:13,850 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:62, output treesize:14 [2018-12-31 04:23:13,920 INFO L478 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 11 [2018-12-31 04:23:13,931 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-31 04:23:13,931 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 04:23:13,956 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:23:14,006 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:23:14,007 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2018-12-31 04:23:14,033 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-31 04:23:14,053 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 04:23:14,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13] total 30 [2018-12-31 04:23:14,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-12-31 04:23:14,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-12-31 04:23:14,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=796, Unknown=0, NotChecked=0, Total=930 [2018-12-31 04:23:14,054 INFO L87 Difference]: Start difference. First operand 135 states and 170 transitions. Second operand 31 states. [2018-12-31 04:23:15,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:23:15,351 INFO L93 Difference]: Finished difference Result 184 states and 229 transitions. [2018-12-31 04:23:15,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-31 04:23:15,352 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 29 [2018-12-31 04:23:15,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:23:15,353 INFO L225 Difference]: With dead ends: 184 [2018-12-31 04:23:15,353 INFO L226 Difference]: Without dead ends: 80 [2018-12-31 04:23:15,355 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 17 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 418 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=266, Invalid=1374, Unknown=0, NotChecked=0, Total=1640 [2018-12-31 04:23:15,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-12-31 04:23:15,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 71. [2018-12-31 04:23:15,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-12-31 04:23:15,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 85 transitions. [2018-12-31 04:23:15,370 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 85 transitions. Word has length 29 [2018-12-31 04:23:15,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:23:15,371 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 85 transitions. [2018-12-31 04:23:15,371 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-12-31 04:23:15,371 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 85 transitions. [2018-12-31 04:23:15,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-31 04:23:15,372 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:23:15,372 INFO L402 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] [2018-12-31 04:23:15,372 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:23:15,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:23:15,372 INFO L82 PathProgramCache]: Analyzing trace with hash 2028220957, now seen corresponding path program 1 times [2018-12-31 04:23:15,374 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:23:15,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:23:15,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:23:15,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:23:15,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:23:15,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:23:15,508 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-31 04:23:15,508 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 04:23:15,508 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 04:23:15,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:23:15,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:23:15,560 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 04:23:15,589 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-31 04:23:15,608 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 04:23:15,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-12-31 04:23:15,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 04:23:15,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 04:23:15,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-31 04:23:15,611 INFO L87 Difference]: Start difference. First operand 71 states and 85 transitions. Second operand 5 states. [2018-12-31 04:23:15,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:23:15,742 INFO L93 Difference]: Finished difference Result 96 states and 115 transitions. [2018-12-31 04:23:15,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 04:23:15,743 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-12-31 04:23:15,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:23:15,743 INFO L225 Difference]: With dead ends: 96 [2018-12-31 04:23:15,744 INFO L226 Difference]: Without dead ends: 84 [2018-12-31 04:23:15,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-31 04:23:15,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-12-31 04:23:15,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 75. [2018-12-31 04:23:15,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-31 04:23:15,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 89 transitions. [2018-12-31 04:23:15,757 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 89 transitions. Word has length 33 [2018-12-31 04:23:15,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:23:15,757 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 89 transitions. [2018-12-31 04:23:15,757 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 04:23:15,757 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 89 transitions. [2018-12-31 04:23:15,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-31 04:23:15,758 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:23:15,758 INFO L402 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] [2018-12-31 04:23:15,758 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:23:15,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:23:15,758 INFO L82 PathProgramCache]: Analyzing trace with hash 591619839, now seen corresponding path program 1 times [2018-12-31 04:23:15,759 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:23:15,759 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:23:15,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:23:15,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:23:15,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:23:15,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:23:15,983 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-12-31 04:23:16,666 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2018-12-31 04:23:17,029 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-31 04:23:17,029 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 04:23:17,029 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 04:23:17,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:23:17,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:23:17,079 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 04:23:17,086 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-12-31 04:23:17,099 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-12-31 04:23:17,099 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 04:23:17,105 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:23:17,110 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:23:17,111 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:18, output treesize:11 [2018-12-31 04:23:17,330 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-12-31 04:23:17,334 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-12-31 04:23:17,335 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 04:23:17,338 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:23:17,346 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:23:17,347 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:14 [2018-12-31 04:23:17,410 INFO L478 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 11 [2018-12-31 04:23:17,413 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-31 04:23:17,413 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 04:23:17,415 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:23:17,418 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:23:17,419 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2018-12-31 04:23:17,449 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-31 04:23:17,468 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 04:23:17,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 11] total 29 [2018-12-31 04:23:17,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-12-31 04:23:17,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-12-31 04:23:17,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=791, Unknown=0, NotChecked=0, Total=870 [2018-12-31 04:23:17,470 INFO L87 Difference]: Start difference. First operand 75 states and 89 transitions. Second operand 30 states. [2018-12-31 04:23:18,301 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 50 [2018-12-31 04:23:18,568 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 55 [2018-12-31 04:23:18,773 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 54 [2018-12-31 04:23:18,912 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 43 [2018-12-31 04:23:19,094 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 64 [2018-12-31 04:23:19,240 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 50 [2018-12-31 04:23:19,436 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 49 [2018-12-31 04:23:19,637 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2018-12-31 04:23:19,882 WARN L181 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 69 [2018-12-31 04:23:20,082 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 67 [2018-12-31 04:23:20,247 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 58 [2018-12-31 04:23:20,543 WARN L181 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 75 [2018-12-31 04:23:20,764 WARN L181 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 68 [2018-12-31 04:23:20,953 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 64 [2018-12-31 04:23:21,163 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 66 [2018-12-31 04:23:21,310 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 64 [2018-12-31 04:23:21,521 WARN L181 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 64 [2018-12-31 04:23:21,861 WARN L181 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 71 [2018-12-31 04:23:22,045 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2018-12-31 04:23:22,198 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 60 [2018-12-31 04:23:22,341 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 60 [2018-12-31 04:23:22,605 WARN L181 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 74 [2018-12-31 04:23:22,942 WARN L181 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 70 [2018-12-31 04:23:23,149 WARN L181 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 66 [2018-12-31 04:23:23,376 WARN L181 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 72 [2018-12-31 04:23:23,570 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 67 [2018-12-31 04:23:23,732 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 61 [2018-12-31 04:23:23,955 WARN L181 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 66 [2018-12-31 04:23:24,235 WARN L181 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 74 [2018-12-31 04:23:24,448 WARN L181 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 70 [2018-12-31 04:23:24,647 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 52 [2018-12-31 04:23:24,826 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2018-12-31 04:23:25,043 WARN L181 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 70 [2018-12-31 04:23:25,234 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 64 [2018-12-31 04:23:25,386 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 62 [2018-12-31 04:23:25,585 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 57 [2018-12-31 04:23:25,776 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 57 [2018-12-31 04:23:26,240 WARN L181 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 74 [2018-12-31 04:23:26,484 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 69 [2018-12-31 04:23:26,737 WARN L181 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 61 [2018-12-31 04:23:26,940 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2018-12-31 04:23:27,191 WARN L181 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 74 [2018-12-31 04:23:27,349 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 47 [2018-12-31 04:23:27,536 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 61 [2018-12-31 04:23:27,727 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 63 [2018-12-31 04:23:27,983 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 61 [2018-12-31 04:23:28,151 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 52 [2018-12-31 04:23:28,320 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 49 [2018-12-31 04:23:28,618 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 62 [2018-12-31 04:23:28,842 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 55 [2018-12-31 04:23:29,189 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 58 [2018-12-31 04:23:29,376 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2018-12-31 04:23:29,765 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 65 [2018-12-31 04:23:30,039 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 62 [2018-12-31 04:23:30,214 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 60 [2018-12-31 04:23:30,389 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 62 [2018-12-31 04:23:30,606 WARN L181 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 66 [2018-12-31 04:23:30,925 WARN L181 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 69 [2018-12-31 04:23:31,119 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 59 [2018-12-31 04:23:31,314 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 61 [2018-12-31 04:23:31,800 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2018-12-31 04:23:32,021 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2018-12-31 04:23:32,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:23:32,054 INFO L93 Difference]: Finished difference Result 224 states and 259 transitions. [2018-12-31 04:23:32,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-12-31 04:23:32,056 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 34 [2018-12-31 04:23:32,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:23:32,058 INFO L225 Difference]: With dead ends: 224 [2018-12-31 04:23:32,058 INFO L226 Difference]: Without dead ends: 210 [2018-12-31 04:23:32,062 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3225 ImplicationChecksByTransitivity, 14.5s TimeCoverageRelationStatistics Valid=2301, Invalid=9041, Unknown=0, NotChecked=0, Total=11342 [2018-12-31 04:23:32,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-12-31 04:23:32,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 88. [2018-12-31 04:23:32,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-12-31 04:23:32,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 104 transitions. [2018-12-31 04:23:32,086 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 104 transitions. Word has length 34 [2018-12-31 04:23:32,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:23:32,086 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 104 transitions. [2018-12-31 04:23:32,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-12-31 04:23:32,086 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 104 transitions. [2018-12-31 04:23:32,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-31 04:23:32,087 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:23:32,087 INFO L402 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] [2018-12-31 04:23:32,087 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:23:32,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:23:32,088 INFO L82 PathProgramCache]: Analyzing trace with hash -1713878490, now seen corresponding path program 1 times [2018-12-31 04:23:32,088 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:23:32,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:23:32,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:23:32,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:23:32,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:23:32,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:23:32,580 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-31 04:23:32,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 04:23:32,581 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 04:23:32,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:23:32,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:23:32,627 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 04:23:32,636 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-12-31 04:23:32,654 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-12-31 04:23:32,654 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 04:23:32,656 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:23:32,663 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:23:32,664 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:18, output treesize:11 [2018-12-31 04:23:32,754 INFO L478 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2018-12-31 04:23:32,758 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-31 04:23:32,759 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 04:23:32,778 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-12-31 04:23:32,782 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-12-31 04:23:32,782 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-31 04:23:32,789 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:23:32,792 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:23:32,813 INFO L478 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2018-12-31 04:23:32,818 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-31 04:23:32,819 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-31 04:23:32,830 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-12-31 04:23:32,833 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-12-31 04:23:32,833 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-31 04:23:32,837 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:23:32,840 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:23:32,854 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:23:32,855 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:79, output treesize:27 [2018-12-31 04:23:32,943 INFO L478 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 11 [2018-12-31 04:23:32,945 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-12-31 04:23:32,946 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 04:23:32,953 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:23:32,965 INFO L478 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 11 [2018-12-31 04:23:32,968 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-31 04:23:32,969 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-31 04:23:32,971 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:23:32,982 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:23:32,982 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:38, output treesize:16 [2018-12-31 04:23:33,014 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-31 04:23:33,034 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 04:23:33,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2018-12-31 04:23:33,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-31 04:23:33,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-31 04:23:33,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2018-12-31 04:23:33,035 INFO L87 Difference]: Start difference. First operand 88 states and 104 transitions. Second operand 20 states. [2018-12-31 04:23:34,396 WARN L181 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 28 [2018-12-31 04:23:34,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:23:34,450 INFO L93 Difference]: Finished difference Result 114 states and 134 transitions. [2018-12-31 04:23:34,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-31 04:23:34,451 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 37 [2018-12-31 04:23:34,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:23:34,453 INFO L225 Difference]: With dead ends: 114 [2018-12-31 04:23:34,453 INFO L226 Difference]: Without dead ends: 89 [2018-12-31 04:23:34,454 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=189, Invalid=867, Unknown=0, NotChecked=0, Total=1056 [2018-12-31 04:23:34,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-12-31 04:23:34,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 80. [2018-12-31 04:23:34,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-12-31 04:23:34,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 92 transitions. [2018-12-31 04:23:34,471 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 92 transitions. Word has length 37 [2018-12-31 04:23:34,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:23:34,471 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 92 transitions. [2018-12-31 04:23:34,471 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-31 04:23:34,471 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 92 transitions. [2018-12-31 04:23:34,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-31 04:23:34,472 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:23:34,472 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1] [2018-12-31 04:23:34,472 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:23:34,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:23:34,473 INFO L82 PathProgramCache]: Analyzing trace with hash 1276662955, now seen corresponding path program 1 times [2018-12-31 04:23:34,473 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:23:34,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:23:34,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:23:34,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:23:34,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:23:34,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:23:35,215 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 31 [2018-12-31 04:23:35,486 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-31 04:23:35,487 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 04:23:35,487 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 04:23:35,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:23:35,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:23:35,534 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 04:23:35,539 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-12-31 04:23:35,553 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-12-31 04:23:35,554 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 04:23:35,557 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:23:35,570 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:23:35,570 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2018-12-31 04:23:35,676 INFO L478 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2018-12-31 04:23:35,678 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-31 04:23:35,679 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 04:23:35,689 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-12-31 04:23:35,694 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2018-12-31 04:23:35,694 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-31 04:23:35,699 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:23:35,701 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:23:35,710 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:23:35,711 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:53, output treesize:23 [2018-12-31 04:23:36,263 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-12-31 04:23:36,328 INFO L478 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2018-12-31 04:23:36,331 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:23:36,333 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-12-31 04:23:36,333 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 04:23:36,348 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 33 [2018-12-31 04:23:36,351 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-12-31 04:23:36,351 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-31 04:23:36,358 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:23:36,364 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:23:36,376 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:23:36,377 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:54, output treesize:23 [2018-12-31 04:23:36,438 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-12-31 04:23:36,443 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2018-12-31 04:23:36,443 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 04:23:36,447 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:23:36,457 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:23:36,458 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:19 [2018-12-31 04:23:36,546 INFO L478 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 11 [2018-12-31 04:23:36,548 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-31 04:23:36,548 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 04:23:36,550 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:23:36,554 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:23:36,554 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2018-12-31 04:23:36,582 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-31 04:23:36,601 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 04:23:36,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 27 [2018-12-31 04:23:36,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-31 04:23:36,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-31 04:23:36,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=658, Unknown=0, NotChecked=0, Total=756 [2018-12-31 04:23:36,602 INFO L87 Difference]: Start difference. First operand 80 states and 92 transitions. Second operand 28 states. [2018-12-31 04:23:38,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:23:38,158 INFO L93 Difference]: Finished difference Result 88 states and 101 transitions. [2018-12-31 04:23:38,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-31 04:23:38,159 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 39 [2018-12-31 04:23:38,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:23:38,160 INFO L225 Difference]: With dead ends: 88 [2018-12-31 04:23:38,160 INFO L226 Difference]: Without dead ends: 62 [2018-12-31 04:23:38,161 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 25 SyntacticMatches, 6 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 413 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=256, Invalid=1550, Unknown=0, NotChecked=0, Total=1806 [2018-12-31 04:23:38,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-12-31 04:23:38,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 59. [2018-12-31 04:23:38,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-31 04:23:38,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 68 transitions. [2018-12-31 04:23:38,176 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 68 transitions. Word has length 39 [2018-12-31 04:23:38,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:23:38,176 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 68 transitions. [2018-12-31 04:23:38,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-31 04:23:38,176 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 68 transitions. [2018-12-31 04:23:38,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-31 04:23:38,179 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:23:38,179 INFO L402 BasicCegarLoop]: trace histogram [3, 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] [2018-12-31 04:23:38,180 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:23:38,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:23:38,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1008598199, now seen corresponding path program 1 times [2018-12-31 04:23:38,180 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:23:38,180 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:23:38,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:23:38,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:23:38,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:23:38,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:23:38,405 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-31 04:23:38,405 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 04:23:38,405 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 04:23:38,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:23:38,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:23:38,479 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 04:23:38,580 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-31 04:23:38,623 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-31 04:23:38,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2018-12-31 04:23:38,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 04:23:38,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 04:23:38,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-31 04:23:38,624 INFO L87 Difference]: Start difference. First operand 59 states and 68 transitions. Second operand 6 states. [2018-12-31 04:23:39,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:23:39,222 INFO L93 Difference]: Finished difference Result 77 states and 88 transitions. [2018-12-31 04:23:39,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 04:23:39,224 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2018-12-31 04:23:39,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:23:39,224 INFO L225 Difference]: With dead ends: 77 [2018-12-31 04:23:39,224 INFO L226 Difference]: Without dead ends: 0 [2018-12-31 04:23:39,225 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-31 04:23:39,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-31 04:23:39,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-31 04:23:39,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-31 04:23:39,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-31 04:23:39,225 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 40 [2018-12-31 04:23:39,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:23:39,233 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-31 04:23:39,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 04:23:39,233 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-31 04:23:39,234 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-31 04:23:39,241 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-31 04:23:39,317 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 04:23:39,355 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 04:23:39,424 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 154 [2018-12-31 04:23:39,702 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 04:23:40,065 WARN L181 SmtUtils]: Spent 589.00 ms on a formula simplification. DAG size of input: 279 DAG size of output: 256 [2018-12-31 04:23:40,866 WARN L181 SmtUtils]: Spent 787.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 41 [2018-12-31 04:23:42,011 WARN L181 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 78 DAG size of output: 58 [2018-12-31 04:23:46,602 WARN L181 SmtUtils]: Spent 4.59 s on a formula simplification. DAG size of input: 148 DAG size of output: 91 [2018-12-31 04:23:47,004 WARN L181 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 69 [2018-12-31 04:23:49,877 WARN L181 SmtUtils]: Spent 2.87 s on a formula simplification. DAG size of input: 256 DAG size of output: 101 [2018-12-31 04:23:50,057 INFO L448 ceAbstractionStarter]: For program point L36-2(lines 36 42) no Hoare annotation was computed. [2018-12-31 04:23:50,058 INFO L444 ceAbstractionStarter]: At program point L36-3(lines 36 42) the Hoare annotation is: (let ((.cse12 (* 4 ULTIMATE.start_f_~i~1)) (.cse22 (select |#memory_$Pointer$.base| |~#pp~0.base|)) (.cse11 (+ |~#pstate~0.offset| 4))) (let ((.cse25 (select |#memory_int| |~#pstate~0.base|)) (.cse20 (select .cse22 .cse11)) (.cse24 (select |#memory_$Pointer$.offset| |~#pp~0.base|)) (.cse26 (+ |~#pp~0.offset| .cse12))) (let ((.cse16 (<= .cse26 7)) (.cse13 (= 1 (select .cse24 |~#pp~0.offset|))) (.cse0 (= |ULTIMATE.start_malloc_#res.offset| 2)) (.cse18 (= .cse11 .cse26)) (.cse1 (= (select .cse24 .cse11) ULTIMATE.start_main_~b~0.offset)) (.cse2 (= .cse20 ULTIMATE.start_main_~a~0.base)) (.cse3 (= ULTIMATE.start_main_~b~0.offset 2)) (.cse4 (= ULTIMATE.start_main_~b~0.base ULTIMATE.start_main_~a~0.base)) (.cse15 (= 0 ULTIMATE.start_main_~a~0.base)) (.cse5 (= ULTIMATE.start_f_~pointer.base ULTIMATE.start_main_~a~0.base)) (.cse6 (= ULTIMATE.start_f_~pointer.offset ULTIMATE.start_main_~b~0.offset)) (.cse7 (= 0 |ULTIMATE.start_malloc_#res.base|)) (.cse19 (= ULTIMATE.start_main_~a~0.offset 1)) (.cse21 (= 1 (select .cse25 0))) (.cse9 (= |~#pp~0.offset| 0)) (.cse10 (<= (+ |ULTIMATE.start_malloc_#res.offset| 1) ~counter~0)) (.cse8 (= 1 (select .cse25 .cse11))) (.cse23 (+ |~#pp~0.offset| (* 4 ULTIMATE.start_g_~i~2))) (.cse14 (<= 0 |~#pstate~0.offset|)) (.cse17 (not (= |~#pp~0.base| |~#pstate~0.base|)))) (or (and (<= 2 ULTIMATE.start_g_~i~2) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (and .cse8 .cse9 .cse10 (<= .cse11 .cse12) (<= (+ ULTIMATE.start_main_~a~0.offset 1) ULTIMATE.start_f_~pointer.offset)) .cse13) .cse14 .cse15 (<= 1 ULTIMATE.start_main_~a~0.offset) .cse16 .cse17) (and .cse18 .cse1 .cse2 .cse4 .cse19 (= ULTIMATE.start_g_~pointer.offset 1) .cse9 (= ULTIMATE.start_g_~pointer.base .cse20) .cse10 .cse0 .cse3 .cse21 .cse8 .cse15 .cse5 (= 0 ULTIMATE.start_g_~i~2) .cse6 .cse7 .cse14 .cse16 .cse17) (and .cse18 .cse1 .cse2 .cse4 (and (= ULTIMATE.start_g_~pointer.base (select .cse22 .cse23)) (= ULTIMATE.start_g_~pointer.offset (select .cse24 0))) .cse19 .cse9 .cse10 .cse0 .cse3 .cse8 .cse15 .cse5 .cse6 .cse7 .cse14 (= 1 ULTIMATE.start_g_~i~2) .cse16 .cse13 .cse17) (and .cse0 .cse18 .cse1 .cse2 .cse3 .cse4 .cse15 .cse5 .cse6 .cse7 (and (and (or (not (= ULTIMATE.start_g_~pointer.offset (select .cse24 .cse23))) (not (= .cse11 .cse23))) (and (<= |~#pstate~0.offset| 0) .cse19 .cse21) .cse9 .cse10 .cse8 (<= .cse11 .cse23)) .cse14 .cse17)))))) [2018-12-31 04:23:50,058 INFO L448 ceAbstractionStarter]: For program point L36-6(lines 36 42) no Hoare annotation was computed. [2018-12-31 04:23:50,058 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-12-31 04:23:50,058 INFO L444 ceAbstractionStarter]: At program point L36-7(lines 36 42) the Hoare annotation is: (let ((.cse27 (* 4 ULTIMATE.start_f_~i~1)) (.cse26 (+ |~#pstate~0.offset| 4))) (let ((.cse21 (select |#memory_int| |~#pstate~0.base|)) (.cse25 (select (select |#memory_$Pointer$.base| |~#pp~0.base|) .cse26)) (.cse24 (+ |~#pp~0.offset| .cse27)) (.cse28 (+ ULTIMATE.start_main_~a~0.offset 1)) (.cse23 (select |#memory_$Pointer$.offset| |~#pp~0.base|)) (.cse29 (+ |~#pp~0.offset| (* 4 ULTIMATE.start_g_~i~2)))) (let ((.cse15 (or (not (= ULTIMATE.start_g_~pointer.offset (select .cse23 .cse29))) (not (= .cse26 .cse29)))) (.cse18 (<= .cse28 ULTIMATE.start_f_~pointer.offset)) (.cse16 (<= .cse28 |ULTIMATE.start_malloc_#res.offset|)) (.cse19 (<= .cse26 .cse29)) (.cse1 (= .cse26 .cse24)) (.cse0 (= |ULTIMATE.start_malloc_#res.offset| 2)) (.cse2 (= (select .cse23 .cse26) ULTIMATE.start_main_~b~0.offset)) (.cse3 (= .cse25 ULTIMATE.start_main_~a~0.base)) (.cse4 (= ULTIMATE.start_main_~b~0.offset 2)) (.cse5 (= ULTIMATE.start_main_~b~0.base ULTIMATE.start_main_~a~0.base)) (.cse6 (= ULTIMATE.start_f_~pointer.base ULTIMATE.start_main_~a~0.base)) (.cse7 (= ULTIMATE.start_f_~pointer.offset ULTIMATE.start_main_~b~0.offset)) (.cse11 (= 0 |ULTIMATE.start_malloc_#res.base|)) (.cse8 (and (<= 1 ~counter~0) (<= |~#pstate~0.offset| 0) (<= .cse28 ULTIMATE.start_main_~b~0.offset) (= ULTIMATE.start_main_~a~0.offset 1) (= 0 |~#pp~0.offset|))) (.cse9 (<= (+ |ULTIMATE.start_malloc_#res.offset| 1) ~counter~0)) (.cse10 (= 1 (select .cse21 .cse26))) (.cse17 (<= .cse26 .cse27)) (.cse20 (= ULTIMATE.start_g_~pointer.base .cse25)) (.cse13 (= 0 ULTIMATE.start_main_~a~0.base)) (.cse12 (<= 0 |~#pstate~0.offset|)) (.cse22 (<= .cse24 7)) (.cse14 (not (= |~#pp~0.base| |~#pstate~0.base|)))) (or (and (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (and .cse8 .cse9 .cse10) .cse11) (<= 1 ULTIMATE.start_g_~i~2) .cse12 .cse13 .cse14) (and .cse15 .cse8 .cse16 .cse9 .cse10 .cse17 .cse12 (or (not .cse1) .cse18) .cse14 .cse19) (and .cse15 (= ULTIMATE.start_f_~i~1 0) .cse18 .cse8 .cse16 .cse9 .cse10 .cse12 .cse14 .cse19) (and .cse0 .cse20 .cse1 .cse2 .cse3 .cse4 .cse5 .cse13 .cse6 .cse7 .cse11 (and .cse9 (and (= ULTIMATE.start_g_~i~2 0) (<= 1 ULTIMATE.start_f_~i~1) (= 1 (select .cse21 0)) .cse8) .cse10) .cse14) (and (<= 2 ULTIMATE.start_g_~i~2) (and (= |ULTIMATE.start_malloc_#res.base| ULTIMATE.start_main_~a~0.base) .cse0 (and .cse7 .cse6) .cse11 (and .cse8 .cse9) .cse4 .cse5 .cse17) .cse12 .cse22 .cse14) (and (and .cse0 (= ULTIMATE.start_g_~pointer.offset 2) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse11 (and (= 0 ULTIMATE.start_g_~i~2) .cse8 .cse9 .cse10 .cse17) .cse20 (= 1 (select .cse23 |~#pp~0.offset|))) .cse13 .cse12 .cse22 .cse14))))) [2018-12-31 04:23:50,059 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-31 04:23:50,059 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2018-12-31 04:23:50,059 INFO L448 ceAbstractionStarter]: For program point L37(lines 37 41) no Hoare annotation was computed. [2018-12-31 04:23:50,059 INFO L448 ceAbstractionStarter]: For program point L4(lines 1 69) no Hoare annotation was computed. [2018-12-31 04:23:50,059 INFO L448 ceAbstractionStarter]: For program point L37-2(lines 37 41) no Hoare annotation was computed. [2018-12-31 04:23:50,059 INFO L448 ceAbstractionStarter]: For program point L4-1(lines 1 69) no Hoare annotation was computed. [2018-12-31 04:23:50,059 INFO L444 ceAbstractionStarter]: At program point L47(lines 46 49) the Hoare annotation is: (let ((.cse1 (+ |~#pstate~0.offset| 4)) (.cse0 (select |#memory_$Pointer$.base| |~#pp~0.base|)) (.cse2 (select |#memory_$Pointer$.offset| |~#pp~0.base|))) (and (= 0 (select .cse0 .cse1)) (<= |~#pstate~0.offset| 0) (<= ULTIMATE.start_init_~i~0 (+ (div (+ .cse1 (- |~#pp~0.offset|)) 4) 1)) (<= 1 |ULTIMATE.start_malloc_#res.offset|) (= 0 (select .cse2 .cse1)) (= ~counter~0 2) (= 0 (select .cse0 0)) (= |ULTIMATE.start_malloc_#res.base| 0) (= |~#pp~0.offset| 0) (<= (+ |ULTIMATE.start_malloc_#res.offset| 1) ~counter~0) (= 0 (select .cse2 |~#pp~0.offset|)) (<= 0 |~#pstate~0.offset|) (not (= |~#pp~0.base| |~#pstate~0.base|)))) [2018-12-31 04:23:50,060 INFO L444 ceAbstractionStarter]: At program point L47-1(lines 46 49) the Hoare annotation is: (let ((.cse1 (+ |~#pstate~0.offset| 4)) (.cse0 (select |#memory_$Pointer$.base| |~#pp~0.base|)) (.cse2 (select |#memory_$Pointer$.offset| |~#pp~0.base|))) (and (= |ULTIMATE.start_malloc_#res.offset| 2) (= 0 (select .cse0 .cse1)) (<= |~#pstate~0.offset| 0) (= 0 ULTIMATE.start_main_~a~0.base) (<= ULTIMATE.start_init_~i~0 (+ (div (+ .cse1 (- |~#pp~0.offset|)) 4) 1)) (= 0 (select .cse2 (+ |~#pp~0.offset| 4))) (= 0 |ULTIMATE.start_malloc_#res.base|) (= ULTIMATE.start_main_~a~0.offset 1) (= 0 (select .cse0 0)) (= |~#pp~0.offset| 0) (<= (+ |ULTIMATE.start_malloc_#res.offset| 1) ~counter~0) (= 0 (select .cse2 |~#pp~0.offset|)) (<= 0 |~#pstate~0.offset|) (not (= |~#pp~0.base| |~#pstate~0.base|)))) [2018-12-31 04:23:50,060 INFO L448 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2018-12-31 04:23:50,060 INFO L448 ceAbstractionStarter]: For program point L6(line 6) no Hoare annotation was computed. [2018-12-31 04:23:50,060 INFO L448 ceAbstractionStarter]: For program point L39-2(line 39) no Hoare annotation was computed. [2018-12-31 04:23:50,060 INFO L448 ceAbstractionStarter]: For program point L6-1(line 6) no Hoare annotation was computed. [2018-12-31 04:23:50,060 INFO L448 ceAbstractionStarter]: For program point L23(lines 23 32) no Hoare annotation was computed. [2018-12-31 04:23:50,060 INFO L448 ceAbstractionStarter]: For program point L23-1(lines 23 32) no Hoare annotation was computed. [2018-12-31 04:23:50,060 INFO L448 ceAbstractionStarter]: For program point L15(lines 15 21) no Hoare annotation was computed. [2018-12-31 04:23:50,060 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-12-31 04:23:50,060 INFO L448 ceAbstractionStarter]: For program point L57(lines 57 58) no Hoare annotation was computed. [2018-12-31 04:23:50,060 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-31 04:23:50,060 INFO L448 ceAbstractionStarter]: For program point L25-2(lines 25 31) no Hoare annotation was computed. [2018-12-31 04:23:50,061 INFO L444 ceAbstractionStarter]: At program point L25-3(lines 25 31) the Hoare annotation is: (let ((.cse0 (* 4 ULTIMATE.start_f_~i~1)) (.cse2 (+ |~#pstate~0.offset| 4)) (.cse1 (select |#memory_$Pointer$.base| |~#pp~0.base|)) (.cse3 (select |#memory_$Pointer$.offset| |~#pp~0.base|))) (and (= 0 (+ |~#pstate~0.offset| .cse0)) (= |ULTIMATE.start_malloc_#res.offset| 2) (= ULTIMATE.start_f_~i~1 0) (= ULTIMATE.start_main_~b~0.offset 2) (= ULTIMATE.start_main_~b~0.base ULTIMATE.start_main_~a~0.base) (= 0 ULTIMATE.start_main_~a~0.base) (= 0 (select (store .cse1 (+ |~#pp~0.offset| .cse0) ULTIMATE.start_f_~pointer.base) .cse2)) (= ULTIMATE.start_f_~pointer.base ULTIMATE.start_main_~a~0.base) (<= ULTIMATE.start_init_~i~0 (+ (div (+ .cse2 (- |~#pp~0.offset|)) 4) 1)) (= 0 (select .cse3 (+ |~#pp~0.offset| 4))) (= 0 |ULTIMATE.start_malloc_#res.base|) (= ULTIMATE.start_main_~a~0.offset 1) (= 0 (select .cse1 0)) (= |~#pp~0.offset| 0) (= 1 ULTIMATE.start_f_~pointer.offset) (<= (+ |ULTIMATE.start_malloc_#res.offset| 1) ~counter~0) (= 0 (select .cse3 |~#pp~0.offset|)) (not (= |~#pp~0.base| |~#pstate~0.base|)))) [2018-12-31 04:23:50,061 INFO L448 ceAbstractionStarter]: For program point L25-6(lines 25 31) no Hoare annotation was computed. [2018-12-31 04:23:50,061 INFO L444 ceAbstractionStarter]: At program point L25-7(lines 25 31) the Hoare annotation is: (let ((.cse11 (select |#memory_$Pointer$.base| |~#pp~0.base|)) (.cse13 (+ |~#pstate~0.offset| 4)) (.cse20 (select |#memory_$Pointer$.offset| |~#pp~0.base|))) (let ((.cse0 (= ULTIMATE.start_main_~b~0.base ULTIMATE.start_main_~a~0.base)) (.cse18 (select .cse20 |~#pp~0.offset|)) (.cse1 (<= ULTIMATE.start_init_~i~0 (+ (div (+ .cse13 (- |~#pp~0.offset|)) 4) 1))) (.cse2 (= 0 (select .cse20 .cse13))) (.cse3 (= ULTIMATE.start_main_~a~0.offset 1)) (.cse4 (= |~#pp~0.offset| 0)) (.cse5 (= (select .cse11 ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.base)) (.cse6 (<= (+ |ULTIMATE.start_malloc_#res.offset| 1) ~counter~0)) (.cse7 (= |ULTIMATE.start_malloc_#res.offset| 2)) (.cse8 (= ULTIMATE.start_main_~b~0.offset 2)) (.cse9 (= 1 (select (select |#memory_int| |~#pstate~0.base|) 0))) (.cse10 (= 0 ULTIMATE.start_main_~a~0.base)) (.cse14 (= ULTIMATE.start_f_~pointer.base ULTIMATE.start_main_~a~0.base)) (.cse15 (= ULTIMATE.start_f_~pointer.offset ULTIMATE.start_main_~b~0.offset)) (.cse16 (= 0 |ULTIMATE.start_malloc_#res.base|)) (.cse17 (<= 0 |~#pstate~0.offset|)) (.cse12 (+ |~#pp~0.offset| (* 4 ULTIMATE.start_f_~i~1))) (.cse19 (not (= |~#pp~0.base| |~#pstate~0.base|)))) (or (and (<= |~#pstate~0.offset| 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ULTIMATE.start_f_~i~1 0) .cse8 .cse9 .cse10 (= 0 (select (store .cse11 .cse12 ULTIMATE.start_f_~pointer.base) .cse13)) .cse14 .cse15 .cse16 .cse17 (= 1 .cse18) .cse19) (and (= 0 (select .cse11 .cse13)) (= .cse13 .cse12) .cse0 (= ULTIMATE.start_main_~a~0.offset .cse18) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse14 .cse15 .cse16 .cse17 (<= .cse12 7) .cse19)))) [2018-12-31 04:23:50,061 INFO L448 ceAbstractionStarter]: For program point L17-2(lines 17 20) no Hoare annotation was computed. [2018-12-31 04:23:50,061 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2018-12-31 04:23:50,062 INFO L444 ceAbstractionStarter]: At program point L17-3(lines 17 20) the Hoare annotation is: (let ((.cse1 (+ |~#pstate~0.offset| 4)) (.cse0 (select |#memory_$Pointer$.base| |~#pp~0.base|)) (.cse2 (select |#memory_$Pointer$.offset| |~#pp~0.base|))) (and (= 0 (select .cse0 .cse1)) (<= ULTIMATE.start_init_~i~0 (+ (div (+ .cse1 (- |~#pp~0.offset|)) 4) 1)) (<= |~#pstate~0.offset| 0) (= 0 (select .cse2 .cse1)) (= 0 (select .cse0 0)) (= |~#pp~0.offset| 0) (= ~counter~0 1) (= 0 (select .cse2 |~#pp~0.offset|)) (<= 0 |~#pstate~0.offset|) (not (= |~#pp~0.base| |~#pstate~0.base|)))) [2018-12-31 04:23:50,063 INFO L448 ceAbstractionStarter]: For program point L34(lines 34 43) no Hoare annotation was computed. [2018-12-31 04:23:50,063 INFO L448 ceAbstractionStarter]: For program point L34-1(lines 34 43) no Hoare annotation was computed. [2018-12-31 04:23:50,063 INFO L448 ceAbstractionStarter]: For program point L26(lines 26 30) no Hoare annotation was computed. [2018-12-31 04:23:50,063 INFO L448 ceAbstractionStarter]: For program point L26-1(lines 26 30) no Hoare annotation was computed. [2018-12-31 04:23:50,063 INFO L451 ceAbstractionStarter]: At program point L68(lines 51 69) the Hoare annotation is: true [2018-12-31 04:23:50,083 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 04:23:50,085 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 04:23:50,085 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 04:23:50,085 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 04:23:50,088 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,089 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,089 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,089 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,092 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 04:23:50,093 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 04:23:50,093 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 04:23:50,093 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 04:23:50,094 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,094 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,096 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,097 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,099 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 04:23:50,100 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 04:23:50,100 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 04:23:50,100 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 04:23:50,103 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,104 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,104 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,104 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,105 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 04:23:50,106 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 04:23:50,108 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 04:23:50,108 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 04:23:50,109 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,109 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,109 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,110 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,111 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 04:23:50,111 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 04:23:50,112 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 04:23:50,113 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 04:23:50,113 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 04:23:50,114 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 04:23:50,114 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 04:23:50,115 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 04:23:50,115 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 04:23:50,115 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 04:23:50,116 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 04:23:50,116 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 04:23:50,117 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 04:23:50,117 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 04:23:50,119 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,120 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,120 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 04:23:50,120 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,121 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,121 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,121 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,122 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 04:23:50,122 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 04:23:50,122 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,123 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,123 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,123 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,123 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 04:23:50,124 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,124 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,124 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,125 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,125 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 04:23:50,125 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 04:23:50,127 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 04:23:50,127 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 04:23:50,128 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 04:23:50,128 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 04:23:50,128 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 04:23:50,129 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 04:23:50,130 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 04:23:50,130 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 04:23:50,130 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 04:23:50,131 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 04:23:50,131 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 04:23:50,132 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 04:23:50,132 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 04:23:50,132 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 04:23:50,135 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,135 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,135 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 04:23:50,136 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,136 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,136 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,137 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,137 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 04:23:50,137 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 04:23:50,137 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,138 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,138 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,138 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,139 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 04:23:50,139 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,139 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,139 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,140 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,140 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 04:23:50,140 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 04:23:50,142 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 04:23:50,142 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 04:23:50,143 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 04:23:50,143 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 04:23:50,143 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 04:23:50,144 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 04:23:50,144 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 04:23:50,144 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 04:23:50,146 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,146 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,146 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 04:23:50,147 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,147 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,147 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,147 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,148 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,148 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,148 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 04:23:50,149 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 04:23:50,150 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 04:23:50,150 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 04:23:50,151 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 04:23:50,151 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 04:23:50,151 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 04:23:50,152 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 04:23:50,152 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 04:23:50,153 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,154 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,154 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 04:23:50,154 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,155 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,155 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,155 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,155 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,156 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,156 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 04:23:50,157 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 04:23:50,158 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 04:23:50,158 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 04:23:50,159 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 04:23:50,159 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 04:23:50,160 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 04:23:50,160 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 04:23:50,161 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 04:23:50,161 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 04:23:50,161 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 04:23:50,162 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 04:23:50,164 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,164 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,164 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 04:23:50,165 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,165 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 04:23:50,165 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,166 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 04:23:50,166 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,166 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,166 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,167 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 04:23:50,167 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 04:23:50,167 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,168 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,168 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 04:23:50,168 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,168 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,170 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 04:23:50,170 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 04:23:50,170 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 04:23:50,171 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 04:23:50,171 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 04:23:50,172 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 04:23:50,172 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 04:23:50,173 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 04:23:50,173 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 04:23:50,174 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 04:23:50,174 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 04:23:50,176 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,176 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,176 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 04:23:50,177 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,177 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 04:23:50,177 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,177 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 04:23:50,178 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,178 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,178 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,178 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 04:23:50,179 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 04:23:50,179 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,179 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,180 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 04:23:50,180 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,180 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,181 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 04:23:50,182 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 04:23:50,182 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 04:23:50,182 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 04:23:50,183 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,183 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,183 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,183 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,184 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 04:23:50,184 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 04:23:50,184 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 04:23:50,185 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 04:23:50,185 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,185 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,186 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,186 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,186 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 04:23:50,187 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 04:23:50,187 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 04:23:50,187 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 04:23:50,188 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,188 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,188 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,188 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,189 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 04:23:50,189 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 04:23:50,189 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 04:23:50,189 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 04:23:50,190 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,190 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,190 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,190 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,193 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 04:23:50 BoogieIcfgContainer [2018-12-31 04:23:50,193 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 04:23:50,193 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 04:23:50,193 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 04:23:50,194 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 04:23:50,194 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 04:22:43" (3/4) ... [2018-12-31 04:23:50,199 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-31 04:23:50,213 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2018-12-31 04:23:50,213 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-12-31 04:23:50,256 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((0 == #memory_$Pointer$[pp][pstate + 4] && pstate <= 0) && i <= (pstate + 4 + -pp) / 4 + 1) && 1 <= \result) && 0 == #memory_$Pointer$[pp][pstate + 4]) && counter == 2) && 0 == #memory_$Pointer$[pp][0]) && \result == 0) && pp == 0) && \result + 1 <= counter) && 0 == #memory_$Pointer$[pp][pp]) && 0 <= pstate) && !(pp == pstate) [2018-12-31 04:23:50,256 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((\result == 2 && 0 == #memory_$Pointer$[pp][pstate + 4]) && pstate <= 0) && 0 == a) && i <= (pstate + 4 + -pp) / 4 + 1) && 0 == #memory_$Pointer$[pp][pp + 4]) && 0 == \result) && a == 1) && 0 == #memory_$Pointer$[pp][0]) && pp == 0) && \result + 1 <= counter) && 0 == #memory_$Pointer$[pp][pp]) && 0 <= pstate) && !(pp == pstate) [2018-12-31 04:23:50,256 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((0 == pstate + 4 * i && \result == 2) && i == 0) && b == 2) && b == a) && 0 == a) && 0 == #memory_$Pointer$[pp][pp + 4 * i := pointer][pstate + 4]) && pointer == a) && i <= (pstate + 4 + -pp) / 4 + 1) && 0 == #memory_$Pointer$[pp][pp + 4]) && 0 == \result) && a == 1) && 0 == #memory_$Pointer$[pp][0]) && pp == 0) && 1 == pointer) && \result + 1 <= counter) && 0 == #memory_$Pointer$[pp][pp]) && !(pp == pstate) [2018-12-31 04:23:50,257 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((pstate <= 0 && b == a) && i <= (pstate + 4 + -pp) / 4 + 1) && 0 == #memory_$Pointer$[pp][pstate + 4]) && a == 1) && pp == 0) && #memory_$Pointer$[pp][a] == a) && \result + 1 <= counter) && \result == 2) && i == 0) && b == 2) && 1 == unknown-#memory_int-unknown[pstate][0]) && 0 == a) && 0 == #memory_$Pointer$[pp][pp + 4 * i := pointer][pstate + 4]) && pointer == a) && pointer == b) && 0 == \result) && 0 <= pstate) && 1 == #memory_$Pointer$[pp][pp]) && !(pp == pstate)) || (((((((((((((((((((0 == #memory_$Pointer$[pp][pstate + 4] && pstate + 4 == pp + 4 * i) && b == a) && a == #memory_$Pointer$[pp][pp]) && i <= (pstate + 4 + -pp) / 4 + 1) && 0 == #memory_$Pointer$[pp][pstate + 4]) && a == 1) && pp == 0) && #memory_$Pointer$[pp][a] == a) && \result + 1 <= counter) && \result == 2) && b == 2) && 1 == unknown-#memory_int-unknown[pstate][0]) && 0 == a) && pointer == a) && pointer == b) && 0 == \result) && 0 <= pstate) && pp + 4 * i <= 7) && !(pp == pstate)) [2018-12-31 04:23:50,257 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((2 <= i && ((((((((\result == 2 && #memory_$Pointer$[pp][pstate + 4] == b) && #memory_$Pointer$[pp][pstate + 4] == a) && b == 2) && b == a) && pointer == a) && pointer == b) && 0 == \result) && (((1 == unknown-#memory_int-unknown[pstate][pstate + 4] && pp == 0) && \result + 1 <= counter) && pstate + 4 <= 4 * i) && a + 1 <= pointer) && 1 == #memory_$Pointer$[pp][pp]) && 0 <= pstate) && 0 == a) && 1 <= a) && pp + 4 * i <= 7) && !(pp == pstate)) || ((((((((((((((((((((pstate + 4 == pp + 4 * i && #memory_$Pointer$[pp][pstate + 4] == b) && #memory_$Pointer$[pp][pstate + 4] == a) && b == a) && a == 1) && pointer == 1) && pp == 0) && pointer == #memory_$Pointer$[pp][pstate + 4]) && \result + 1 <= counter) && \result == 2) && b == 2) && 1 == unknown-#memory_int-unknown[pstate][0]) && 1 == unknown-#memory_int-unknown[pstate][pstate + 4]) && 0 == a) && pointer == a) && 0 == i) && pointer == b) && 0 == \result) && 0 <= pstate) && pp + 4 * i <= 7) && !(pp == pstate))) || (((((((((((((((((((pstate + 4 == pp + 4 * i && #memory_$Pointer$[pp][pstate + 4] == b) && #memory_$Pointer$[pp][pstate + 4] == a) && b == a) && pointer == #memory_$Pointer$[pp][pp + 4 * i] && pointer == #memory_$Pointer$[pp][0]) && a == 1) && pp == 0) && \result + 1 <= counter) && \result == 2) && b == 2) && 1 == unknown-#memory_int-unknown[pstate][pstate + 4]) && 0 == a) && pointer == a) && pointer == b) && 0 == \result) && 0 <= pstate) && 1 == i) && pp + 4 * i <= 7) && 1 == #memory_$Pointer$[pp][pp]) && !(pp == pstate))) || ((((((((((\result == 2 && pstate + 4 == pp + 4 * i) && #memory_$Pointer$[pp][pstate + 4] == b) && #memory_$Pointer$[pp][pstate + 4] == a) && b == 2) && b == a) && 0 == a) && pointer == a) && pointer == b) && 0 == \result) && (((((((!(pointer == #memory_$Pointer$[pp][pp + 4 * i]) || !(pstate + 4 == pp + 4 * i)) && (pstate <= 0 && a == 1) && 1 == unknown-#memory_int-unknown[pstate][0]) && pp == 0) && \result + 1 <= counter) && 1 == unknown-#memory_int-unknown[pstate][pstate + 4]) && pstate + 4 <= pp + 4 * i) && 0 <= pstate) && !(pp == pstate)) [2018-12-31 04:23:50,258 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((\result == 2 && pstate + 4 == pp + 4 * i) && #memory_$Pointer$[pp][pstate + 4] == b) && #memory_$Pointer$[pp][pstate + 4] == a) && b == 2) && b == a) && pointer == a) && pointer == b) && (((((1 <= counter && pstate <= 0) && a + 1 <= b) && a == 1) && 0 == pp) && \result + 1 <= counter) && 1 == unknown-#memory_int-unknown[pstate][pstate + 4]) && 0 == \result) && 1 <= i) && 0 <= pstate) && 0 == a) && !(pp == pstate)) || ((((((((((!(pointer == #memory_$Pointer$[pp][pp + 4 * i]) || !(pstate + 4 == pp + 4 * i)) && (((1 <= counter && pstate <= 0) && a + 1 <= b) && a == 1) && 0 == pp) && a + 1 <= \result) && \result + 1 <= counter) && 1 == unknown-#memory_int-unknown[pstate][pstate + 4]) && pstate + 4 <= 4 * i) && 0 <= pstate) && (!(pstate + 4 == pp + 4 * i) || a + 1 <= pointer)) && !(pp == pstate)) && pstate + 4 <= pp + 4 * i)) || ((((((((((!(pointer == #memory_$Pointer$[pp][pp + 4 * i]) || !(pstate + 4 == pp + 4 * i)) && i == 0) && a + 1 <= pointer) && (((1 <= counter && pstate <= 0) && a + 1 <= b) && a == 1) && 0 == pp) && a + 1 <= \result) && \result + 1 <= counter) && 1 == unknown-#memory_int-unknown[pstate][pstate + 4]) && 0 <= pstate) && !(pp == pstate)) && pstate + 4 <= pp + 4 * i)) || ((((((((((((\result == 2 && pointer == #memory_$Pointer$[pp][pstate + 4]) && pstate + 4 == pp + 4 * i) && #memory_$Pointer$[pp][pstate + 4] == b) && #memory_$Pointer$[pp][pstate + 4] == a) && b == 2) && b == a) && 0 == a) && pointer == a) && pointer == b) && 0 == \result) && (\result + 1 <= counter && ((i == 0 && 1 <= i) && 1 == unknown-#memory_int-unknown[pstate][0]) && (((1 <= counter && pstate <= 0) && a + 1 <= b) && a == 1) && 0 == pp) && 1 == unknown-#memory_int-unknown[pstate][pstate + 4]) && !(pp == pstate))) || ((((2 <= i && ((((((\result == a && \result == 2) && pointer == b && pointer == a) && 0 == \result) && ((((1 <= counter && pstate <= 0) && a + 1 <= b) && a == 1) && 0 == pp) && \result + 1 <= counter) && b == 2) && b == a) && pstate + 4 <= 4 * i) && 0 <= pstate) && pp + 4 * i <= 7) && !(pp == pstate))) || (((((((((((((((\result == 2 && pointer == 2) && #memory_$Pointer$[pp][pstate + 4] == b) && #memory_$Pointer$[pp][pstate + 4] == a) && b == 2) && b == a) && pointer == a) && pointer == b) && 0 == \result) && (((0 == i && (((1 <= counter && pstate <= 0) && a + 1 <= b) && a == 1) && 0 == pp) && \result + 1 <= counter) && 1 == unknown-#memory_int-unknown[pstate][pstate + 4]) && pstate + 4 <= 4 * i) && pointer == #memory_$Pointer$[pp][pstate + 4]) && 1 == #memory_$Pointer$[pp][pp]) && 0 == a) && 0 <= pstate) && pp + 4 * i <= 7) && !(pp == pstate)) [2018-12-31 04:23:50,289 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 04:23:50,289 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 04:23:50,290 INFO L168 Benchmark]: Toolchain (without parser) took 67622.37 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 511.7 MB). Free memory was 948.7 MB in the beginning and 1.2 GB in the end (delta: -288.3 MB). Peak memory consumption was 223.4 MB. Max. memory is 11.5 GB. [2018-12-31 04:23:50,291 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 04:23:50,291 INFO L168 Benchmark]: CACSL2BoogieTranslator took 300.38 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 937.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-31 04:23:50,291 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.81 ms. Allocated memory is still 1.0 GB. Free memory was 937.9 MB in the beginning and 932.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-31 04:23:50,292 INFO L168 Benchmark]: Boogie Preprocessor took 129.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -194.7 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. [2018-12-31 04:23:50,292 INFO L168 Benchmark]: RCFGBuilder took 652.49 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 31.6 MB). Peak memory consumption was 31.6 MB. Max. memory is 11.5 GB. [2018-12-31 04:23:50,293 INFO L168 Benchmark]: TraceAbstraction took 66387.26 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 372.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -141.3 MB). Peak memory consumption was 632.8 MB. Max. memory is 11.5 GB. [2018-12-31 04:23:50,293 INFO L168 Benchmark]: Witness Printer took 95.84 ms. Allocated memory is still 1.5 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2018-12-31 04:23:50,296 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 300.38 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 937.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 51.81 ms. Allocated memory is still 1.0 GB. Free memory was 937.9 MB in the beginning and 932.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 129.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -194.7 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 652.49 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 31.6 MB). Peak memory consumption was 31.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 66387.26 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 372.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -141.3 MB). Peak memory consumption was 632.8 MB. Max. memory is 11.5 GB. * Witness Printer took 95.84 ms. Allocated memory is still 1.5 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 6]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 6]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: 46]: Loop Invariant [2018-12-31 04:23:50,305 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 04:23:50,305 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 04:23:50,305 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 04:23:50,306 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 04:23:50,306 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,306 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,306 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,307 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,307 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 04:23:50,307 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 04:23:50,307 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 04:23:50,308 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 04:23:50,308 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,309 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,309 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,309 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: (((((((((((0 == #memory_$Pointer$[pp][pstate + 4] && pstate <= 0) && i <= (pstate + 4 + -pp) / 4 + 1) && 1 <= \result) && 0 == #memory_$Pointer$[pp][pstate + 4]) && counter == 2) && 0 == #memory_$Pointer$[pp][0]) && \result == 0) && pp == 0) && \result + 1 <= counter) && 0 == #memory_$Pointer$[pp][pp]) && 0 <= pstate) && !(pp == pstate) - InvariantResult [Line: 25]: Loop Invariant [2018-12-31 04:23:50,309 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 04:23:50,310 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 04:23:50,310 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 04:23:50,310 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 04:23:50,310 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,318 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,319 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,319 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,319 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 04:23:50,320 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 04:23:50,320 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 04:23:50,320 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 04:23:50,320 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,321 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,321 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,321 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((((((((((((((((0 == pstate + 4 * i && \result == 2) && i == 0) && b == 2) && b == a) && 0 == a) && 0 == #memory_$Pointer$[pp][pp + 4 * i := pointer][pstate + 4]) && pointer == a) && i <= (pstate + 4 + -pp) / 4 + 1) && 0 == #memory_$Pointer$[pp][pp + 4]) && 0 == \result) && a == 1) && 0 == #memory_$Pointer$[pp][0]) && pp == 0) && 1 == pointer) && \result + 1 <= counter) && 0 == #memory_$Pointer$[pp][pp]) && !(pp == pstate) - InvariantResult [Line: 36]: Loop Invariant [2018-12-31 04:23:50,322 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 04:23:50,325 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 04:23:50,325 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 04:23:50,326 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 04:23:50,326 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 04:23:50,326 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 04:23:50,326 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 04:23:50,327 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 04:23:50,327 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 04:23:50,328 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 04:23:50,328 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 04:23:50,328 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 04:23:50,328 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 04:23:50,329 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 04:23:50,330 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,331 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,331 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 04:23:50,331 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,331 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,332 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,332 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,332 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 04:23:50,332 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 04:23:50,333 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,333 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,333 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,333 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,334 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 04:23:50,334 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,334 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,334 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,334 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,337 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 04:23:50,337 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 04:23:50,338 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 04:23:50,339 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 04:23:50,339 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 04:23:50,339 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 04:23:50,339 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 04:23:50,340 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 04:23:50,340 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 04:23:50,340 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 04:23:50,340 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 04:23:50,343 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 04:23:50,343 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 04:23:50,343 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 04:23:50,343 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 04:23:50,344 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 04:23:50,345 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,345 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,345 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 04:23:50,345 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,345 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,347 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,348 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,348 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 04:23:50,348 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 04:23:50,348 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,349 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,349 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,349 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,349 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 04:23:50,350 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,350 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,350 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,350 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,350 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 04:23:50,350 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((((((((2 <= i && ((((((((\result == 2 && #memory_$Pointer$[pp][pstate + 4] == b) && #memory_$Pointer$[pp][pstate + 4] == a) && b == 2) && b == a) && pointer == a) && pointer == b) && 0 == \result) && (((1 == unknown-#memory_int-unknown[pstate][pstate + 4] && pp == 0) && \result + 1 <= counter) && pstate + 4 <= 4 * i) && a + 1 <= pointer) && 1 == #memory_$Pointer$[pp][pp]) && 0 <= pstate) && 0 == a) && 1 <= a) && pp + 4 * i <= 7) && !(pp == pstate)) || ((((((((((((((((((((pstate + 4 == pp + 4 * i && #memory_$Pointer$[pp][pstate + 4] == b) && #memory_$Pointer$[pp][pstate + 4] == a) && b == a) && a == 1) && pointer == 1) && pp == 0) && pointer == #memory_$Pointer$[pp][pstate + 4]) && \result + 1 <= counter) && \result == 2) && b == 2) && 1 == unknown-#memory_int-unknown[pstate][0]) && 1 == unknown-#memory_int-unknown[pstate][pstate + 4]) && 0 == a) && pointer == a) && 0 == i) && pointer == b) && 0 == \result) && 0 <= pstate) && pp + 4 * i <= 7) && !(pp == pstate))) || (((((((((((((((((((pstate + 4 == pp + 4 * i && #memory_$Pointer$[pp][pstate + 4] == b) && #memory_$Pointer$[pp][pstate + 4] == a) && b == a) && pointer == #memory_$Pointer$[pp][pp + 4 * i] && pointer == #memory_$Pointer$[pp][0]) && a == 1) && pp == 0) && \result + 1 <= counter) && \result == 2) && b == 2) && 1 == unknown-#memory_int-unknown[pstate][pstate + 4]) && 0 == a) && pointer == a) && pointer == b) && 0 == \result) && 0 <= pstate) && 1 == i) && pp + 4 * i <= 7) && 1 == #memory_$Pointer$[pp][pp]) && !(pp == pstate))) || ((((((((((\result == 2 && pstate + 4 == pp + 4 * i) && #memory_$Pointer$[pp][pstate + 4] == b) && #memory_$Pointer$[pp][pstate + 4] == a) && b == 2) && b == a) && 0 == a) && pointer == a) && pointer == b) && 0 == \result) && (((((((!(pointer == #memory_$Pointer$[pp][pp + 4 * i]) || !(pstate + 4 == pp + 4 * i)) && (pstate <= 0 && a == 1) && 1 == unknown-#memory_int-unknown[pstate][0]) && pp == 0) && \result + 1 <= counter) && 1 == unknown-#memory_int-unknown[pstate][pstate + 4]) && pstate + 4 <= pp + 4 * i) && 0 <= pstate) && !(pp == pstate)) - InvariantResult [Line: 25]: Loop Invariant [2018-12-31 04:23:50,351 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 04:23:50,352 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 04:23:50,352 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 04:23:50,352 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 04:23:50,352 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 04:23:50,352 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 04:23:50,353 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 04:23:50,353 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 04:23:50,354 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,354 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,354 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 04:23:50,354 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,354 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,355 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,355 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,355 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,355 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,355 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 04:23:50,356 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 04:23:50,356 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 04:23:50,356 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 04:23:50,357 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 04:23:50,357 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 04:23:50,357 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 04:23:50,357 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 04:23:50,358 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 04:23:50,359 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,359 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,360 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 04:23:50,360 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,360 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,360 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,360 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,361 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,361 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,361 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: (((((((((((((((((((pstate <= 0 && b == a) && i <= (pstate + 4 + -pp) / 4 + 1) && 0 == #memory_$Pointer$[pp][pstate + 4]) && a == 1) && pp == 0) && #memory_$Pointer$[pp][a] == a) && \result + 1 <= counter) && \result == 2) && i == 0) && b == 2) && 1 == unknown-#memory_int-unknown[pstate][0]) && 0 == a) && 0 == #memory_$Pointer$[pp][pp + 4 * i := pointer][pstate + 4]) && pointer == a) && pointer == b) && 0 == \result) && 0 <= pstate) && 1 == #memory_$Pointer$[pp][pp]) && !(pp == pstate)) || (((((((((((((((((((0 == #memory_$Pointer$[pp][pstate + 4] && pstate + 4 == pp + 4 * i) && b == a) && a == #memory_$Pointer$[pp][pp]) && i <= (pstate + 4 + -pp) / 4 + 1) && 0 == #memory_$Pointer$[pp][pstate + 4]) && a == 1) && pp == 0) && #memory_$Pointer$[pp][a] == a) && \result + 1 <= counter) && \result == 2) && b == 2) && 1 == unknown-#memory_int-unknown[pstate][0]) && 0 == a) && pointer == a) && pointer == b) && 0 == \result) && 0 <= pstate) && pp + 4 * i <= 7) && !(pp == pstate)) - InvariantResult [Line: 36]: Loop Invariant [2018-12-31 04:23:50,362 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 04:23:50,362 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 04:23:50,362 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 04:23:50,363 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 04:23:50,363 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 04:23:50,363 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 04:23:50,363 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 04:23:50,364 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 04:23:50,364 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 04:23:50,364 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 04:23:50,364 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 04:23:50,367 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,367 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,368 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 04:23:50,368 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,368 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 04:23:50,368 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,369 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 04:23:50,377 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,377 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,377 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,377 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 04:23:50,378 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 04:23:50,378 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,378 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,378 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 04:23:50,379 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,379 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,379 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 04:23:50,380 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 04:23:50,381 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 04:23:50,381 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 04:23:50,381 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 04:23:50,381 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 04:23:50,382 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 04:23:50,382 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 04:23:50,382 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 04:23:50,385 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 04:23:50,385 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 04:23:50,386 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,386 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,387 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 04:23:50,387 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,387 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 04:23:50,391 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,391 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 04:23:50,406 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,406 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,406 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,406 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 04:23:50,407 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 04:23:50,407 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,407 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,407 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 04:23:50,407 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,408 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: (((((((((((((((((\result == 2 && pstate + 4 == pp + 4 * i) && #memory_$Pointer$[pp][pstate + 4] == b) && #memory_$Pointer$[pp][pstate + 4] == a) && b == 2) && b == a) && pointer == a) && pointer == b) && (((((1 <= counter && pstate <= 0) && a + 1 <= b) && a == 1) && 0 == pp) && \result + 1 <= counter) && 1 == unknown-#memory_int-unknown[pstate][pstate + 4]) && 0 == \result) && 1 <= i) && 0 <= pstate) && 0 == a) && !(pp == pstate)) || ((((((((((!(pointer == #memory_$Pointer$[pp][pp + 4 * i]) || !(pstate + 4 == pp + 4 * i)) && (((1 <= counter && pstate <= 0) && a + 1 <= b) && a == 1) && 0 == pp) && a + 1 <= \result) && \result + 1 <= counter) && 1 == unknown-#memory_int-unknown[pstate][pstate + 4]) && pstate + 4 <= 4 * i) && 0 <= pstate) && (!(pstate + 4 == pp + 4 * i) || a + 1 <= pointer)) && !(pp == pstate)) && pstate + 4 <= pp + 4 * i)) || ((((((((((!(pointer == #memory_$Pointer$[pp][pp + 4 * i]) || !(pstate + 4 == pp + 4 * i)) && i == 0) && a + 1 <= pointer) && (((1 <= counter && pstate <= 0) && a + 1 <= b) && a == 1) && 0 == pp) && a + 1 <= \result) && \result + 1 <= counter) && 1 == unknown-#memory_int-unknown[pstate][pstate + 4]) && 0 <= pstate) && !(pp == pstate)) && pstate + 4 <= pp + 4 * i)) || ((((((((((((\result == 2 && pointer == #memory_$Pointer$[pp][pstate + 4]) && pstate + 4 == pp + 4 * i) && #memory_$Pointer$[pp][pstate + 4] == b) && #memory_$Pointer$[pp][pstate + 4] == a) && b == 2) && b == a) && 0 == a) && pointer == a) && pointer == b) && 0 == \result) && (\result + 1 <= counter && ((i == 0 && 1 <= i) && 1 == unknown-#memory_int-unknown[pstate][0]) && (((1 <= counter && pstate <= 0) && a + 1 <= b) && a == 1) && 0 == pp) && 1 == unknown-#memory_int-unknown[pstate][pstate + 4]) && !(pp == pstate))) || ((((2 <= i && ((((((\result == a && \result == 2) && pointer == b && pointer == a) && 0 == \result) && ((((1 <= counter && pstate <= 0) && a + 1 <= b) && a == 1) && 0 == pp) && \result + 1 <= counter) && b == 2) && b == a) && pstate + 4 <= 4 * i) && 0 <= pstate) && pp + 4 * i <= 7) && !(pp == pstate))) || (((((((((((((((\result == 2 && pointer == 2) && #memory_$Pointer$[pp][pstate + 4] == b) && #memory_$Pointer$[pp][pstate + 4] == a) && b == 2) && b == a) && pointer == a) && pointer == b) && 0 == \result) && (((0 == i && (((1 <= counter && pstate <= 0) && a + 1 <= b) && a == 1) && 0 == pp) && \result + 1 <= counter) && 1 == unknown-#memory_int-unknown[pstate][pstate + 4]) && pstate + 4 <= 4 * i) && pointer == #memory_$Pointer$[pp][pstate + 4]) && 1 == #memory_$Pointer$[pp][pp]) && 0 == a) && 0 <= pstate) && pp + 4 * i <= 7) && !(pp == pstate)) - InvariantResult [Line: 46]: Loop Invariant [2018-12-31 04:23:50,408 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 04:23:50,409 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 04:23:50,432 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 04:23:50,432 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 04:23:50,432 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,433 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,433 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,433 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,433 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 04:23:50,434 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 04:23:50,435 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 04:23:50,435 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 04:23:50,435 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,435 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,436 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,436 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((((((((((((\result == 2 && 0 == #memory_$Pointer$[pp][pstate + 4]) && pstate <= 0) && 0 == a) && i <= (pstate + 4 + -pp) / 4 + 1) && 0 == #memory_$Pointer$[pp][pp + 4]) && 0 == \result) && a == 1) && 0 == #memory_$Pointer$[pp][0]) && pp == 0) && \result + 1 <= counter) && 0 == #memory_$Pointer$[pp][pp]) && 0 <= pstate) && !(pp == pstate) - InvariantResult [Line: 17]: Loop Invariant [2018-12-31 04:23:50,436 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 04:23:50,436 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 04:23:50,437 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 04:23:50,437 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 04:23:50,437 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,440 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,440 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,441 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,441 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 04:23:50,462 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 04:23:50,462 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 04:23:50,462 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 04:23:50,462 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,463 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,463 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:23:50,463 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((((((((0 == #memory_$Pointer$[pp][pstate + 4] && i <= (pstate + 4 + -pp) / 4 + 1) && pstate <= 0) && 0 == #memory_$Pointer$[pp][pstate + 4]) && 0 == #memory_$Pointer$[pp][0]) && pp == 0) && counter == 1) && 0 == #memory_$Pointer$[pp][pp]) && 0 <= pstate) && !(pp == pstate) - InvariantResult [Line: 51]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 35 locations, 2 error locations. SAFE Result, 66.1s OverallTime, 15 OverallIterations, 3 TraceHistogramMax, 39.1s AutomataDifference, 0.0s DeadEndRemovalTime, 10.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 455 SDtfs, 2902 SDslu, 2640 SDs, 0 SdLazy, 4781 SolverSat, 1408 SolverUnsat, 9 SolverUnknown, 0 SolverNotchecked, 12.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 736 GetRequests, 286 SyntacticMatches, 20 SemanticMatches, 430 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6713 ImplicationChecksByTransitivity, 36.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=136occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 549 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 8 PreInvPairs, 30 NumberOfFragments, 1533 HoareAnnotationTreeSize, 8 FomulaSimplifications, 20386860 FormulaSimplificationTreeSizeReduction, 0.8s HoareSimplificationTime, 8 FomulaSimplificationsInter, 1790545 FormulaSimplificationTreeSizeReductionInter, 9.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 14.2s InterpolantComputationTime, 765 NumberOfCodeBlocks, 765 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 738 ConstructedInterpolants, 3 QuantifiedInterpolants, 264676 SizeOfPredicates, 100 NumberOfNonLiveVariables, 2076 ConjunctsInSsa, 263 ConjunctsInUnsatCore, 27 InterpolantComputations, 6 PerfectInterpolantSequences, 149/239 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...