java -Xmx8000000000 -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 csv -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem11_label55_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-dd2f093 [2018-07-24 02:37:42,487 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-24 02:37:42,489 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-24 02:37:42,510 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-24 02:37:42,510 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-24 02:37:42,511 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-24 02:37:42,513 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-24 02:37:42,515 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-24 02:37:42,518 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-24 02:37:42,524 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-24 02:37:42,525 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-24 02:37:42,527 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-24 02:37:42,529 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-24 02:37:42,533 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-24 02:37:42,534 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-24 02:37:42,537 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-24 02:37:42,538 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-24 02:37:42,539 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-24 02:37:42,544 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-24 02:37:42,546 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-24 02:37:42,550 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-24 02:37:42,551 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-24 02:37:42,557 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-24 02:37:42,558 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-24 02:37:42,558 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-24 02:37:42,559 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-24 02:37:42,562 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-24 02:37:42,566 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-24 02:37:42,566 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-24 02:37:42,569 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-24 02:37:42,570 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-24 02:37:42,572 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-24 02:37:42,572 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-24 02:37:42,572 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-24 02:37:42,573 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-24 02:37:42,574 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-24 02:37:42,574 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-07-24 02:37:42,595 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-24 02:37:42,595 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-24 02:37:42,596 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-07-24 02:37:42,596 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-07-24 02:37:42,597 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-07-24 02:37:42,597 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-07-24 02:37:42,597 INFO L133 SettingsManager]: * Use SBE=true [2018-07-24 02:37:42,598 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-07-24 02:37:42,598 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-07-24 02:37:42,598 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-07-24 02:37:42,598 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-07-24 02:37:42,598 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-07-24 02:37:42,599 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-07-24 02:37:42,599 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-07-24 02:37:42,599 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-07-24 02:37:42,599 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-24 02:37:42,599 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-07-24 02:37:42,600 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-07-24 02:37:42,600 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-07-24 02:37:42,600 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-07-24 02:37:42,600 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-24 02:37:42,600 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-07-24 02:37:42,601 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-07-24 02:37:42,601 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-07-24 02:37:42,601 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-07-24 02:37:42,601 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-07-24 02:37:42,601 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-24 02:37:42,602 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-07-24 02:37:42,664 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-24 02:37:42,680 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-24 02:37:42,686 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-24 02:37:42,687 INFO L271 PluginConnector]: Initializing CDTParser... [2018-07-24 02:37:42,688 INFO L276 PluginConnector]: CDTParser initialized [2018-07-24 02:37:42,688 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem11_label55_true-unreach-call.c [2018-07-24 02:37:43,039 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe49efea1/23e3b27a742b4b098d216d50cc97de75/FLAG9e0a874c4 [2018-07-24 02:37:43,350 INFO L276 CDTParser]: Found 1 translation units. [2018-07-24 02:37:43,350 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem11_label55_true-unreach-call.c [2018-07-24 02:37:43,369 INFO L324 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe49efea1/23e3b27a742b4b098d216d50cc97de75/FLAG9e0a874c4 [2018-07-24 02:37:43,385 INFO L332 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe49efea1/23e3b27a742b4b098d216d50cc97de75 [2018-07-24 02:37:43,396 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-24 02:37:43,400 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-07-24 02:37:43,401 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-07-24 02:37:43,401 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-07-24 02:37:43,410 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-07-24 02:37:43,411 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.07 02:37:43" (1/1) ... [2018-07-24 02:37:43,414 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22224105 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 02:37:43, skipping insertion in model container [2018-07-24 02:37:43,414 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.07 02:37:43" (1/1) ... [2018-07-24 02:37:43,687 INFO L179 PRDispatcher]: Starting pre-run dispatcher in SV-COMP mode [2018-07-24 02:37:44,093 INFO L175 PostProcessor]: Settings: Checked method=main [2018-07-24 02:37:44,114 INFO L422 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-07-24 02:37:44,315 INFO L175 PostProcessor]: Settings: Checked method=main [2018-07-24 02:37:44,403 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 02:37:44 WrapperNode [2018-07-24 02:37:44,403 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-07-24 02:37:44,404 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-07-24 02:37:44,404 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-07-24 02:37:44,405 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-07-24 02:37:44,415 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 02:37:44" (1/1) ... [2018-07-24 02:37:44,471 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 02:37:44" (1/1) ... [2018-07-24 02:37:44,582 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-07-24 02:37:44,583 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-24 02:37:44,583 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-24 02:37:44,583 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-24 02:37:44,819 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 02:37:44" (1/1) ... [2018-07-24 02:37:44,819 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 02:37:44" (1/1) ... [2018-07-24 02:37:44,826 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 02:37:44" (1/1) ... [2018-07-24 02:37:44,827 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 02:37:44" (1/1) ... [2018-07-24 02:37:44,867 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 02:37:44" (1/1) ... [2018-07-24 02:37:44,880 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 02:37:44" (1/1) ... [2018-07-24 02:37:44,900 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 02:37:44" (1/1) ... [2018-07-24 02:37:44,919 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-24 02:37:44,920 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-24 02:37:44,920 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-24 02:37:44,920 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-24 02:37:44,921 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 02:37:44" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-07-24 02:37:44,997 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-07-24 02:37:44,998 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-07-24 02:37:44,998 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-07-24 02:37:49,173 INFO L261 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-07-24 02:37:49,173 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.07 02:37:49 BoogieIcfgContainer [2018-07-24 02:37:49,174 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-24 02:37:49,175 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-24 02:37:49,175 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-24 02:37:49,178 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-24 02:37:49,179 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.07 02:37:43" (1/3) ... [2018-07-24 02:37:49,180 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b8c6794 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.07 02:37:49, skipping insertion in model container [2018-07-24 02:37:49,180 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 02:37:44" (2/3) ... [2018-07-24 02:37:49,180 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b8c6794 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.07 02:37:49, skipping insertion in model container [2018-07-24 02:37:49,181 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.07 02:37:49" (3/3) ... [2018-07-24 02:37:49,183 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label55_true-unreach-call.c [2018-07-24 02:37:49,193 INFO L132 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-07-24 02:37:49,203 INFO L144 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-24 02:37:49,259 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-24 02:37:49,260 INFO L373 AbstractCegarLoop]: Interprodecural is true [2018-07-24 02:37:49,261 INFO L374 AbstractCegarLoop]: Hoare is true [2018-07-24 02:37:49,261 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-07-24 02:37:49,261 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-07-24 02:37:49,261 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-24 02:37:49,262 INFO L378 AbstractCegarLoop]: Difference is false [2018-07-24 02:37:49,262 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-24 02:37:49,262 INFO L384 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-24 02:37:49,288 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states. [2018-07-24 02:37:49,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-07-24 02:37:49,298 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 02:37:49,299 INFO L353 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] [2018-07-24 02:37:49,300 INFO L414 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 02:37:49,305 INFO L82 PathProgramCache]: Analyzing trace with hash 279835594, now seen corresponding path program 1 times [2018-07-24 02:37:49,308 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 02:37:49,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 02:37:49,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 02:37:49,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 02:37:49,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 02:37:49,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 02:37:49,819 WARN L169 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 6 DAG size of output: 3 [2018-07-24 02:37:49,831 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-24 02:37:49,834 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 02:37:49,834 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-24 02:37:49,840 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-24 02:37:49,856 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-24 02:37:49,857 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 02:37:49,860 INFO L87 Difference]: Start difference. First operand 284 states. Second operand 4 states. [2018-07-24 02:37:53,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 02:37:53,573 INFO L93 Difference]: Finished difference Result 974 states and 1747 transitions. [2018-07-24 02:37:53,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-24 02:37:53,575 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2018-07-24 02:37:53,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 02:37:53,599 INFO L225 Difference]: With dead ends: 974 [2018-07-24 02:37:53,600 INFO L226 Difference]: Without dead ends: 683 [2018-07-24 02:37:53,605 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 02:37:53,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2018-07-24 02:37:53,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 677. [2018-07-24 02:37:53,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 677 states. [2018-07-24 02:37:53,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 1087 transitions. [2018-07-24 02:37:53,716 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 1087 transitions. Word has length 46 [2018-07-24 02:37:53,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 02:37:53,716 INFO L471 AbstractCegarLoop]: Abstraction has 677 states and 1087 transitions. [2018-07-24 02:37:53,717 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-24 02:37:53,717 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 1087 transitions. [2018-07-24 02:37:53,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-07-24 02:37:53,722 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 02:37:53,722 INFO L353 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, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 02:37:53,723 INFO L414 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 02:37:53,723 INFO L82 PathProgramCache]: Analyzing trace with hash 281883940, now seen corresponding path program 1 times [2018-07-24 02:37:53,723 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 02:37:53,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 02:37:53,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 02:37:53,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 02:37:53,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 02:37:53,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 02:37:54,094 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 02:37:54,095 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 02:37:54,095 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-24 02:37:54,097 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-24 02:37:54,097 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-24 02:37:54,097 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 02:37:54,098 INFO L87 Difference]: Start difference. First operand 677 states and 1087 transitions. Second operand 4 states. [2018-07-24 02:37:58,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 02:37:58,490 INFO L93 Difference]: Finished difference Result 2487 states and 4110 transitions. [2018-07-24 02:37:58,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-24 02:37:58,491 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2018-07-24 02:37:58,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 02:37:58,503 INFO L225 Difference]: With dead ends: 2487 [2018-07-24 02:37:58,503 INFO L226 Difference]: Without dead ends: 1812 [2018-07-24 02:37:58,508 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-24 02:37:58,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1812 states. [2018-07-24 02:37:58,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1812 to 1795. [2018-07-24 02:37:58,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1795 states. [2018-07-24 02:37:58,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1795 states to 1795 states and 2721 transitions. [2018-07-24 02:37:58,562 INFO L78 Accepts]: Start accepts. Automaton has 1795 states and 2721 transitions. Word has length 116 [2018-07-24 02:37:58,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 02:37:58,562 INFO L471 AbstractCegarLoop]: Abstraction has 1795 states and 2721 transitions. [2018-07-24 02:37:58,563 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-24 02:37:58,563 INFO L276 IsEmpty]: Start isEmpty. Operand 1795 states and 2721 transitions. [2018-07-24 02:37:58,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-07-24 02:37:58,568 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 02:37:58,569 INFO L353 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 02:37:58,569 INFO L414 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 02:37:58,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1162525310, now seen corresponding path program 1 times [2018-07-24 02:37:58,569 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 02:37:58,570 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 02:37:58,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 02:37:58,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 02:37:58,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 02:37:58,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 02:37:58,830 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 02:37:58,830 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 02:37:58,830 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-24 02:37:58,831 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-24 02:37:58,831 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-24 02:37:58,831 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 02:37:58,832 INFO L87 Difference]: Start difference. First operand 1795 states and 2721 transitions. Second operand 3 states. [2018-07-24 02:38:00,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 02:38:00,421 INFO L93 Difference]: Finished difference Result 5253 states and 8014 transitions. [2018-07-24 02:38:00,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-24 02:38:00,422 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 141 [2018-07-24 02:38:00,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 02:38:00,441 INFO L225 Difference]: With dead ends: 5253 [2018-07-24 02:38:00,441 INFO L226 Difference]: Without dead ends: 3460 [2018-07-24 02:38:00,445 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 02:38:00,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3460 states. [2018-07-24 02:38:00,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3460 to 3460. [2018-07-24 02:38:00,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3460 states. [2018-07-24 02:38:00,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3460 states to 3460 states and 4898 transitions. [2018-07-24 02:38:00,520 INFO L78 Accepts]: Start accepts. Automaton has 3460 states and 4898 transitions. Word has length 141 [2018-07-24 02:38:00,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 02:38:00,520 INFO L471 AbstractCegarLoop]: Abstraction has 3460 states and 4898 transitions. [2018-07-24 02:38:00,520 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-24 02:38:00,521 INFO L276 IsEmpty]: Start isEmpty. Operand 3460 states and 4898 transitions. [2018-07-24 02:38:00,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-07-24 02:38:00,525 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 02:38:00,525 INFO L353 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, 2, 2, 2, 2, 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] [2018-07-24 02:38:00,525 INFO L414 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 02:38:00,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1664526320, now seen corresponding path program 1 times [2018-07-24 02:38:00,526 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 02:38:00,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 02:38:00,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 02:38:00,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 02:38:00,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 02:38:00,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 02:38:00,955 WARN L169 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 7 [2018-07-24 02:38:01,001 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-07-24 02:38:01,001 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 02:38:01,002 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-24 02:38:01,002 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-24 02:38:01,003 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-24 02:38:01,003 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 02:38:01,003 INFO L87 Difference]: Start difference. First operand 3460 states and 4898 transitions. Second operand 4 states. [2018-07-24 02:38:02,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 02:38:02,730 INFO L93 Difference]: Finished difference Result 7860 states and 10876 transitions. [2018-07-24 02:38:02,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-24 02:38:02,731 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 203 [2018-07-24 02:38:02,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 02:38:02,751 INFO L225 Difference]: With dead ends: 7860 [2018-07-24 02:38:02,752 INFO L226 Difference]: Without dead ends: 4024 [2018-07-24 02:38:02,758 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 02:38:02,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4024 states. [2018-07-24 02:38:02,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4024 to 3641. [2018-07-24 02:38:02,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3641 states. [2018-07-24 02:38:02,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3641 states to 3641 states and 5064 transitions. [2018-07-24 02:38:02,846 INFO L78 Accepts]: Start accepts. Automaton has 3641 states and 5064 transitions. Word has length 203 [2018-07-24 02:38:02,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 02:38:02,846 INFO L471 AbstractCegarLoop]: Abstraction has 3641 states and 5064 transitions. [2018-07-24 02:38:02,847 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-24 02:38:02,847 INFO L276 IsEmpty]: Start isEmpty. Operand 3641 states and 5064 transitions. [2018-07-24 02:38:02,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-07-24 02:38:02,851 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 02:38:02,851 INFO L353 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 02:38:02,851 INFO L414 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 02:38:02,852 INFO L82 PathProgramCache]: Analyzing trace with hash -427990478, now seen corresponding path program 1 times [2018-07-24 02:38:02,852 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 02:38:02,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 02:38:02,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 02:38:02,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 02:38:02,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 02:38:02,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 02:38:03,343 WARN L169 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-07-24 02:38:03,855 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 02:38:03,855 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 02:38:03,856 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-07-24 02:38:03,856 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-24 02:38:03,856 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-24 02:38:03,857 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-07-24 02:38:03,857 INFO L87 Difference]: Start difference. First operand 3641 states and 5064 transitions. Second operand 8 states. [2018-07-24 02:38:11,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 02:38:11,174 INFO L93 Difference]: Finished difference Result 7541 states and 10411 transitions. [2018-07-24 02:38:11,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-07-24 02:38:11,180 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 206 [2018-07-24 02:38:11,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 02:38:11,196 INFO L225 Difference]: With dead ends: 7541 [2018-07-24 02:38:11,196 INFO L226 Difference]: Without dead ends: 3902 [2018-07-24 02:38:11,201 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2018-07-24 02:38:11,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3902 states. [2018-07-24 02:38:11,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3902 to 3826. [2018-07-24 02:38:11,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3826 states. [2018-07-24 02:38:11,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3826 states to 3826 states and 5255 transitions. [2018-07-24 02:38:11,271 INFO L78 Accepts]: Start accepts. Automaton has 3826 states and 5255 transitions. Word has length 206 [2018-07-24 02:38:11,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 02:38:11,271 INFO L471 AbstractCegarLoop]: Abstraction has 3826 states and 5255 transitions. [2018-07-24 02:38:11,272 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-24 02:38:11,272 INFO L276 IsEmpty]: Start isEmpty. Operand 3826 states and 5255 transitions. [2018-07-24 02:38:11,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2018-07-24 02:38:11,276 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 02:38:11,276 INFO L353 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-24 02:38:11,276 INFO L414 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 02:38:11,277 INFO L82 PathProgramCache]: Analyzing trace with hash 1715298297, now seen corresponding path program 1 times [2018-07-24 02:38:11,277 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 02:38:11,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 02:38:11,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 02:38:11,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 02:38:11,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 02:38:11,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 02:38:11,696 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2018-07-24 02:38:11,696 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 02:38:11,696 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-24 02:38:11,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 02:38:11,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 02:38:11,867 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 02:38:11,970 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-07-24 02:38:12,014 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-07-24 02:38:12,015 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2018-07-24 02:38:12,016 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-24 02:38:12,016 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-24 02:38:12,016 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 02:38:12,017 INFO L87 Difference]: Start difference. First operand 3826 states and 5255 transitions. Second operand 4 states. [2018-07-24 02:38:15,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 02:38:15,853 INFO L93 Difference]: Finished difference Result 10061 states and 13797 transitions. [2018-07-24 02:38:15,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-24 02:38:15,854 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 245 [2018-07-24 02:38:15,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 02:38:15,880 INFO L225 Difference]: With dead ends: 10061 [2018-07-24 02:38:15,880 INFO L226 Difference]: Without dead ends: 6422 [2018-07-24 02:38:15,886 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 245 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-24 02:38:15,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6422 states. [2018-07-24 02:38:16,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6422 to 4751. [2018-07-24 02:38:16,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4751 states. [2018-07-24 02:38:16,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4751 states to 4751 states and 6306 transitions. [2018-07-24 02:38:16,056 INFO L78 Accepts]: Start accepts. Automaton has 4751 states and 6306 transitions. Word has length 245 [2018-07-24 02:38:16,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 02:38:16,057 INFO L471 AbstractCegarLoop]: Abstraction has 4751 states and 6306 transitions. [2018-07-24 02:38:16,057 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-24 02:38:16,057 INFO L276 IsEmpty]: Start isEmpty. Operand 4751 states and 6306 transitions. [2018-07-24 02:38:16,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2018-07-24 02:38:16,063 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 02:38:16,063 INFO L353 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-07-24 02:38:16,063 INFO L414 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 02:38:16,064 INFO L82 PathProgramCache]: Analyzing trace with hash 172573228, now seen corresponding path program 1 times [2018-07-24 02:38:16,064 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 02:38:16,064 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 02:38:16,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 02:38:16,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 02:38:16,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 02:38:16,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 02:38:16,498 WARN L169 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-07-24 02:38:16,727 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 11 proven. 76 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2018-07-24 02:38:16,727 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 02:38:16,727 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-24 02:38:16,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 02:38:16,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 02:38:16,832 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 02:38:16,933 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2018-07-24 02:38:16,954 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-07-24 02:38:16,955 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2018-07-24 02:38:16,955 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-24 02:38:16,955 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-24 02:38:16,956 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-07-24 02:38:16,956 INFO L87 Difference]: Start difference. First operand 4751 states and 6306 transitions. Second operand 7 states. [2018-07-24 02:38:21,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 02:38:21,507 INFO L93 Difference]: Finished difference Result 11716 states and 15775 transitions. [2018-07-24 02:38:21,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-07-24 02:38:21,508 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 262 [2018-07-24 02:38:21,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 02:38:21,531 INFO L225 Difference]: With dead ends: 11716 [2018-07-24 02:38:21,532 INFO L226 Difference]: Without dead ends: 5652 [2018-07-24 02:38:21,538 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 265 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2018-07-24 02:38:21,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5652 states. [2018-07-24 02:38:21,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5652 to 5464. [2018-07-24 02:38:21,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5464 states. [2018-07-24 02:38:21,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5464 states to 5464 states and 6707 transitions. [2018-07-24 02:38:21,624 INFO L78 Accepts]: Start accepts. Automaton has 5464 states and 6707 transitions. Word has length 262 [2018-07-24 02:38:21,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 02:38:21,625 INFO L471 AbstractCegarLoop]: Abstraction has 5464 states and 6707 transitions. [2018-07-24 02:38:21,625 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-24 02:38:21,625 INFO L276 IsEmpty]: Start isEmpty. Operand 5464 states and 6707 transitions. [2018-07-24 02:38:21,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2018-07-24 02:38:21,631 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 02:38:21,632 INFO L353 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-24 02:38:21,632 INFO L414 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 02:38:21,632 INFO L82 PathProgramCache]: Analyzing trace with hash -350000540, now seen corresponding path program 1 times [2018-07-24 02:38:21,632 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 02:38:21,632 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 02:38:21,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 02:38:21,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 02:38:21,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 02:38:21,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 02:38:22,148 WARN L169 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 5 [2018-07-24 02:38:22,235 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 183 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 02:38:22,235 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 02:38:22,236 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-24 02:38:22,236 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-24 02:38:22,237 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-24 02:38:22,237 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-07-24 02:38:22,237 INFO L87 Difference]: Start difference. First operand 5464 states and 6707 transitions. Second operand 5 states. [2018-07-24 02:38:25,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 02:38:25,626 INFO L93 Difference]: Finished difference Result 15196 states and 18869 transitions. [2018-07-24 02:38:25,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-24 02:38:25,626 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 273 [2018-07-24 02:38:25,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 02:38:25,653 INFO L225 Difference]: With dead ends: 15196 [2018-07-24 02:38:25,653 INFO L226 Difference]: Without dead ends: 9731 [2018-07-24 02:38:25,660 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-07-24 02:38:25,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9731 states. [2018-07-24 02:38:25,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9731 to 8056. [2018-07-24 02:38:25,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8056 states. [2018-07-24 02:38:25,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8056 states to 8056 states and 9808 transitions. [2018-07-24 02:38:25,782 INFO L78 Accepts]: Start accepts. Automaton has 8056 states and 9808 transitions. Word has length 273 [2018-07-24 02:38:25,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 02:38:25,782 INFO L471 AbstractCegarLoop]: Abstraction has 8056 states and 9808 transitions. [2018-07-24 02:38:25,782 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-24 02:38:25,782 INFO L276 IsEmpty]: Start isEmpty. Operand 8056 states and 9808 transitions. [2018-07-24 02:38:25,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2018-07-24 02:38:25,796 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 02:38:25,796 INFO L353 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 02:38:25,796 INFO L414 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 02:38:25,797 INFO L82 PathProgramCache]: Analyzing trace with hash -993164823, now seen corresponding path program 1 times [2018-07-24 02:38:25,797 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 02:38:25,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 02:38:25,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 02:38:25,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 02:38:25,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 02:38:25,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 02:38:26,114 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 362 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-07-24 02:38:26,114 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 02:38:26,114 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-24 02:38:26,115 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-24 02:38:26,115 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-24 02:38:26,115 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 02:38:26,115 INFO L87 Difference]: Start difference. First operand 8056 states and 9808 transitions. Second operand 4 states. [2018-07-24 02:38:28,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 02:38:28,952 INFO L93 Difference]: Finished difference Result 20380 states and 24962 transitions. [2018-07-24 02:38:28,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-24 02:38:28,952 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 360 [2018-07-24 02:38:28,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 02:38:28,979 INFO L225 Difference]: With dead ends: 20380 [2018-07-24 02:38:28,980 INFO L226 Difference]: Without dead ends: 12511 [2018-07-24 02:38:28,989 INFO L573 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-24 02:38:29,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12511 states. [2018-07-24 02:38:29,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12511 to 11571. [2018-07-24 02:38:29,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11571 states. [2018-07-24 02:38:29,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11571 states to 11571 states and 13756 transitions. [2018-07-24 02:38:29,163 INFO L78 Accepts]: Start accepts. Automaton has 11571 states and 13756 transitions. Word has length 360 [2018-07-24 02:38:29,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 02:38:29,164 INFO L471 AbstractCegarLoop]: Abstraction has 11571 states and 13756 transitions. [2018-07-24 02:38:29,164 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-24 02:38:29,164 INFO L276 IsEmpty]: Start isEmpty. Operand 11571 states and 13756 transitions. [2018-07-24 02:38:29,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2018-07-24 02:38:29,185 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 02:38:29,186 INFO L353 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 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-24 02:38:29,186 INFO L414 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 02:38:29,187 INFO L82 PathProgramCache]: Analyzing trace with hash 1766560681, now seen corresponding path program 1 times [2018-07-24 02:38:29,187 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 02:38:29,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 02:38:29,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 02:38:29,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 02:38:29,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 02:38:29,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 02:38:29,816 WARN L169 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 11 [2018-07-24 02:38:30,078 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 312 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2018-07-24 02:38:30,079 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 02:38:30,079 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-24 02:38:30,079 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-24 02:38:30,080 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-24 02:38:30,080 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 02:38:30,080 INFO L87 Difference]: Start difference. First operand 11571 states and 13756 transitions. Second operand 4 states. [2018-07-24 02:38:32,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 02:38:32,317 INFO L93 Difference]: Finished difference Result 24624 states and 29328 transitions. [2018-07-24 02:38:32,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-24 02:38:32,318 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 370 [2018-07-24 02:38:32,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 02:38:32,346 INFO L225 Difference]: With dead ends: 24624 [2018-07-24 02:38:32,346 INFO L226 Difference]: Without dead ends: 12497 [2018-07-24 02:38:32,359 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 02:38:32,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12497 states. [2018-07-24 02:38:32,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12497 to 11753. [2018-07-24 02:38:32,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11753 states. [2018-07-24 02:38:32,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11753 states to 11753 states and 13733 transitions. [2018-07-24 02:38:32,530 INFO L78 Accepts]: Start accepts. Automaton has 11753 states and 13733 transitions. Word has length 370 [2018-07-24 02:38:32,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 02:38:32,531 INFO L471 AbstractCegarLoop]: Abstraction has 11753 states and 13733 transitions. [2018-07-24 02:38:32,531 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-24 02:38:32,531 INFO L276 IsEmpty]: Start isEmpty. Operand 11753 states and 13733 transitions. [2018-07-24 02:38:32,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 511 [2018-07-24 02:38:32,565 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 02:38:32,566 INFO L353 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-07-24 02:38:32,566 INFO L414 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 02:38:32,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1641900616, now seen corresponding path program 1 times [2018-07-24 02:38:32,566 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 02:38:32,567 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 02:38:32,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 02:38:32,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 02:38:32,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 02:38:32,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 02:38:33,283 INFO L134 CoverageAnalysis]: Checked inductivity of 747 backedges. 568 proven. 0 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2018-07-24 02:38:33,283 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 02:38:33,283 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-24 02:38:33,284 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-24 02:38:33,284 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-24 02:38:33,284 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-07-24 02:38:33,285 INFO L87 Difference]: Start difference. First operand 11753 states and 13733 transitions. Second operand 5 states. [2018-07-24 02:38:37,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 02:38:37,394 INFO L93 Difference]: Finished difference Result 29253 states and 34189 transitions. [2018-07-24 02:38:37,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-24 02:38:37,395 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 510 [2018-07-24 02:38:37,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 02:38:37,417 INFO L225 Difference]: With dead ends: 29253 [2018-07-24 02:38:37,417 INFO L226 Difference]: Without dead ends: 17687 [2018-07-24 02:38:37,429 INFO L573 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-24 02:38:37,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17687 states. [2018-07-24 02:38:37,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17687 to 17314. [2018-07-24 02:38:37,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17314 states. [2018-07-24 02:38:37,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17314 states to 17314 states and 19548 transitions. [2018-07-24 02:38:37,648 INFO L78 Accepts]: Start accepts. Automaton has 17314 states and 19548 transitions. Word has length 510 [2018-07-24 02:38:37,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 02:38:37,649 INFO L471 AbstractCegarLoop]: Abstraction has 17314 states and 19548 transitions. [2018-07-24 02:38:37,649 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-24 02:38:37,649 INFO L276 IsEmpty]: Start isEmpty. Operand 17314 states and 19548 transitions. [2018-07-24 02:38:37,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 657 [2018-07-24 02:38:37,680 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 02:38:37,681 INFO L353 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, 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, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-24 02:38:37,681 INFO L414 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 02:38:37,681 INFO L82 PathProgramCache]: Analyzing trace with hash 186205551, now seen corresponding path program 1 times [2018-07-24 02:38:37,681 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 02:38:37,681 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 02:38:37,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 02:38:37,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 02:38:37,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 02:38:37,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 02:38:38,304 INFO L134 CoverageAnalysis]: Checked inductivity of 1280 backedges. 838 proven. 0 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2018-07-24 02:38:38,304 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 02:38:38,304 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-24 02:38:38,305 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-24 02:38:38,305 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-24 02:38:38,305 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-07-24 02:38:38,305 INFO L87 Difference]: Start difference. First operand 17314 states and 19548 transitions. Second operand 5 states. [2018-07-24 02:38:40,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 02:38:40,549 INFO L93 Difference]: Finished difference Result 33716 states and 38086 transitions. [2018-07-24 02:38:40,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-24 02:38:40,549 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 656 [2018-07-24 02:38:40,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 02:38:40,577 INFO L225 Difference]: With dead ends: 33716 [2018-07-24 02:38:40,577 INFO L226 Difference]: Without dead ends: 17331 [2018-07-24 02:38:40,592 INFO L573 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-24 02:38:40,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17331 states. [2018-07-24 02:38:40,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17331 to 16573. [2018-07-24 02:38:40,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16573 states. [2018-07-24 02:38:40,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16573 states to 16573 states and 18377 transitions. [2018-07-24 02:38:40,859 INFO L78 Accepts]: Start accepts. Automaton has 16573 states and 18377 transitions. Word has length 656 [2018-07-24 02:38:40,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 02:38:40,860 INFO L471 AbstractCegarLoop]: Abstraction has 16573 states and 18377 transitions. [2018-07-24 02:38:40,860 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-24 02:38:40,860 INFO L276 IsEmpty]: Start isEmpty. Operand 16573 states and 18377 transitions. [2018-07-24 02:38:41,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 688 [2018-07-24 02:38:41,034 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 02:38:41,035 INFO L353 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, 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, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 02:38:41,035 INFO L414 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 02:38:41,035 INFO L82 PathProgramCache]: Analyzing trace with hash 1045894770, now seen corresponding path program 1 times [2018-07-24 02:38:41,035 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 02:38:41,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 02:38:41,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 02:38:41,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 02:38:41,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 02:38:41,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 02:38:41,683 WARN L169 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-07-24 02:38:42,815 INFO L134 CoverageAnalysis]: Checked inductivity of 1309 backedges. 897 proven. 233 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2018-07-24 02:38:42,815 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 02:38:42,816 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-24 02:38:42,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 02:38:43,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 02:38:43,065 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 02:38:44,417 INFO L134 CoverageAnalysis]: Checked inductivity of 1309 backedges. 897 proven. 233 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2018-07-24 02:38:44,439 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-24 02:38:44,439 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6] total 12 [2018-07-24 02:38:44,440 INFO L450 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-24 02:38:44,441 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-24 02:38:44,441 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2018-07-24 02:38:44,441 INFO L87 Difference]: Start difference. First operand 16573 states and 18377 transitions. Second operand 13 states. [2018-07-24 02:38:54,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 02:38:54,862 INFO L93 Difference]: Finished difference Result 41924 states and 46188 transitions. [2018-07-24 02:38:54,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-24 02:38:54,863 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 687 [2018-07-24 02:38:54,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 02:38:54,887 INFO L225 Difference]: With dead ends: 41924 [2018-07-24 02:38:54,887 INFO L226 Difference]: Without dead ends: 26095 [2018-07-24 02:38:54,901 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 717 GetRequests, 682 SyntacticMatches, 5 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=348, Invalid=644, Unknown=0, NotChecked=0, Total=992 [2018-07-24 02:38:54,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26095 states. [2018-07-24 02:38:55,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26095 to 16931. [2018-07-24 02:38:55,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16931 states. [2018-07-24 02:38:55,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16931 states to 16931 states and 18717 transitions. [2018-07-24 02:38:55,145 INFO L78 Accepts]: Start accepts. Automaton has 16931 states and 18717 transitions. Word has length 687 [2018-07-24 02:38:55,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 02:38:55,145 INFO L471 AbstractCegarLoop]: Abstraction has 16931 states and 18717 transitions. [2018-07-24 02:38:55,145 INFO L472 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-24 02:38:55,146 INFO L276 IsEmpty]: Start isEmpty. Operand 16931 states and 18717 transitions. [2018-07-24 02:38:55,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 724 [2018-07-24 02:38:55,168 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 02:38:55,169 INFO L353 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, 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, 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, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 02:38:55,169 INFO L414 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 02:38:55,170 INFO L82 PathProgramCache]: Analyzing trace with hash 72178577, now seen corresponding path program 1 times [2018-07-24 02:38:55,170 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 02:38:55,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 02:38:55,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 02:38:55,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 02:38:55,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 02:38:55,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 02:38:57,680 INFO L134 CoverageAnalysis]: Checked inductivity of 1363 backedges. 135 proven. 1077 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2018-07-24 02:38:57,680 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 02:38:57,680 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-24 02:38:57,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 02:38:57,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 02:38:57,939 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 02:38:58,461 WARN L169 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 26 [2018-07-24 02:39:00,632 INFO L134 CoverageAnalysis]: Checked inductivity of 1363 backedges. 906 proven. 91 refuted. 0 times theorem prover too weak. 366 trivial. 0 not checked. [2018-07-24 02:39:00,652 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-24 02:39:00,652 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 12 [2018-07-24 02:39:00,654 INFO L450 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-24 02:39:00,654 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-24 02:39:00,655 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2018-07-24 02:39:00,655 INFO L87 Difference]: Start difference. First operand 16931 states and 18717 transitions. Second operand 13 states. [2018-07-24 02:39:16,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 02:39:16,337 INFO L93 Difference]: Finished difference Result 47446 states and 52415 transitions. [2018-07-24 02:39:16,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-07-24 02:39:16,338 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 723 [2018-07-24 02:39:16,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 02:39:16,367 INFO L225 Difference]: With dead ends: 47446 [2018-07-24 02:39:16,368 INFO L226 Difference]: Without dead ends: 25674 [2018-07-24 02:39:16,377 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 751 GetRequests, 718 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=253, Invalid=869, Unknown=0, NotChecked=0, Total=1122 [2018-07-24 02:39:16,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25674 states. [2018-07-24 02:39:16,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25674 to 21411. [2018-07-24 02:39:16,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21411 states. [2018-07-24 02:39:16,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21411 states to 21411 states and 23134 transitions. [2018-07-24 02:39:16,631 INFO L78 Accepts]: Start accepts. Automaton has 21411 states and 23134 transitions. Word has length 723 [2018-07-24 02:39:16,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 02:39:16,632 INFO L471 AbstractCegarLoop]: Abstraction has 21411 states and 23134 transitions. [2018-07-24 02:39:16,632 INFO L472 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-24 02:39:16,632 INFO L276 IsEmpty]: Start isEmpty. Operand 21411 states and 23134 transitions. [2018-07-24 02:39:16,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 985 [2018-07-24 02:39:16,658 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 02:39:16,659 INFO L353 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 02:39:16,659 INFO L414 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 02:39:16,659 INFO L82 PathProgramCache]: Analyzing trace with hash -1557244373, now seen corresponding path program 1 times [2018-07-24 02:39:16,659 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 02:39:16,660 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 02:39:16,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 02:39:16,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 02:39:16,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 02:39:16,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 02:39:17,776 INFO L134 CoverageAnalysis]: Checked inductivity of 3713 backedges. 1138 proven. 0 refuted. 0 times theorem prover too weak. 2575 trivial. 0 not checked. [2018-07-24 02:39:17,776 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 02:39:17,777 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-24 02:39:17,778 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-24 02:39:17,778 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-24 02:39:17,778 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 02:39:17,779 INFO L87 Difference]: Start difference. First operand 21411 states and 23134 transitions. Second operand 3 states. [2018-07-24 02:39:20,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 02:39:20,994 INFO L93 Difference]: Finished difference Result 40032 states and 43293 transitions. [2018-07-24 02:39:20,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-24 02:39:20,995 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 984 [2018-07-24 02:39:20,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 02:39:20,996 INFO L225 Difference]: With dead ends: 40032 [2018-07-24 02:39:20,996 INFO L226 Difference]: Without dead ends: 0 [2018-07-24 02:39:21,011 INFO L573 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-24 02:39:21,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-07-24 02:39:21,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-07-24 02:39:21,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-07-24 02:39:21,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-07-24 02:39:21,013 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 984 [2018-07-24 02:39:21,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 02:39:21,013 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-07-24 02:39:21,013 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-24 02:39:21,013 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-07-24 02:39:21,014 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-07-24 02:39:21,019 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-07-24 02:39:21,638 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:39:21,655 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:39:21,664 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:39:21,666 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:39:21,669 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:39:21,687 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:39:21,735 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:39:21,747 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:39:21,785 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:39:21,842 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:39:21,872 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:39:21,893 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:39:21,912 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:39:21,929 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:39:21,992 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:39:21,999 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:39:22,195 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:39:22,230 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:39:22,254 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:39:22,338 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:39:22,480 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:39:22,573 WARN L169 SmtUtils]: Spent 1.55 s on a formula simplification. DAG size of input: 590 DAG size of output: 418 [2018-07-24 02:39:23,017 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:39:23,031 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:39:23,038 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:39:23,039 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:39:23,041 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:39:23,054 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:39:23,097 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:39:23,106 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:39:23,141 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:39:23,184 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:39:23,204 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:39:23,217 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:39:23,232 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:39:23,245 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:39:23,293 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:39:23,298 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:39:23,380 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:39:23,454 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:39:23,482 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:39:23,499 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:39:23,567 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:39:23,688 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:39:23,760 WARN L169 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 596 DAG size of output: 417 [2018-07-24 02:39:28,003 WARN L169 SmtUtils]: Spent 4.24 s on a formula simplification. DAG size of input: 390 DAG size of output: 113 [2018-07-24 02:39:31,434 WARN L169 SmtUtils]: Spent 3.43 s on a formula simplification. DAG size of input: 387 DAG size of output: 113 [2018-07-24 02:39:31,438 INFO L421 ceAbstractionStarter]: For program point L904(lines 904 914) no Hoare annotation was computed. [2018-07-24 02:39:31,438 INFO L421 ceAbstractionStarter]: For program point L903(lines 903 1024) no Hoare annotation was computed. [2018-07-24 02:39:31,438 INFO L421 ceAbstractionStarter]: For program point L904''(lines 904 914) no Hoare annotation was computed. [2018-07-24 02:39:31,438 INFO L421 ceAbstractionStarter]: For program point L478''(lines 478 486) no Hoare annotation was computed. [2018-07-24 02:39:31,438 INFO L421 ceAbstractionStarter]: For program point L927(lines 927 1024) no Hoare annotation was computed. [2018-07-24 02:39:31,438 INFO L421 ceAbstractionStarter]: For program point L916(lines 916 926) no Hoare annotation was computed. [2018-07-24 02:39:31,438 INFO L421 ceAbstractionStarter]: For program point L915(lines 915 1024) no Hoare annotation was computed. [2018-07-24 02:39:31,438 INFO L421 ceAbstractionStarter]: For program point L940(lines 940 952) no Hoare annotation was computed. [2018-07-24 02:39:31,438 INFO L421 ceAbstractionStarter]: For program point L970''(lines 970 980) no Hoare annotation was computed. [2018-07-24 02:39:31,439 INFO L421 ceAbstractionStarter]: For program point L706(lines 706 1024) no Hoare annotation was computed. [2018-07-24 02:39:31,439 INFO L421 ceAbstractionStarter]: For program point L932(lines 932 1024) no Hoare annotation was computed. [2018-07-24 02:39:31,439 INFO L421 ceAbstractionStarter]: For program point L939(lines 939 1024) no Hoare annotation was computed. [2018-07-24 02:39:31,439 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-07-24 02:39:31,439 INFO L421 ceAbstractionStarter]: For program point L963(lines 963 1024) no Hoare annotation was computed. [2018-07-24 02:39:31,439 INFO L421 ceAbstractionStarter]: For program point L969(lines 969 1024) no Hoare annotation was computed. [2018-07-24 02:39:31,439 INFO L421 ceAbstractionStarter]: For program point L953(lines 953 1024) no Hoare annotation was computed. [2018-07-24 02:39:31,439 INFO L421 ceAbstractionStarter]: For program point L712(lines 712 1024) no Hoare annotation was computed. [2018-07-24 02:39:31,439 INFO L421 ceAbstractionStarter]: For program point L718(lines 718 730) no Hoare annotation was computed. [2018-07-24 02:39:31,439 INFO L421 ceAbstractionStarter]: For program point L717(lines 717 1024) no Hoare annotation was computed. [2018-07-24 02:39:31,440 INFO L421 ceAbstractionStarter]: For program point L958(lines 958 1024) no Hoare annotation was computed. [2018-07-24 02:39:31,440 INFO L421 ceAbstractionStarter]: For program point L981(lines 981 1024) no Hoare annotation was computed. [2018-07-24 02:39:31,440 INFO L421 ceAbstractionStarter]: For program point L743(lines 743 1024) no Hoare annotation was computed. [2018-07-24 02:39:31,440 INFO L421 ceAbstractionStarter]: For program point L500(lines 500 1024) no Hoare annotation was computed. [2018-07-24 02:39:31,440 INFO L421 ceAbstractionStarter]: For program point L988(lines 988 1024) no Hoare annotation was computed. [2018-07-24 02:39:31,440 INFO L421 ceAbstractionStarter]: For program point L507(lines 507 1024) no Hoare annotation was computed. [2018-07-24 02:39:31,440 INFO L421 ceAbstractionStarter]: For program point L970(lines 970 980) no Hoare annotation was computed. [2018-07-24 02:39:31,440 INFO L421 ceAbstractionStarter]: For program point L731(lines 731 1024) no Hoare annotation was computed. [2018-07-24 02:39:31,441 INFO L421 ceAbstractionStarter]: For program point L738(lines 738 1024) no Hoare annotation was computed. [2018-07-24 02:39:31,441 INFO L421 ceAbstractionStarter]: For program point L769(lines 769 1024) no Hoare annotation was computed. [2018-07-24 02:39:31,441 INFO L421 ceAbstractionStarter]: For program point L526(lines 526 1024) no Hoare annotation was computed. [2018-07-24 02:39:31,441 INFO L421 ceAbstractionStarter]: For program point L993(lines 993 1024) no Hoare annotation was computed. [2018-07-24 02:39:31,441 INFO L421 ceAbstractionStarter]: For program point L750(lines 750 1024) no Hoare annotation was computed. [2018-07-24 02:39:31,441 INFO L421 ceAbstractionStarter]: For program point L758(lines 758 768) no Hoare annotation was computed. [2018-07-24 02:39:31,441 INFO L421 ceAbstractionStarter]: For program point L515(lines 515 525) no Hoare annotation was computed. [2018-07-24 02:39:31,441 INFO L421 ceAbstractionStarter]: For program point L757(lines 757 1024) no Hoare annotation was computed. [2018-07-24 02:39:31,441 INFO L421 ceAbstractionStarter]: For program point L514(lines 514 1024) no Hoare annotation was computed. [2018-07-24 02:39:31,441 INFO L421 ceAbstractionStarter]: For program point L780(lines 780 1024) no Hoare annotation was computed. [2018-07-24 02:39:31,442 INFO L421 ceAbstractionStarter]: For program point L542(lines 542 1024) no Hoare annotation was computed. [2018-07-24 02:39:31,442 INFO L421 ceAbstractionStarter]: For program point L787(lines 787 1024) no Hoare annotation was computed. [2018-07-24 02:39:31,442 INFO L421 ceAbstractionStarter]: For program point L549(lines 549 1024) no Hoare annotation was computed. [2018-07-24 02:39:31,442 INFO L421 ceAbstractionStarter]: For program point L305(lines 305 1024) no Hoare annotation was computed. [2018-07-24 02:39:31,442 INFO L421 ceAbstractionStarter]: For program point L531(lines 531 1024) no Hoare annotation was computed. [2018-07-24 02:39:31,442 INFO L421 ceAbstractionStarter]: For program point L774(lines 774 1024) no Hoare annotation was computed. [2018-07-24 02:39:31,442 INFO L421 ceAbstractionStarter]: For program point L537(lines 537 1024) no Hoare annotation was computed. [2018-07-24 02:39:31,442 INFO L421 ceAbstractionStarter]: For program point L587''(lines 587 597) no Hoare annotation was computed. [2018-07-24 02:39:31,442 INFO L421 ceAbstractionStarter]: For program point L322(lines 322 1024) no Hoare annotation was computed. [2018-07-24 02:39:31,442 INFO L421 ceAbstractionStarter]: For program point L561(lines 561 1024) no Hoare annotation was computed. [2018-07-24 02:39:31,442 INFO L421 ceAbstractionStarter]: For program point L566(lines 566 1024) no Hoare annotation was computed. [2018-07-24 02:39:31,442 INFO L421 ceAbstractionStarter]: For program point L329(lines 329 1024) no Hoare annotation was computed. [2018-07-24 02:39:31,443 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-07-24 02:39:31,443 INFO L421 ceAbstractionStarter]: For program point L310(lines 310 1024) no Hoare annotation was computed. [2018-07-24 02:39:31,443 INFO L421 ceAbstractionStarter]: For program point L792(lines 792 1024) no Hoare annotation was computed. [2018-07-24 02:39:31,443 INFO L421 ceAbstractionStarter]: For program point L799(lines 799 1024) no Hoare annotation was computed. [2018-07-24 02:39:31,443 INFO L421 ceAbstractionStarter]: For program point L555(lines 555 1024) no Hoare annotation was computed. [2018-07-24 02:39:31,443 INFO L421 ceAbstractionStarter]: For program point L317(lines 317 1024) no Hoare annotation was computed. [2018-07-24 02:39:31,443 INFO L421 ceAbstractionStarter]: For program point L340(lines 340 1024) no Hoare annotation was computed. [2018-07-24 02:39:31,443 INFO L421 ceAbstractionStarter]: For program point L581(lines 581 1024) no Hoare annotation was computed. [2018-07-24 02:39:31,443 INFO L421 ceAbstractionStarter]: For program point L102(line 102) no Hoare annotation was computed. [2018-07-24 02:39:31,443 INFO L421 ceAbstractionStarter]: For program point L586(lines 586 1024) no Hoare annotation was computed. [2018-07-24 02:39:31,443 INFO L421 ceAbstractionStarter]: For program point L101(lines 22 1026) no Hoare annotation was computed. [2018-07-24 02:39:31,443 INFO L421 ceAbstractionStarter]: For program point L105(line 105) no Hoare annotation was computed. [2018-07-24 02:39:31,443 INFO L421 ceAbstractionStarter]: For program point L104(lines 22 1026) no Hoare annotation was computed. [2018-07-24 02:39:31,443 INFO L421 ceAbstractionStarter]: For program point L346(lines 346 1024) no Hoare annotation was computed. [2018-07-24 02:39:31,444 INFO L421 ceAbstractionStarter]: For program point L587(lines 587 597) no Hoare annotation was computed. [2018-07-24 02:39:31,444 INFO L421 ceAbstractionStarter]: For program point L108(line 108) no Hoare annotation was computed. [2018-07-24 02:39:31,444 INFO L421 ceAbstractionStarter]: For program point L107(lines 22 1026) no Hoare annotation was computed. [2018-07-24 02:39:31,444 INFO L421 ceAbstractionStarter]: For program point L648''(lines 648 657) no Hoare annotation was computed. [2018-07-24 02:39:31,444 INFO L421 ceAbstractionStarter]: For program point L575(lines 575 1024) no Hoare annotation was computed. [2018-07-24 02:39:31,444 INFO L421 ceAbstractionStarter]: For program point L572(lines 572 1024) no Hoare annotation was computed. [2018-07-24 02:39:31,444 INFO L421 ceAbstractionStarter]: For program point L334(lines 334 1024) no Hoare annotation was computed. [2018-07-24 02:39:31,444 INFO L421 ceAbstractionStarter]: For program point L120(line 120) no Hoare annotation was computed. [2018-07-24 02:39:31,444 INFO L421 ceAbstractionStarter]: For program point L123(line 123) no Hoare annotation was computed. [2018-07-24 02:39:31,444 INFO L421 ceAbstractionStarter]: For program point L365(lines 365 1024) no Hoare annotation was computed. [2018-07-24 02:39:31,444 INFO L421 ceAbstractionStarter]: For program point L122(lines 22 1026) no Hoare annotation was computed. [2018-07-24 02:39:31,444 INFO L421 ceAbstractionStarter]: For program point L128(lines 22 1026) no Hoare annotation was computed. [2018-07-24 02:39:31,445 INFO L421 ceAbstractionStarter]: For program point L126(line 126) no Hoare annotation was computed. [2018-07-24 02:39:31,445 INFO L421 ceAbstractionStarter]: For program point L125(lines 22 1026) no Hoare annotation was computed. [2018-07-24 02:39:31,445 INFO L421 ceAbstractionStarter]: For program point L129(line 129) no Hoare annotation was computed. [2018-07-24 02:39:31,445 INFO L421 ceAbstractionStarter]: For program point L515''(lines 515 525) no Hoare annotation was computed. [2018-07-24 02:39:31,445 INFO L421 ceAbstractionStarter]: For program point L113(lines 22 1026) no Hoare annotation was computed. [2018-07-24 02:39:31,445 INFO L421 ceAbstractionStarter]: For program point L111(line 111) no Hoare annotation was computed. [2018-07-24 02:39:31,445 INFO L421 ceAbstractionStarter]: For program point L353(lines 353 1024) no Hoare annotation was computed. [2018-07-24 02:39:31,445 INFO L421 ceAbstractionStarter]: For program point L110(lines 22 1026) no Hoare annotation was computed. [2018-07-24 02:39:31,445 INFO L421 ceAbstractionStarter]: For program point L117(line 117) no Hoare annotation was computed. [2018-07-24 02:39:31,446 INFO L421 ceAbstractionStarter]: For program point L116(lines 22 1026) no Hoare annotation was computed. [2018-07-24 02:39:31,446 INFO L421 ceAbstractionStarter]: For program point L358(lines 358 1024) no Hoare annotation was computed. [2018-07-24 02:39:31,446 INFO L421 ceAbstractionStarter]: For program point L114(line 114) no Hoare annotation was computed. [2018-07-24 02:39:31,446 INFO L421 ceAbstractionStarter]: For program point L598(lines 598 1024) no Hoare annotation was computed. [2018-07-24 02:39:31,446 INFO L421 ceAbstractionStarter]: For program point L119(lines 22 1026) no Hoare annotation was computed. [2018-07-24 02:39:31,446 INFO L421 ceAbstractionStarter]: For program point L384(lines 384 1024) no Hoare annotation was computed. [2018-07-24 02:39:31,446 INFO L421 ceAbstractionStarter]: For program point L141(line 141) no Hoare annotation was computed. [2018-07-24 02:39:31,446 INFO L421 ceAbstractionStarter]: For program point L146(lines 22 1026) no Hoare annotation was computed. [2018-07-24 02:39:31,446 INFO L421 ceAbstractionStarter]: For program point L144(line 144) no Hoare annotation was computed. [2018-07-24 02:39:31,446 INFO L421 ceAbstractionStarter]: For program point L143(lines 22 1026) no Hoare annotation was computed. [2018-07-24 02:39:31,447 INFO L421 ceAbstractionStarter]: For program point L149(lines 22 1026) no Hoare annotation was computed. [2018-07-24 02:39:31,447 INFO L421 ceAbstractionStarter]: For program point L147(line 147) no Hoare annotation was computed. [2018-07-24 02:39:31,447 INFO L421 ceAbstractionStarter]: For program point L391(lines 391 1024) no Hoare annotation was computed. [2018-07-24 02:39:31,447 INFO L421 ceAbstractionStarter]: For program point L131(lines 22 1026) no Hoare annotation was computed. [2018-07-24 02:39:31,447 INFO L421 ceAbstractionStarter]: For program point L370(lines 370 1024) no Hoare annotation was computed. [2018-07-24 02:39:31,447 INFO L421 ceAbstractionStarter]: For program point L135(line 135) no Hoare annotation was computed. [2018-07-24 02:39:31,447 INFO L421 ceAbstractionStarter]: For program point L377(lines 377 1024) no Hoare annotation was computed. [2018-07-24 02:39:31,447 INFO L421 ceAbstractionStarter]: For program point L134(lines 22 1026) no Hoare annotation was computed. [2018-07-24 02:39:31,447 INFO L421 ceAbstractionStarter]: For program point L132(line 132) no Hoare annotation was computed. [2018-07-24 02:39:31,447 INFO L421 ceAbstractionStarter]: For program point L138(line 138) no Hoare annotation was computed. [2018-07-24 02:39:31,448 INFO L421 ceAbstractionStarter]: For program point L137(lines 22 1026) no Hoare annotation was computed. [2018-07-24 02:39:31,448 INFO L421 ceAbstractionStarter]: For program point L164(lines 22 1026) no Hoare annotation was computed. [2018-07-24 02:39:31,448 INFO L421 ceAbstractionStarter]: For program point L162(line 162) no Hoare annotation was computed. [2018-07-24 02:39:31,448 INFO L421 ceAbstractionStarter]: For program point L161(lines 22 1026) no Hoare annotation was computed. [2018-07-24 02:39:31,448 INFO L421 ceAbstractionStarter]: For program point L168(line 168) no Hoare annotation was computed. [2018-07-24 02:39:31,448 INFO L421 ceAbstractionStarter]: For program point L167(lines 22 1026) no Hoare annotation was computed. [2018-07-24 02:39:31,448 INFO L421 ceAbstractionStarter]: For program point L165(line 165) no Hoare annotation was computed. [2018-07-24 02:39:31,448 INFO L421 ceAbstractionStarter]: For program point L171(line 171) no Hoare annotation was computed. [2018-07-24 02:39:31,448 INFO L421 ceAbstractionStarter]: For program point L170(lines 22 1026) no Hoare annotation was computed. [2018-07-24 02:39:31,448 INFO L421 ceAbstractionStarter]: For program point L153(line 153) no Hoare annotation was computed. [2018-07-24 02:39:31,449 INFO L421 ceAbstractionStarter]: For program point L152(lines 22 1026) no Hoare annotation was computed. [2018-07-24 02:39:31,449 INFO L421 ceAbstractionStarter]: For program point L150(line 150) no Hoare annotation was computed. [2018-07-24 02:39:31,449 INFO L421 ceAbstractionStarter]: For program point L399(lines 399 410) no Hoare annotation was computed. [2018-07-24 02:39:31,449 INFO L421 ceAbstractionStarter]: For program point L156(line 156) no Hoare annotation was computed. [2018-07-24 02:39:31,449 INFO L421 ceAbstractionStarter]: For program point L398(lines 398 1024) no Hoare annotation was computed. [2018-07-24 02:39:31,449 INFO L421 ceAbstractionStarter]: For program point L155(lines 22 1026) no Hoare annotation was computed. [2018-07-24 02:39:31,449 INFO L421 ceAbstractionStarter]: For program point L159(line 159) no Hoare annotation was computed. [2018-07-24 02:39:31,449 INFO L421 ceAbstractionStarter]: For program point L158(lines 22 1026) no Hoare annotation was computed. [2018-07-24 02:39:31,449 INFO L421 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-07-24 02:39:31,450 INFO L421 ceAbstractionStarter]: For program point L604''(lines 604 614) no Hoare annotation was computed. [2018-07-24 02:39:31,450 INFO L421 ceAbstractionStarter]: For program point L186(line 186) no Hoare annotation was computed. [2018-07-24 02:39:31,450 INFO L421 ceAbstractionStarter]: For program point L185(lines 22 1026) no Hoare annotation was computed. [2018-07-24 02:39:31,450 INFO L421 ceAbstractionStarter]: For program point L183(line 183) no Hoare annotation was computed. [2018-07-24 02:39:31,450 INFO L421 ceAbstractionStarter]: For program point L189(line 189) no Hoare annotation was computed. [2018-07-24 02:39:31,450 INFO L421 ceAbstractionStarter]: For program point L188(lines 22 1026) no Hoare annotation was computed. [2018-07-24 02:39:31,450 INFO L421 ceAbstractionStarter]: For program point L192(line 192) no Hoare annotation was computed. [2018-07-24 02:39:31,450 INFO L421 ceAbstractionStarter]: For program point L191(lines 22 1026) no Hoare annotation was computed. [2018-07-24 02:39:31,450 INFO L421 ceAbstractionStarter]: For program point L174(line 174) no Hoare annotation was computed. [2018-07-24 02:39:31,450 INFO L421 ceAbstractionStarter]: For program point L173(lines 22 1026) no Hoare annotation was computed. [2018-07-24 02:39:31,450 INFO L421 ceAbstractionStarter]: For program point L179(lines 22 1026) no Hoare annotation was computed. [2018-07-24 02:39:31,451 INFO L421 ceAbstractionStarter]: For program point L177(line 177) no Hoare annotation was computed. [2018-07-24 02:39:31,451 INFO L421 ceAbstractionStarter]: For program point L176(lines 22 1026) no Hoare annotation was computed. [2018-07-24 02:39:31,451 INFO L421 ceAbstractionStarter]: For program point L182(lines 22 1026) no Hoare annotation was computed. [2018-07-24 02:39:31,451 INFO L421 ceAbstractionStarter]: For program point L180(line 180) no Hoare annotation was computed. [2018-07-24 02:39:31,451 INFO L421 ceAbstractionStarter]: For program point L197(lines 22 1026) no Hoare annotation was computed. [2018-07-24 02:39:31,451 INFO L421 ceAbstractionStarter]: For program point L195(line 195) no Hoare annotation was computed. [2018-07-24 02:39:31,451 INFO L421 ceAbstractionStarter]: For program point L194(lines 22 1026) no Hoare annotation was computed. [2018-07-24 02:39:31,451 INFO L421 ceAbstractionStarter]: For program point L198(line 198) no Hoare annotation was computed. [2018-07-24 02:39:31,451 INFO L421 ceAbstractionStarter]: For program point L23(lines 23 25) no Hoare annotation was computed. [2018-07-24 02:39:31,452 INFO L421 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2018-07-24 02:39:31,452 INFO L421 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2018-07-24 02:39:31,452 INFO L421 ceAbstractionStarter]: For program point L26(lines 22 1026) no Hoare annotation was computed. [2018-07-24 02:39:31,452 INFO L421 ceAbstractionStarter]: For program point L29(lines 22 1026) no Hoare annotation was computed. [2018-07-24 02:39:31,452 INFO L421 ceAbstractionStarter]: For program point L940''(lines 940 952) no Hoare annotation was computed. [2018-07-24 02:39:31,452 INFO L421 ceAbstractionStarter]: For program point L30(line 30) no Hoare annotation was computed. [2018-07-24 02:39:31,452 INFO L421 ceAbstractionStarter]: For program point L32(lines 22 1026) no Hoare annotation was computed. [2018-07-24 02:39:31,452 INFO L421 ceAbstractionStarter]: For program point L33(line 33) no Hoare annotation was computed. [2018-07-24 02:39:31,452 INFO L421 ceAbstractionStarter]: For program point L36(line 36) no Hoare annotation was computed. [2018-07-24 02:39:31,453 INFO L421 ceAbstractionStarter]: For program point L35(lines 22 1026) no Hoare annotation was computed. [2018-07-24 02:39:31,453 INFO L421 ceAbstractionStarter]: For program point L38(lines 22 1026) no Hoare annotation was computed. [2018-07-24 02:39:31,453 INFO L421 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2018-07-24 02:39:31,453 INFO L421 ceAbstractionStarter]: For program point L41(lines 22 1026) no Hoare annotation was computed. [2018-07-24 02:39:31,453 INFO L421 ceAbstractionStarter]: For program point L42(line 42) no Hoare annotation was computed. [2018-07-24 02:39:31,453 INFO L421 ceAbstractionStarter]: For program point L45(line 45) no Hoare annotation was computed. [2018-07-24 02:39:31,453 INFO L421 ceAbstractionStarter]: For program point L44(lines 22 1026) no Hoare annotation was computed. [2018-07-24 02:39:31,453 INFO L421 ceAbstractionStarter]: For program point L47(lines 22 1026) no Hoare annotation was computed. [2018-07-24 02:39:31,454 INFO L421 ceAbstractionStarter]: For program point L48(line 48) no Hoare annotation was computed. [2018-07-24 02:39:31,454 INFO L421 ceAbstractionStarter]: For program point L866''(lines 866 875) no Hoare annotation was computed. [2018-07-24 02:39:31,454 INFO L421 ceAbstractionStarter]: For program point L50(lines 22 1026) no Hoare annotation was computed. [2018-07-24 02:39:31,454 INFO L421 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2018-07-24 02:39:31,454 INFO L421 ceAbstractionStarter]: For program point L54(line 54) no Hoare annotation was computed. [2018-07-24 02:39:31,454 INFO L421 ceAbstractionStarter]: For program point L53(lines 22 1026) no Hoare annotation was computed. [2018-07-24 02:39:31,454 INFO L421 ceAbstractionStarter]: For program point L56(lines 22 1026) no Hoare annotation was computed. [2018-07-24 02:39:31,454 INFO L421 ceAbstractionStarter]: For program point L57(line 57) no Hoare annotation was computed. [2018-07-24 02:39:31,454 INFO L421 ceAbstractionStarter]: For program point L59(lines 22 1026) no Hoare annotation was computed. [2018-07-24 02:39:31,454 INFO L421 ceAbstractionStarter]: For program point L60(line 60) no Hoare annotation was computed. [2018-07-24 02:39:31,454 INFO L421 ceAbstractionStarter]: For program point L63(line 63) no Hoare annotation was computed. [2018-07-24 02:39:31,454 INFO L421 ceAbstractionStarter]: For program point L62(lines 22 1026) no Hoare annotation was computed. [2018-07-24 02:39:31,454 INFO L421 ceAbstractionStarter]: For program point L65(lines 22 1026) no Hoare annotation was computed. [2018-07-24 02:39:31,454 INFO L421 ceAbstractionStarter]: For program point L66(line 66) no Hoare annotation was computed. [2018-07-24 02:39:31,455 INFO L421 ceAbstractionStarter]: For program point L69(line 69) no Hoare annotation was computed. [2018-07-24 02:39:31,455 INFO L421 ceAbstractionStarter]: For program point L68(lines 22 1026) no Hoare annotation was computed. [2018-07-24 02:39:31,455 INFO L421 ceAbstractionStarter]: For program point L72(line 72) no Hoare annotation was computed. [2018-07-24 02:39:31,455 INFO L421 ceAbstractionStarter]: For program point L71(lines 22 1026) no Hoare annotation was computed. [2018-07-24 02:39:31,455 INFO L421 ceAbstractionStarter]: For program point L74(lines 22 1026) no Hoare annotation was computed. [2018-07-24 02:39:31,455 INFO L421 ceAbstractionStarter]: For program point L75(line 75) no Hoare annotation was computed. [2018-07-24 02:39:31,455 INFO L421 ceAbstractionStarter]: For program point L78(line 78) no Hoare annotation was computed. [2018-07-24 02:39:31,455 INFO L421 ceAbstractionStarter]: For program point L77(lines 22 1026) no Hoare annotation was computed. [2018-07-24 02:39:31,455 INFO L421 ceAbstractionStarter]: For program point L81(line 81) no Hoare annotation was computed. [2018-07-24 02:39:31,455 INFO L421 ceAbstractionStarter]: For program point L80(lines 22 1026) no Hoare annotation was computed. [2018-07-24 02:39:31,455 INFO L421 ceAbstractionStarter]: For program point L83(lines 22 1026) no Hoare annotation was computed. [2018-07-24 02:39:31,455 INFO L421 ceAbstractionStarter]: For program point L84(line 84) no Hoare annotation was computed. [2018-07-24 02:39:31,455 INFO L421 ceAbstractionStarter]: For program point L87(line 87) no Hoare annotation was computed. [2018-07-24 02:39:31,455 INFO L421 ceAbstractionStarter]: For program point L86(lines 22 1026) no Hoare annotation was computed. [2018-07-24 02:39:31,456 INFO L421 ceAbstractionStarter]: For program point L89(lines 22 1026) no Hoare annotation was computed. [2018-07-24 02:39:31,456 INFO L421 ceAbstractionStarter]: For program point L805(lines 805 815) no Hoare annotation was computed. [2018-07-24 02:39:31,456 INFO L421 ceAbstractionStarter]: For program point L804(lines 804 1024) no Hoare annotation was computed. [2018-07-24 02:39:31,456 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-07-24 02:39:31,456 INFO L421 ceAbstractionStarter]: For program point L916''(lines 916 926) no Hoare annotation was computed. [2018-07-24 02:39:31,456 INFO L421 ceAbstractionStarter]: For program point L90(line 90) no Hoare annotation was computed. [2018-07-24 02:39:31,456 INFO L421 ceAbstractionStarter]: For program point L92(lines 22 1026) no Hoare annotation was computed. [2018-07-24 02:39:31,456 INFO L421 ceAbstractionStarter]: For program point L93(line 93) no Hoare annotation was computed. [2018-07-24 02:39:31,456 INFO L421 ceAbstractionStarter]: For program point L96(line 96) no Hoare annotation was computed. [2018-07-24 02:39:31,456 INFO L421 ceAbstractionStarter]: For program point L95(lines 22 1026) no Hoare annotation was computed. [2018-07-24 02:39:31,456 INFO L421 ceAbstractionStarter]: For program point L98(lines 22 1026) no Hoare annotation was computed. [2018-07-24 02:39:31,456 INFO L421 ceAbstractionStarter]: For program point L99(line 99) no Hoare annotation was computed. [2018-07-24 02:39:31,456 INFO L421 ceAbstractionStarter]: For program point L825(lines 825 1024) no Hoare annotation was computed. [2018-07-24 02:39:31,456 INFO L421 ceAbstractionStarter]: For program point L822(lines 822 1024) no Hoare annotation was computed. [2018-07-24 02:39:31,456 INFO L421 ceAbstractionStarter]: For program point L816(lines 816 1024) no Hoare annotation was computed. [2018-07-24 02:39:31,457 INFO L421 ceAbstractionStarter]: For program point L841(lines 841 1024) no Hoare annotation was computed. [2018-07-24 02:39:31,457 INFO L421 ceAbstractionStarter]: For program point L604(lines 604 614) no Hoare annotation was computed. [2018-07-24 02:39:31,457 INFO L421 ceAbstractionStarter]: For program point L846(lines 846 1024) no Hoare annotation was computed. [2018-07-24 02:39:31,457 INFO L421 ceAbstractionStarter]: For program point L603(lines 603 1024) no Hoare annotation was computed. [2018-07-24 02:39:31,457 INFO L421 ceAbstractionStarter]: For program point L831(lines 831 1024) no Hoare annotation was computed. [2018-07-24 02:39:31,457 INFO L421 ceAbstractionStarter]: For program point L836(lines 836 1024) no Hoare annotation was computed. [2018-07-24 02:39:31,457 INFO L421 ceAbstractionStarter]: For program point L865(lines 865 1024) no Hoare annotation was computed. [2018-07-24 02:39:31,457 INFO L421 ceAbstractionStarter]: For program point L621(lines 621 1024) no Hoare annotation was computed. [2018-07-24 02:39:31,457 INFO L421 ceAbstractionStarter]: For program point L866(lines 866 875) no Hoare annotation was computed. [2018-07-24 02:39:31,457 INFO L421 ceAbstractionStarter]: For program point L628(lines 628 1024) no Hoare annotation was computed. [2018-07-24 02:39:31,457 INFO L421 ceAbstractionStarter]: For program point L852(lines 852 1024) no Hoare annotation was computed. [2018-07-24 02:39:31,457 INFO L421 ceAbstractionStarter]: For program point L615(lines 615 1024) no Hoare annotation was computed. [2018-07-24 02:39:31,457 INFO L421 ceAbstractionStarter]: For program point L859(lines 859 1024) no Hoare annotation was computed. [2018-07-24 02:39:31,457 INFO L421 ceAbstractionStarter]: For program point L881(lines 881 1024) no Hoare annotation was computed. [2018-07-24 02:39:31,458 INFO L421 ceAbstractionStarter]: For program point L886(lines 886 1024) no Hoare annotation was computed. [2018-07-24 02:39:31,458 INFO L421 ceAbstractionStarter]: For program point L642(lines 642 1024) no Hoare annotation was computed. [2018-07-24 02:39:31,458 INFO L421 ceAbstractionStarter]: For program point L648(lines 648 657) no Hoare annotation was computed. [2018-07-24 02:39:31,458 INFO L421 ceAbstractionStarter]: For program point L647(lines 647 1024) no Hoare annotation was computed. [2018-07-24 02:39:31,458 INFO L421 ceAbstractionStarter]: For program point L876(lines 876 1024) no Hoare annotation was computed. [2018-07-24 02:39:31,458 INFO L421 ceAbstractionStarter]: For program point L635(lines 635 1024) no Hoare annotation was computed. [2018-07-24 02:39:31,458 INFO L421 ceAbstractionStarter]: For program point L399''(lines 399 410) no Hoare annotation was computed. [2018-07-24 02:39:31,458 INFO L421 ceAbstractionStarter]: For program point L663(lines 663 1024) no Hoare annotation was computed. [2018-07-24 02:39:31,458 INFO L421 ceAbstractionStarter]: For program point L422(lines 422 1024) no Hoare annotation was computed. [2018-07-24 02:39:31,458 INFO L421 ceAbstractionStarter]: For program point L429(lines 429 1024) no Hoare annotation was computed. [2018-07-24 02:39:31,458 INFO L421 ceAbstractionStarter]: For program point L695''(lines 695 705) no Hoare annotation was computed. [2018-07-24 02:39:31,458 INFO L421 ceAbstractionStarter]: For program point L893(lines 893 1024) no Hoare annotation was computed. [2018-07-24 02:39:31,458 INFO L421 ceAbstractionStarter]: For program point L898(lines 898 1024) no Hoare annotation was computed. [2018-07-24 02:39:31,458 INFO L421 ceAbstractionStarter]: For program point L411(lines 411 1024) no Hoare annotation was computed. [2018-07-24 02:39:31,459 INFO L421 ceAbstractionStarter]: For program point L417(lines 417 1024) no Hoare annotation was computed. [2018-07-24 02:39:31,459 INFO L421 ceAbstractionStarter]: For program point L658(lines 658 1024) no Hoare annotation was computed. [2018-07-24 02:39:31,459 INFO L421 ceAbstractionStarter]: For program point L681(lines 681 1024) no Hoare annotation was computed. [2018-07-24 02:39:31,459 INFO L421 ceAbstractionStarter]: For program point L201(line 201) no Hoare annotation was computed. [2018-07-24 02:39:31,459 INFO L421 ceAbstractionStarter]: For program point L443(lines 443 1024) no Hoare annotation was computed. [2018-07-24 02:39:31,459 INFO L421 ceAbstractionStarter]: For program point L200(lines 22 1026) no Hoare annotation was computed. [2018-07-24 02:39:31,459 INFO L421 ceAbstractionStarter]: For program point L204(line 204) no Hoare annotation was computed. [2018-07-24 02:39:31,459 INFO L421 ceAbstractionStarter]: For program point L688(lines 688 1024) no Hoare annotation was computed. [2018-07-24 02:39:31,459 INFO L421 ceAbstractionStarter]: For program point L203(lines 22 1026) no Hoare annotation was computed. [2018-07-24 02:39:31,459 INFO L421 ceAbstractionStarter]: For program point L805''(lines 805 815) no Hoare annotation was computed. [2018-07-24 02:39:31,459 INFO L421 ceAbstractionStarter]: For program point L140'(lines 22 1026) no Hoare annotation was computed. [2018-07-24 02:39:31,459 INFO L421 ceAbstractionStarter]: For program point L670(lines 670 1024) no Hoare annotation was computed. [2018-07-24 02:39:31,459 INFO L421 ceAbstractionStarter]: For program point L436(lines 436 1024) no Hoare annotation was computed. [2018-07-24 02:39:31,459 INFO L421 ceAbstractionStarter]: For program point L675(lines 675 1024) no Hoare annotation was computed. [2018-07-24 02:39:31,459 INFO L421 ceAbstractionStarter]: For program point L488''(lines 488 499) no Hoare annotation was computed. [2018-07-24 02:39:31,460 INFO L421 ceAbstractionStarter]: For program point L718''(lines 718 730) no Hoare annotation was computed. [2018-07-24 02:39:31,460 INFO L421 ceAbstractionStarter]: For program point L221(lines 221 1024) no Hoare annotation was computed. [2018-07-24 02:39:31,460 INFO L421 ceAbstractionStarter]: For program point L463(lines 463 1024) no Hoare annotation was computed. [2018-07-24 02:39:31,460 INFO L421 ceAbstractionStarter]: For program point L227(lines 227 1024) no Hoare annotation was computed. [2018-07-24 02:39:31,460 INFO L421 ceAbstractionStarter]: For program point L23'(lines 22 1026) no Hoare annotation was computed. [2018-07-24 02:39:31,460 INFO L421 ceAbstractionStarter]: For program point L450(lines 450 1024) no Hoare annotation was computed. [2018-07-24 02:39:31,460 INFO L421 ceAbstractionStarter]: For program point L695(lines 695 705) no Hoare annotation was computed. [2018-07-24 02:39:31,460 INFO L421 ceAbstractionStarter]: For program point L694(lines 694 1024) no Hoare annotation was computed. [2018-07-24 02:39:31,460 INFO L421 ceAbstractionStarter]: For program point L214(lines 214 1024) no Hoare annotation was computed. [2018-07-24 02:39:31,460 INFO L421 ceAbstractionStarter]: For program point L456(lines 456 1024) no Hoare annotation was computed. [2018-07-24 02:39:31,461 INFO L421 ceAbstractionStarter]: For program point L240(lines 240 1024) no Hoare annotation was computed. [2018-07-24 02:39:31,461 INFO L421 ceAbstractionStarter]: For program point L487(lines 487 1024) no Hoare annotation was computed. [2018-07-24 02:39:31,461 INFO L421 ceAbstractionStarter]: For program point L247(lines 247 1024) no Hoare annotation was computed. [2018-07-24 02:39:31,461 INFO L421 ceAbstractionStarter]: For program point L488(lines 488 499) no Hoare annotation was computed. [2018-07-24 02:39:31,462 INFO L417 ceAbstractionStarter]: At program point L1034''(lines 1034 1043) the Hoare annotation is: (let ((.cse10 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4~0 1)) (.cse15 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25~0 9)) (.cse18 (+ ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23~0 43))) (let ((.cse11 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25~0 13))) (.cse12 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25~0 12)) (.cse9 (< 306 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23~0)) (.cse17 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25~0 11)) (.cse13 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a8~0 15)) (.cse14 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0 277)) (.cse0 (<= .cse18 0)) (.cse1 (not .cse15)) (.cse16 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23~0 138)) (.cse2 (not .cse10)) (.cse5 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0 130)) (.cse7 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3~0 1)) (.cse8 (<= 13 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25~0)) (.cse6 (<= 260 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0)) (.cse3 (= 15 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a8~0)) (.cse4 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3~0))) (or (and (and .cse0 .cse1 .cse2) .cse3 .cse4) (and (and .cse5 .cse0) .cse3 .cse4) (and (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4~0) (exists ((v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500 Int)) (and (<= v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500 140) (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0 (+ (div v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500 5) 206649)) (= 0 (mod v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500 5)))) .cse6 .cse7 .cse3 .cse8) (and (and .cse9 .cse10) .cse3 .cse4 .cse11 (not .cse12)) (and .cse4 (and .cse13 (and .cse5 .cse9 .cse10))) (and .cse14 .cse10 (<= 141 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0) .cse3 .cse4) (and .cse5 .cse10 .cse15) (and .cse10 .cse16 .cse3 .cse4 .cse11) (and (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25~0 10)) .cse16 .cse1 .cse3 .cse2 (not .cse17) .cse4) (and (and .cse12 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4~0 0) .cse14 (< 140 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0)) .cse3 .cse4) (and (and .cse13 .cse7 (and .cse14 .cse9 .cse10)) .cse8) (and (= 12 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25~0) .cse10 .cse3 .cse4 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23~0 312)) (and .cse17 .cse10 .cse3 .cse4) (and .cse15 .cse6 .cse0 .cse3 .cse4) (and .cse13 .cse14 .cse10 .cse0 .cse7) (and .cse10 .cse15 .cse7 .cse3) (and (exists ((v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_501 Int) (v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500 Int)) (and (<= 0 v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_501) (<= v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500 140) (<= (+ ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0 275914) (* 2 (div v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_501 5))) (< 277 v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_501) (<= v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_501 (+ (div v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500 5) 206649)) (= 0 (mod v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500 5)))) .cse3 (= 10 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25~0) .cse4) (and (and .cse5 .cse1 .cse2) .cse3 .cse4) (and (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0 140) .cse16 .cse3 .cse2 .cse4 (< 0 .cse18)) (and .cse5 .cse7 .cse3 .cse8) (and (<= (+ ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23~0 115606) 0) .cse6 .cse3 .cse4)))) [2018-07-24 02:39:31,462 INFO L421 ceAbstractionStarter]: For program point L470(lines 470 1024) no Hoare annotation was computed. [2018-07-24 02:39:31,462 INFO L421 ceAbstractionStarter]: For program point L233(lines 233 1024) no Hoare annotation was computed. [2018-07-24 02:39:31,462 INFO L421 ceAbstractionStarter]: For program point L478(lines 478 486) no Hoare annotation was computed. [2018-07-24 02:39:31,462 INFO L421 ceAbstractionStarter]: For program point L477(lines 477 1024) no Hoare annotation was computed. [2018-07-24 02:39:31,462 INFO L421 ceAbstractionStarter]: For program point L758''(lines 758 768) no Hoare annotation was computed. [2018-07-24 02:39:31,462 INFO L421 ceAbstractionStarter]: For program point L260(lines 260 1024) no Hoare annotation was computed. [2018-07-24 02:39:31,462 INFO L421 ceAbstractionStarter]: For program point L265(lines 265 1024) no Hoare annotation was computed. [2018-07-24 02:39:31,463 INFO L421 ceAbstractionStarter]: For program point L1012(lines 1012 1024) no Hoare annotation was computed. [2018-07-24 02:39:31,463 INFO L421 ceAbstractionStarter]: For program point L268(lines 268 1024) no Hoare annotation was computed. [2018-07-24 02:39:31,463 INFO L421 ceAbstractionStarter]: For program point L1017(lines 1017 1024) no Hoare annotation was computed. [2018-07-24 02:39:31,463 INFO L421 ceAbstractionStarter]: For program point L254(lines 254 1024) no Hoare annotation was computed. [2018-07-24 02:39:31,464 INFO L417 ceAbstractionStarter]: At program point L1025(lines 22 1026) the Hoare annotation is: (let ((.cse10 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4~0 1)) (.cse15 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25~0 9)) (.cse18 (+ ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23~0 43))) (let ((.cse11 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25~0 13))) (.cse12 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25~0 12)) (.cse9 (< 306 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23~0)) (.cse17 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25~0 11)) (.cse13 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a8~0 15)) (.cse14 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0 277)) (.cse0 (<= .cse18 0)) (.cse1 (not .cse15)) (.cse16 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23~0 138)) (.cse2 (not .cse10)) (.cse5 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0 130)) (.cse7 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3~0 1)) (.cse8 (<= 13 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25~0)) (.cse6 (<= 260 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0)) (.cse3 (= 15 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a8~0)) (.cse4 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3~0))) (or (and (and .cse0 .cse1 .cse2) .cse3 .cse4) (and (and .cse5 .cse0) .cse3 .cse4) (and (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4~0) (exists ((v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500 Int)) (and (<= v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500 140) (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0 (+ (div v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500 5) 206649)) (= 0 (mod v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500 5)))) .cse6 .cse7 .cse3 .cse8) (and (and .cse9 .cse10) .cse3 .cse4 .cse11 (not .cse12)) (and .cse4 (and .cse13 (and .cse5 .cse9 .cse10))) (and .cse14 .cse10 (<= 141 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0) .cse3 .cse4) (and .cse5 .cse10 .cse15) (and .cse10 .cse16 .cse3 .cse4 .cse11) (and (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25~0 10)) .cse16 .cse1 .cse3 .cse2 (not .cse17) .cse4) (and (and .cse12 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4~0 0) .cse14 (< 140 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0)) .cse3 .cse4) (and (and .cse13 .cse7 (and .cse14 .cse9 .cse10)) .cse8) (and (= 12 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25~0) .cse10 .cse3 .cse4 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23~0 312)) (and .cse17 .cse10 .cse3 .cse4) (and .cse15 .cse6 .cse0 .cse3 .cse4) (and .cse13 .cse14 .cse10 .cse0 .cse7) (and .cse10 .cse15 .cse7 .cse3) (and (exists ((v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_501 Int) (v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500 Int)) (and (<= 0 v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_501) (<= v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500 140) (<= (+ ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0 275914) (* 2 (div v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_501 5))) (< 277 v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_501) (<= v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_501 (+ (div v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500 5) 206649)) (= 0 (mod v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500 5)))) .cse3 (= 10 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25~0) .cse4) (and (and .cse5 .cse1 .cse2) .cse3 .cse4) (and (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0 140) .cse16 .cse3 .cse2 .cse4 (< 0 .cse18)) (and .cse5 .cse7 .cse3 .cse8) (and (<= (+ ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23~0 115606) 0) .cse6 .cse3 .cse4)))) [2018-07-24 02:39:31,464 INFO L424 ceAbstractionStarter]: At program point L1028(lines 1028 1044) the Hoare annotation is: true [2018-07-24 02:39:31,464 INFO L421 ceAbstractionStarter]: For program point L287(lines 287 1024) no Hoare annotation was computed. [2018-07-24 02:39:31,464 INFO L421 ceAbstractionStarter]: For program point L275(lines 275 1024) no Hoare annotation was computed. [2018-07-24 02:39:31,464 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startErr0AssertViolationERROR_FUNCTION(line 141) no Hoare annotation was computed. [2018-07-24 02:39:31,464 INFO L421 ceAbstractionStarter]: For program point L1000(lines 1000 1024) no Hoare annotation was computed. [2018-07-24 02:39:31,464 INFO L421 ceAbstractionStarter]: For program point L1005(lines 1005 1024) no Hoare annotation was computed. [2018-07-24 02:39:31,464 INFO L421 ceAbstractionStarter]: For program point L280(lines 280 1024) no Hoare annotation was computed. [2018-07-24 02:39:31,464 INFO L421 ceAbstractionStarter]: For program point L294(lines 294 1024) no Hoare annotation was computed. [2018-07-24 02:39:31,465 INFO L421 ceAbstractionStarter]: For program point L299(lines 299 1024) no Hoare annotation was computed. [2018-07-24 02:39:31,465 INFO L421 ceAbstractionStarter]: For program point L1034(lines 1034 1043) no Hoare annotation was computed. [2018-07-24 02:39:31,465 INFO L421 ceAbstractionStarter]: For program point L1039(line 1039) no Hoare annotation was computed. [2018-07-24 02:39:31,472 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500,QUANTIFIED] [2018-07-24 02:39:31,473 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500,QUANTIFIED] [2018-07-24 02:39:31,474 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500,QUANTIFIED] [2018-07-24 02:39:31,479 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_501,QUANTIFIED] [2018-07-24 02:39:31,479 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500,QUANTIFIED] [2018-07-24 02:39:31,479 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_501,QUANTIFIED] [2018-07-24 02:39:31,479 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_501,QUANTIFIED] [2018-07-24 02:39:31,480 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_501,QUANTIFIED] [2018-07-24 02:39:31,480 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500,QUANTIFIED] [2018-07-24 02:39:31,480 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500,QUANTIFIED] [2018-07-24 02:39:31,499 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500,QUANTIFIED] [2018-07-24 02:39:31,500 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500,QUANTIFIED] [2018-07-24 02:39:31,500 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500,QUANTIFIED] [2018-07-24 02:39:31,501 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_501,QUANTIFIED] [2018-07-24 02:39:31,501 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500,QUANTIFIED] [2018-07-24 02:39:31,501 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_501,QUANTIFIED] [2018-07-24 02:39:31,501 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_501,QUANTIFIED] [2018-07-24 02:39:31,502 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_501,QUANTIFIED] [2018-07-24 02:39:31,502 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500,QUANTIFIED] [2018-07-24 02:39:31,502 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500,QUANTIFIED] [2018-07-24 02:39:31,507 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500,QUANTIFIED] [2018-07-24 02:39:31,507 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500,QUANTIFIED] [2018-07-24 02:39:31,507 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500,QUANTIFIED] [2018-07-24 02:39:31,508 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_501,QUANTIFIED] [2018-07-24 02:39:31,508 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500,QUANTIFIED] [2018-07-24 02:39:31,508 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_501,QUANTIFIED] [2018-07-24 02:39:31,508 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_501,QUANTIFIED] [2018-07-24 02:39:31,509 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_501,QUANTIFIED] [2018-07-24 02:39:31,509 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500,QUANTIFIED] [2018-07-24 02:39:31,509 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500,QUANTIFIED] [2018-07-24 02:39:31,513 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500,QUANTIFIED] [2018-07-24 02:39:31,513 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500,QUANTIFIED] [2018-07-24 02:39:31,513 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500,QUANTIFIED] [2018-07-24 02:39:31,514 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_501,QUANTIFIED] [2018-07-24 02:39:31,514 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500,QUANTIFIED] [2018-07-24 02:39:31,515 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_501,QUANTIFIED] [2018-07-24 02:39:31,515 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_501,QUANTIFIED] [2018-07-24 02:39:31,515 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_501,QUANTIFIED] [2018-07-24 02:39:31,515 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500,QUANTIFIED] [2018-07-24 02:39:31,515 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500,QUANTIFIED] [2018-07-24 02:39:31,520 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.07 02:39:31 BoogieIcfgContainer [2018-07-24 02:39:31,521 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-24 02:39:31,522 INFO L168 Benchmark]: Toolchain (without parser) took 108125.00 ms. Allocated memory was 1.5 GB in the beginning and 3.9 GB in the end (delta: 2.4 GB). Free memory was 1.4 GB in the beginning and 3.7 GB in the end (delta: -2.3 GB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2018-07-24 02:39:31,523 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-24 02:39:31,523 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1002.60 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 63.4 MB). Peak memory consumption was 63.4 MB. Max. memory is 7.1 GB. [2018-07-24 02:39:31,524 INFO L168 Benchmark]: Boogie Procedure Inliner took 178.35 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-07-24 02:39:31,525 INFO L168 Benchmark]: Boogie Preprocessor took 336.95 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 815.3 MB). Free memory was 1.3 GB in the beginning and 2.3 GB in the end (delta: -931.4 MB). Peak memory consumption was 49.4 MB. Max. memory is 7.1 GB. [2018-07-24 02:39:31,526 INFO L168 Benchmark]: RCFGBuilder took 4253.83 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.0 GB in the end (delta: 214.2 MB). Peak memory consumption was 214.2 MB. Max. memory is 7.1 GB. [2018-07-24 02:39:31,526 INFO L168 Benchmark]: TraceAbstraction took 102346.00 ms. Allocated memory was 2.3 GB in the beginning and 3.9 GB in the end (delta: 1.6 GB). Free memory was 2.0 GB in the beginning and 3.7 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2018-07-24 02:39:31,532 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.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1002.60 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 63.4 MB). Peak memory consumption was 63.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 178.35 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 336.95 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 815.3 MB). Free memory was 1.3 GB in the beginning and 2.3 GB in the end (delta: -931.4 MB). Peak memory consumption was 49.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 4253.83 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.0 GB in the end (delta: 214.2 MB). Peak memory consumption was 214.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 102346.00 ms. Allocated memory was 2.3 GB in the beginning and 3.9 GB in the end (delta: 1.6 GB). Free memory was 2.0 GB in the beginning and 3.7 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_501,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_501,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_501,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_501,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_501,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_501,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_501,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_501,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_501,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_501,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_501,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_501,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_501,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_501,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_501,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_501,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 141]: 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: 22]: Loop Invariant [2018-07-24 02:39:31,543 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500,QUANTIFIED] [2018-07-24 02:39:31,544 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500,QUANTIFIED] [2018-07-24 02:39:31,544 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500,QUANTIFIED] [2018-07-24 02:39:31,544 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_501,QUANTIFIED] [2018-07-24 02:39:31,545 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500,QUANTIFIED] [2018-07-24 02:39:31,545 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_501,QUANTIFIED] [2018-07-24 02:39:31,545 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_501,QUANTIFIED] [2018-07-24 02:39:31,545 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_501,QUANTIFIED] [2018-07-24 02:39:31,546 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500,QUANTIFIED] [2018-07-24 02:39:31,546 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500,QUANTIFIED] [2018-07-24 02:39:31,549 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500,QUANTIFIED] [2018-07-24 02:39:31,549 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500,QUANTIFIED] [2018-07-24 02:39:31,549 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500,QUANTIFIED] [2018-07-24 02:39:31,550 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_501,QUANTIFIED] [2018-07-24 02:39:31,550 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500,QUANTIFIED] [2018-07-24 02:39:31,550 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_501,QUANTIFIED] [2018-07-24 02:39:31,551 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_501,QUANTIFIED] [2018-07-24 02:39:31,551 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_501,QUANTIFIED] [2018-07-24 02:39:31,551 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500,QUANTIFIED] [2018-07-24 02:39:31,551 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23 + 43 <= 0 && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25 == 9)) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 == 1)) && 15 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a8) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3) || (((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 <= 130 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23 + 43 <= 0) && 15 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a8) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3)) || (((((1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 && (\exists v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500 : int :: (v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500 <= 140 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 <= v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500 / 5 + 206649) && 0 == v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500 % 5)) && 260 <= __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3 == 1) && 15 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a8) && 13 <= __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25)) || (((((306 < __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 == 1) && 15 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a8) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25 == 13)) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25 == 12))) || (1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a8 == 15 && (__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 <= 130 && 306 < __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 == 1)) || ((((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 <= 277 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 == 1) && 141 <= __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29) && 15 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a8) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3)) || ((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 <= 130 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 == 1) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25 == 9)) || ((((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 == 1 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23 <= 138) && 15 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a8) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25 == 13))) || ((((((!(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25 == 10) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23 <= 138) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25 == 9)) && 15 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a8) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 == 1)) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25 == 11)) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3)) || (((((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25 == 12 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 <= 0) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 <= 277) && 140 < __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29) && 15 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a8) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3)) || (((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a8 == 15 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3 == 1) && (__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 <= 277 && 306 < __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 == 1) && 13 <= __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25)) || ((((12 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 == 1) && 15 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a8) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23 <= 312)) || (((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25 == 11 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 == 1) && 15 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a8) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3)) || ((((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25 == 9 && 260 <= __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23 + 43 <= 0) && 15 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a8) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3)) || ((((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a8 == 15 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 <= 277) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 == 1) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23 + 43 <= 0) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3 == 1)) || (((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 == 1 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25 == 9) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3 == 1) && 15 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a8)) || ((((\exists v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_501 : int, v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500 : int :: ((((0 <= v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_501 && v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500 <= 140) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 + 275914 <= 2 * (v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_501 / 5)) && 277 < v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_501) && v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_501 <= v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500 / 5 + 206649) && 0 == v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500 % 5) && 15 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a8) && 10 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3)) || ((((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 <= 130 && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25 == 9)) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 == 1)) && 15 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a8) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3)) || (((((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 <= 140 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23 <= 138) && 15 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a8) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 == 1)) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3) && 0 < __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23 + 43)) || (((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 <= 130 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3 == 1) && 15 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a8) && 13 <= __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25)) || (((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23 + 115606 <= 0 && 260 <= __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29) && 15 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a8) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3) - InvariantResult [Line: 1034]: Loop Invariant [2018-07-24 02:39:31,554 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500,QUANTIFIED] [2018-07-24 02:39:31,555 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500,QUANTIFIED] [2018-07-24 02:39:31,555 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500,QUANTIFIED] [2018-07-24 02:39:31,555 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_501,QUANTIFIED] [2018-07-24 02:39:31,555 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500,QUANTIFIED] [2018-07-24 02:39:31,556 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_501,QUANTIFIED] [2018-07-24 02:39:31,556 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_501,QUANTIFIED] [2018-07-24 02:39:31,556 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_501,QUANTIFIED] [2018-07-24 02:39:31,556 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500,QUANTIFIED] [2018-07-24 02:39:31,556 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500,QUANTIFIED] [2018-07-24 02:39:31,559 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500,QUANTIFIED] [2018-07-24 02:39:31,560 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500,QUANTIFIED] [2018-07-24 02:39:31,560 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500,QUANTIFIED] [2018-07-24 02:39:31,560 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_501,QUANTIFIED] [2018-07-24 02:39:31,561 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500,QUANTIFIED] [2018-07-24 02:39:31,561 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_501,QUANTIFIED] [2018-07-24 02:39:31,561 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_501,QUANTIFIED] [2018-07-24 02:39:31,561 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_501,QUANTIFIED] [2018-07-24 02:39:31,561 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500,QUANTIFIED] [2018-07-24 02:39:31,562 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23 + 43 <= 0 && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25 == 9)) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 == 1)) && 15 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a8) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3) || (((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 <= 130 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23 + 43 <= 0) && 15 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a8) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3)) || (((((1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 && (\exists v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500 : int :: (v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500 <= 140 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 <= v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500 / 5 + 206649) && 0 == v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500 % 5)) && 260 <= __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3 == 1) && 15 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a8) && 13 <= __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25)) || (((((306 < __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 == 1) && 15 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a8) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25 == 13)) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25 == 12))) || (1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a8 == 15 && (__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 <= 130 && 306 < __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 == 1)) || ((((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 <= 277 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 == 1) && 141 <= __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29) && 15 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a8) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3)) || ((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 <= 130 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 == 1) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25 == 9)) || ((((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 == 1 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23 <= 138) && 15 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a8) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25 == 13))) || ((((((!(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25 == 10) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23 <= 138) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25 == 9)) && 15 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a8) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 == 1)) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25 == 11)) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3)) || (((((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25 == 12 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 <= 0) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 <= 277) && 140 < __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29) && 15 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a8) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3)) || (((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a8 == 15 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3 == 1) && (__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 <= 277 && 306 < __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 == 1) && 13 <= __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25)) || ((((12 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 == 1) && 15 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a8) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23 <= 312)) || (((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25 == 11 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 == 1) && 15 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a8) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3)) || ((((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25 == 9 && 260 <= __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23 + 43 <= 0) && 15 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a8) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3)) || ((((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a8 == 15 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 <= 277) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 == 1) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23 + 43 <= 0) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3 == 1)) || (((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 == 1 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25 == 9) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3 == 1) && 15 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a8)) || ((((\exists v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_501 : int, v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500 : int :: ((((0 <= v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_501 && v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500 <= 140) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 + 275914 <= 2 * (v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_501 / 5)) && 277 < v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_501) && v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_501 <= v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500 / 5 + 206649) && 0 == v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0_500 % 5) && 15 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a8) && 10 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3)) || ((((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 <= 130 && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25 == 9)) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 == 1)) && 15 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a8) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3)) || (((((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 <= 140 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23 <= 138) && 15 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a8) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 == 1)) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3) && 0 < __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23 + 43)) || (((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 <= 130 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3 == 1) && 15 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a8) && 13 <= __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25)) || (((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23 + 115606 <= 0 && 260 <= __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29) && 15 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a8) && 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3) - InvariantResult [Line: 1028]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 284 locations, 1 error locations. SAFE Result, 102.2s OverallTime, 15 OverallIterations, 10 TraceHistogramMax, 71.7s AutomataDifference, 0.0s DeadEndRemovalTime, 10.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 3061 SDtfs, 13727 SDslu, 2228 SDs, 0 SdLazy, 32432 SolverSat, 5578 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 59.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2035 GetRequests, 1926 SyntacticMatches, 8 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 558 ImplicationChecksByTransitivity, 7.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21411occurred in iteration=14, 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: 2.0s AutomataMinimizationTime, 15 MinimizatonAttempts, 20258 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 318 NumberOfFragments, 821 HoareAnnotationTreeSize, 3 FomulaSimplifications, 73848 FormulaSimplificationTreeSizeReduction, 2.7s HoareSimplificationTime, 3 FomulaSimplificationsInter, 40118 FormulaSimplificationTreeSizeReductionInter, 7.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 11.5s InterpolantComputationTime, 7699 NumberOfCodeBlocks, 7699 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 7680 ConstructedInterpolants, 134 QuantifiedInterpolants, 21738590 SizeOfPredicates, 15 NumberOfNonLiveVariables, 2469 ConjunctsInSsa, 35 ConjunctsInUnsatCore, 19 InterpolantComputations, 13 PerfectInterpolantSequences, 11341/13067 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/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem11_label55_true-unreach-call.c_svcomp-Reach-64bit-Automizer_Default.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-07-24_02-39-31-572.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem11_label55_true-unreach-call.c_svcomp-Reach-64bit-Automizer_Default.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-24_02-39-31-572.csv Received shutdown request...