/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem10_label49.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 21:03:56,526 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 21:03:56,530 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 21:03:56,549 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 21:03:56,549 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 21:03:56,551 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 21:03:56,553 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 21:03:56,563 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 21:03:56,567 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 21:03:56,570 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 21:03:56,572 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 21:03:56,574 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 21:03:56,574 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 21:03:56,576 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 21:03:56,578 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 21:03:56,580 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 21:03:56,581 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 21:03:56,583 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 21:03:56,585 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 21:03:56,589 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 21:03:56,591 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 21:03:56,593 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 21:03:56,594 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 21:03:56,595 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 21:03:56,598 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 21:03:56,598 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 21:03:56,598 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 21:03:56,600 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 21:03:56,602 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 21:03:56,603 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 21:03:56,603 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 21:03:56,604 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 21:03:56,605 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 21:03:56,606 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 21:03:56,607 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 21:03:56,607 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 21:03:56,607 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 21:03:56,608 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 21:03:56,608 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 21:03:56,609 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 21:03:56,609 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 21:03:56,610 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-23 21:03:56,626 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 21:03:56,626 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 21:03:56,628 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 21:03:56,628 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 21:03:56,628 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 21:03:56,628 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 21:03:56,629 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 21:03:56,629 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 21:03:56,629 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 21:03:56,629 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 21:03:56,629 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 21:03:56,629 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 21:03:56,630 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 21:03:56,630 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 21:03:56,630 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 21:03:56,630 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 21:03:56,630 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 21:03:56,631 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 21:03:56,631 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 21:03:56,631 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 21:03:56,631 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 21:03:56,631 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 21:03:56,632 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 21:03:56,632 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 21:03:56,632 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 21:03:56,632 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 21:03:56,632 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 21:03:56,633 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 21:03:56,633 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 21:03:56,633 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 21:03:56,934 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 21:03:56,951 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 21:03:56,954 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 21:03:56,956 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 21:03:56,957 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 21:03:56,957 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label49.c [2019-11-23 21:03:57,022 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8de2b6d68/b09f673456a24ce08ec73ad9296ff035/FLAGf191f756a [2019-11-23 21:03:57,621 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 21:03:57,622 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem10_label49.c [2019-11-23 21:03:57,634 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8de2b6d68/b09f673456a24ce08ec73ad9296ff035/FLAGf191f756a [2019-11-23 21:03:57,830 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8de2b6d68/b09f673456a24ce08ec73ad9296ff035 [2019-11-23 21:03:57,839 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 21:03:57,841 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 21:03:57,842 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 21:03:57,843 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 21:03:57,846 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 21:03:57,847 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:03:57" (1/1) ... [2019-11-23 21:03:57,851 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e76d925 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:03:57, skipping insertion in model container [2019-11-23 21:03:57,851 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:03:57" (1/1) ... [2019-11-23 21:03:57,859 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 21:03:57,919 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 21:03:58,333 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 21:03:58,340 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 21:03:58,565 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 21:03:58,591 INFO L208 MainTranslator]: Completed translation [2019-11-23 21:03:58,591 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:03:58 WrapperNode [2019-11-23 21:03:58,591 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 21:03:58,592 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 21:03:58,592 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 21:03:58,592 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 21:03:58,599 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:03:58" (1/1) ... [2019-11-23 21:03:58,618 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:03:58" (1/1) ... [2019-11-23 21:03:58,693 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 21:03:58,694 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 21:03:58,694 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 21:03:58,694 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 21:03:58,705 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:03:58" (1/1) ... [2019-11-23 21:03:58,705 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:03:58" (1/1) ... [2019-11-23 21:03:58,711 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:03:58" (1/1) ... [2019-11-23 21:03:58,711 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:03:58" (1/1) ... [2019-11-23 21:03:58,738 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:03:58" (1/1) ... [2019-11-23 21:03:58,749 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:03:58" (1/1) ... [2019-11-23 21:03:58,764 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:03:58" (1/1) ... [2019-11-23 21:03:58,779 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 21:03:58,781 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 21:03:58,781 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 21:03:58,781 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 21:03:58,783 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:03:58" (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 [2019-11-23 21:03:58,855 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 21:03:58,856 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 21:04:00,113 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 21:04:00,114 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-23 21:04:00,115 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:04:00 BoogieIcfgContainer [2019-11-23 21:04:00,115 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 21:04:00,116 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 21:04:00,116 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 21:04:00,120 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 21:04:00,120 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 09:03:57" (1/3) ... [2019-11-23 21:04:00,121 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39c1ac21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:04:00, skipping insertion in model container [2019-11-23 21:04:00,121 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:03:58" (2/3) ... [2019-11-23 21:04:00,122 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39c1ac21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:04:00, skipping insertion in model container [2019-11-23 21:04:00,122 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:04:00" (3/3) ... [2019-11-23 21:04:00,124 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem10_label49.c [2019-11-23 21:04:00,134 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 21:04:00,142 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 21:04:00,154 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 21:04:00,182 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 21:04:00,183 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 21:04:00,183 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 21:04:00,183 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 21:04:00,183 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 21:04:00,183 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 21:04:00,184 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 21:04:00,184 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 21:04:00,206 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states. [2019-11-23 21:04:00,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-23 21:04:00,213 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:04:00,214 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:04:00,215 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:04:00,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:04:00,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1644072970, now seen corresponding path program 1 times [2019-11-23 21:04:00,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:04:00,231 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163353241] [2019-11-23 21:04:00,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:04:00,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:04:00,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:04:00,467 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163353241] [2019-11-23 21:04:00,471 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:04:00,471 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 21:04:00,474 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078916348] [2019-11-23 21:04:00,479 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 21:04:00,480 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:04:00,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 21:04:00,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:04:00,497 INFO L87 Difference]: Start difference. First operand 206 states. Second operand 4 states. [2019-11-23 21:04:01,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:04:01,958 INFO L93 Difference]: Finished difference Result 694 states and 1246 transitions. [2019-11-23 21:04:01,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 21:04:01,960 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-11-23 21:04:01,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:04:02,002 INFO L225 Difference]: With dead ends: 694 [2019-11-23 21:04:02,002 INFO L226 Difference]: Without dead ends: 421 [2019-11-23 21:04:02,007 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:04:02,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2019-11-23 21:04:02,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 421. [2019-11-23 21:04:02,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-11-23 21:04:02,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 586 transitions. [2019-11-23 21:04:02,077 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 586 transitions. Word has length 22 [2019-11-23 21:04:02,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:04:02,077 INFO L462 AbstractCegarLoop]: Abstraction has 421 states and 586 transitions. [2019-11-23 21:04:02,078 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 21:04:02,078 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 586 transitions. [2019-11-23 21:04:02,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-23 21:04:02,081 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:04:02,082 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:04:02,082 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:04:02,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:04:02,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1869682614, now seen corresponding path program 1 times [2019-11-23 21:04:02,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:04:02,083 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737515284] [2019-11-23 21:04:02,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:04:02,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:04:02,527 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:04:02,528 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737515284] [2019-11-23 21:04:02,528 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [188519573] [2019-11-23 21:04:02,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:04:02,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:04:02,592 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 21:04:02,601 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:04:02,681 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-11-23 21:04:02,682 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 21:04:02,682 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2019-11-23 21:04:02,683 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77711334] [2019-11-23 21:04:02,684 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 21:04:02,685 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:04:02,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 21:04:02,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-11-23 21:04:02,686 INFO L87 Difference]: Start difference. First operand 421 states and 586 transitions. Second operand 3 states. [2019-11-23 21:04:03,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:04:03,475 INFO L93 Difference]: Finished difference Result 840 states and 1170 transitions. [2019-11-23 21:04:03,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 21:04:03,476 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 88 [2019-11-23 21:04:03,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:04:03,482 INFO L225 Difference]: With dead ends: 840 [2019-11-23 21:04:03,482 INFO L226 Difference]: Without dead ends: 838 [2019-11-23 21:04:03,484 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-11-23 21:04:03,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2019-11-23 21:04:03,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 560. [2019-11-23 21:04:03,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 560 states. [2019-11-23 21:04:03,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 800 transitions. [2019-11-23 21:04:03,515 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 800 transitions. Word has length 88 [2019-11-23 21:04:03,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:04:03,516 INFO L462 AbstractCegarLoop]: Abstraction has 560 states and 800 transitions. [2019-11-23 21:04:03,516 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 21:04:03,516 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 800 transitions. [2019-11-23 21:04:03,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-23 21:04:03,520 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:04:03,520 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:04:03,734 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:04:03,735 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:04:03,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:04:03,735 INFO L82 PathProgramCache]: Analyzing trace with hash -1943772973, now seen corresponding path program 1 times [2019-11-23 21:04:03,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:04:03,736 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105568409] [2019-11-23 21:04:03,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:04:03,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:04:03,847 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:04:03,848 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105568409] [2019-11-23 21:04:03,848 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:04:03,848 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 21:04:03,849 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624864409] [2019-11-23 21:04:03,850 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 21:04:03,850 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:04:03,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 21:04:03,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:04:03,851 INFO L87 Difference]: Start difference. First operand 560 states and 800 transitions. Second operand 4 states. [2019-11-23 21:04:04,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:04:04,820 INFO L93 Difference]: Finished difference Result 1674 states and 2334 transitions. [2019-11-23 21:04:04,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 21:04:04,821 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-11-23 21:04:04,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:04:04,827 INFO L225 Difference]: With dead ends: 1674 [2019-11-23 21:04:04,828 INFO L226 Difference]: Without dead ends: 1116 [2019-11-23 21:04:04,830 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:04:04,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1116 states. [2019-11-23 21:04:04,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1116 to 838. [2019-11-23 21:04:04,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 838 states. [2019-11-23 21:04:04,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1083 transitions. [2019-11-23 21:04:04,855 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1083 transitions. Word has length 91 [2019-11-23 21:04:04,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:04:04,856 INFO L462 AbstractCegarLoop]: Abstraction has 838 states and 1083 transitions. [2019-11-23 21:04:04,856 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 21:04:04,856 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1083 transitions. [2019-11-23 21:04:04,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-11-23 21:04:04,874 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:04:04,874 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:04:04,874 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:04:04,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:04:04,875 INFO L82 PathProgramCache]: Analyzing trace with hash -1933258404, now seen corresponding path program 1 times [2019-11-23 21:04:04,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:04:04,876 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715846283] [2019-11-23 21:04:04,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:04:04,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:04:05,084 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:04:05,085 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715846283] [2019-11-23 21:04:05,085 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:04:05,085 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 21:04:05,086 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774015568] [2019-11-23 21:04:05,088 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 21:04:05,089 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:04:05,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 21:04:05,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:04:05,089 INFO L87 Difference]: Start difference. First operand 838 states and 1083 transitions. Second operand 4 states. [2019-11-23 21:04:06,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:04:06,155 INFO L93 Difference]: Finished difference Result 1813 states and 2348 transitions. [2019-11-23 21:04:06,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 21:04:06,156 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 182 [2019-11-23 21:04:06,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:04:06,162 INFO L225 Difference]: With dead ends: 1813 [2019-11-23 21:04:06,162 INFO L226 Difference]: Without dead ends: 977 [2019-11-23 21:04:06,164 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:04:06,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2019-11-23 21:04:06,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 977. [2019-11-23 21:04:06,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 977 states. [2019-11-23 21:04:06,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1177 transitions. [2019-11-23 21:04:06,183 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1177 transitions. Word has length 182 [2019-11-23 21:04:06,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:04:06,184 INFO L462 AbstractCegarLoop]: Abstraction has 977 states and 1177 transitions. [2019-11-23 21:04:06,184 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 21:04:06,184 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1177 transitions. [2019-11-23 21:04:06,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-11-23 21:04:06,187 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:04:06,188 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:04:06,188 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:04:06,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:04:06,188 INFO L82 PathProgramCache]: Analyzing trace with hash -51833937, now seen corresponding path program 1 times [2019-11-23 21:04:06,189 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:04:06,189 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748272289] [2019-11-23 21:04:06,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:04:06,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:04:06,420 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-11-23 21:04:06,421 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748272289] [2019-11-23 21:04:06,421 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:04:06,421 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 21:04:06,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47953314] [2019-11-23 21:04:06,422 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 21:04:06,423 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:04:06,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 21:04:06,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 21:04:06,424 INFO L87 Difference]: Start difference. First operand 977 states and 1177 transitions. Second operand 5 states. [2019-11-23 21:04:08,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:04:08,017 INFO L93 Difference]: Finished difference Result 3620 states and 4392 transitions. [2019-11-23 21:04:08,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 21:04:08,018 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 189 [2019-11-23 21:04:08,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:04:08,030 INFO L225 Difference]: With dead ends: 3620 [2019-11-23 21:04:08,030 INFO L226 Difference]: Without dead ends: 2645 [2019-11-23 21:04:08,032 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 21:04:08,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2645 states. [2019-11-23 21:04:08,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2645 to 1672. [2019-11-23 21:04:08,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1672 states. [2019-11-23 21:04:08,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 1977 transitions. [2019-11-23 21:04:08,072 INFO L78 Accepts]: Start accepts. Automaton has 1672 states and 1977 transitions. Word has length 189 [2019-11-23 21:04:08,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:04:08,073 INFO L462 AbstractCegarLoop]: Abstraction has 1672 states and 1977 transitions. [2019-11-23 21:04:08,073 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 21:04:08,073 INFO L276 IsEmpty]: Start isEmpty. Operand 1672 states and 1977 transitions. [2019-11-23 21:04:08,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-11-23 21:04:08,077 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:04:08,077 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:04:08,078 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:04:08,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:04:08,078 INFO L82 PathProgramCache]: Analyzing trace with hash 298360043, now seen corresponding path program 1 times [2019-11-23 21:04:08,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:04:08,079 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124367938] [2019-11-23 21:04:08,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:04:08,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:04:08,306 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:04:08,306 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124367938] [2019-11-23 21:04:08,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:04:08,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 21:04:08,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403608867] [2019-11-23 21:04:08,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 21:04:08,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:04:08,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 21:04:08,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 21:04:08,308 INFO L87 Difference]: Start difference. First operand 1672 states and 1977 transitions. Second operand 5 states. [2019-11-23 21:04:09,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:04:09,677 INFO L93 Difference]: Finished difference Result 4593 states and 5384 transitions. [2019-11-23 21:04:09,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 21:04:09,678 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 229 [2019-11-23 21:04:09,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:04:09,687 INFO L225 Difference]: With dead ends: 4593 [2019-11-23 21:04:09,687 INFO L226 Difference]: Without dead ends: 1811 [2019-11-23 21:04:09,691 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 21:04:09,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1811 states. [2019-11-23 21:04:09,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1811 to 1533. [2019-11-23 21:04:09,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1533 states. [2019-11-23 21:04:09,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1533 states to 1533 states and 1717 transitions. [2019-11-23 21:04:09,725 INFO L78 Accepts]: Start accepts. Automaton has 1533 states and 1717 transitions. Word has length 229 [2019-11-23 21:04:09,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:04:09,726 INFO L462 AbstractCegarLoop]: Abstraction has 1533 states and 1717 transitions. [2019-11-23 21:04:09,726 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 21:04:09,726 INFO L276 IsEmpty]: Start isEmpty. Operand 1533 states and 1717 transitions. [2019-11-23 21:04:09,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2019-11-23 21:04:09,731 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:04:09,731 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:04:09,731 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:04:09,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:04:09,732 INFO L82 PathProgramCache]: Analyzing trace with hash -1307309551, now seen corresponding path program 1 times [2019-11-23 21:04:09,732 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:04:09,733 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726142682] [2019-11-23 21:04:09,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:04:09,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:04:10,245 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 142 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:04:10,245 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726142682] [2019-11-23 21:04:10,246 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1186302103] [2019-11-23 21:04:10,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:04:10,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:04:10,339 INFO L255 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-23 21:04:10,347 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:04:10,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:04:10,419 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2019-11-23 21:04:10,420 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 21:04:10,420 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2019-11-23 21:04:10,420 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505619102] [2019-11-23 21:04:10,421 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 21:04:10,421 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:04:10,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 21:04:10,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-23 21:04:10,422 INFO L87 Difference]: Start difference. First operand 1533 states and 1717 transitions. Second operand 3 states. [2019-11-23 21:04:11,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:04:11,075 INFO L93 Difference]: Finished difference Result 3481 states and 3910 transitions. [2019-11-23 21:04:11,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 21:04:11,076 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 265 [2019-11-23 21:04:11,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:04:11,084 INFO L225 Difference]: With dead ends: 3481 [2019-11-23 21:04:11,084 INFO L226 Difference]: Without dead ends: 1950 [2019-11-23 21:04:11,086 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 264 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-23 21:04:11,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1950 states. [2019-11-23 21:04:11,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1950 to 1672. [2019-11-23 21:04:11,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1672 states. [2019-11-23 21:04:11,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 1865 transitions. [2019-11-23 21:04:11,117 INFO L78 Accepts]: Start accepts. Automaton has 1672 states and 1865 transitions. Word has length 265 [2019-11-23 21:04:11,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:04:11,117 INFO L462 AbstractCegarLoop]: Abstraction has 1672 states and 1865 transitions. [2019-11-23 21:04:11,117 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 21:04:11,118 INFO L276 IsEmpty]: Start isEmpty. Operand 1672 states and 1865 transitions. [2019-11-23 21:04:11,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2019-11-23 21:04:11,122 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:04:11,123 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:04:11,327 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:04:11,327 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:04:11,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:04:11,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1440717452, now seen corresponding path program 1 times [2019-11-23 21:04:11,328 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:04:11,329 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598914629] [2019-11-23 21:04:11,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:04:11,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:04:11,591 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 256 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:04:11,591 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598914629] [2019-11-23 21:04:11,592 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [359799929] [2019-11-23 21:04:11,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:04:11,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:04:11,681 INFO L255 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-23 21:04:11,698 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:04:11,847 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 262 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:04:11,848 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 21:04:11,848 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-11-23 21:04:11,848 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306951115] [2019-11-23 21:04:11,849 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 21:04:11,849 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:04:11,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 21:04:11,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-23 21:04:11,850 INFO L87 Difference]: Start difference. First operand 1672 states and 1865 transitions. Second operand 4 states. [2019-11-23 21:04:12,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:04:12,813 INFO L93 Difference]: Finished difference Result 4037 states and 4530 transitions. [2019-11-23 21:04:12,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 21:04:12,815 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 270 [2019-11-23 21:04:12,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:04:12,825 INFO L225 Difference]: With dead ends: 4037 [2019-11-23 21:04:12,825 INFO L226 Difference]: Without dead ends: 2367 [2019-11-23 21:04:12,828 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 269 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-23 21:04:12,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2367 states. [2019-11-23 21:04:12,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2367 to 2228. [2019-11-23 21:04:12,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2228 states. [2019-11-23 21:04:12,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2228 states to 2228 states and 2423 transitions. [2019-11-23 21:04:12,865 INFO L78 Accepts]: Start accepts. Automaton has 2228 states and 2423 transitions. Word has length 270 [2019-11-23 21:04:12,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:04:12,866 INFO L462 AbstractCegarLoop]: Abstraction has 2228 states and 2423 transitions. [2019-11-23 21:04:12,866 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 21:04:12,866 INFO L276 IsEmpty]: Start isEmpty. Operand 2228 states and 2423 transitions. [2019-11-23 21:04:12,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2019-11-23 21:04:12,872 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:04:12,872 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:04:13,075 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:04:13,075 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:04:13,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:04:13,076 INFO L82 PathProgramCache]: Analyzing trace with hash -876938456, now seen corresponding path program 1 times [2019-11-23 21:04:13,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:04:13,076 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149519940] [2019-11-23 21:04:13,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:04:13,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:04:13,405 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 230 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:04:13,406 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149519940] [2019-11-23 21:04:13,406 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [773852379] [2019-11-23 21:04:13,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:04:13,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:04:13,524 INFO L255 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 21:04:13,530 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:04:13,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:04:13,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:04:13,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:04:13,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:04:13,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:04:13,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:04:13,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:04:13,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:04:13,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:04:13,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:04:13,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:04:13,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:04:13,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:04:13,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:04:13,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:04:13,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:04:13,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:04:13,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:04:13,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:04:13,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:04:13,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:04:13,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:04:13,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:04:13,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:04:13,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:04:14,486 WARN L192 SmtUtils]: Spent 520.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 21 [2019-11-23 21:04:14,615 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2019-11-23 21:04:14,616 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 21:04:14,616 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2019-11-23 21:04:14,616 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488000617] [2019-11-23 21:04:14,617 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 21:04:14,617 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:04:14,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 21:04:14,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-23 21:04:14,618 INFO L87 Difference]: Start difference. First operand 2228 states and 2423 transitions. Second operand 3 states. [2019-11-23 21:04:20,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:04:20,564 INFO L93 Difference]: Finished difference Result 5149 states and 5613 transitions. [2019-11-23 21:04:20,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 21:04:20,565 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 283 [2019-11-23 21:04:20,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:04:20,576 INFO L225 Difference]: With dead ends: 5149 [2019-11-23 21:04:20,577 INFO L226 Difference]: Without dead ends: 2923 [2019-11-23 21:04:20,579 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 283 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-23 21:04:20,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2923 states. [2019-11-23 21:04:20,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2923 to 2506. [2019-11-23 21:04:20,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2506 states. [2019-11-23 21:04:20,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2506 states to 2506 states and 2717 transitions. [2019-11-23 21:04:20,649 INFO L78 Accepts]: Start accepts. Automaton has 2506 states and 2717 transitions. Word has length 283 [2019-11-23 21:04:20,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:04:20,650 INFO L462 AbstractCegarLoop]: Abstraction has 2506 states and 2717 transitions. [2019-11-23 21:04:20,650 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 21:04:20,650 INFO L276 IsEmpty]: Start isEmpty. Operand 2506 states and 2717 transitions. [2019-11-23 21:04:20,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2019-11-23 21:04:20,657 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:04:20,658 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:04:20,861 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:04:20,862 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:04:20,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:04:20,862 INFO L82 PathProgramCache]: Analyzing trace with hash 1778174755, now seen corresponding path program 1 times [2019-11-23 21:04:20,862 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:04:20,863 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581042726] [2019-11-23 21:04:20,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:04:20,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:04:21,070 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2019-11-23 21:04:21,070 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581042726] [2019-11-23 21:04:21,071 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:04:21,071 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 21:04:21,072 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171156775] [2019-11-23 21:04:21,072 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 21:04:21,073 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:04:21,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 21:04:21,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:04:21,073 INFO L87 Difference]: Start difference. First operand 2506 states and 2717 transitions. Second operand 4 states. [2019-11-23 21:04:21,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:04:21,645 INFO L93 Difference]: Finished difference Result 2506 states and 2717 transitions. [2019-11-23 21:04:21,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 21:04:21,646 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 319 [2019-11-23 21:04:21,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:04:21,647 INFO L225 Difference]: With dead ends: 2506 [2019-11-23 21:04:21,647 INFO L226 Difference]: Without dead ends: 0 [2019-11-23 21:04:21,649 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:04:21,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-23 21:04:21,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-23 21:04:21,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-23 21:04:21,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-23 21:04:21,651 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 319 [2019-11-23 21:04:21,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:04:21,651 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-23 21:04:21,651 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 21:04:21,651 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-23 21:04:21,652 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-23 21:04:21,657 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-23 21:04:22,423 WARN L192 SmtUtils]: Spent 596.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 67 [2019-11-23 21:04:23,071 WARN L192 SmtUtils]: Spent 644.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 67 [2019-11-23 21:04:23,074 INFO L444 ceAbstractionStarter]: For program point L465(lines 465 572) no Hoare annotation was computed. [2019-11-23 21:04:23,075 INFO L444 ceAbstractionStarter]: For program point L201-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:04:23,075 INFO L444 ceAbstractionStarter]: For program point L168-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:04:23,075 INFO L444 ceAbstractionStarter]: For program point L135-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:04:23,075 INFO L444 ceAbstractionStarter]: For program point L102-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:04:23,075 INFO L444 ceAbstractionStarter]: For program point L69-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:04:23,075 INFO L444 ceAbstractionStarter]: For program point L36-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:04:23,076 INFO L444 ceAbstractionStarter]: For program point L499(lines 499 572) no Hoare annotation was computed. [2019-11-23 21:04:23,076 INFO L444 ceAbstractionStarter]: For program point L301(lines 301 572) no Hoare annotation was computed. [2019-11-23 21:04:23,076 INFO L444 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-11-23 21:04:23,076 INFO L444 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2019-11-23 21:04:23,077 INFO L444 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-11-23 21:04:23,077 INFO L444 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2019-11-23 21:04:23,077 INFO L444 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2019-11-23 21:04:23,077 INFO L444 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-11-23 21:04:23,077 INFO L444 ceAbstractionStarter]: For program point L335(lines 335 572) no Hoare annotation was computed. [2019-11-23 21:04:23,078 INFO L444 ceAbstractionStarter]: For program point L236(lines 236 572) no Hoare annotation was computed. [2019-11-23 21:04:23,078 INFO L444 ceAbstractionStarter]: For program point L534(lines 534 572) no Hoare annotation was computed. [2019-11-23 21:04:23,078 INFO L444 ceAbstractionStarter]: For program point L171-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:04:23,078 INFO L444 ceAbstractionStarter]: For program point L138-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:04:23,078 INFO L444 ceAbstractionStarter]: For program point L105-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:04:23,079 INFO L444 ceAbstractionStarter]: For program point L72-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:04:23,079 INFO L444 ceAbstractionStarter]: For program point L39-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:04:23,079 INFO L444 ceAbstractionStarter]: For program point L436(lines 436 572) no Hoare annotation was computed. [2019-11-23 21:04:23,079 INFO L444 ceAbstractionStarter]: For program point L403(lines 403 572) no Hoare annotation was computed. [2019-11-23 21:04:23,079 INFO L444 ceAbstractionStarter]: For program point L370(lines 370 572) no Hoare annotation was computed. [2019-11-23 21:04:23,079 INFO L444 ceAbstractionStarter]: For program point L271(lines 271 572) no Hoare annotation was computed. [2019-11-23 21:04:23,079 INFO L444 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-11-23 21:04:23,080 INFO L444 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2019-11-23 21:04:23,080 INFO L444 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2019-11-23 21:04:23,080 INFO L444 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-11-23 21:04:23,080 INFO L444 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-11-23 21:04:23,080 INFO L444 ceAbstractionStarter]: For program point L569(lines 569 572) no Hoare annotation was computed. [2019-11-23 21:04:23,080 INFO L444 ceAbstractionStarter]: For program point L239(lines 239 572) no Hoare annotation was computed. [2019-11-23 21:04:23,080 INFO L444 ceAbstractionStarter]: For program point L504(lines 504 572) no Hoare annotation was computed. [2019-11-23 21:04:23,081 INFO L444 ceAbstractionStarter]: For program point L471(lines 471 572) no Hoare annotation was computed. [2019-11-23 21:04:23,081 INFO L444 ceAbstractionStarter]: For program point L306(lines 306 572) no Hoare annotation was computed. [2019-11-23 21:04:23,081 INFO L444 ceAbstractionStarter]: For program point L174-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:04:23,081 INFO L444 ceAbstractionStarter]: For program point L141-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:04:23,081 INFO L444 ceAbstractionStarter]: For program point L108-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:04:23,081 INFO L444 ceAbstractionStarter]: For program point L75-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:04:23,081 INFO L444 ceAbstractionStarter]: For program point L42-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:04:23,081 INFO L444 ceAbstractionStarter]: For program point L340(lines 340 572) no Hoare annotation was computed. [2019-11-23 21:04:23,082 INFO L444 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-11-23 21:04:23,082 INFO L444 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2019-11-23 21:04:23,082 INFO L444 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-11-23 21:04:23,082 INFO L444 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2019-11-23 21:04:23,082 INFO L444 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-11-23 21:04:23,083 INFO L440 ceAbstractionStarter]: At program point L573(lines 20 574) the Hoare annotation is: (let ((.cse6 (= ~a10~0 2))) (let ((.cse2 (not (= ~a19~0 10))) (.cse4 (<= 1 ~a10~0)) (.cse0 (not (= ~a10~0 3))) (.cse1 (not .cse6)) (.cse7 (= ~a10~0 0)) (.cse5 (< 218 ~a1~0)) (.cse9 (= ~a19~0 9)) (.cse8 (exists ((v_~a1~0_342 Int)) (let ((.cse10 (div (* v_~a1~0_342 9) 10))) (and (<= 0 .cse10) (= 0 (mod (+ .cse10 1) 25)) (<= ~a1~0 (+ (mod .cse10 25) 12)) (<= 0 (* 9 v_~a1~0_342)))))) (.cse3 (<= ~a19~0 8))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse1 .cse2 .cse4 (not (= ~a19~0 8))) (and .cse5 .cse6 .cse3) (and (<= ~a1~0 218) .cse1 .cse2 .cse3 (< 0 (+ ~a1~0 13))) (and .cse2 .cse7) (and .cse8 .cse6 .cse9) (= ~a19~0 7) (and .cse0 .cse1 .cse4) (and .cse8 (or (and .cse0 .cse1 (<= (+ ~a1~0 437977) 0) (not .cse9)) .cse7)) (and .cse5 .cse6 .cse9) (and .cse8 .cse6 .cse3)))) [2019-11-23 21:04:23,083 INFO L444 ceAbstractionStarter]: For program point L540(lines 540 572) no Hoare annotation was computed. [2019-11-23 21:04:23,083 INFO L444 ceAbstractionStarter]: For program point L408(lines 408 572) no Hoare annotation was computed. [2019-11-23 21:04:23,083 INFO L444 ceAbstractionStarter]: For program point L375(lines 375 572) no Hoare annotation was computed. [2019-11-23 21:04:23,083 INFO L444 ceAbstractionStarter]: For program point L210(lines 210 572) no Hoare annotation was computed. [2019-11-23 21:04:23,083 INFO L444 ceAbstractionStarter]: For program point L177-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:04:23,083 INFO L444 ceAbstractionStarter]: For program point L144-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:04:23,084 INFO L444 ceAbstractionStarter]: For program point L111-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:04:23,084 INFO L444 ceAbstractionStarter]: For program point L78-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:04:23,084 INFO L444 ceAbstractionStarter]: For program point L45-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:04:23,084 INFO L444 ceAbstractionStarter]: For program point L442(lines 442 572) no Hoare annotation was computed. [2019-11-23 21:04:23,084 INFO L444 ceAbstractionStarter]: For program point L277(lines 277 572) no Hoare annotation was computed. [2019-11-23 21:04:23,084 INFO L444 ceAbstractionStarter]: For program point L244(lines 244 572) no Hoare annotation was computed. [2019-11-23 21:04:23,084 INFO L444 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2019-11-23 21:04:23,084 INFO L444 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2019-11-23 21:04:23,085 INFO L444 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-11-23 21:04:23,085 INFO L444 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-11-23 21:04:23,085 INFO L444 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-11-23 21:04:23,085 INFO L444 ceAbstractionStarter]: For program point L509(lines 509 572) no Hoare annotation was computed. [2019-11-23 21:04:23,085 INFO L444 ceAbstractionStarter]: For program point L476(lines 476 572) no Hoare annotation was computed. [2019-11-23 21:04:23,085 INFO L447 ceAbstractionStarter]: At program point L576(lines 576 592) the Hoare annotation is: true [2019-11-23 21:04:23,085 INFO L444 ceAbstractionStarter]: For program point L378(lines 378 572) no Hoare annotation was computed. [2019-11-23 21:04:23,086 INFO L444 ceAbstractionStarter]: For program point L345(lines 345 572) no Hoare annotation was computed. [2019-11-23 21:04:23,086 INFO L444 ceAbstractionStarter]: For program point L312(lines 312 572) no Hoare annotation was computed. [2019-11-23 21:04:23,086 INFO L444 ceAbstractionStarter]: For program point L180-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:04:23,086 INFO L444 ceAbstractionStarter]: For program point L147-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:04:23,086 INFO L444 ceAbstractionStarter]: For program point L114-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:04:23,086 INFO L444 ceAbstractionStarter]: For program point L81-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:04:23,086 INFO L444 ceAbstractionStarter]: For program point L48-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:04:23,086 INFO L444 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-11-23 21:04:23,087 INFO L444 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-11-23 21:04:23,087 INFO L444 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2019-11-23 21:04:23,087 INFO L444 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2019-11-23 21:04:23,087 INFO L444 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2019-11-23 21:04:23,087 INFO L444 ceAbstractionStarter]: For program point L545(lines 545 572) no Hoare annotation was computed. [2019-11-23 21:04:23,087 INFO L444 ceAbstractionStarter]: For program point L215(lines 215 572) no Hoare annotation was computed. [2019-11-23 21:04:23,087 INFO L444 ceAbstractionStarter]: For program point L414(lines 414 572) no Hoare annotation was computed. [2019-11-23 21:04:23,087 INFO L444 ceAbstractionStarter]: For program point L249(lines 249 572) no Hoare annotation was computed. [2019-11-23 21:04:23,087 INFO L444 ceAbstractionStarter]: For program point L183-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:04:23,088 INFO L444 ceAbstractionStarter]: For program point L150-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:04:23,088 INFO L444 ceAbstractionStarter]: For program point L117-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:04:23,088 INFO L444 ceAbstractionStarter]: For program point L84-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:04:23,088 INFO L444 ceAbstractionStarter]: For program point L51-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:04:23,088 INFO L444 ceAbstractionStarter]: For program point L514(lines 514 572) no Hoare annotation was computed. [2019-11-23 21:04:23,088 INFO L444 ceAbstractionStarter]: For program point L481(lines 481 572) no Hoare annotation was computed. [2019-11-23 21:04:23,088 INFO L444 ceAbstractionStarter]: For program point L448(lines 448 572) no Hoare annotation was computed. [2019-11-23 21:04:23,089 INFO L444 ceAbstractionStarter]: For program point L283(lines 283 572) no Hoare annotation was computed. [2019-11-23 21:04:23,089 INFO L444 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-11-23 21:04:23,089 INFO L444 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2019-11-23 21:04:23,089 INFO L444 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-11-23 21:04:23,089 INFO L444 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2019-11-23 21:04:23,089 INFO L444 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-11-23 21:04:23,089 INFO L444 ceAbstractionStarter]: For program point L548(lines 548 572) no Hoare annotation was computed. [2019-11-23 21:04:23,089 INFO L444 ceAbstractionStarter]: For program point L383(lines 383 572) no Hoare annotation was computed. [2019-11-23 21:04:23,090 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-23 21:04:23,090 INFO L444 ceAbstractionStarter]: For program point L317(lines 317 572) no Hoare annotation was computed. [2019-11-23 21:04:23,090 INFO L440 ceAbstractionStarter]: At program point L582-2(lines 582 591) the Hoare annotation is: (let ((.cse6 (= ~a10~0 2))) (let ((.cse2 (not (= ~a19~0 10))) (.cse4 (<= 1 ~a10~0)) (.cse0 (not (= ~a10~0 3))) (.cse1 (not .cse6)) (.cse7 (= ~a10~0 0)) (.cse5 (< 218 ~a1~0)) (.cse9 (= ~a19~0 9)) (.cse8 (exists ((v_~a1~0_342 Int)) (let ((.cse10 (div (* v_~a1~0_342 9) 10))) (and (<= 0 .cse10) (= 0 (mod (+ .cse10 1) 25)) (<= ~a1~0 (+ (mod .cse10 25) 12)) (<= 0 (* 9 v_~a1~0_342)))))) (.cse3 (<= ~a19~0 8))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse1 .cse2 .cse4 (not (= ~a19~0 8))) (and .cse5 .cse6 .cse3) (and (<= ~a1~0 218) .cse1 .cse2 .cse3 (< 0 (+ ~a1~0 13))) (and .cse2 .cse7) (and .cse8 .cse6 .cse9) (= ~a19~0 7) (and .cse0 .cse1 .cse4) (and .cse8 (or (and .cse0 .cse1 (<= (+ ~a1~0 437977) 0) (not .cse9)) .cse7)) (and .cse5 .cse6 .cse9) (and .cse8 .cse6 .cse3)))) [2019-11-23 21:04:23,090 INFO L444 ceAbstractionStarter]: For program point L351(lines 351 572) no Hoare annotation was computed. [2019-11-23 21:04:23,090 INFO L444 ceAbstractionStarter]: For program point L186-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:04:23,090 INFO L444 ceAbstractionStarter]: For program point L153-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:04:23,091 INFO L444 ceAbstractionStarter]: For program point L120-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:04:23,091 INFO L444 ceAbstractionStarter]: For program point L87-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:04:23,091 INFO L444 ceAbstractionStarter]: For program point L21(lines 21 23) no Hoare annotation was computed. [2019-11-23 21:04:23,091 INFO L444 ceAbstractionStarter]: For program point L54-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:04:23,091 INFO L444 ceAbstractionStarter]: For program point L21-2(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:04:23,091 INFO L444 ceAbstractionStarter]: For program point L517(lines 517 572) no Hoare annotation was computed. [2019-11-23 21:04:23,091 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 572) no Hoare annotation was computed. [2019-11-23 21:04:23,091 INFO L444 ceAbstractionStarter]: For program point L220(lines 220 572) no Hoare annotation was computed. [2019-11-23 21:04:23,091 INFO L444 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2019-11-23 21:04:23,092 INFO L444 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-11-23 21:04:23,092 INFO L444 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-11-23 21:04:23,092 INFO L444 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2019-11-23 21:04:23,092 INFO L444 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2019-11-23 21:04:23,092 INFO L444 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2019-11-23 21:04:23,092 INFO L444 ceAbstractionStarter]: For program point L419(lines 419 572) no Hoare annotation was computed. [2019-11-23 21:04:23,092 INFO L444 ceAbstractionStarter]: For program point L320(lines 320 572) no Hoare annotation was computed. [2019-11-23 21:04:23,093 INFO L444 ceAbstractionStarter]: For program point L254(lines 254 572) no Hoare annotation was computed. [2019-11-23 21:04:23,093 INFO L444 ceAbstractionStarter]: For program point L354(lines 354 572) no Hoare annotation was computed. [2019-11-23 21:04:23,093 INFO L444 ceAbstractionStarter]: For program point L189-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:04:23,093 INFO L444 ceAbstractionStarter]: For program point L156-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:04:23,093 INFO L444 ceAbstractionStarter]: For program point L123-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:04:23,093 INFO L444 ceAbstractionStarter]: For program point L90-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:04:23,093 INFO L444 ceAbstractionStarter]: For program point L57-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:04:23,094 INFO L444 ceAbstractionStarter]: For program point L24-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:04:23,094 INFO L444 ceAbstractionStarter]: For program point L487(lines 487 572) no Hoare annotation was computed. [2019-11-23 21:04:23,094 INFO L444 ceAbstractionStarter]: For program point L454(lines 454 572) no Hoare annotation was computed. [2019-11-23 21:04:23,094 INFO L444 ceAbstractionStarter]: For program point L388(lines 388 572) no Hoare annotation was computed. [2019-11-23 21:04:23,094 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-23 21:04:23,094 INFO L444 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-11-23 21:04:23,094 INFO L444 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2019-11-23 21:04:23,094 INFO L444 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-11-23 21:04:23,095 INFO L444 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-11-23 21:04:23,095 INFO L444 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2019-11-23 21:04:23,095 INFO L444 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-11-23 21:04:23,095 INFO L444 ceAbstractionStarter]: For program point L587(line 587) no Hoare annotation was computed. [2019-11-23 21:04:23,095 INFO L444 ceAbstractionStarter]: For program point L554(lines 554 572) no Hoare annotation was computed. [2019-11-23 21:04:23,095 INFO L444 ceAbstractionStarter]: For program point L323(lines 323 572) no Hoare annotation was computed. [2019-11-23 21:04:23,095 INFO L444 ceAbstractionStarter]: For program point L357(lines 357 572) no Hoare annotation was computed. [2019-11-23 21:04:23,095 INFO L444 ceAbstractionStarter]: For program point L291(lines 291 572) no Hoare annotation was computed. [2019-11-23 21:04:23,096 INFO L444 ceAbstractionStarter]: For program point L225(lines 225 572) no Hoare annotation was computed. [2019-11-23 21:04:23,096 INFO L444 ceAbstractionStarter]: For program point L192-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:04:23,096 INFO L444 ceAbstractionStarter]: For program point L159-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:04:23,096 INFO L444 ceAbstractionStarter]: For program point L126-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:04:23,096 INFO L444 ceAbstractionStarter]: For program point L93-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:04:23,096 INFO L444 ceAbstractionStarter]: For program point L60-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:04:23,096 INFO L444 ceAbstractionStarter]: For program point L27-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:04:23,096 INFO L444 ceAbstractionStarter]: For program point L523(lines 523 572) no Hoare annotation was computed. [2019-11-23 21:04:23,096 INFO L444 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2019-11-23 21:04:23,097 INFO L444 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-11-23 21:04:23,097 INFO L444 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2019-11-23 21:04:23,097 INFO L444 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2019-11-23 21:04:23,097 INFO L444 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2019-11-23 21:04:23,097 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-23 21:04:23,097 INFO L444 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-11-23 21:04:23,097 INFO L444 ceAbstractionStarter]: For program point L557(lines 557 572) no Hoare annotation was computed. [2019-11-23 21:04:23,097 INFO L444 ceAbstractionStarter]: For program point L425(lines 425 572) no Hoare annotation was computed. [2019-11-23 21:04:23,098 INFO L444 ceAbstractionStarter]: For program point L326(lines 326 572) no Hoare annotation was computed. [2019-11-23 21:04:23,098 INFO L444 ceAbstractionStarter]: For program point L260(lines 260 572) no Hoare annotation was computed. [2019-11-23 21:04:23,098 INFO L444 ceAbstractionStarter]: For program point L393(lines 393 572) no Hoare annotation was computed. [2019-11-23 21:04:23,098 INFO L444 ceAbstractionStarter]: For program point L360(lines 360 572) no Hoare annotation was computed. [2019-11-23 21:04:23,098 INFO L444 ceAbstractionStarter]: For program point L195-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:04:23,098 INFO L444 ceAbstractionStarter]: For program point L162-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:04:23,098 INFO L444 ceAbstractionStarter]: For program point L129-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:04:23,098 INFO L444 ceAbstractionStarter]: For program point L96-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:04:23,099 INFO L444 ceAbstractionStarter]: For program point L63-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:04:23,099 INFO L444 ceAbstractionStarter]: For program point L30-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:04:23,099 INFO L444 ceAbstractionStarter]: For program point L526(lines 526 572) no Hoare annotation was computed. [2019-11-23 21:04:23,099 INFO L444 ceAbstractionStarter]: For program point L493(lines 493 572) no Hoare annotation was computed. [2019-11-23 21:04:23,099 INFO L444 ceAbstractionStarter]: For program point L460(lines 460 572) no Hoare annotation was computed. [2019-11-23 21:04:23,099 INFO L444 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2019-11-23 21:04:23,099 INFO L444 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-11-23 21:04:23,099 INFO L444 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-11-23 21:04:23,100 INFO L444 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-11-23 21:04:23,100 INFO L444 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-11-23 21:04:23,100 INFO L444 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2019-11-23 21:04:23,100 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 572) no Hoare annotation was computed. [2019-11-23 21:04:23,100 INFO L444 ceAbstractionStarter]: For program point L296(lines 296 572) no Hoare annotation was computed. [2019-11-23 21:04:23,100 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-23 21:04:23,100 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 70) no Hoare annotation was computed. [2019-11-23 21:04:23,101 INFO L444 ceAbstractionStarter]: For program point L231(lines 231 572) no Hoare annotation was computed. [2019-11-23 21:04:23,101 INFO L444 ceAbstractionStarter]: For program point L198-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:04:23,101 INFO L444 ceAbstractionStarter]: For program point L165-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:04:23,101 INFO L444 ceAbstractionStarter]: For program point L132-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:04:23,101 INFO L444 ceAbstractionStarter]: For program point L99-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:04:23,101 INFO L444 ceAbstractionStarter]: For program point L66-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:04:23,101 INFO L444 ceAbstractionStarter]: For program point L33-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:04:23,101 INFO L444 ceAbstractionStarter]: For program point L529(lines 529 572) no Hoare annotation was computed. [2019-11-23 21:04:23,102 INFO L444 ceAbstractionStarter]: For program point L430(lines 430 572) no Hoare annotation was computed. [2019-11-23 21:04:23,102 INFO L444 ceAbstractionStarter]: For program point L265(lines 265 572) no Hoare annotation was computed. [2019-11-23 21:04:23,102 INFO L444 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-11-23 21:04:23,102 INFO L444 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2019-11-23 21:04:23,102 INFO L444 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-11-23 21:04:23,102 INFO L444 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-11-23 21:04:23,102 INFO L444 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-11-23 21:04:23,102 INFO L444 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-11-23 21:04:23,103 INFO L444 ceAbstractionStarter]: For program point L563(lines 563 572) no Hoare annotation was computed. [2019-11-23 21:04:23,103 INFO L444 ceAbstractionStarter]: For program point L398(lines 398 572) no Hoare annotation was computed. [2019-11-23 21:04:23,103 INFO L444 ceAbstractionStarter]: For program point L365(lines 365 572) no Hoare annotation was computed. [2019-11-23 21:04:23,111 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-23 21:04:23,112 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-23 21:04:23,113 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-23 21:04:23,113 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-23 21:04:23,114 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-23 21:04:23,114 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-23 21:04:23,114 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-23 21:04:23,114 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-23 21:04:23,115 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-23 21:04:23,115 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-23 21:04:23,115 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-23 21:04:23,115 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-23 21:04:23,125 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-23 21:04:23,125 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-23 21:04:23,125 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-23 21:04:23,125 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-23 21:04:23,126 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-23 21:04:23,126 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-23 21:04:23,126 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-23 21:04:23,126 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-23 21:04:23,127 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-23 21:04:23,127 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-23 21:04:23,127 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-23 21:04:23,127 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-23 21:04:23,130 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-23 21:04:23,130 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-23 21:04:23,130 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-23 21:04:23,131 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-23 21:04:23,131 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-23 21:04:23,131 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-23 21:04:23,131 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-23 21:04:23,132 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-23 21:04:23,132 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-23 21:04:23,132 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-23 21:04:23,132 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-23 21:04:23,133 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-23 21:04:23,134 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-23 21:04:23,134 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-23 21:04:23,135 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-23 21:04:23,135 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-23 21:04:23,135 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-23 21:04:23,135 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-23 21:04:23,136 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-23 21:04:23,136 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-23 21:04:23,136 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-23 21:04:23,136 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-23 21:04:23,137 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-23 21:04:23,137 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-23 21:04:23,140 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 09:04:23 BoogieIcfgContainer [2019-11-23 21:04:23,140 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-23 21:04:23,142 INFO L168 Benchmark]: Toolchain (without parser) took 25300.68 ms. Allocated memory was 146.3 MB in the beginning and 524.3 MB in the end (delta: 378.0 MB). Free memory was 101.9 MB in the beginning and 400.3 MB in the end (delta: -298.4 MB). Peak memory consumption was 389.1 MB. Max. memory is 7.1 GB. [2019-11-23 21:04:23,143 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 146.3 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-11-23 21:04:23,143 INFO L168 Benchmark]: CACSL2BoogieTranslator took 749.38 ms. Allocated memory was 146.3 MB in the beginning and 206.6 MB in the end (delta: 60.3 MB). Free memory was 101.7 MB in the beginning and 173.0 MB in the end (delta: -71.3 MB). Peak memory consumption was 31.4 MB. Max. memory is 7.1 GB. [2019-11-23 21:04:23,146 INFO L168 Benchmark]: Boogie Procedure Inliner took 101.49 ms. Allocated memory is still 206.6 MB. Free memory was 173.0 MB in the beginning and 165.5 MB in the end (delta: 7.6 MB). Peak memory consumption was 7.6 MB. Max. memory is 7.1 GB. [2019-11-23 21:04:23,147 INFO L168 Benchmark]: Boogie Preprocessor took 86.58 ms. Allocated memory is still 206.6 MB. Free memory was 165.5 MB in the beginning and 160.0 MB in the end (delta: 5.5 MB). Peak memory consumption was 5.5 MB. Max. memory is 7.1 GB. [2019-11-23 21:04:23,148 INFO L168 Benchmark]: RCFGBuilder took 1334.52 ms. Allocated memory was 206.6 MB in the beginning and 238.6 MB in the end (delta: 32.0 MB). Free memory was 160.0 MB in the beginning and 170.0 MB in the end (delta: -10.1 MB). Peak memory consumption was 76.4 MB. Max. memory is 7.1 GB. [2019-11-23 21:04:23,149 INFO L168 Benchmark]: TraceAbstraction took 23023.64 ms. Allocated memory was 238.6 MB in the beginning and 524.3 MB in the end (delta: 285.7 MB). Free memory was 168.6 MB in the beginning and 400.3 MB in the end (delta: -231.7 MB). Peak memory consumption was 363.5 MB. Max. memory is 7.1 GB. [2019-11-23 21:04:23,154 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27 ms. Allocated memory is still 146.3 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 749.38 ms. Allocated memory was 146.3 MB in the beginning and 206.6 MB in the end (delta: 60.3 MB). Free memory was 101.7 MB in the beginning and 173.0 MB in the end (delta: -71.3 MB). Peak memory consumption was 31.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 101.49 ms. Allocated memory is still 206.6 MB. Free memory was 173.0 MB in the beginning and 165.5 MB in the end (delta: 7.6 MB). Peak memory consumption was 7.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 86.58 ms. Allocated memory is still 206.6 MB. Free memory was 165.5 MB in the beginning and 160.0 MB in the end (delta: 5.5 MB). Peak memory consumption was 5.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1334.52 ms. Allocated memory was 206.6 MB in the beginning and 238.6 MB in the end (delta: 32.0 MB). Free memory was 160.0 MB in the beginning and 170.0 MB in the end (delta: -10.1 MB). Peak memory consumption was 76.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 23023.64 ms. Allocated memory was 238.6 MB in the beginning and 524.3 MB in the end (delta: 285.7 MB). Free memory was 168.6 MB in the beginning and 400.3 MB in the end (delta: -231.7 MB). Peak memory consumption was 363.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 70]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 582]: Loop Invariant [2019-11-23 21:04:23,167 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-23 21:04:23,167 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-23 21:04:23,168 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-23 21:04:23,168 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-23 21:04:23,168 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-23 21:04:23,168 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-23 21:04:23,169 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-23 21:04:23,169 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-23 21:04:23,169 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-23 21:04:23,169 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-23 21:04:23,169 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-23 21:04:23,170 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-23 21:04:23,171 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-23 21:04:23,171 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-23 21:04:23,171 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-23 21:04:23,172 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-23 21:04:23,172 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-23 21:04:23,172 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-23 21:04:23,172 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-23 21:04:23,172 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-23 21:04:23,173 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-23 21:04:23,173 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-23 21:04:23,173 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-23 21:04:23,173 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] Derived loop invariant: ((((((((((((!(a10 == 3) && !(a10 == 2)) && !(a19 == 10)) && a19 <= 8) || (((!(a10 == 2) && !(a19 == 10)) && 1 <= a10) && !(a19 == 8))) || ((218 < a1 && a10 == 2) && a19 <= 8)) || ((((a1 <= 218 && !(a10 == 2)) && !(a19 == 10)) && a19 <= 8) && 0 < a1 + 13)) || (!(a19 == 10) && a10 == 0)) || (((\exists v_~a1~0_342 : int :: ((0 <= v_~a1~0_342 * 9 / 10 && 0 == (v_~a1~0_342 * 9 / 10 + 1) % 25) && a1 <= v_~a1~0_342 * 9 / 10 % 25 + 12) && 0 <= 9 * v_~a1~0_342) && a10 == 2) && a19 == 9)) || a19 == 7) || ((!(a10 == 3) && !(a10 == 2)) && 1 <= a10)) || ((\exists v_~a1~0_342 : int :: ((0 <= v_~a1~0_342 * 9 / 10 && 0 == (v_~a1~0_342 * 9 / 10 + 1) % 25) && a1 <= v_~a1~0_342 * 9 / 10 % 25 + 12) && 0 <= 9 * v_~a1~0_342) && ((((!(a10 == 3) && !(a10 == 2)) && a1 + 437977 <= 0) && !(a19 == 9)) || a10 == 0))) || ((218 < a1 && a10 == 2) && a19 == 9)) || (((\exists v_~a1~0_342 : int :: ((0 <= v_~a1~0_342 * 9 / 10 && 0 == (v_~a1~0_342 * 9 / 10 + 1) % 25) && a1 <= v_~a1~0_342 * 9 / 10 % 25 + 12) && 0 <= 9 * v_~a1~0_342) && a10 == 2) && a19 <= 8) - InvariantResult [Line: 20]: Loop Invariant [2019-11-23 21:04:23,174 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-23 21:04:23,174 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-23 21:04:23,175 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-23 21:04:23,175 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-23 21:04:23,175 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-23 21:04:23,175 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-23 21:04:23,175 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-23 21:04:23,176 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-23 21:04:23,176 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-23 21:04:23,176 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-23 21:04:23,176 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-23 21:04:23,176 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-23 21:04:23,177 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-23 21:04:23,177 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-23 21:04:23,178 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-23 21:04:23,178 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-23 21:04:23,178 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-23 21:04:23,178 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-23 21:04:23,179 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-23 21:04:23,179 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-23 21:04:23,179 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-23 21:04:23,179 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-23 21:04:23,179 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-23 21:04:23,179 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] Derived loop invariant: ((((((((((((!(a10 == 3) && !(a10 == 2)) && !(a19 == 10)) && a19 <= 8) || (((!(a10 == 2) && !(a19 == 10)) && 1 <= a10) && !(a19 == 8))) || ((218 < a1 && a10 == 2) && a19 <= 8)) || ((((a1 <= 218 && !(a10 == 2)) && !(a19 == 10)) && a19 <= 8) && 0 < a1 + 13)) || (!(a19 == 10) && a10 == 0)) || (((\exists v_~a1~0_342 : int :: ((0 <= v_~a1~0_342 * 9 / 10 && 0 == (v_~a1~0_342 * 9 / 10 + 1) % 25) && a1 <= v_~a1~0_342 * 9 / 10 % 25 + 12) && 0 <= 9 * v_~a1~0_342) && a10 == 2) && a19 == 9)) || a19 == 7) || ((!(a10 == 3) && !(a10 == 2)) && 1 <= a10)) || ((\exists v_~a1~0_342 : int :: ((0 <= v_~a1~0_342 * 9 / 10 && 0 == (v_~a1~0_342 * 9 / 10 + 1) % 25) && a1 <= v_~a1~0_342 * 9 / 10 % 25 + 12) && 0 <= 9 * v_~a1~0_342) && ((((!(a10 == 3) && !(a10 == 2)) && a1 + 437977 <= 0) && !(a19 == 9)) || a10 == 0))) || ((218 < a1 && a10 == 2) && a19 == 9)) || (((\exists v_~a1~0_342 : int :: ((0 <= v_~a1~0_342 * 9 / 10 && 0 == (v_~a1~0_342 * 9 / 10 + 1) % 25) && a1 <= v_~a1~0_342 * 9 / 10 % 25 + 12) && 0 <= 9 * v_~a1~0_342) && a10 == 2) && a19 <= 8) - InvariantResult [Line: 576]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 206 locations, 1 error locations. Result: SAFE, OverallTime: 22.9s, OverallIterations: 10, TraceHistogramMax: 4, AutomataDifference: 15.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.4s, HoareTripleCheckerStatistics: 883 SDtfs, 2350 SDslu, 100 SDs, 0 SdLazy, 6897 SolverSat, 979 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 12.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 954 GetRequests, 914 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2506occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 10 MinimizatonAttempts, 2641 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 64 NumberOfFragments, 483 HoareAnnotationTreeSize, 3 FomulaSimplifications, 2362 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 2798 FormulaSimplificationTreeSizeReductionInter, 1.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 2844 NumberOfCodeBlocks, 2844 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 2830 ConstructedInterpolants, 20 QuantifiedInterpolants, 2541186 SizeOfPredicates, 3 NumberOfNonLiveVariables, 1292 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 14 InterpolantComputations, 10 PerfectInterpolantSequences, 1994/2056 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...