java -Xss4m -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem15_label21_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-71425fa [2018-07-22 13:25:18,541 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-22 13:25:18,543 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-22 13:25:18,555 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-22 13:25:18,556 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-22 13:25:18,557 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-22 13:25:18,558 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-22 13:25:18,560 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-22 13:25:18,562 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-22 13:25:18,562 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-22 13:25:18,563 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-22 13:25:18,563 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-22 13:25:18,564 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-22 13:25:18,565 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-22 13:25:18,566 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-22 13:25:18,567 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-22 13:25:18,568 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-22 13:25:18,573 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-22 13:25:18,575 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-22 13:25:18,585 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-22 13:25:18,586 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-22 13:25:18,588 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-22 13:25:18,590 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-22 13:25:18,590 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-22 13:25:18,591 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-22 13:25:18,591 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-22 13:25:18,592 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-22 13:25:18,597 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-22 13:25:18,597 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-22 13:25:18,598 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-22 13:25:18,599 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-22 13:25:18,599 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-22 13:25:18,599 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-22 13:25:18,600 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-22 13:25:18,600 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-22 13:25:18,601 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-22 13:25:18,601 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-07-22 13:25:18,616 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-22 13:25:18,617 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-22 13:25:18,618 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-07-22 13:25:18,618 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-07-22 13:25:18,618 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-07-22 13:25:18,619 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-07-22 13:25:18,619 INFO L133 SettingsManager]: * Use SBE=true [2018-07-22 13:25:18,619 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-07-22 13:25:18,619 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-07-22 13:25:18,619 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-07-22 13:25:18,619 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-07-22 13:25:18,620 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-07-22 13:25:18,620 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-07-22 13:25:18,620 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-07-22 13:25:18,620 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-07-22 13:25:18,620 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-22 13:25:18,621 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-07-22 13:25:18,621 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-07-22 13:25:18,621 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-07-22 13:25:18,621 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-07-22 13:25:18,621 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-22 13:25:18,622 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-07-22 13:25:18,622 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-07-22 13:25:18,622 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-07-22 13:25:18,622 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-07-22 13:25:18,622 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-07-22 13:25:18,622 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-07-22 13:25:18,623 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-22 13:25:18,623 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-07-22 13:25:18,667 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-22 13:25:18,684 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-22 13:25:18,690 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-22 13:25:18,692 INFO L271 PluginConnector]: Initializing CDTParser... [2018-07-22 13:25:18,692 INFO L276 PluginConnector]: CDTParser initialized [2018-07-22 13:25:18,694 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem15_label21_true-unreach-call.c [2018-07-22 13:25:19,092 INFO L220 CDTParser]: Created temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/e3161d332/a55a81778c104c39988d04f9ed69c099/FLAGe32727aaf [2018-07-22 13:25:19,502 INFO L276 CDTParser]: Found 1 translation units. [2018-07-22 13:25:19,503 INFO L158 CDTParser]: Scanning /storage/ultimate/trunk/examples/svcomp/eca-rers2012/Problem15_label21_true-unreach-call.c [2018-07-22 13:25:19,546 INFO L324 CDTParser]: About to delete temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/e3161d332/a55a81778c104c39988d04f9ed69c099/FLAGe32727aaf [2018-07-22 13:25:19,567 INFO L332 CDTParser]: Successfully deleted /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/e3161d332/a55a81778c104c39988d04f9ed69c099 [2018-07-22 13:25:19,579 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-22 13:25:19,585 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-07-22 13:25:19,586 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-07-22 13:25:19,587 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-07-22 13:25:19,595 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-07-22 13:25:19,596 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 01:25:19" (1/1) ... [2018-07-22 13:25:19,599 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2df9384a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:25:19, skipping insertion in model container [2018-07-22 13:25:19,600 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 01:25:19" (1/1) ... [2018-07-22 13:25:19,883 INFO L179 PRDispatcher]: Starting pre-run dispatcher in SV-COMP mode [2018-07-22 13:25:20,600 INFO L175 PostProcessor]: Settings: Checked method=main [2018-07-22 13:25:20,617 INFO L422 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-07-22 13:25:21,046 INFO L175 PostProcessor]: Settings: Checked method=main [2018-07-22 13:25:21,189 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:25:21 WrapperNode [2018-07-22 13:25:21,189 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-07-22 13:25:21,191 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-07-22 13:25:21,191 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-07-22 13:25:21,191 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-07-22 13:25:21,201 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:25:21" (1/1) ... [2018-07-22 13:25:21,269 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:25:21" (1/1) ... [2018-07-22 13:25:21,460 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-07-22 13:25:21,460 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-22 13:25:21,461 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-22 13:25:21,461 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-22 13:25:21,472 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:25:21" (1/1) ... [2018-07-22 13:25:21,472 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:25:21" (1/1) ... [2018-07-22 13:25:21,495 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:25:21" (1/1) ... [2018-07-22 13:25:21,495 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:25:21" (1/1) ... [2018-07-22 13:25:21,603 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:25:21" (1/1) ... [2018-07-22 13:25:22,162 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:25:21" (1/1) ... [2018-07-22 13:25:22,195 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:25:21" (1/1) ... [2018-07-22 13:25:22,217 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-22 13:25:22,218 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-22 13:25:22,218 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-22 13:25:22,219 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-22 13:25:22,220 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:25:21" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-07-22 13:25:22,296 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-07-22 13:25:22,296 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-07-22 13:25:22,296 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-07-22 13:25:29,460 INFO L261 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-07-22 13:25:29,460 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 01:25:29 BoogieIcfgContainer [2018-07-22 13:25:29,461 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-22 13:25:29,461 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-22 13:25:29,462 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-22 13:25:29,465 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-22 13:25:29,465 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 01:25:19" (1/3) ... [2018-07-22 13:25:29,466 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f9ca43f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 01:25:29, skipping insertion in model container [2018-07-22 13:25:29,466 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:25:21" (2/3) ... [2018-07-22 13:25:29,469 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f9ca43f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 01:25:29, skipping insertion in model container [2018-07-22 13:25:29,469 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 01:25:29" (3/3) ... [2018-07-22 13:25:29,471 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem15_label21_true-unreach-call.c [2018-07-22 13:25:29,483 INFO L132 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-07-22 13:25:29,492 INFO L144 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-22 13:25:29,554 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-22 13:25:29,555 INFO L373 AbstractCegarLoop]: Interprodecural is true [2018-07-22 13:25:29,555 INFO L374 AbstractCegarLoop]: Hoare is true [2018-07-22 13:25:29,555 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-07-22 13:25:29,555 INFO L376 AbstractCegarLoop]: Backedges is TWOTRACK [2018-07-22 13:25:29,555 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-22 13:25:29,555 INFO L378 AbstractCegarLoop]: Difference is false [2018-07-22 13:25:29,555 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-22 13:25:29,555 INFO L384 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-22 13:25:29,583 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states. [2018-07-22 13:25:29,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-07-22 13:25:29,592 INFO L350 BasicCegarLoop]: Found error trace [2018-07-22 13:25:29,593 INFO L358 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, 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] [2018-07-22 13:25:29,594 INFO L414 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-22 13:25:29,599 INFO L82 PathProgramCache]: Analyzing trace with hash 1059493314, now seen corresponding path program 1 times [2018-07-22 13:25:29,601 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-22 13:25:29,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-22 13:25:29,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 13:25:29,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-22 13:25:29,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 13:25:29,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-22 13:25:30,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-22 13:25:30,111 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-22 13:25:30,111 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-22 13:25:30,115 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-22 13:25:30,133 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-22 13:25:30,133 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-22 13:25:30,136 INFO L87 Difference]: Start difference. First operand 425 states. Second operand 4 states. [2018-07-22 13:25:37,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-22 13:25:37,958 INFO L93 Difference]: Finished difference Result 1470 states and 2719 transitions. [2018-07-22 13:25:37,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-22 13:25:37,959 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2018-07-22 13:25:37,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-22 13:25:37,984 INFO L225 Difference]: With dead ends: 1470 [2018-07-22 13:25:37,985 INFO L226 Difference]: Without dead ends: 1038 [2018-07-22 13:25:37,991 INFO L578 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-22 13:25:38,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1038 states. [2018-07-22 13:25:38,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1038 to 1036. [2018-07-22 13:25:38,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1036 states. [2018-07-22 13:25:38,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1036 states to 1036 states and 1553 transitions. [2018-07-22 13:25:38,109 INFO L78 Accepts]: Start accepts. Automaton has 1036 states and 1553 transitions. Word has length 61 [2018-07-22 13:25:38,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-22 13:25:38,109 INFO L471 AbstractCegarLoop]: Abstraction has 1036 states and 1553 transitions. [2018-07-22 13:25:38,109 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-22 13:25:38,110 INFO L276 IsEmpty]: Start isEmpty. Operand 1036 states and 1553 transitions. [2018-07-22 13:25:38,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-07-22 13:25:38,117 INFO L350 BasicCegarLoop]: Found error trace [2018-07-22 13:25:38,117 INFO L358 BasicCegarLoop]: trace histogram [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] [2018-07-22 13:25:38,117 INFO L414 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-22 13:25:38,118 INFO L82 PathProgramCache]: Analyzing trace with hash 303710982, now seen corresponding path program 1 times [2018-07-22 13:25:38,118 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-22 13:25:38,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-22 13:25:38,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 13:25:38,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-22 13:25:38,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 13:25:38,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-22 13:25:38,631 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-22 13:25:38,632 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-22 13:25:38,666 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-22 13:25:38,668 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-22 13:25:38,668 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-22 13:25:38,668 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-07-22 13:25:38,668 INFO L87 Difference]: Start difference. First operand 1036 states and 1553 transitions. Second operand 5 states. [2018-07-22 13:25:47,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-22 13:25:47,723 INFO L93 Difference]: Finished difference Result 3292 states and 4885 transitions. [2018-07-22 13:25:47,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-22 13:25:47,724 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 127 [2018-07-22 13:25:47,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-22 13:25:47,738 INFO L225 Difference]: With dead ends: 3292 [2018-07-22 13:25:47,738 INFO L226 Difference]: Without dead ends: 2258 [2018-07-22 13:25:47,745 INFO L578 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-07-22 13:25:47,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2258 states. [2018-07-22 13:25:47,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2258 to 1950. [2018-07-22 13:25:47,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1950 states. [2018-07-22 13:25:47,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1950 states to 1950 states and 2697 transitions. [2018-07-22 13:25:47,829 INFO L78 Accepts]: Start accepts. Automaton has 1950 states and 2697 transitions. Word has length 127 [2018-07-22 13:25:47,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-22 13:25:47,829 INFO L471 AbstractCegarLoop]: Abstraction has 1950 states and 2697 transitions. [2018-07-22 13:25:47,829 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-22 13:25:47,830 INFO L276 IsEmpty]: Start isEmpty. Operand 1950 states and 2697 transitions. [2018-07-22 13:25:47,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-07-22 13:25:47,834 INFO L350 BasicCegarLoop]: Found error trace [2018-07-22 13:25:47,834 INFO L358 BasicCegarLoop]: trace histogram [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] [2018-07-22 13:25:47,834 INFO L414 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-22 13:25:47,835 INFO L82 PathProgramCache]: Analyzing trace with hash 235551512, now seen corresponding path program 1 times [2018-07-22 13:25:47,835 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-22 13:25:47,835 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-22 13:25:47,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 13:25:47,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-22 13:25:47,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 13:25:47,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-22 13:25:48,062 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-22 13:25:48,062 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-22 13:25:48,062 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-22 13:25:48,063 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-22 13:25:48,063 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-22 13:25:48,063 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-22 13:25:48,064 INFO L87 Difference]: Start difference. First operand 1950 states and 2697 transitions. Second operand 4 states. [2018-07-22 13:25:51,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-22 13:25:51,271 INFO L93 Difference]: Finished difference Result 7208 states and 10119 transitions. [2018-07-22 13:25:51,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-22 13:25:51,272 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 132 [2018-07-22 13:25:51,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-22 13:25:51,296 INFO L225 Difference]: With dead ends: 7208 [2018-07-22 13:25:51,296 INFO L226 Difference]: Without dead ends: 5260 [2018-07-22 13:25:51,300 INFO L578 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-22 13:25:51,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5260 states. [2018-07-22 13:25:51,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5260 to 5254. [2018-07-22 13:25:51,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5254 states. [2018-07-22 13:25:51,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5254 states to 5254 states and 6742 transitions. [2018-07-22 13:25:51,433 INFO L78 Accepts]: Start accepts. Automaton has 5254 states and 6742 transitions. Word has length 132 [2018-07-22 13:25:51,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-22 13:25:51,433 INFO L471 AbstractCegarLoop]: Abstraction has 5254 states and 6742 transitions. [2018-07-22 13:25:51,433 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-22 13:25:51,433 INFO L276 IsEmpty]: Start isEmpty. Operand 5254 states and 6742 transitions. [2018-07-22 13:25:51,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-07-22 13:25:51,438 INFO L350 BasicCegarLoop]: Found error trace [2018-07-22 13:25:51,438 INFO L358 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-22 13:25:51,438 INFO L414 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-22 13:25:51,438 INFO L82 PathProgramCache]: Analyzing trace with hash -1470256139, now seen corresponding path program 1 times [2018-07-22 13:25:51,438 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-22 13:25:51,439 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-22 13:25:51,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 13:25:51,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-22 13:25:51,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 13:25:51,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-22 13:25:51,894 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 4 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-22 13:25:51,895 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-22 13:25:51,895 INFO L219 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-22 13:25:51,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-22 13:25:51,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-22 13:25:52,004 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-22 13:25:52,084 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-22 13:25:52,118 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-07-22 13:25:52,118 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2018-07-22 13:25:52,119 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-22 13:25:52,119 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-22 13:25:52,119 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-07-22 13:25:52,119 INFO L87 Difference]: Start difference. First operand 5254 states and 6742 transitions. Second operand 5 states. [2018-07-22 13:25:58,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-22 13:25:58,440 INFO L93 Difference]: Finished difference Result 17486 states and 23062 transitions. [2018-07-22 13:25:58,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-22 13:25:58,440 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 153 [2018-07-22 13:25:58,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-22 13:25:58,489 INFO L225 Difference]: With dead ends: 17486 [2018-07-22 13:25:58,489 INFO L226 Difference]: Without dead ends: 12234 [2018-07-22 13:25:58,496 INFO L578 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-07-22 13:25:58,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12234 states. [2018-07-22 13:25:58,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12234 to 12191. [2018-07-22 13:25:58,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12191 states. [2018-07-22 13:25:58,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12191 states to 12191 states and 15289 transitions. [2018-07-22 13:25:58,785 INFO L78 Accepts]: Start accepts. Automaton has 12191 states and 15289 transitions. Word has length 153 [2018-07-22 13:25:58,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-22 13:25:58,786 INFO L471 AbstractCegarLoop]: Abstraction has 12191 states and 15289 transitions. [2018-07-22 13:25:58,786 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-22 13:25:58,786 INFO L276 IsEmpty]: Start isEmpty. Operand 12191 states and 15289 transitions. [2018-07-22 13:25:58,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-07-22 13:25:58,792 INFO L350 BasicCegarLoop]: Found error trace [2018-07-22 13:25:58,792 INFO L358 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 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] [2018-07-22 13:25:58,792 INFO L414 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-22 13:25:58,793 INFO L82 PathProgramCache]: Analyzing trace with hash 1189801408, now seen corresponding path program 1 times [2018-07-22 13:25:58,793 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-22 13:25:58,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-22 13:25:58,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 13:25:58,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-22 13:25:58,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 13:25:58,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-22 13:25:59,189 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 117 proven. 4 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-07-22 13:25:59,189 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-22 13:25:59,189 INFO L219 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-22 13:25:59,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-22 13:25:59,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-22 13:25:59,285 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-22 13:25:59,401 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-22 13:25:59,422 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-07-22 13:25:59,422 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2018-07-22 13:25:59,422 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-22 13:25:59,422 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-22 13:25:59,423 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-22 13:25:59,423 INFO L87 Difference]: Start difference. First operand 12191 states and 15289 transitions. Second operand 4 states. [2018-07-22 13:26:01,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-22 13:26:01,870 INFO L93 Difference]: Finished difference Result 38266 states and 48763 transitions. [2018-07-22 13:26:01,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-22 13:26:01,870 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 222 [2018-07-22 13:26:01,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-22 13:26:01,955 INFO L225 Difference]: With dead ends: 38266 [2018-07-22 13:26:01,955 INFO L226 Difference]: Without dead ends: 26377 [2018-07-22 13:26:01,967 INFO L578 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-22 13:26:01,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26377 states. [2018-07-22 13:26:02,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26377 to 16988. [2018-07-22 13:26:02,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16988 states. [2018-07-22 13:26:02,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16988 states to 16988 states and 20291 transitions. [2018-07-22 13:26:02,395 INFO L78 Accepts]: Start accepts. Automaton has 16988 states and 20291 transitions. Word has length 222 [2018-07-22 13:26:02,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-22 13:26:02,397 INFO L471 AbstractCegarLoop]: Abstraction has 16988 states and 20291 transitions. [2018-07-22 13:26:02,398 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-22 13:26:02,398 INFO L276 IsEmpty]: Start isEmpty. Operand 16988 states and 20291 transitions. [2018-07-22 13:26:02,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2018-07-22 13:26:02,406 INFO L350 BasicCegarLoop]: Found error trace [2018-07-22 13:26:02,407 INFO L358 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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] [2018-07-22 13:26:02,407 INFO L414 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-22 13:26:02,407 INFO L82 PathProgramCache]: Analyzing trace with hash -1594518826, now seen corresponding path program 1 times [2018-07-22 13:26:02,407 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-22 13:26:02,408 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-22 13:26:02,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 13:26:02,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-22 13:26:02,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 13:26:02,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-22 13:26:03,144 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2018-07-22 13:26:03,145 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-22 13:26:03,145 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-22 13:26:03,146 INFO L450 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-22 13:26:03,146 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-22 13:26:03,146 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-07-22 13:26:03,146 INFO L87 Difference]: Start difference. First operand 16988 states and 20291 transitions. Second operand 6 states. [2018-07-22 13:26:07,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-22 13:26:07,748 INFO L93 Difference]: Finished difference Result 39702 states and 47968 transitions. [2018-07-22 13:26:07,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-22 13:26:07,749 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 324 [2018-07-22 13:26:07,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-22 13:26:07,780 INFO L225 Difference]: With dead ends: 39702 [2018-07-22 13:26:07,780 INFO L226 Difference]: Without dead ends: 23016 [2018-07-22 13:26:07,797 INFO L578 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-07-22 13:26:07,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23016 states. [2018-07-22 13:26:08,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23016 to 22994. [2018-07-22 13:26:08,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22994 states. [2018-07-22 13:26:08,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22994 states to 22994 states and 27081 transitions. [2018-07-22 13:26:08,261 INFO L78 Accepts]: Start accepts. Automaton has 22994 states and 27081 transitions. Word has length 324 [2018-07-22 13:26:08,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-22 13:26:08,262 INFO L471 AbstractCegarLoop]: Abstraction has 22994 states and 27081 transitions. [2018-07-22 13:26:08,262 INFO L472 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-22 13:26:08,262 INFO L276 IsEmpty]: Start isEmpty. Operand 22994 states and 27081 transitions. [2018-07-22 13:26:08,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2018-07-22 13:26:08,276 INFO L350 BasicCegarLoop]: Found error trace [2018-07-22 13:26:08,277 INFO L358 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-22 13:26:08,277 INFO L414 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-22 13:26:08,277 INFO L82 PathProgramCache]: Analyzing trace with hash 1084491977, now seen corresponding path program 1 times [2018-07-22 13:26:08,277 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-22 13:26:08,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-22 13:26:08,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 13:26:08,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-22 13:26:08,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 13:26:08,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-22 13:26:08,869 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-07-22 13:26:08,869 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-22 13:26:08,869 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-22 13:26:08,873 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-22 13:26:08,874 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-22 13:26:08,874 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-22 13:26:08,874 INFO L87 Difference]: Start difference. First operand 22994 states and 27081 transitions. Second operand 4 states. [2018-07-22 13:26:13,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-22 13:26:13,593 INFO L93 Difference]: Finished difference Result 51385 states and 60886 transitions. [2018-07-22 13:26:13,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-22 13:26:13,596 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 409 [2018-07-22 13:26:13,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-22 13:26:13,646 INFO L225 Difference]: With dead ends: 51385 [2018-07-22 13:26:13,646 INFO L226 Difference]: Without dead ends: 28693 [2018-07-22 13:26:13,678 INFO L578 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-22 13:26:13,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28693 states. [2018-07-22 13:26:14,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28693 to 25377. [2018-07-22 13:26:14,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25377 states. [2018-07-22 13:26:14,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25377 states to 25377 states and 28846 transitions. [2018-07-22 13:26:14,219 INFO L78 Accepts]: Start accepts. Automaton has 25377 states and 28846 transitions. Word has length 409 [2018-07-22 13:26:14,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-22 13:26:14,220 INFO L471 AbstractCegarLoop]: Abstraction has 25377 states and 28846 transitions. [2018-07-22 13:26:14,221 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-22 13:26:14,221 INFO L276 IsEmpty]: Start isEmpty. Operand 25377 states and 28846 transitions. [2018-07-22 13:26:14,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 411 [2018-07-22 13:26:14,234 INFO L350 BasicCegarLoop]: Found error trace [2018-07-22 13:26:14,234 INFO L358 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-22 13:26:14,235 INFO L414 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-22 13:26:14,235 INFO L82 PathProgramCache]: Analyzing trace with hash -1387767710, now seen corresponding path program 1 times [2018-07-22 13:26:14,235 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-22 13:26:14,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-22 13:26:14,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 13:26:14,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-22 13:26:14,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 13:26:14,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-22 13:26:14,963 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-07-22 13:26:14,963 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-22 13:26:14,963 INFO L219 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-22 13:26:14,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-22 13:26:15,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-22 13:26:15,087 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-22 13:26:16,011 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-07-22 13:26:16,030 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-07-22 13:26:16,030 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2018-07-22 13:26:16,031 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-22 13:26:16,031 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-22 13:26:16,031 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-07-22 13:26:16,032 INFO L87 Difference]: Start difference. First operand 25377 states and 28846 transitions. Second operand 7 states. [2018-07-22 13:26:23,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-22 13:26:23,323 INFO L93 Difference]: Finished difference Result 76601 states and 88155 transitions. [2018-07-22 13:26:23,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-07-22 13:26:23,323 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 410 [2018-07-22 13:26:23,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-22 13:26:23,368 INFO L225 Difference]: With dead ends: 76601 [2018-07-22 13:26:23,368 INFO L226 Difference]: Without dead ends: 39178 [2018-07-22 13:26:23,390 INFO L578 BasicCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 408 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-07-22 13:26:23,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39178 states. [2018-07-22 13:26:23,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39178 to 34350. [2018-07-22 13:26:23,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34350 states. [2018-07-22 13:26:23,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34350 states to 34350 states and 36894 transitions. [2018-07-22 13:26:23,854 INFO L78 Accepts]: Start accepts. Automaton has 34350 states and 36894 transitions. Word has length 410 [2018-07-22 13:26:23,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-22 13:26:23,854 INFO L471 AbstractCegarLoop]: Abstraction has 34350 states and 36894 transitions. [2018-07-22 13:26:23,855 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-22 13:26:23,855 INFO L276 IsEmpty]: Start isEmpty. Operand 34350 states and 36894 transitions. [2018-07-22 13:26:23,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 538 [2018-07-22 13:26:23,883 INFO L350 BasicCegarLoop]: Found error trace [2018-07-22 13:26:23,883 INFO L358 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 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, 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] [2018-07-22 13:26:23,883 INFO L414 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-22 13:26:23,884 INFO L82 PathProgramCache]: Analyzing trace with hash 1622554676, now seen corresponding path program 1 times [2018-07-22 13:26:23,885 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-22 13:26:23,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-22 13:26:23,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 13:26:23,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-22 13:26:23,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 13:26:23,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-22 13:26:24,742 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 390 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2018-07-22 13:26:24,742 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-22 13:26:24,743 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-22 13:26:24,743 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-22 13:26:24,744 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-22 13:26:24,744 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-22 13:26:24,744 INFO L87 Difference]: Start difference. First operand 34350 states and 36894 transitions. Second operand 4 states. [2018-07-22 13:26:27,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-22 13:26:27,300 INFO L93 Difference]: Finished difference Result 70501 states and 75886 transitions. [2018-07-22 13:26:27,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-22 13:26:27,301 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 537 [2018-07-22 13:26:27,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-22 13:26:27,328 INFO L225 Difference]: With dead ends: 70501 [2018-07-22 13:26:27,328 INFO L226 Difference]: Without dead ends: 36453 [2018-07-22 13:26:27,350 INFO L578 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-22 13:26:27,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36453 states. [2018-07-22 13:26:28,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36453 to 35845. [2018-07-22 13:26:28,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35845 states. [2018-07-22 13:26:28,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35845 states to 35845 states and 37973 transitions. [2018-07-22 13:26:28,055 INFO L78 Accepts]: Start accepts. Automaton has 35845 states and 37973 transitions. Word has length 537 [2018-07-22 13:26:28,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-22 13:26:28,055 INFO L471 AbstractCegarLoop]: Abstraction has 35845 states and 37973 transitions. [2018-07-22 13:26:28,055 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-22 13:26:28,056 INFO L276 IsEmpty]: Start isEmpty. Operand 35845 states and 37973 transitions. [2018-07-22 13:26:28,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 552 [2018-07-22 13:26:28,075 INFO L350 BasicCegarLoop]: Found error trace [2018-07-22 13:26:28,076 INFO L358 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 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, 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] [2018-07-22 13:26:28,076 INFO L414 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-22 13:26:28,076 INFO L82 PathProgramCache]: Analyzing trace with hash -396535485, now seen corresponding path program 1 times [2018-07-22 13:26:28,077 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-22 13:26:28,077 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-22 13:26:28,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 13:26:28,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-22 13:26:28,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 13:26:28,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-22 13:26:28,508 INFO L134 CoverageAnalysis]: Checked inductivity of 501 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2018-07-22 13:26:28,508 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-22 13:26:28,508 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-22 13:26:28,509 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-22 13:26:28,509 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-22 13:26:28,509 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-22 13:26:28,509 INFO L87 Difference]: Start difference. First operand 35845 states and 37973 transitions. Second operand 3 states. [2018-07-22 13:26:30,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-22 13:26:30,510 INFO L93 Difference]: Finished difference Result 71385 states and 75656 transitions. [2018-07-22 13:26:30,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-22 13:26:30,511 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 551 [2018-07-22 13:26:30,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-22 13:26:30,545 INFO L225 Difference]: With dead ends: 71385 [2018-07-22 13:26:30,545 INFO L226 Difference]: Without dead ends: 37644 [2018-07-22 13:26:30,558 INFO L578 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-22 13:26:30,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37644 states. [2018-07-22 13:26:30,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37644 to 35844. [2018-07-22 13:26:30,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35844 states. [2018-07-22 13:26:30,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35844 states to 35844 states and 37705 transitions. [2018-07-22 13:26:30,907 INFO L78 Accepts]: Start accepts. Automaton has 35844 states and 37705 transitions. Word has length 551 [2018-07-22 13:26:30,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-22 13:26:30,908 INFO L471 AbstractCegarLoop]: Abstraction has 35844 states and 37705 transitions. [2018-07-22 13:26:30,908 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-22 13:26:30,909 INFO L276 IsEmpty]: Start isEmpty. Operand 35844 states and 37705 transitions. [2018-07-22 13:26:30,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 621 [2018-07-22 13:26:30,918 INFO L350 BasicCegarLoop]: Found error trace [2018-07-22 13:26:30,918 INFO L358 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 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, 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] [2018-07-22 13:26:30,918 INFO L414 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-22 13:26:30,919 INFO L82 PathProgramCache]: Analyzing trace with hash -1678454478, now seen corresponding path program 1 times [2018-07-22 13:26:30,919 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-22 13:26:30,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-22 13:26:30,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 13:26:30,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-22 13:26:30,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 13:26:31,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-22 13:26:31,877 INFO L134 CoverageAnalysis]: Checked inductivity of 766 backedges. 441 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2018-07-22 13:26:31,877 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-22 13:26:31,877 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-22 13:26:31,878 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-22 13:26:31,878 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-22 13:26:31,878 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-22 13:26:31,878 INFO L87 Difference]: Start difference. First operand 35844 states and 37705 transitions. Second operand 3 states. [2018-07-22 13:26:34,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-22 13:26:34,104 INFO L93 Difference]: Finished difference Result 70484 states and 74226 transitions. [2018-07-22 13:26:34,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-22 13:26:34,104 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 620 [2018-07-22 13:26:34,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-22 13:26:34,146 INFO L225 Difference]: With dead ends: 70484 [2018-07-22 13:26:34,146 INFO L226 Difference]: Without dead ends: 36744 [2018-07-22 13:26:34,167 INFO L578 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-22 13:26:34,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36744 states. [2018-07-22 13:26:34,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36744 to 36744. [2018-07-22 13:26:34,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36744 states. [2018-07-22 13:26:34,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36744 states to 36744 states and 38540 transitions. [2018-07-22 13:26:34,935 INFO L78 Accepts]: Start accepts. Automaton has 36744 states and 38540 transitions. Word has length 620 [2018-07-22 13:26:34,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-22 13:26:34,935 INFO L471 AbstractCegarLoop]: Abstraction has 36744 states and 38540 transitions. [2018-07-22 13:26:34,935 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-22 13:26:34,935 INFO L276 IsEmpty]: Start isEmpty. Operand 36744 states and 38540 transitions. [2018-07-22 13:26:34,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 645 [2018-07-22 13:26:34,945 INFO L350 BasicCegarLoop]: Found error trace [2018-07-22 13:26:34,946 INFO L358 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-22 13:26:34,946 INFO L414 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-22 13:26:34,946 INFO L82 PathProgramCache]: Analyzing trace with hash -947319469, now seen corresponding path program 1 times [2018-07-22 13:26:34,946 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-22 13:26:34,946 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-22 13:26:34,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 13:26:34,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-22 13:26:34,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 13:26:35,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-22 13:26:35,581 WARN L169 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-07-22 13:26:37,433 INFO L134 CoverageAnalysis]: Checked inductivity of 790 backedges. 556 proven. 136 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2018-07-22 13:26:37,433 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-22 13:26:37,433 INFO L219 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-22 13:26:37,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-22 13:26:37,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-22 13:26:37,585 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-22 13:26:37,784 INFO L134 CoverageAnalysis]: Checked inductivity of 790 backedges. 624 proven. 0 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2018-07-22 13:26:37,806 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-07-22 13:26:37,806 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2018-07-22 13:26:37,807 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-22 13:26:37,807 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-22 13:26:37,807 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-07-22 13:26:37,808 INFO L87 Difference]: Start difference. First operand 36744 states and 38540 transitions. Second operand 9 states. [2018-07-22 13:26:43,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-22 13:26:43,922 INFO L93 Difference]: Finished difference Result 72912 states and 76492 transitions. [2018-07-22 13:26:43,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-22 13:26:43,922 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 644 [2018-07-22 13:26:43,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-22 13:26:43,950 INFO L225 Difference]: With dead ends: 72912 [2018-07-22 13:26:43,950 INFO L226 Difference]: Without dead ends: 36470 [2018-07-22 13:26:43,965 INFO L578 BasicCegarLoop]: 0 DeclaredPredicates, 660 GetRequests, 648 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2018-07-22 13:26:43,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36470 states. [2018-07-22 13:26:44,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36470 to 35239. [2018-07-22 13:26:44,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35239 states. [2018-07-22 13:26:44,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35239 states to 35239 states and 36615 transitions. [2018-07-22 13:26:44,263 INFO L78 Accepts]: Start accepts. Automaton has 35239 states and 36615 transitions. Word has length 644 [2018-07-22 13:26:44,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-22 13:26:44,263 INFO L471 AbstractCegarLoop]: Abstraction has 35239 states and 36615 transitions. [2018-07-22 13:26:44,263 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-22 13:26:44,263 INFO L276 IsEmpty]: Start isEmpty. Operand 35239 states and 36615 transitions. [2018-07-22 13:26:44,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 762 [2018-07-22 13:26:44,278 INFO L350 BasicCegarLoop]: Found error trace [2018-07-22 13:26:44,279 INFO L358 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 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] [2018-07-22 13:26:44,279 INFO L414 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-22 13:26:44,279 INFO L82 PathProgramCache]: Analyzing trace with hash -2043186924, now seen corresponding path program 1 times [2018-07-22 13:26:44,279 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-22 13:26:44,279 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-22 13:26:44,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 13:26:44,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-22 13:26:44,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 13:26:44,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-22 13:26:45,068 INFO L134 CoverageAnalysis]: Checked inductivity of 905 backedges. 441 proven. 0 refuted. 0 times theorem prover too weak. 464 trivial. 0 not checked. [2018-07-22 13:26:45,069 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-22 13:26:45,069 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-22 13:26:45,069 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-22 13:26:45,070 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-22 13:26:45,070 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-07-22 13:26:45,070 INFO L87 Difference]: Start difference. First operand 35239 states and 36615 transitions. Second operand 5 states. [2018-07-22 13:26:49,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-22 13:26:49,937 INFO L93 Difference]: Finished difference Result 75297 states and 78307 transitions. [2018-07-22 13:26:49,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-22 13:26:49,937 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 761 [2018-07-22 13:26:49,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-22 13:26:49,968 INFO L225 Difference]: With dead ends: 75297 [2018-07-22 13:26:49,968 INFO L226 Difference]: Without dead ends: 42162 [2018-07-22 13:26:49,980 INFO L578 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-07-22 13:26:49,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42162 states. [2018-07-22 13:26:50,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42162 to 34639. [2018-07-22 13:26:50,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34639 states. [2018-07-22 13:26:50,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34639 states to 34639 states and 35929 transitions. [2018-07-22 13:26:50,314 INFO L78 Accepts]: Start accepts. Automaton has 34639 states and 35929 transitions. Word has length 761 [2018-07-22 13:26:50,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-22 13:26:50,314 INFO L471 AbstractCegarLoop]: Abstraction has 34639 states and 35929 transitions. [2018-07-22 13:26:50,314 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-22 13:26:50,314 INFO L276 IsEmpty]: Start isEmpty. Operand 34639 states and 35929 transitions. [2018-07-22 13:26:50,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 770 [2018-07-22 13:26:50,330 INFO L350 BasicCegarLoop]: Found error trace [2018-07-22 13:26:50,330 INFO L358 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-22 13:26:50,330 INFO L414 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-22 13:26:50,331 INFO L82 PathProgramCache]: Analyzing trace with hash -634602583, now seen corresponding path program 1 times [2018-07-22 13:26:50,331 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-22 13:26:50,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-22 13:26:50,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 13:26:50,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-22 13:26:50,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 13:26:50,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-22 13:26:51,314 INFO L134 CoverageAnalysis]: Checked inductivity of 1271 backedges. 875 proven. 0 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2018-07-22 13:26:51,314 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-22 13:26:51,314 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-22 13:26:51,315 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-22 13:26:51,315 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-22 13:26:51,315 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-07-22 13:26:51,316 INFO L87 Difference]: Start difference. First operand 34639 states and 35929 transitions. Second operand 5 states. [2018-07-22 13:26:55,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-22 13:26:55,598 INFO L93 Difference]: Finished difference Result 65642 states and 68080 transitions. [2018-07-22 13:26:55,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-22 13:26:55,600 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 769 [2018-07-22 13:26:55,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-22 13:26:55,614 INFO L225 Difference]: With dead ends: 65642 [2018-07-22 13:26:55,615 INFO L226 Difference]: Without dead ends: 17452 [2018-07-22 13:26:55,630 INFO L578 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-07-22 13:26:55,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17452 states. [2018-07-22 13:26:55,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17452 to 12045. [2018-07-22 13:26:55,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12045 states. [2018-07-22 13:26:55,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12045 states to 12045 states and 12297 transitions. [2018-07-22 13:26:55,750 INFO L78 Accepts]: Start accepts. Automaton has 12045 states and 12297 transitions. Word has length 769 [2018-07-22 13:26:55,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-22 13:26:55,751 INFO L471 AbstractCegarLoop]: Abstraction has 12045 states and 12297 transitions. [2018-07-22 13:26:55,751 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-22 13:26:55,751 INFO L276 IsEmpty]: Start isEmpty. Operand 12045 states and 12297 transitions. [2018-07-22 13:26:55,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 773 [2018-07-22 13:26:55,756 INFO L350 BasicCegarLoop]: Found error trace [2018-07-22 13:26:55,757 INFO L358 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 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] [2018-07-22 13:26:55,757 INFO L414 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-22 13:26:55,757 INFO L82 PathProgramCache]: Analyzing trace with hash 2055028223, now seen corresponding path program 1 times [2018-07-22 13:26:55,757 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-22 13:26:55,757 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-22 13:26:55,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 13:26:55,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-22 13:26:55,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 13:26:55,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-22 13:26:56,489 INFO L134 CoverageAnalysis]: Checked inductivity of 929 backedges. 441 proven. 0 refuted. 0 times theorem prover too weak. 488 trivial. 0 not checked. [2018-07-22 13:26:56,489 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-22 13:26:56,489 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-22 13:26:56,489 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-22 13:26:56,490 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-22 13:26:56,490 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-22 13:26:56,490 INFO L87 Difference]: Start difference. First operand 12045 states and 12297 transitions. Second operand 4 states. [2018-07-22 13:26:57,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-22 13:26:57,692 INFO L93 Difference]: Finished difference Result 26490 states and 27045 transitions. [2018-07-22 13:26:57,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-22 13:26:57,693 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 772 [2018-07-22 13:26:57,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-22 13:26:57,693 INFO L225 Difference]: With dead ends: 26490 [2018-07-22 13:26:57,693 INFO L226 Difference]: Without dead ends: 0 [2018-07-22 13:26:57,699 INFO L578 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-22 13:26:57,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-07-22 13:26:57,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-07-22 13:26:57,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-07-22 13:26:57,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-07-22 13:26:57,700 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 772 [2018-07-22 13:26:57,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-22 13:26:57,700 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-07-22 13:26:57,700 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-22 13:26:57,701 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-07-22 13:26:57,701 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-07-22 13:26:57,705 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-07-22 13:26:57,761 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 13:26:58,131 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 13:26:58,137 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 13:26:58,138 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 13:26:58,175 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 13:26:58,192 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 13:26:58,350 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 13:26:58,351 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 13:26:58,351 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 13:26:58,404 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 13:26:58,519 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 13:26:58,592 WARN L169 SmtUtils]: Spent 880.00 ms on a formula simplification. DAG size of input: 523 DAG size of output: 413 [2018-07-22 13:26:58,628 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 13:26:58,670 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 13:26:58,691 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 13:26:59,072 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 13:26:59,080 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 13:26:59,106 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 13:26:59,106 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 13:26:59,162 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 13:26:59,200 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 13:26:59,231 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 13:26:59,700 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 13:26:59,766 WARN L169 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 706 DAG size of output: 566 [2018-07-22 13:26:59,799 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 13:26:59,826 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 13:26:59,845 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 13:27:00,161 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 13:27:00,168 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 13:27:00,168 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 13:27:00,169 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 13:27:00,214 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 13:27:00,253 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 13:27:00,279 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 13:27:00,596 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 13:27:00,632 WARN L169 SmtUtils]: Spent 863.00 ms on a formula simplification. DAG size of input: 706 DAG size of output: 566 [2018-07-22 13:27:03,585 WARN L169 SmtUtils]: Spent 2.95 s on a formula simplification. DAG size of input: 402 DAG size of output: 116 [2018-07-22 13:27:06,924 WARN L169 SmtUtils]: Spent 3.34 s on a formula simplification. DAG size of input: 545 DAG size of output: 119 [2018-07-22 13:27:10,244 WARN L169 SmtUtils]: Spent 3.32 s on a formula simplification. DAG size of input: 545 DAG size of output: 119 [2018-07-22 13:27:10,247 INFO L421 ceAbstractionStarter]: For program point L530''(lines 530 541) no Hoare annotation was computed. [2018-07-22 13:27:10,247 INFO L421 ceAbstractionStarter]: For program point L707(lines 707 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,247 INFO L421 ceAbstractionStarter]: For program point L1701(lines 1701 1756) no Hoare annotation was computed. [2018-07-22 13:27:10,248 INFO L421 ceAbstractionStarter]: For program point L1709(lines 1709 1756) no Hoare annotation was computed. [2018-07-22 13:27:10,248 INFO L421 ceAbstractionStarter]: For program point L1706(lines 1706 1756) no Hoare annotation was computed. [2018-07-22 13:27:10,248 INFO L421 ceAbstractionStarter]: For program point L725(lines 725 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,248 INFO L421 ceAbstractionStarter]: For program point L712(lines 712 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,248 INFO L421 ceAbstractionStarter]: For program point L718(lines 718 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,248 INFO L421 ceAbstractionStarter]: For program point L521''(lines 521 528) no Hoare annotation was computed. [2018-07-22 13:27:10,248 INFO L421 ceAbstractionStarter]: For program point L742(lines 742 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,248 INFO L421 ceAbstractionStarter]: For program point L748(lines 748 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,248 INFO L421 ceAbstractionStarter]: For program point L1735(lines 1735 1756) no Hoare annotation was computed. [2018-07-22 13:27:10,248 INFO L421 ceAbstractionStarter]: For program point L732(lines 732 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,248 INFO L421 ceAbstractionStarter]: For program point L735(lines 735 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,248 INFO L421 ceAbstractionStarter]: For program point L1749(lines 1749 1756) no Hoare annotation was computed. [2018-07-22 13:27:10,248 INFO L421 ceAbstractionStarter]: For program point L1742(lines 1742 1756) no Hoare annotation was computed. [2018-07-22 13:27:10,248 INFO L421 ceAbstractionStarter]: For program point L761(lines 761 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,248 INFO L421 ceAbstractionStarter]: For program point L768(lines 768 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,248 INFO L421 ceAbstractionStarter]: For program point L1710(lines 1710 1721) no Hoare annotation was computed. [2018-07-22 13:27:10,248 INFO L421 ceAbstractionStarter]: For program point L694''(lines 694 706) no Hoare annotation was computed. [2018-07-22 13:27:10,249 INFO L421 ceAbstractionStarter]: For program point L754(lines 754 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,249 INFO L421 ceAbstractionStarter]: For program point L1722(lines 1722 1756) no Hoare annotation was computed. [2018-07-22 13:27:10,249 INFO L421 ceAbstractionStarter]: For program point L1729(lines 1729 1756) no Hoare annotation was computed. [2018-07-22 13:27:10,249 INFO L421 ceAbstractionStarter]: For program point L1771(line 1771) no Hoare annotation was computed. [2018-07-22 13:27:10,249 INFO L421 ceAbstractionStarter]: For program point L786(lines 786 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,249 INFO L421 ceAbstractionStarter]: For program point L307(lines 307 319) no Hoare annotation was computed. [2018-07-22 13:27:10,249 INFO L421 ceAbstractionStarter]: For program point L306(lines 306 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,249 INFO L421 ceAbstractionStarter]: For program point L1300(lines 1300 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,249 INFO L421 ceAbstractionStarter]: For program point L774(lines 774 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,249 INFO L421 ceAbstractionStarter]: For program point L779(lines 779 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,249 INFO L421 ceAbstractionStarter]: For program point L1306(lines 1306 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,249 INFO L421 ceAbstractionStarter]: For program point L320(lines 320 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,249 INFO L421 ceAbstractionStarter]: For program point L327(lines 327 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,250 INFO L417 ceAbstractionStarter]: At program point L1757(lines 1658 1758) the Hoare annotation is: (let ((.cse5 (= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a2~0 3)) (.cse24 (+ ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4~0 86)) (.cse18 (+ ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a0~0 147))) (let ((.cse9 (= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a2~0 1)) (.cse21 (<= .cse18 0)) (.cse23 (+ ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0 16)) (.cse14 (<= .cse24 0)) (.cse3 (not .cse5))) (let ((.cse13 (<= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0 43)) (.cse11 (<= (+ ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a0~0 61) 0)) (.cse0 (and .cse14 .cse3)) (.cse6 (<= (+ ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a0~0 104) 0)) (.cse1 (<= 3 ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a2~0)) (.cse17 (< 0 .cse24)) (.cse10 (<= 0 (+ ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a0~0 97))) (.cse4 (< 0 .cse23)) (.cse16 (and (not .cse9) .cse21 .cse3)) (.cse20 (= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a2~0 4)) (.cse15 (= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a2~0 2)) (.cse2 (<= 0 (+ ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a0~0 44))) (.cse12 (< 0 (+ ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0 144))) (.cse7 (<= (+ ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a0~0 98) 0)) (.cse8 (and .cse14 (<= .cse23 0))) (.cse19 (<= (+ ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0 127) 0))) (or (and (or (and .cse0 .cse1) (and .cse2 .cse3 .cse1)) .cse4) (and .cse5 .cse6) (and .cse7 (and .cse8 .cse9)) (and .cse10 .cse11 .cse12 .cse13 .cse9) (and .cse5 .cse14 .cse10 .cse11) (and .cse4 (and .cse7 .cse15)) (and .cse7 .cse4 .cse3 .cse1) (and .cse16 .cse1) (and (< 43 ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0) .cse7 .cse9) (and .cse15 .cse0) (and .cse7 .cse17 (< 0 .cse18) .cse9) (and .cse5 (and .cse14 .cse19)) (and .cse17 .cse4 .cse13 .cse9) (and .cse11 .cse0 .cse1) (and (<= 0 (+ ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a0~0 143)) .cse12 .cse6 .cse1) (and .cse5 .cse7 .cse17) (and (and .cse5 .cse14 .cse10) .cse4) (or (and .cse2 .cse12 .cse20) (and (and .cse14 .cse2) .cse20)) (and .cse21 .cse14) (and .cse15 .cse16) (and .cse14 .cse12 .cse20) (and .cse15 .cse2) (and .cse12 (exists ((v_prenex_5 Int)) (let ((.cse22 (mod v_prenex_5 299926))) (and (not (= (mod (+ .cse22 3) 5) 0)) (<= (+ v_prenex_5 44) 0) (< .cse22 300072) (= 0 .cse22) (<= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a0~0 (+ (* 5 (div (+ .cse22 (- 300072)) 5)) 3))))) .cse9) (and .cse7 (and .cse5 .cse8)) (and .cse14 .cse19 .cse9))))) [2018-07-22 13:27:10,250 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-07-22 13:27:10,250 INFO L421 ceAbstractionStarter]: For program point L794(lines 794 803) no Hoare annotation was computed. [2018-07-22 13:27:10,250 INFO L421 ceAbstractionStarter]: For program point L793(lines 793 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,250 INFO L424 ceAbstractionStarter]: At program point L1760(lines 1760 1776) the Hoare annotation is: true [2018-07-22 13:27:10,250 INFO L421 ceAbstractionStarter]: For program point L1766(lines 1766 1775) no Hoare annotation was computed. [2018-07-22 13:27:10,250 INFO L421 ceAbstractionStarter]: For program point L342(lines 342 349) no Hoare annotation was computed. [2018-07-22 13:27:10,250 INFO L421 ceAbstractionStarter]: For program point L341(lines 341 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,250 INFO L421 ceAbstractionStarter]: For program point L1333(lines 1333 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,251 INFO L421 ceAbstractionStarter]: For program point L1338(lines 1338 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,251 INFO L421 ceAbstractionStarter]: For program point L333(lines 333 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,251 INFO L421 ceAbstractionStarter]: For program point L1344(lines 1344 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,251 INFO L421 ceAbstractionStarter]: For program point L336(lines 336 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,251 INFO L421 ceAbstractionStarter]: For program point L361(lines 361 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,251 INFO L421 ceAbstractionStarter]: For program point L367(lines 367 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,251 INFO L421 ceAbstractionStarter]: For program point L1571''(lines 1571 1581) no Hoare annotation was computed. [2018-07-22 13:27:10,251 INFO L421 ceAbstractionStarter]: For program point L1317(lines 1317 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,251 INFO L421 ceAbstractionStarter]: For program point L1313(lines 1313 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,251 INFO L421 ceAbstractionStarter]: For program point L350(lines 350 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,251 INFO L421 ceAbstractionStarter]: For program point L355(lines 355 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,251 INFO L421 ceAbstractionStarter]: For program point L1322(lines 1322 1332) no Hoare annotation was computed. [2018-07-22 13:27:10,251 INFO L421 ceAbstractionStarter]: For program point L1321(lines 1321 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,251 INFO L421 ceAbstractionStarter]: For program point L384(lines 384 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,251 INFO L421 ceAbstractionStarter]: For program point L1378(lines 1378 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,251 INFO L421 ceAbstractionStarter]: For program point L1371(lines 1371 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,251 INFO L421 ceAbstractionStarter]: For program point L391(lines 391 402) no Hoare annotation was computed. [2018-07-22 13:27:10,251 INFO L421 ceAbstractionStarter]: For program point L390(lines 390 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,252 INFO L421 ceAbstractionStarter]: For program point L373(lines 373 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,252 INFO L421 ceAbstractionStarter]: For program point L1710''(lines 1710 1721) no Hoare annotation was computed. [2018-07-22 13:27:10,252 INFO L421 ceAbstractionStarter]: For program point L1388(lines 1388 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,252 INFO L421 ceAbstractionStarter]: For program point L1385(lines 1385 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,252 INFO L421 ceAbstractionStarter]: For program point L380(lines 380 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,252 INFO L421 ceAbstractionStarter]: For program point L1351(lines 1351 1358) no Hoare annotation was computed. [2018-07-22 13:27:10,252 INFO L421 ceAbstractionStarter]: For program point L1350(lines 1350 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,252 INFO L421 ceAbstractionStarter]: For program point L1359(lines 1359 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,252 INFO L421 ceAbstractionStarter]: For program point L1365(lines 1365 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,252 INFO L421 ceAbstractionStarter]: For program point L1135''(lines 1135 1144) no Hoare annotation was computed. [2018-07-22 13:27:10,252 INFO L421 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-07-22 13:27:10,252 INFO L421 ceAbstractionStarter]: For program point L886''(lines 886 894) no Hoare annotation was computed. [2018-07-22 13:27:10,252 INFO L421 ceAbstractionStarter]: For program point L1395(lines 1395 1407) no Hoare annotation was computed. [2018-07-22 13:27:10,252 INFO L421 ceAbstractionStarter]: For program point L1394(lines 1394 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,252 INFO L421 ceAbstractionStarter]: For program point L1099''(lines 1099 1107) no Hoare annotation was computed. [2018-07-22 13:27:10,252 INFO L421 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-07-22 13:27:10,252 INFO L421 ceAbstractionStarter]: For program point L24(lines 24 26) no Hoare annotation was computed. [2018-07-22 13:27:10,253 INFO L421 ceAbstractionStarter]: For program point L27(lines 23 1656) no Hoare annotation was computed. [2018-07-22 13:27:10,253 INFO L421 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2018-07-22 13:27:10,253 INFO L421 ceAbstractionStarter]: For program point L30(lines 23 1656) no Hoare annotation was computed. [2018-07-22 13:27:10,253 INFO L421 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2018-07-22 13:27:10,253 INFO L421 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2018-07-22 13:27:10,253 INFO L421 ceAbstractionStarter]: For program point L33(lines 23 1656) no Hoare annotation was computed. [2018-07-22 13:27:10,253 INFO L421 ceAbstractionStarter]: For program point L36(lines 23 1656) no Hoare annotation was computed. [2018-07-22 13:27:10,253 INFO L421 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2018-07-22 13:27:10,253 INFO L421 ceAbstractionStarter]: For program point L39(lines 23 1656) no Hoare annotation was computed. [2018-07-22 13:27:10,253 INFO L421 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2018-07-22 13:27:10,253 INFO L421 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2018-07-22 13:27:10,253 INFO L421 ceAbstractionStarter]: For program point L42(lines 23 1656) no Hoare annotation was computed. [2018-07-22 13:27:10,253 INFO L421 ceAbstractionStarter]: For program point L45(lines 23 1656) no Hoare annotation was computed. [2018-07-22 13:27:10,253 INFO L421 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2018-07-22 13:27:10,253 INFO L421 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2018-07-22 13:27:10,253 INFO L421 ceAbstractionStarter]: For program point L48(lines 23 1656) no Hoare annotation was computed. [2018-07-22 13:27:10,253 INFO L421 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2018-07-22 13:27:10,253 INFO L421 ceAbstractionStarter]: For program point L51(lines 23 1656) no Hoare annotation was computed. [2018-07-22 13:27:10,254 INFO L421 ceAbstractionStarter]: For program point L54(lines 23 1656) no Hoare annotation was computed. [2018-07-22 13:27:10,254 INFO L421 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2018-07-22 13:27:10,254 INFO L421 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2018-07-22 13:27:10,254 INFO L421 ceAbstractionStarter]: For program point L57(lines 23 1656) no Hoare annotation was computed. [2018-07-22 13:27:10,254 INFO L421 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2018-07-22 13:27:10,254 INFO L421 ceAbstractionStarter]: For program point L60(lines 23 1656) no Hoare annotation was computed. [2018-07-22 13:27:10,254 INFO L421 ceAbstractionStarter]: For program point L63(lines 23 1656) no Hoare annotation was computed. [2018-07-22 13:27:10,254 INFO L421 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2018-07-22 13:27:10,254 INFO L421 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2018-07-22 13:27:10,254 INFO L421 ceAbstractionStarter]: For program point L66(lines 23 1656) no Hoare annotation was computed. [2018-07-22 13:27:10,254 INFO L421 ceAbstractionStarter]: For program point L69(lines 23 1656) no Hoare annotation was computed. [2018-07-22 13:27:10,254 INFO L421 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2018-07-22 13:27:10,254 INFO L421 ceAbstractionStarter]: For program point L72(lines 23 1656) no Hoare annotation was computed. [2018-07-22 13:27:10,254 INFO L421 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2018-07-22 13:27:10,254 INFO L421 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2018-07-22 13:27:10,254 INFO L421 ceAbstractionStarter]: For program point L75(lines 23 1656) no Hoare annotation was computed. [2018-07-22 13:27:10,254 INFO L421 ceAbstractionStarter]: For program point L78(lines 23 1656) no Hoare annotation was computed. [2018-07-22 13:27:10,255 INFO L421 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2018-07-22 13:27:10,255 INFO L421 ceAbstractionStarter]: For program point L81(lines 23 1656) no Hoare annotation was computed. [2018-07-22 13:27:10,255 INFO L421 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2018-07-22 13:27:10,255 INFO L421 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2018-07-22 13:27:10,255 INFO L421 ceAbstractionStarter]: For program point L84(lines 23 1656) no Hoare annotation was computed. [2018-07-22 13:27:10,255 INFO L421 ceAbstractionStarter]: For program point L87(lines 23 1656) no Hoare annotation was computed. [2018-07-22 13:27:10,255 INFO L421 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2018-07-22 13:27:10,255 INFO L421 ceAbstractionStarter]: For program point L804(lines 804 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,255 INFO L421 ceAbstractionStarter]: For program point L90(lines 23 1656) no Hoare annotation was computed. [2018-07-22 13:27:10,255 INFO L421 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2018-07-22 13:27:10,255 INFO L421 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2018-07-22 13:27:10,255 INFO L421 ceAbstractionStarter]: For program point L93(lines 23 1656) no Hoare annotation was computed. [2018-07-22 13:27:10,255 INFO L421 ceAbstractionStarter]: For program point L96(lines 23 1656) no Hoare annotation was computed. [2018-07-22 13:27:10,255 INFO L421 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2018-07-22 13:27:10,255 INFO L421 ceAbstractionStarter]: For program point L99(lines 23 1656) no Hoare annotation was computed. [2018-07-22 13:27:10,256 INFO L421 ceAbstractionStarter]: For program point L824(lines 824 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,256 INFO L421 ceAbstractionStarter]: For program point L829(lines 829 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,256 INFO L421 ceAbstractionStarter]: For program point L811(lines 811 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,256 INFO L421 ceAbstractionStarter]: For program point L817(lines 817 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,256 INFO L421 ceAbstractionStarter]: For program point L840(lines 840 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,256 INFO L421 ceAbstractionStarter]: For program point L845(lines 845 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,256 INFO L421 ceAbstractionStarter]: For program point L830(lines 830 839) no Hoare annotation was computed. [2018-07-22 13:27:10,256 INFO L421 ceAbstractionStarter]: For program point L862(lines 862 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,256 INFO L421 ceAbstractionStarter]: For program point L868(lines 868 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,256 INFO L421 ceAbstractionStarter]: For program point L1612(lines 1612 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,257 INFO L421 ceAbstractionStarter]: For program point L1613(lines 1613 1622) no Hoare annotation was computed. [2018-07-22 13:27:10,257 INFO L421 ceAbstractionStarter]: For program point L851(lines 851 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,257 INFO L421 ceAbstractionStarter]: For program point L855(lines 855 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,257 INFO L421 ceAbstractionStarter]: For program point L1623(lines 1623 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,257 INFO L421 ceAbstractionStarter]: For program point L1629(lines 1629 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,257 INFO L421 ceAbstractionStarter]: For program point L880(lines 880 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,257 INFO L421 ceAbstractionStarter]: For program point L403(lines 403 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,257 INFO L421 ceAbstractionStarter]: For program point L886(lines 886 894) no Hoare annotation was computed. [2018-07-22 13:27:10,257 INFO L421 ceAbstractionStarter]: For program point L885(lines 885 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,257 INFO L421 ceAbstractionStarter]: For program point L595''(lines 595 605) no Hoare annotation was computed. [2018-07-22 13:27:10,257 INFO L421 ceAbstractionStarter]: For program point L342''(lines 342 349) no Hoare annotation was computed. [2018-07-22 13:27:10,258 INFO L421 ceAbstractionStarter]: For program point L408(lines 408 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,259 INFO L421 ceAbstractionStarter]: For program point L874(lines 874 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,259 INFO L421 ceAbstractionStarter]: For program point L1606(lines 1606 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,259 INFO L421 ceAbstractionStarter]: For program point L1602(lines 1602 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,259 INFO L421 ceAbstractionStarter]: For program point L422(lines 422 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,259 INFO L421 ceAbstractionStarter]: For program point L428(lines 428 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,260 INFO L417 ceAbstractionStarter]: At program point L1655(lines 23 1656) the Hoare annotation is: (let ((.cse13 (= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a2~0 3)) (.cse28 (+ ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4~0 86))) (let ((.cse16 (+ ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a0~0 147)) (.cse10 (<= .cse28 0)) (.cse11 (not .cse13)) (.cse27 (+ ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a0~0 98))) (let ((.cse25 (< 0 .cse27)) (.cse1 (and .cse10 .cse11)) (.cse12 (<= 3 ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a2~0)) (.cse26 (+ ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0 16)) (.cse6 (= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a2~0 1)) (.cse19 (<= .cse16 0))) (let ((.cse0 (= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a2~0 2)) (.cse14 (<= (+ ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a0~0 104) 0)) (.cse4 (and (not .cse6) .cse19)) (.cse7 (<= 0 (+ ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a0~0 44))) (.cse15 (< 0 .cse28)) (.cse3 (< 0 .cse26)) (.cse20 (and .cse1 .cse12)) (.cse9 (= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a2~0 4)) (.cse18 (and .cse13 (and .cse10 .cse25))) (.cse22 (and .cse10 .cse25 .cse11)) (.cse2 (<= .cse27 0)) (.cse5 (and .cse10 (<= .cse26 0))) (.cse23 (<= (+ ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a0~0 61) 0)) (.cse8 (< 0 (+ ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0 144))) (.cse21 (<= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0 43)) (.cse17 (<= (+ ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0 127) 0))) (or (and .cse0 .cse1) (and (and .cse2 .cse0) .cse3) (and .cse0 .cse4) (and .cse2 (and .cse5 .cse6)) (or (and .cse7 .cse8 .cse9) (and (and .cse10 .cse7) .cse9)) (and .cse0 .cse7) (and .cse2 .cse3 .cse11 .cse12) (and .cse13 .cse14) (and .cse2 .cse15 (< 0 .cse16) .cse6) (and .cse13 (and .cse10 .cse17)) (and .cse18 .cse3) (and (<= 0 (+ ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a0~0 143)) .cse8 .cse14 .cse12) (and .cse4 .cse12) (and .cse13 .cse2 .cse15) (and .cse19 .cse10) (and .cse3 (or .cse20 (and .cse7 .cse11 .cse12))) (and (< 43 ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0) .cse2 .cse6) (and (and .cse15 .cse21 .cse6) .cse3) (and .cse20 .cse2) (and .cse22 .cse8 .cse9) (and .cse18 .cse23) (and .cse23 (and .cse22 .cse12)) (and .cse8 (exists ((v_prenex_5 Int)) (let ((.cse24 (mod v_prenex_5 299926))) (and (not (= (mod (+ .cse24 3) 5) 0)) (<= (+ v_prenex_5 44) 0) (< .cse24 300072) (= 0 .cse24) (<= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a0~0 (+ (* 5 (div (+ .cse24 (- 300072)) 5)) 3))))) .cse6) (and .cse2 (and .cse13 .cse5)) (and .cse23 .cse8 .cse25 .cse21 .cse6) (and .cse10 .cse17 .cse6)))))) [2018-07-22 13:27:10,260 INFO L421 ceAbstractionStarter]: For program point L1661(lines 1661 1756) no Hoare annotation was computed. [2018-07-22 13:27:10,260 INFO L421 ceAbstractionStarter]: For program point L895(lines 895 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,260 INFO L421 ceAbstractionStarter]: For program point L415(lines 415 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,260 INFO L421 ceAbstractionStarter]: For program point L1668(lines 1668 1756) no Hoare annotation was computed. [2018-07-22 13:27:10,260 INFO L421 ceAbstractionStarter]: For program point L445(lines 445 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,260 INFO L421 ceAbstractionStarter]: For program point L449(lines 449 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,260 INFO L421 ceAbstractionStarter]: For program point L1635(lines 1635 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,260 INFO L421 ceAbstractionStarter]: For program point L433(lines 433 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,260 INFO L421 ceAbstractionStarter]: For program point L1640(lines 1640 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,261 INFO L421 ceAbstractionStarter]: For program point L439(lines 439 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,261 INFO L421 ceAbstractionStarter]: For program point L1647(lines 1647 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,261 INFO L421 ceAbstractionStarter]: For program point L462(lines 462 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,261 INFO L421 ceAbstractionStarter]: For program point L1212(lines 1212 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,261 INFO L421 ceAbstractionStarter]: For program point L468(lines 468 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,261 INFO L421 ceAbstractionStarter]: For program point L1694(lines 1694 1756) no Hoare annotation was computed. [2018-07-22 13:27:10,261 INFO L421 ceAbstractionStarter]: For program point L1218(lines 1218 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,261 INFO L421 ceAbstractionStarter]: For program point L1224(lines 1224 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,261 INFO L421 ceAbstractionStarter]: For program point L456(lines 456 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,261 INFO L421 ceAbstractionStarter]: For program point L486(lines 486 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,262 INFO L421 ceAbstractionStarter]: For program point L1672(lines 1672 1756) no Hoare annotation was computed. [2018-07-22 13:27:10,262 INFO L421 ceAbstractionStarter]: For program point L1678(lines 1678 1756) no Hoare annotation was computed. [2018-07-22 13:27:10,262 INFO L421 ceAbstractionStarter]: For program point L474(lines 474 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,262 INFO L421 ceAbstractionStarter]: For program point L1685(lines 1685 1756) no Hoare annotation was computed. [2018-07-22 13:27:10,262 INFO L421 ceAbstractionStarter]: For program point L479(lines 479 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,262 INFO L421 ceAbstractionStarter]: For program point L1686(lines 1686 1693) no Hoare annotation was computed. [2018-07-22 13:27:10,262 INFO L421 ceAbstractionStarter]: For program point L1208(lines 1208 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,262 INFO L421 ceAbstractionStarter]: For program point L1613''(lines 1613 1622) no Hoare annotation was computed. [2018-07-22 13:27:10,262 INFO L421 ceAbstractionStarter]: For program point L1203(lines 1203 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,262 INFO L421 ceAbstractionStarter]: For program point L1255(lines 1255 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,262 INFO L421 ceAbstractionStarter]: For program point L491(lines 491 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,262 INFO L421 ceAbstractionStarter]: For program point L497(lines 497 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,262 INFO L421 ceAbstractionStarter]: For program point L1264(lines 1264 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,262 INFO L421 ceAbstractionStarter]: For program point L1261(lines 1261 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,262 INFO L421 ceAbstractionStarter]: For program point L1231(lines 1231 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,262 INFO L421 ceAbstractionStarter]: For program point L1237(lines 1237 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,262 INFO L421 ceAbstractionStarter]: For program point L1243(lines 1243 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,263 INFO L421 ceAbstractionStarter]: For program point L1249(lines 1249 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,263 INFO L421 ceAbstractionStarter]: For program point L1290(lines 1290 1299) no Hoare annotation was computed. [2018-07-22 13:27:10,263 INFO L421 ceAbstractionStarter]: For program point L547''(lines 547 556) no Hoare annotation was computed. [2018-07-22 13:27:10,263 INFO L421 ceAbstractionStarter]: For program point L1271(lines 1271 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,263 INFO L421 ceAbstractionStarter]: For program point L391''(lines 391 402) no Hoare annotation was computed. [2018-07-22 13:27:10,263 INFO L421 ceAbstractionStarter]: For program point L1277(lines 1277 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,263 INFO L421 ceAbstractionStarter]: For program point L1439''(lines 1439 1448) no Hoare annotation was computed. [2018-07-22 13:27:10,263 INFO L421 ceAbstractionStarter]: For program point L1289(lines 1289 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,263 INFO L421 ceAbstractionStarter]: For program point L1283(lines 1283 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,263 INFO L421 ceAbstractionStarter]: For program point L307''(lines 307 319) no Hoare annotation was computed. [2018-07-22 13:27:10,263 INFO L421 ceAbstractionStarter]: For program point L901(lines 901 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,263 INFO L421 ceAbstractionStarter]: For program point L907(lines 907 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,263 INFO L421 ceAbstractionStarter]: For program point L925(lines 925 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,263 INFO L421 ceAbstractionStarter]: For program point L912(lines 912 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,263 INFO L421 ceAbstractionStarter]: For program point L919(lines 919 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,263 INFO L421 ceAbstractionStarter]: For program point L942(lines 942 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,263 INFO L421 ceAbstractionStarter]: For program point L948(lines 948 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,263 INFO L421 ceAbstractionStarter]: For program point L930(lines 930 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,264 INFO L421 ceAbstractionStarter]: For program point L935(lines 935 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,264 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-07-22 13:27:10,264 INFO L421 ceAbstractionStarter]: For program point L966(lines 966 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,264 INFO L421 ceAbstractionStarter]: For program point L955(lines 955 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,264 INFO L421 ceAbstractionStarter]: For program point L959(lines 959 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,264 INFO L421 ceAbstractionStarter]: For program point L502(lines 502 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,264 INFO L421 ceAbstractionStarter]: For program point L985(lines 985 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,264 INFO L421 ceAbstractionStarter]: For program point L507(lines 507 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,264 INFO L421 ceAbstractionStarter]: For program point L973(lines 973 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,264 INFO L421 ceAbstractionStarter]: For program point L979(lines 979 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,264 INFO L421 ceAbstractionStarter]: For program point L1501(lines 1501 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,264 INFO L421 ceAbstractionStarter]: For program point L1508(lines 1508 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,264 INFO L421 ceAbstractionStarter]: For program point L520(lines 520 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,264 INFO L421 ceAbstractionStarter]: For program point L521(lines 521 528) no Hoare annotation was computed. [2018-07-22 13:27:10,264 INFO L421 ceAbstractionStarter]: For program point L529(lines 529 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,264 INFO L421 ceAbstractionStarter]: For program point L992(lines 992 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,264 INFO L421 ceAbstractionStarter]: For program point L514(lines 514 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,265 INFO L421 ceAbstractionStarter]: For program point L998(lines 998 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,265 INFO L421 ceAbstractionStarter]: For program point L542(lines 542 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,265 INFO L421 ceAbstractionStarter]: For program point L546(lines 546 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,265 INFO L421 ceAbstractionStarter]: For program point L547(lines 547 556) no Hoare annotation was computed. [2018-07-22 13:27:10,265 INFO L421 ceAbstractionStarter]: For program point L1533(lines 1533 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,265 INFO L421 ceAbstractionStarter]: For program point L530(lines 530 541) no Hoare annotation was computed. [2018-07-22 13:27:10,265 INFO L421 ceAbstractionStarter]: For program point L1540(lines 1540 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,265 INFO L421 ceAbstractionStarter]: For program point L1547(lines 1547 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,265 INFO L421 ceAbstractionStarter]: For program point L569(lines 569 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,265 INFO L421 ceAbstractionStarter]: For program point L1516(lines 1516 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,265 INFO L421 ceAbstractionStarter]: For program point L1511(lines 1511 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,265 INFO L421 ceAbstractionStarter]: For program point L557(lines 557 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,265 INFO L421 ceAbstractionStarter]: For program point L558(lines 558 568) no Hoare annotation was computed. [2018-07-22 13:27:10,265 INFO L421 ceAbstractionStarter]: For program point L1528(lines 1528 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,265 INFO L421 ceAbstractionStarter]: For program point L794''(lines 794 803) no Hoare annotation was computed. [2018-07-22 13:27:10,265 INFO L421 ceAbstractionStarter]: For program point L1522(lines 1522 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,265 INFO L421 ceAbstractionStarter]: For program point L102(lines 23 1656) no Hoare annotation was computed. [2018-07-22 13:27:10,265 INFO L421 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-07-22 13:27:10,266 INFO L421 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2018-07-22 13:27:10,266 INFO L421 ceAbstractionStarter]: For program point L105(lines 23 1656) no Hoare annotation was computed. [2018-07-22 13:27:10,266 INFO L421 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2018-07-22 13:27:10,266 INFO L421 ceAbstractionStarter]: For program point L587(lines 587 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,266 INFO L421 ceAbstractionStarter]: For program point L1571(lines 1571 1581) no Hoare annotation was computed. [2018-07-22 13:27:10,266 INFO L421 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2018-07-22 13:27:10,266 INFO L421 ceAbstractionStarter]: For program point L108(lines 23 1656) no Hoare annotation was computed. [2018-07-22 13:27:10,266 INFO L421 ceAbstractionStarter]: For program point L1570(lines 1570 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,266 INFO L421 ceAbstractionStarter]: For program point L575(lines 575 586) no Hoare annotation was computed. [2018-07-22 13:27:10,266 INFO L421 ceAbstractionStarter]: For program point L574(lines 574 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,266 INFO L421 ceAbstractionStarter]: For program point L1582(lines 1582 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,267 INFO L421 ceAbstractionStarter]: For program point L1108(lines 1108 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,267 INFO L421 ceAbstractionStarter]: For program point L1351''(lines 1351 1358) no Hoare annotation was computed. [2018-07-22 13:27:10,267 INFO L421 ceAbstractionStarter]: For program point L1589(lines 1589 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,267 INFO L421 ceAbstractionStarter]: For program point L120(lines 23 1656) no Hoare annotation was computed. [2018-07-22 13:27:10,267 INFO L421 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2018-07-22 13:27:10,267 INFO L421 ceAbstractionStarter]: For program point L123(lines 23 1656) no Hoare annotation was computed. [2018-07-22 13:27:10,267 INFO L421 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2018-07-22 13:27:10,267 INFO L421 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2018-07-22 13:27:10,267 INFO L421 ceAbstractionStarter]: For program point L1554(lines 1554 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,267 INFO L421 ceAbstractionStarter]: For program point L126(lines 23 1656) no Hoare annotation was computed. [2018-07-22 13:27:10,268 INFO L421 ceAbstractionStarter]: For program point L129(lines 23 1656) no Hoare annotation was computed. [2018-07-22 13:27:10,268 INFO L421 ceAbstractionStarter]: For program point L1559(lines 1559 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,268 INFO L421 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2018-07-22 13:27:10,268 INFO L421 ceAbstractionStarter]: For program point L111(lines 23 1656) no Hoare annotation was computed. [2018-07-22 13:27:10,268 INFO L421 ceAbstractionStarter]: For program point L595(lines 595 605) no Hoare annotation was computed. [2018-07-22 13:27:10,268 INFO L421 ceAbstractionStarter]: For program point L594(lines 594 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,268 INFO L421 ceAbstractionStarter]: For program point L117(lines 23 1656) no Hoare annotation was computed. [2018-07-22 13:27:10,268 INFO L421 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2018-07-22 13:27:10,268 INFO L421 ceAbstractionStarter]: For program point L114(lines 23 1656) no Hoare annotation was computed. [2018-07-22 13:27:10,268 INFO L421 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2018-07-22 13:27:10,269 INFO L421 ceAbstractionStarter]: For program point L1566(lines 1566 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,269 INFO L421 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2018-07-22 13:27:10,269 INFO L421 ceAbstractionStarter]: For program point L141(lines 23 1656) no Hoare annotation was computed. [2018-07-22 13:27:10,269 INFO L421 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2018-07-22 13:27:10,269 INFO L421 ceAbstractionStarter]: For program point L144(lines 23 1656) no Hoare annotation was computed. [2018-07-22 13:27:10,269 INFO L421 ceAbstractionStarter]: For program point L1134(lines 1134 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,269 INFO L421 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2018-07-22 13:27:10,269 INFO L421 ceAbstractionStarter]: For program point L147(lines 23 1656) no Hoare annotation was computed. [2018-07-22 13:27:10,269 INFO L421 ceAbstractionStarter]: For program point L1135(lines 1135 1144) no Hoare annotation was computed. [2018-07-22 13:27:10,269 INFO L421 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2018-07-22 13:27:10,269 INFO L421 ceAbstractionStarter]: For program point L135(lines 23 1656) no Hoare annotation was computed. [2018-07-22 13:27:10,270 INFO L421 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2018-07-22 13:27:10,270 INFO L421 ceAbstractionStarter]: For program point L132(lines 23 1656) no Hoare annotation was computed. [2018-07-22 13:27:10,270 INFO L421 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2018-07-22 13:27:10,270 INFO L421 ceAbstractionStarter]: For program point L1145(lines 1145 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,270 INFO L421 ceAbstractionStarter]: For program point L138(lines 23 1656) no Hoare annotation was computed. [2018-07-22 13:27:10,270 INFO L421 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2018-07-22 13:27:10,270 INFO L421 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2018-07-22 13:27:10,270 INFO L421 ceAbstractionStarter]: For program point L162(lines 23 1656) no Hoare annotation was computed. [2018-07-22 13:27:10,270 INFO L421 ceAbstractionStarter]: For program point L168(lines 23 1656) no Hoare annotation was computed. [2018-07-22 13:27:10,270 INFO L421 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2018-07-22 13:27:10,270 INFO L421 ceAbstractionStarter]: For program point L165(lines 23 1656) no Hoare annotation was computed. [2018-07-22 13:27:10,270 INFO L421 ceAbstractionStarter]: For program point L1595(lines 1595 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,270 INFO L421 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2018-07-22 13:27:10,270 INFO L421 ceAbstractionStarter]: For program point L1115(lines 1115 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,270 INFO L421 ceAbstractionStarter]: For program point L171(lines 23 1656) no Hoare annotation was computed. [2018-07-22 13:27:10,270 INFO L421 ceAbstractionStarter]: For program point L153(lines 23 1656) no Hoare annotation was computed. [2018-07-22 13:27:10,271 INFO L421 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2018-07-22 13:27:10,271 INFO L421 ceAbstractionStarter]: For program point L150(lines 23 1656) no Hoare annotation was computed. [2018-07-22 13:27:10,271 INFO L421 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2018-07-22 13:27:10,271 INFO L421 ceAbstractionStarter]: For program point L156(lines 23 1656) no Hoare annotation was computed. [2018-07-22 13:27:10,271 INFO L421 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2018-07-22 13:27:10,271 INFO L421 ceAbstractionStarter]: For program point L1122(lines 1122 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,271 INFO L421 ceAbstractionStarter]: For program point L159(lines 23 1656) no Hoare annotation was computed. [2018-07-22 13:27:10,271 INFO L421 ceAbstractionStarter]: For program point L1128(lines 1128 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,271 INFO L421 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2018-07-22 13:27:10,271 INFO L421 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2018-07-22 13:27:10,271 INFO L421 ceAbstractionStarter]: For program point L1172(lines 1172 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,271 INFO L421 ceAbstractionStarter]: For program point L183(lines 23 1656) no Hoare annotation was computed. [2018-07-22 13:27:10,271 INFO L421 ceAbstractionStarter]: For program point L189(lines 23 1656) no Hoare annotation was computed. [2018-07-22 13:27:10,271 INFO L421 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2018-07-22 13:27:10,271 INFO L421 ceAbstractionStarter]: For program point L1178(lines 1178 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,271 INFO L421 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2018-07-22 13:27:10,272 INFO L421 ceAbstractionStarter]: For program point L192(lines 23 1656) no Hoare annotation was computed. [2018-07-22 13:27:10,272 INFO L421 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2018-07-22 13:27:10,272 INFO L421 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2018-07-22 13:27:10,272 INFO L421 ceAbstractionStarter]: For program point L174(lines 23 1656) no Hoare annotation was computed. [2018-07-22 13:27:10,272 INFO L421 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2018-07-22 13:27:10,272 INFO L421 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2018-07-22 13:27:10,272 INFO L421 ceAbstractionStarter]: For program point L177(lines 23 1656) no Hoare annotation was computed. [2018-07-22 13:27:10,272 INFO L421 ceAbstractionStarter]: For program point L1184(lines 1184 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,272 INFO L421 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2018-07-22 13:27:10,272 INFO L421 ceAbstractionStarter]: For program point L180(lines 23 1656) no Hoare annotation was computed. [2018-07-22 13:27:10,272 INFO L421 ceAbstractionStarter]: For program point L1150(lines 1150 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,272 INFO L421 ceAbstractionStarter]: For program point L1156(lines 1156 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,272 INFO L421 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2018-07-22 13:27:10,272 INFO L421 ceAbstractionStarter]: For program point L195(lines 23 1656) no Hoare annotation was computed. [2018-07-22 13:27:10,272 INFO L421 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2018-07-22 13:27:10,272 INFO L421 ceAbstractionStarter]: For program point L198(lines 23 1656) no Hoare annotation was computed. [2018-07-22 13:27:10,272 INFO L421 ceAbstractionStarter]: For program point L1168(lines 1168 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,273 INFO L421 ceAbstractionStarter]: For program point L1162(lines 1162 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,273 INFO L421 ceAbstractionStarter]: For program point L1395''(lines 1395 1407) no Hoare annotation was computed. [2018-07-22 13:27:10,273 INFO L421 ceAbstractionStarter]: For program point L1190(lines 1190 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,273 INFO L421 ceAbstractionStarter]: For program point L1197(lines 1197 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,273 INFO L421 ceAbstractionStarter]: For program point L1050''(lines 1050 1061) no Hoare annotation was computed. [2018-07-22 13:27:10,273 INFO L421 ceAbstractionStarter]: For program point L1686''(lines 1686 1693) no Hoare annotation was computed. [2018-07-22 13:27:10,273 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-07-22 13:27:10,273 INFO L421 ceAbstractionStarter]: For program point L642''(lines 642 651) no Hoare annotation was computed. [2018-07-22 13:27:10,273 INFO L421 ceAbstractionStarter]: For program point L606(lines 606 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,273 INFO L421 ceAbstractionStarter]: For program point L1063''(lines 1063 1073) no Hoare annotation was computed. [2018-07-22 13:27:10,274 INFO L417 ceAbstractionStarter]: At program point L1766''(lines 1766 1775) the Hoare annotation is: (let ((.cse13 (= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a2~0 3)) (.cse28 (+ ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4~0 86))) (let ((.cse16 (+ ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a0~0 147)) (.cse10 (<= .cse28 0)) (.cse11 (not .cse13)) (.cse27 (+ ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a0~0 98))) (let ((.cse25 (< 0 .cse27)) (.cse1 (and .cse10 .cse11)) (.cse12 (<= 3 ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a2~0)) (.cse26 (+ ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0 16)) (.cse6 (= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a2~0 1)) (.cse19 (<= .cse16 0))) (let ((.cse0 (= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a2~0 2)) (.cse14 (<= (+ ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a0~0 104) 0)) (.cse4 (and (not .cse6) .cse19)) (.cse7 (<= 0 (+ ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a0~0 44))) (.cse15 (< 0 .cse28)) (.cse3 (< 0 .cse26)) (.cse20 (and .cse1 .cse12)) (.cse9 (= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a2~0 4)) (.cse18 (and .cse13 (and .cse10 .cse25))) (.cse22 (and .cse10 .cse25 .cse11)) (.cse2 (<= .cse27 0)) (.cse5 (and .cse10 (<= .cse26 0))) (.cse23 (<= (+ ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a0~0 61) 0)) (.cse8 (< 0 (+ ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0 144))) (.cse21 (<= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0 43)) (.cse17 (<= (+ ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0 127) 0))) (or (and .cse0 .cse1) (and (and .cse2 .cse0) .cse3) (and .cse0 .cse4) (and .cse2 (and .cse5 .cse6)) (or (and .cse7 .cse8 .cse9) (and (and .cse10 .cse7) .cse9)) (and .cse0 .cse7) (and .cse2 .cse3 .cse11 .cse12) (and .cse13 .cse14) (and .cse2 .cse15 (< 0 .cse16) .cse6) (and .cse13 (and .cse10 .cse17)) (and .cse18 .cse3) (and (<= 0 (+ ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a0~0 143)) .cse8 .cse14 .cse12) (and .cse4 .cse12) (and .cse13 .cse2 .cse15) (and .cse19 .cse10) (and .cse3 (or .cse20 (and .cse7 .cse11 .cse12))) (and (< 43 ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0) .cse2 .cse6) (and (and .cse15 .cse21 .cse6) .cse3) (and .cse20 .cse2) (and .cse22 .cse8 .cse9) (and .cse18 .cse23) (and .cse23 (and .cse22 .cse12)) (and .cse8 (exists ((v_prenex_5 Int)) (let ((.cse24 (mod v_prenex_5 299926))) (and (not (= (mod (+ .cse24 3) 5) 0)) (<= (+ v_prenex_5 44) 0) (< .cse24 300072) (= 0 .cse24) (<= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a0~0 (+ (* 5 (div (+ .cse24 (- 300072)) 5)) 3))))) .cse6) (and .cse2 (and .cse13 .cse5)) (and .cse23 .cse8 .cse25 .cse21 .cse6) (and .cse10 .cse17 .cse6)))))) [2018-07-22 13:27:10,274 INFO L421 ceAbstractionStarter]: For program point L620(lines 620 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,274 INFO L421 ceAbstractionStarter]: For program point L627(lines 627 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,274 INFO L421 ceAbstractionStarter]: For program point L186'(lines 23 1656) no Hoare annotation was computed. [2018-07-22 13:27:10,274 INFO L421 ceAbstractionStarter]: For program point L613(lines 613 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,274 INFO L421 ceAbstractionStarter]: For program point L641(lines 641 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,274 INFO L421 ceAbstractionStarter]: For program point L642(lines 642 651) no Hoare annotation was computed. [2018-07-22 13:27:10,274 INFO L421 ceAbstractionStarter]: For program point L1322''(lines 1322 1332) no Hoare annotation was computed. [2018-07-22 13:27:10,274 INFO L421 ceAbstractionStarter]: For program point L1420''(lines 1420 1430) no Hoare annotation was computed. [2018-07-22 13:27:10,274 INFO L421 ceAbstractionStarter]: For program point L634(lines 634 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,274 INFO L421 ceAbstractionStarter]: For program point L662(lines 662 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,274 INFO L421 ceAbstractionStarter]: For program point L668(lines 668 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,274 INFO L421 ceAbstractionStarter]: For program point L1419(lines 1419 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,274 INFO L421 ceAbstractionStarter]: For program point L575''(lines 575 586) no Hoare annotation was computed. [2018-07-22 13:27:10,275 INFO L421 ceAbstractionStarter]: For program point L1413(lines 1413 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,275 INFO L421 ceAbstractionStarter]: For program point L652(lines 652 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,275 INFO L421 ceAbstractionStarter]: For program point L1420(lines 1420 1430) no Hoare annotation was computed. [2018-07-22 13:27:10,275 INFO L421 ceAbstractionStarter]: For program point L657(lines 657 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,275 INFO L421 ceAbstractionStarter]: For program point L681(lines 681 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,275 INFO L421 ceAbstractionStarter]: For program point L201(lines 23 1656) no Hoare annotation was computed. [2018-07-22 13:27:10,275 INFO L421 ceAbstractionStarter]: For program point L205(line 205) no Hoare annotation was computed. [2018-07-22 13:27:10,275 INFO L421 ceAbstractionStarter]: For program point L204(lines 23 1656) no Hoare annotation was computed. [2018-07-22 13:27:10,275 INFO L421 ceAbstractionStarter]: For program point L687(lines 687 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,275 INFO L421 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2018-07-22 13:27:10,275 INFO L421 ceAbstractionStarter]: For program point L675(lines 675 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,275 INFO L421 ceAbstractionStarter]: For program point L1408(lines 1408 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,275 INFO L421 ceAbstractionStarter]: For program point L1290''(lines 1290 1299) no Hoare annotation was computed. [2018-07-22 13:27:10,275 INFO L421 ceAbstractionStarter]: For program point L220(lines 220 228) no Hoare annotation was computed. [2018-07-22 13:27:10,275 INFO L421 ceAbstractionStarter]: For program point L229(lines 229 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,276 INFO L421 ceAbstractionStarter]: For program point L1456(lines 1456 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,276 INFO L421 ceAbstractionStarter]: For program point L694(lines 694 706) no Hoare annotation was computed. [2018-07-22 13:27:10,276 INFO L421 ceAbstractionStarter]: For program point L693(lines 693 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,276 INFO L421 ceAbstractionStarter]: For program point L1466(lines 1466 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,276 INFO L421 ceAbstractionStarter]: For program point L214(lines 214 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,276 INFO L421 ceAbstractionStarter]: For program point L1461(lines 1461 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,277 INFO L421 ceAbstractionStarter]: For program point L219(lines 219 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,277 INFO L421 ceAbstractionStarter]: For program point L241(lines 241 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,277 INFO L421 ceAbstractionStarter]: For program point L247(lines 247 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,277 INFO L421 ceAbstractionStarter]: For program point L1431(lines 1431 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,277 INFO L421 ceAbstractionStarter]: For program point L1438(lines 1438 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,277 INFO L421 ceAbstractionStarter]: For program point L1439(lines 1439 1448) no Hoare annotation was computed. [2018-07-22 13:27:10,277 INFO L421 ceAbstractionStarter]: For program point L234(lines 234 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,277 INFO L421 ceAbstractionStarter]: For program point L1449(lines 1449 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,277 INFO L421 ceAbstractionStarter]: For program point L24'(lines 23 1656) no Hoare annotation was computed. [2018-07-22 13:27:10,277 INFO L421 ceAbstractionStarter]: For program point L260(lines 260 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,278 INFO L421 ceAbstractionStarter]: For program point L266(lines 266 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,278 INFO L421 ceAbstractionStarter]: For program point L220''(lines 220 228) no Hoare annotation was computed. [2018-07-22 13:27:10,278 INFO L421 ceAbstractionStarter]: For program point L1494(lines 1494 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,278 INFO L421 ceAbstractionStarter]: For program point L1011(lines 1011 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,278 INFO L421 ceAbstractionStarter]: For program point L1016(lines 1016 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,278 INFO L421 ceAbstractionStarter]: For program point L1019(lines 1019 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,278 INFO L421 ceAbstractionStarter]: For program point L253(lines 253 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,278 INFO L421 ceAbstractionStarter]: For program point L1026(lines 1026 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,278 INFO L421 ceAbstractionStarter]: For program point L285(lines 285 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,278 INFO L421 ceAbstractionStarter]: For program point L1473(lines 1473 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,279 INFO L421 ceAbstractionStarter]: For program point L1478(lines 1478 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,279 INFO L421 ceAbstractionStarter]: For program point L292(lines 292 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,279 INFO L421 ceAbstractionStarter]: For program point L273(lines 273 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,279 INFO L421 ceAbstractionStarter]: For program point L278(lines 278 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,279 INFO L421 ceAbstractionStarter]: For program point L1488(lines 1488 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,279 INFO L421 ceAbstractionStarter]: For program point L1004(lines 1004 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,279 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startErr0AssertViolationERROR_FUNCTION(line 187) no Hoare annotation was computed. [2018-07-22 13:27:10,279 INFO L421 ceAbstractionStarter]: For program point L1482(lines 1482 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,279 INFO L421 ceAbstractionStarter]: For program point L1050(lines 1050 1061) no Hoare annotation was computed. [2018-07-22 13:27:10,279 INFO L421 ceAbstractionStarter]: For program point L558''(lines 558 568) no Hoare annotation was computed. [2018-07-22 13:27:10,280 INFO L421 ceAbstractionStarter]: For program point L1062(lines 1062 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,280 INFO L421 ceAbstractionStarter]: For program point L299(lines 299 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,280 INFO L421 ceAbstractionStarter]: For program point L1063(lines 1063 1073) no Hoare annotation was computed. [2018-07-22 13:27:10,280 INFO L421 ceAbstractionStarter]: For program point L1035(lines 1035 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,280 INFO L421 ceAbstractionStarter]: For program point L1030(lines 1030 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,280 INFO L421 ceAbstractionStarter]: For program point L1038(lines 1038 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,280 INFO L421 ceAbstractionStarter]: For program point L1044(lines 1044 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,280 INFO L421 ceAbstractionStarter]: For program point L1049(lines 1049 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,280 INFO L421 ceAbstractionStarter]: For program point L1091(lines 1091 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,280 INFO L421 ceAbstractionStarter]: For program point L1099(lines 1099 1107) no Hoare annotation was computed. [2018-07-22 13:27:10,281 INFO L421 ceAbstractionStarter]: For program point L1098(lines 1098 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,281 INFO L421 ceAbstractionStarter]: For program point L830''(lines 830 839) no Hoare annotation was computed. [2018-07-22 13:27:10,281 INFO L421 ceAbstractionStarter]: For program point L1074(lines 1074 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,281 INFO L421 ceAbstractionStarter]: For program point L1081(lines 1081 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,281 INFO L421 ceAbstractionStarter]: For program point L1086(lines 1086 1654) no Hoare annotation was computed. [2018-07-22 13:27:10,293 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-07-22 13:27:10,299 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-07-22 13:27:10,300 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-07-22 13:27:10,300 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-07-22 13:27:10,300 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-07-22 13:27:10,329 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-07-22 13:27:10,329 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-07-22 13:27:10,330 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-07-22 13:27:10,330 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-07-22 13:27:10,330 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-07-22 13:27:10,334 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-07-22 13:27:10,344 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-07-22 13:27:10,344 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-07-22 13:27:10,344 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-07-22 13:27:10,344 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-07-22 13:27:10,348 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-07-22 13:27:10,348 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-07-22 13:27:10,349 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-07-22 13:27:10,349 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-07-22 13:27:10,349 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-07-22 13:27:10,353 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-07-22 13:27:10,357 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-07-22 13:27:10,357 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-07-22 13:27:10,357 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-07-22 13:27:10,357 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-07-22 13:27:10,363 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-07-22 13:27:10,363 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-07-22 13:27:10,363 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-07-22 13:27:10,363 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-07-22 13:27:10,364 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-07-22 13:27:10,368 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.07 01:27:10 BoogieIcfgContainer [2018-07-22 13:27:10,368 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-22 13:27:10,369 INFO L168 Benchmark]: Toolchain (without parser) took 110789.95 ms. Allocated memory was 307.2 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 246.5 MB in the beginning and 877.6 MB in the end (delta: -631.1 MB). Peak memory consumption was 1.5 GB. Max. memory is 5.3 GB. [2018-07-22 13:27:10,370 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 307.2 MB. Free memory is still 272.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-07-22 13:27:10,371 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1603.44 ms. Allocated memory was 307.2 MB in the beginning and 330.8 MB in the end (delta: 23.6 MB). Free memory was 246.5 MB in the beginning and 236.2 MB in the end (delta: 10.4 MB). Peak memory consumption was 71.1 MB. Max. memory is 5.3 GB. [2018-07-22 13:27:10,371 INFO L168 Benchmark]: Boogie Procedure Inliner took 269.64 ms. Allocated memory is still 330.8 MB. Free memory was 236.2 MB in the beginning and 193.3 MB in the end (delta: 42.9 MB). Peak memory consumption was 42.9 MB. Max. memory is 5.3 GB. [2018-07-22 13:27:10,372 INFO L168 Benchmark]: Boogie Preprocessor took 757.55 ms. Allocated memory was 330.8 MB in the beginning and 584.6 MB in the end (delta: 253.8 MB). Free memory was 193.3 MB in the beginning and 515.4 MB in the end (delta: -322.1 MB). Peak memory consumption was 56.8 MB. Max. memory is 5.3 GB. [2018-07-22 13:27:10,373 INFO L168 Benchmark]: RCFGBuilder took 7242.42 ms. Allocated memory is still 584.6 MB. Free memory was 515.4 MB in the beginning and 371.7 MB in the end (delta: 143.7 MB). Peak memory consumption was 199.0 MB. Max. memory is 5.3 GB. [2018-07-22 13:27:10,373 INFO L168 Benchmark]: TraceAbstraction took 100907.07 ms. Allocated memory was 584.6 MB in the beginning and 2.3 GB in the end (delta: 1.7 GB). Free memory was 371.7 MB in the beginning and 877.6 MB in the end (delta: -505.9 MB). Peak memory consumption was 1.4 GB. Max. memory is 5.3 GB. [2018-07-22 13:27:10,377 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 307.2 MB. Free memory is still 272.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 1603.44 ms. Allocated memory was 307.2 MB in the beginning and 330.8 MB in the end (delta: 23.6 MB). Free memory was 246.5 MB in the beginning and 236.2 MB in the end (delta: 10.4 MB). Peak memory consumption was 71.1 MB. Max. memory is 5.3 GB. * Boogie Procedure Inliner took 269.64 ms. Allocated memory is still 330.8 MB. Free memory was 236.2 MB in the beginning and 193.3 MB in the end (delta: 42.9 MB). Peak memory consumption was 42.9 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 757.55 ms. Allocated memory was 330.8 MB in the beginning and 584.6 MB in the end (delta: 253.8 MB). Free memory was 193.3 MB in the beginning and 515.4 MB in the end (delta: -322.1 MB). Peak memory consumption was 56.8 MB. Max. memory is 5.3 GB. * RCFGBuilder took 7242.42 ms. Allocated memory is still 584.6 MB. Free memory was 515.4 MB in the beginning and 371.7 MB in the end (delta: 143.7 MB). Peak memory consumption was 199.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 100907.07 ms. Allocated memory was 584.6 MB in the beginning and 2.3 GB in the end (delta: 1.7 GB). Free memory was 371.7 MB in the beginning and 877.6 MB in the end (delta: -505.9 MB). Peak memory consumption was 1.4 GB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 187]: 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: 1658]: Loop Invariant [2018-07-22 13:27:10,385 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-07-22 13:27:10,386 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-07-22 13:27:10,386 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-07-22 13:27:10,386 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-07-22 13:27:10,386 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-07-22 13:27:10,395 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-07-22 13:27:10,395 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-07-22 13:27:10,395 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-07-22 13:27:10,395 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-07-22 13:27:10,396 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 + 86 <= 0 && !(__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a2 == 3)) && 3 <= __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a2) || ((0 <= __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a0 + 44 && !(__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a2 == 3)) && 3 <= __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a2)) && 0 < __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 + 16) || (__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a2 == 3 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a0 + 104 <= 0)) || (__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a0 + 98 <= 0 && (__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 + 86 <= 0 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 + 16 <= 0) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a2 == 1)) || ((((0 <= __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a0 + 97 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a0 + 61 <= 0) && 0 < __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 + 144) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 <= 43) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a2 == 1)) || (((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a2 == 3 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 + 86 <= 0) && 0 <= __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a0 + 97) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a0 + 61 <= 0)) || (0 < __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 + 16 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a0 + 98 <= 0 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a2 == 2)) || (((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a0 + 98 <= 0 && 0 < __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 + 16) && !(__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a2 == 3)) && 3 <= __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a2)) || (((!(__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a2 == 1) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a0 + 147 <= 0) && !(__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a2 == 3)) && 3 <= __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a2)) || ((43 < __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a0 + 98 <= 0) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a2 == 1)) || (__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a2 == 2 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 + 86 <= 0 && !(__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a2 == 3))) || (((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a0 + 98 <= 0 && 0 < __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 + 86) && 0 < __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a0 + 147) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a2 == 1)) || (__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a2 == 3 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 + 86 <= 0 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 + 127 <= 0)) || (((0 < __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 + 86 && 0 < __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 + 16) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 <= 43) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a2 == 1)) || ((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a0 + 61 <= 0 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 + 86 <= 0 && !(__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a2 == 3)) && 3 <= __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a2)) || (((0 <= __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a0 + 143 && 0 < __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 + 144) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a0 + 104 <= 0) && 3 <= __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a2)) || ((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a2 == 3 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a0 + 98 <= 0) && 0 < __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 + 86)) || (((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a2 == 3 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 + 86 <= 0) && 0 <= __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a0 + 97) && 0 < __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 + 16)) || ((0 <= __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a0 + 44 && 0 < __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 + 144) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a2 == 4) || ((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 + 86 <= 0 && 0 <= __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a0 + 44) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a2 == 4)) || (__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a0 + 147 <= 0 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 + 86 <= 0)) || (__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a2 == 2 && (!(__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a2 == 1) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a0 + 147 <= 0) && !(__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a2 == 3))) || ((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 + 86 <= 0 && 0 < __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 + 144) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a2 == 4)) || (__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a2 == 2 && 0 <= __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a0 + 44)) || ((0 < __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 + 144 && (\exists v_prenex_5 : int :: (((!((v_prenex_5 % 299926 + 3) % 5 == 0) && v_prenex_5 + 44 <= 0) && v_prenex_5 % 299926 < 300072) && 0 == v_prenex_5 % 299926) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a0 <= 5 * ((v_prenex_5 % 299926 + -300072) / 5) + 3)) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a2 == 1)) || (__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a0 + 98 <= 0 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a2 == 3 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 + 86 <= 0 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 + 16 <= 0)) || ((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 + 86 <= 0 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 + 127 <= 0) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a2 == 1) - InvariantResult [Line: 1766]: Loop Invariant [2018-07-22 13:27:10,399 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-07-22 13:27:10,400 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-07-22 13:27:10,400 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-07-22 13:27:10,400 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-07-22 13:27:10,400 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-07-22 13:27:10,403 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-07-22 13:27:10,403 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-07-22 13:27:10,403 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-07-22 13:27:10,403 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-07-22 13:27:10,403 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a2 == 2 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 + 86 <= 0 && !(__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a2 == 3)) || ((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a0 + 98 <= 0 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a2 == 2) && 0 < __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 + 16)) || (__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a2 == 2 && !(__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a2 == 1) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a0 + 147 <= 0)) || (__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a0 + 98 <= 0 && (__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 + 86 <= 0 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 + 16 <= 0) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a2 == 1)) || ((0 <= __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a0 + 44 && 0 < __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 + 144) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a2 == 4) || ((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 + 86 <= 0 && 0 <= __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a0 + 44) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a2 == 4)) || (__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a2 == 2 && 0 <= __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a0 + 44)) || (((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a0 + 98 <= 0 && 0 < __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 + 16) && !(__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a2 == 3)) && 3 <= __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a2)) || (__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a2 == 3 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a0 + 104 <= 0)) || (((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a0 + 98 <= 0 && 0 < __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 + 86) && 0 < __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a0 + 147) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a2 == 1)) || (__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a2 == 3 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 + 86 <= 0 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 + 127 <= 0)) || ((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a2 == 3 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 + 86 <= 0 && 0 < __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a0 + 98) && 0 < __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 + 16)) || (((0 <= __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a0 + 143 && 0 < __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 + 144) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a0 + 104 <= 0) && 3 <= __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a2)) || ((!(__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a2 == 1) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a0 + 147 <= 0) && 3 <= __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a2)) || ((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a2 == 3 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a0 + 98 <= 0) && 0 < __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 + 86)) || (__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a0 + 147 <= 0 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 + 86 <= 0)) || (0 < __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 + 16 && (((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 + 86 <= 0 && !(__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a2 == 3)) && 3 <= __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a2) || ((0 <= __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a0 + 44 && !(__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a2 == 3)) && 3 <= __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a2)))) || ((43 < __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a0 + 98 <= 0) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a2 == 1)) || (((0 < __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 + 86 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 <= 43) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a2 == 1) && 0 < __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 + 16)) || (((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 + 86 <= 0 && !(__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a2 == 3)) && 3 <= __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a2) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a0 + 98 <= 0)) || ((((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 + 86 <= 0 && 0 < __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a0 + 98) && !(__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a2 == 3)) && 0 < __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 + 144) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a2 == 4)) || ((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a2 == 3 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 + 86 <= 0 && 0 < __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a0 + 98) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a0 + 61 <= 0)) || (__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a0 + 61 <= 0 && ((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 + 86 <= 0 && 0 < __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a0 + 98) && !(__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a2 == 3)) && 3 <= __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a2)) || ((0 < __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 + 144 && (\exists v_prenex_5 : int :: (((!((v_prenex_5 % 299926 + 3) % 5 == 0) && v_prenex_5 + 44 <= 0) && v_prenex_5 % 299926 < 300072) && 0 == v_prenex_5 % 299926) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a0 <= 5 * ((v_prenex_5 % 299926 + -300072) / 5) + 3)) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a2 == 1)) || (__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a0 + 98 <= 0 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a2 == 3 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 + 86 <= 0 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 + 16 <= 0)) || ((((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a0 + 61 <= 0 && 0 < __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 + 144) && 0 < __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a0 + 98) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 <= 43) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a2 == 1)) || ((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 + 86 <= 0 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 + 127 <= 0) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a2 == 1) - InvariantResult [Line: 1760]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 23]: Loop Invariant [2018-07-22 13:27:10,406 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-07-22 13:27:10,406 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-07-22 13:27:10,406 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-07-22 13:27:10,406 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-07-22 13:27:10,407 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-07-22 13:27:10,409 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-07-22 13:27:10,409 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-07-22 13:27:10,409 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-07-22 13:27:10,409 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-07-22 13:27:10,410 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a2 == 2 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 + 86 <= 0 && !(__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a2 == 3)) || ((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a0 + 98 <= 0 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a2 == 2) && 0 < __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 + 16)) || (__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a2 == 2 && !(__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a2 == 1) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a0 + 147 <= 0)) || (__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a0 + 98 <= 0 && (__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 + 86 <= 0 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 + 16 <= 0) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a2 == 1)) || ((0 <= __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a0 + 44 && 0 < __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 + 144) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a2 == 4) || ((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 + 86 <= 0 && 0 <= __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a0 + 44) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a2 == 4)) || (__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a2 == 2 && 0 <= __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a0 + 44)) || (((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a0 + 98 <= 0 && 0 < __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 + 16) && !(__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a2 == 3)) && 3 <= __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a2)) || (__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a2 == 3 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a0 + 104 <= 0)) || (((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a0 + 98 <= 0 && 0 < __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 + 86) && 0 < __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a0 + 147) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a2 == 1)) || (__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a2 == 3 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 + 86 <= 0 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 + 127 <= 0)) || ((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a2 == 3 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 + 86 <= 0 && 0 < __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a0 + 98) && 0 < __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 + 16)) || (((0 <= __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a0 + 143 && 0 < __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 + 144) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a0 + 104 <= 0) && 3 <= __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a2)) || ((!(__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a2 == 1) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a0 + 147 <= 0) && 3 <= __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a2)) || ((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a2 == 3 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a0 + 98 <= 0) && 0 < __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 + 86)) || (__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a0 + 147 <= 0 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 + 86 <= 0)) || (0 < __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 + 16 && (((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 + 86 <= 0 && !(__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a2 == 3)) && 3 <= __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a2) || ((0 <= __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a0 + 44 && !(__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a2 == 3)) && 3 <= __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a2)))) || ((43 < __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a0 + 98 <= 0) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a2 == 1)) || (((0 < __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 + 86 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 <= 43) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a2 == 1) && 0 < __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 + 16)) || (((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 + 86 <= 0 && !(__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a2 == 3)) && 3 <= __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a2) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a0 + 98 <= 0)) || ((((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 + 86 <= 0 && 0 < __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a0 + 98) && !(__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a2 == 3)) && 0 < __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 + 144) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a2 == 4)) || ((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a2 == 3 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 + 86 <= 0 && 0 < __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a0 + 98) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a0 + 61 <= 0)) || (__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a0 + 61 <= 0 && ((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 + 86 <= 0 && 0 < __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a0 + 98) && !(__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a2 == 3)) && 3 <= __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a2)) || ((0 < __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 + 144 && (\exists v_prenex_5 : int :: (((!((v_prenex_5 % 299926 + 3) % 5 == 0) && v_prenex_5 + 44 <= 0) && v_prenex_5 % 299926 < 300072) && 0 == v_prenex_5 % 299926) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a0 <= 5 * ((v_prenex_5 % 299926 + -300072) / 5) + 3)) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a2 == 1)) || (__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a0 + 98 <= 0 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a2 == 3 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 + 86 <= 0 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 + 16 <= 0)) || ((((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a0 + 61 <= 0 && 0 < __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 + 144) && 0 < __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a0 + 98) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 <= 43) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a2 == 1)) || ((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 + 86 <= 0 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 + 127 <= 0) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a2 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 425 locations, 1 error locations. SAFE Result, 100.7s OverallTime, 15 OverallIterations, 6 TraceHistogramMax, 69.4s AutomataDifference, 0.0s DeadEndRemovalTime, 12.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 4818 SDtfs, 14456 SDslu, 2227 SDs, 0 SdLazy, 30756 SolverSat, 6404 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 59.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1501 GetRequests, 1449 SyntacticMatches, 7 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36744occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 5.0s AutomataMinimizationTime, 15 MinimizatonAttempts, 34483 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 433 NumberOfFragments, 1481 HoareAnnotationTreeSize, 4 FomulaSimplifications, 19470 FormulaSimplificationTreeSizeReduction, 2.9s HoareSimplificationTime, 4 FomulaSimplificationsInter, 45810 FormulaSimplificationTreeSizeReductionInter, 9.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 7.1s InterpolantComputationTime, 7921 NumberOfCodeBlocks, 7921 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 7902 ConstructedInterpolants, 59 QuantifiedInterpolants, 11294175 SizeOfPredicates, 2 NumberOfNonLiveVariables, 1779 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 19 InterpolantComputations, 15 PerfectInterpolantSequences, 7431/7742 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/Problem15_label21_true-unreach-call.c_svcomp-Reach-64bit-Automizer_Default.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-07-22_13-27-10-419.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/Problem15_label21_true-unreach-call.c_svcomp-Reach-64bit-Automizer_Default.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-22_13-27-10-419.csv Received shutdown request...