java -Xss4m -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem11_label57_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-71425fa [2018-07-22 11:33:58,393 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-22 11:33:58,395 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-22 11:33:58,410 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-22 11:33:58,410 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-22 11:33:58,411 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-22 11:33:58,413 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-22 11:33:58,421 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-22 11:33:58,424 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-22 11:33:58,425 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-22 11:33:58,425 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-22 11:33:58,428 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-22 11:33:58,429 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-22 11:33:58,429 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-22 11:33:58,431 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-22 11:33:58,431 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-22 11:33:58,432 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-22 11:33:58,434 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-22 11:33:58,436 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-22 11:33:58,437 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-22 11:33:58,438 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-22 11:33:58,439 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-22 11:33:58,441 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-22 11:33:58,441 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-22 11:33:58,442 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-22 11:33:58,442 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-22 11:33:58,443 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-22 11:33:58,444 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-22 11:33:58,445 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-22 11:33:58,446 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-22 11:33:58,446 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-22 11:33:58,446 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-22 11:33:58,447 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-22 11:33:58,447 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-22 11:33:58,448 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-22 11:33:58,448 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-22 11:33:58,449 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-07-22 11:33:58,467 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-22 11:33:58,467 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-22 11:33:58,468 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-07-22 11:33:58,468 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-07-22 11:33:58,469 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-07-22 11:33:58,469 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-07-22 11:33:58,469 INFO L133 SettingsManager]: * Use SBE=true [2018-07-22 11:33:58,470 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-07-22 11:33:58,470 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-07-22 11:33:58,470 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-07-22 11:33:58,470 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-07-22 11:33:58,470 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-07-22 11:33:58,470 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-07-22 11:33:58,471 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-07-22 11:33:58,471 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-07-22 11:33:58,471 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-22 11:33:58,471 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-07-22 11:33:58,471 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-07-22 11:33:58,472 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-07-22 11:33:58,472 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-07-22 11:33:58,472 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-22 11:33:58,472 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-07-22 11:33:58,472 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-07-22 11:33:58,472 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-07-22 11:33:58,473 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-07-22 11:33:58,473 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-07-22 11:33:58,473 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-07-22 11:33:58,473 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-22 11:33:58,473 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-07-22 11:33:58,515 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-22 11:33:58,533 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-22 11:33:58,536 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-22 11:33:58,537 INFO L271 PluginConnector]: Initializing CDTParser... [2018-07-22 11:33:58,537 INFO L276 PluginConnector]: CDTParser initialized [2018-07-22 11:33:58,538 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem11_label57_true-unreach-call.c [2018-07-22 11:33:58,887 INFO L220 CDTParser]: Created temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/e4c94c066/7a2b001cee574cd9955dab9fd1e9c225/FLAGbca675fcc [2018-07-22 11:33:59,243 INFO L276 CDTParser]: Found 1 translation units. [2018-07-22 11:33:59,244 INFO L158 CDTParser]: Scanning /storage/ultimate/trunk/examples/svcomp/eca-rers2012/Problem11_label57_true-unreach-call.c [2018-07-22 11:33:59,264 INFO L324 CDTParser]: About to delete temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/e4c94c066/7a2b001cee574cd9955dab9fd1e9c225/FLAGbca675fcc [2018-07-22 11:33:59,309 INFO L332 CDTParser]: Successfully deleted /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/e4c94c066/7a2b001cee574cd9955dab9fd1e9c225 [2018-07-22 11:33:59,320 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-22 11:33:59,329 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-07-22 11:33:59,330 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-07-22 11:33:59,330 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-07-22 11:33:59,338 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-07-22 11:33:59,339 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 11:33:59" (1/1) ... [2018-07-22 11:33:59,341 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@148681d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:33:59, skipping insertion in model container [2018-07-22 11:33:59,341 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 11:33:59" (1/1) ... [2018-07-22 11:33:59,553 INFO L179 PRDispatcher]: Starting pre-run dispatcher in SV-COMP mode [2018-07-22 11:33:59,986 INFO L175 PostProcessor]: Settings: Checked method=main [2018-07-22 11:34:00,005 INFO L422 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-07-22 11:34:00,279 INFO L175 PostProcessor]: Settings: Checked method=main [2018-07-22 11:34:00,396 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:34:00 WrapperNode [2018-07-22 11:34:00,396 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-07-22 11:34:00,397 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-07-22 11:34:00,397 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-07-22 11:34:00,397 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-07-22 11:34:00,408 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:34:00" (1/1) ... [2018-07-22 11:34:00,452 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:34:00" (1/1) ... [2018-07-22 11:34:00,565 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-07-22 11:34:00,565 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-22 11:34:00,566 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-22 11:34:00,566 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-22 11:34:00,576 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:34:00" (1/1) ... [2018-07-22 11:34:00,576 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:34:00" (1/1) ... [2018-07-22 11:34:00,586 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:34:00" (1/1) ... [2018-07-22 11:34:00,586 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:34:00" (1/1) ... [2018-07-22 11:34:00,640 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:34:00" (1/1) ... [2018-07-22 11:34:00,947 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:34:00" (1/1) ... [2018-07-22 11:34:00,980 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:34:00" (1/1) ... [2018-07-22 11:34:00,996 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-22 11:34:00,997 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-22 11:34:00,997 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-22 11:34:00,997 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-22 11:34:00,998 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:34:00" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-07-22 11:34:01,068 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-07-22 11:34:01,068 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-07-22 11:34:01,068 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-07-22 11:34:05,342 INFO L261 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-07-22 11:34:05,343 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 11:34:05 BoogieIcfgContainer [2018-07-22 11:34:05,343 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-22 11:34:05,344 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-22 11:34:05,344 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-22 11:34:05,348 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-22 11:34:05,348 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 11:33:59" (1/3) ... [2018-07-22 11:34:05,349 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e4b1e9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 11:34:05, skipping insertion in model container [2018-07-22 11:34:05,349 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:34:00" (2/3) ... [2018-07-22 11:34:05,349 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e4b1e9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 11:34:05, skipping insertion in model container [2018-07-22 11:34:05,350 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 11:34:05" (3/3) ... [2018-07-22 11:34:05,352 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label57_true-unreach-call.c [2018-07-22 11:34:05,362 INFO L132 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-07-22 11:34:05,371 INFO L144 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-22 11:34:05,426 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-22 11:34:05,426 INFO L373 AbstractCegarLoop]: Interprodecural is true [2018-07-22 11:34:05,427 INFO L374 AbstractCegarLoop]: Hoare is true [2018-07-22 11:34:05,427 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-07-22 11:34:05,427 INFO L376 AbstractCegarLoop]: Backedges is TWOTRACK [2018-07-22 11:34:05,427 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-22 11:34:05,427 INFO L378 AbstractCegarLoop]: Difference is false [2018-07-22 11:34:05,428 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-22 11:34:05,428 INFO L384 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-22 11:34:05,479 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states. [2018-07-22 11:34:05,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-07-22 11:34:05,490 INFO L350 BasicCegarLoop]: Found error trace [2018-07-22 11:34:05,491 INFO L358 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-22 11:34:05,492 INFO L414 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-22 11:34:05,499 INFO L82 PathProgramCache]: Analyzing trace with hash 84973194, now seen corresponding path program 1 times [2018-07-22 11:34:05,501 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-22 11:34:05,502 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-22 11:34:05,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 11:34:05,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-22 11:34:05,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 11:34:05,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-22 11:34:05,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-22 11:34:05,879 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-22 11:34:05,880 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-22 11:34:05,882 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-22 11:34:05,897 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-22 11:34:05,898 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-22 11:34:05,900 INFO L87 Difference]: Start difference. First operand 284 states. Second operand 4 states. [2018-07-22 11:34:08,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-22 11:34:08,753 INFO L93 Difference]: Finished difference Result 974 states and 1747 transitions. [2018-07-22 11:34:08,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-22 11:34:08,754 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2018-07-22 11:34:08,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-22 11:34:08,780 INFO L225 Difference]: With dead ends: 974 [2018-07-22 11:34:08,780 INFO L226 Difference]: Without dead ends: 683 [2018-07-22 11:34:08,790 INFO L578 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-22 11:34:08,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2018-07-22 11:34:08,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 677. [2018-07-22 11:34:08,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 677 states. [2018-07-22 11:34:08,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 1087 transitions. [2018-07-22 11:34:08,881 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 1087 transitions. Word has length 47 [2018-07-22 11:34:08,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-22 11:34:08,881 INFO L471 AbstractCegarLoop]: Abstraction has 677 states and 1087 transitions. [2018-07-22 11:34:08,882 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-22 11:34:08,882 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 1087 transitions. [2018-07-22 11:34:08,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-07-22 11:34:08,887 INFO L350 BasicCegarLoop]: Found error trace [2018-07-22 11:34:08,887 INFO L358 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-22 11:34:08,888 INFO L414 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-22 11:34:08,888 INFO L82 PathProgramCache]: Analyzing trace with hash 1103993199, now seen corresponding path program 1 times [2018-07-22 11:34:08,888 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-22 11:34:08,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-22 11:34:08,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 11:34:08,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-22 11:34:08,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 11:34:08,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-22 11:34:09,263 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-22 11:34:09,263 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-22 11:34:09,263 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-22 11:34:09,265 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-22 11:34:09,265 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-22 11:34:09,266 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-22 11:34:09,266 INFO L87 Difference]: Start difference. First operand 677 states and 1087 transitions. Second operand 4 states. [2018-07-22 11:34:12,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-22 11:34:12,862 INFO L93 Difference]: Finished difference Result 2487 states and 4110 transitions. [2018-07-22 11:34:12,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-22 11:34:12,866 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 117 [2018-07-22 11:34:12,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-22 11:34:12,877 INFO L225 Difference]: With dead ends: 2487 [2018-07-22 11:34:12,877 INFO L226 Difference]: Without dead ends: 1812 [2018-07-22 11:34:12,882 INFO L578 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-22 11:34:12,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1812 states. [2018-07-22 11:34:12,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1812 to 1795. [2018-07-22 11:34:12,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1795 states. [2018-07-22 11:34:12,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1795 states to 1795 states and 2709 transitions. [2018-07-22 11:34:12,960 INFO L78 Accepts]: Start accepts. Automaton has 1795 states and 2709 transitions. Word has length 117 [2018-07-22 11:34:12,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-22 11:34:12,962 INFO L471 AbstractCegarLoop]: Abstraction has 1795 states and 2709 transitions. [2018-07-22 11:34:12,962 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-22 11:34:12,962 INFO L276 IsEmpty]: Start isEmpty. Operand 1795 states and 2709 transitions. [2018-07-22 11:34:12,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2018-07-22 11:34:12,974 INFO L350 BasicCegarLoop]: Found error trace [2018-07-22 11:34:12,975 INFO L358 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-22 11:34:12,975 INFO L414 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-22 11:34:12,975 INFO L82 PathProgramCache]: Analyzing trace with hash 1314248931, now seen corresponding path program 1 times [2018-07-22 11:34:12,975 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-22 11:34:12,976 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-22 11:34:12,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 11:34:12,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-22 11:34:12,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 11:34:13,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-22 11:34:13,309 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 138 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-07-22 11:34:13,309 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-22 11:34:13,310 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-22 11:34:13,310 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-22 11:34:13,310 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-22 11:34:13,311 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-22 11:34:13,311 INFO L87 Difference]: Start difference. First operand 1795 states and 2709 transitions. Second operand 3 states. [2018-07-22 11:34:15,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-22 11:34:15,489 INFO L93 Difference]: Finished difference Result 5254 states and 7979 transitions. [2018-07-22 11:34:15,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-22 11:34:15,489 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 262 [2018-07-22 11:34:15,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-22 11:34:15,506 INFO L225 Difference]: With dead ends: 5254 [2018-07-22 11:34:15,507 INFO L226 Difference]: Without dead ends: 3461 [2018-07-22 11:34:15,511 INFO L578 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-22 11:34:15,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3461 states. [2018-07-22 11:34:15,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3461 to 3461. [2018-07-22 11:34:15,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3461 states. [2018-07-22 11:34:15,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3461 states to 3461 states and 4887 transitions. [2018-07-22 11:34:15,612 INFO L78 Accepts]: Start accepts. Automaton has 3461 states and 4887 transitions. Word has length 262 [2018-07-22 11:34:15,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-22 11:34:15,612 INFO L471 AbstractCegarLoop]: Abstraction has 3461 states and 4887 transitions. [2018-07-22 11:34:15,613 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-22 11:34:15,614 INFO L276 IsEmpty]: Start isEmpty. Operand 3461 states and 4887 transitions. [2018-07-22 11:34:15,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2018-07-22 11:34:15,622 INFO L350 BasicCegarLoop]: Found error trace [2018-07-22 11:34:15,622 INFO L358 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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] [2018-07-22 11:34:15,622 INFO L414 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-22 11:34:15,623 INFO L82 PathProgramCache]: Analyzing trace with hash 2142506900, now seen corresponding path program 1 times [2018-07-22 11:34:15,623 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-22 11:34:15,623 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-22 11:34:15,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 11:34:15,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-22 11:34:15,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 11:34:15,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-22 11:34:16,236 WARN L169 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 7 [2018-07-22 11:34:16,297 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-07-22 11:34:16,298 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-22 11:34:16,299 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-22 11:34:16,299 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-22 11:34:16,299 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-22 11:34:16,299 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-22 11:34:16,300 INFO L87 Difference]: Start difference. First operand 3461 states and 4887 transitions. Second operand 4 states. [2018-07-22 11:34:17,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-22 11:34:17,786 INFO L93 Difference]: Finished difference Result 7677 states and 10635 transitions. [2018-07-22 11:34:17,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-22 11:34:17,787 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 280 [2018-07-22 11:34:17,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-22 11:34:17,803 INFO L225 Difference]: With dead ends: 7677 [2018-07-22 11:34:17,803 INFO L226 Difference]: Without dead ends: 3840 [2018-07-22 11:34:17,809 INFO L578 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-22 11:34:17,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3840 states. [2018-07-22 11:34:17,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3840 to 3457. [2018-07-22 11:34:17,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3457 states. [2018-07-22 11:34:17,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3457 states to 3457 states and 4838 transitions. [2018-07-22 11:34:17,916 INFO L78 Accepts]: Start accepts. Automaton has 3457 states and 4838 transitions. Word has length 280 [2018-07-22 11:34:17,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-22 11:34:17,916 INFO L471 AbstractCegarLoop]: Abstraction has 3457 states and 4838 transitions. [2018-07-22 11:34:17,917 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-22 11:34:17,917 INFO L276 IsEmpty]: Start isEmpty. Operand 3457 states and 4838 transitions. [2018-07-22 11:34:17,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2018-07-22 11:34:17,969 INFO L350 BasicCegarLoop]: Found error trace [2018-07-22 11:34:17,970 INFO L358 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-07-22 11:34:17,970 INFO L414 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-22 11:34:17,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1025622735, now seen corresponding path program 1 times [2018-07-22 11:34:17,971 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-22 11:34:17,971 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-22 11:34:17,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 11:34:17,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-22 11:34:17,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 11:34:18,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-22 11:34:18,622 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 45 proven. 187 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-22 11:34:18,622 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-22 11:34:18,623 INFO L219 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-22 11:34:18,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-22 11:34:18,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-22 11:34:18,775 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-22 11:34:20,940 WARN L169 SmtUtils]: Spent 1.30 s on a formula simplification. DAG size of input: 48 DAG size of output: 24 [2018-07-22 11:34:22,134 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 16 proven. 216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-22 11:34:22,155 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-22 11:34:22,155 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2018-07-22 11:34:22,156 INFO L450 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-22 11:34:22,156 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-22 11:34:22,156 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=63, Unknown=1, NotChecked=0, Total=90 [2018-07-22 11:34:22,157 INFO L87 Difference]: Start difference. First operand 3457 states and 4838 transitions. Second operand 10 states. [2018-07-22 11:34:24,421 WARN L169 SmtUtils]: Spent 910.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-07-22 11:34:27,095 WARN L169 SmtUtils]: Spent 646.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-07-22 11:35:08,174 WARN L169 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2018-07-22 11:36:48,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-22 11:36:48,533 INFO L93 Difference]: Finished difference Result 17865 states and 24978 transitions. [2018-07-22 11:36:48,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-07-22 11:36:48,533 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 354 [2018-07-22 11:36:48,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-22 11:36:48,579 INFO L225 Difference]: With dead ends: 17865 [2018-07-22 11:36:48,579 INFO L226 Difference]: Without dead ends: 14036 [2018-07-22 11:36:48,587 INFO L578 BasicCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 350 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=212, Invalid=651, Unknown=7, NotChecked=0, Total=870 [2018-07-22 11:36:48,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14036 states. [2018-07-22 11:36:48,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14036 to 7914. [2018-07-22 11:36:48,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7914 states. [2018-07-22 11:36:48,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7914 states to 7914 states and 10492 transitions. [2018-07-22 11:36:48,851 INFO L78 Accepts]: Start accepts. Automaton has 7914 states and 10492 transitions. Word has length 354 [2018-07-22 11:36:48,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-22 11:36:48,852 INFO L471 AbstractCegarLoop]: Abstraction has 7914 states and 10492 transitions. [2018-07-22 11:36:48,852 INFO L472 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-22 11:36:48,854 INFO L276 IsEmpty]: Start isEmpty. Operand 7914 states and 10492 transitions. [2018-07-22 11:36:48,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2018-07-22 11:36:48,876 INFO L350 BasicCegarLoop]: Found error trace [2018-07-22 11:36:48,877 INFO L358 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-22 11:36:48,877 INFO L414 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-22 11:36:48,877 INFO L82 PathProgramCache]: Analyzing trace with hash -1855735118, now seen corresponding path program 1 times [2018-07-22 11:36:48,877 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-22 11:36:48,878 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-22 11:36:48,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 11:36:48,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-22 11:36:48,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 11:36:48,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-22 11:36:49,495 INFO L134 CoverageAnalysis]: Checked inductivity of 488 backedges. 439 proven. 4 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-07-22 11:36:49,495 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-22 11:36:49,495 INFO L219 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-22 11:36:49,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-22 11:36:49,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-22 11:36:49,635 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-22 11:36:49,913 INFO L134 CoverageAnalysis]: Checked inductivity of 488 backedges. 443 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-07-22 11:36:49,933 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-07-22 11:36:49,934 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2018-07-22 11:36:49,935 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-22 11:36:49,935 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-22 11:36:49,935 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-07-22 11:36:49,935 INFO L87 Difference]: Start difference. First operand 7914 states and 10492 transitions. Second operand 7 states. [2018-07-22 11:36:53,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-22 11:36:53,330 INFO L93 Difference]: Finished difference Result 21565 states and 28220 transitions. [2018-07-22 11:36:53,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-22 11:36:53,333 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 460 [2018-07-22 11:36:53,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-22 11:36:53,399 INFO L225 Difference]: With dead ends: 21565 [2018-07-22 11:36:53,399 INFO L226 Difference]: Without dead ends: 13653 [2018-07-22 11:36:53,408 INFO L578 BasicCegarLoop]: 0 DeclaredPredicates, 467 GetRequests, 458 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-07-22 11:36:53,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13653 states. [2018-07-22 11:36:53,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13653 to 12905. [2018-07-22 11:36:53,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12905 states. [2018-07-22 11:36:53,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12905 states to 12905 states and 16154 transitions. [2018-07-22 11:36:53,862 INFO L78 Accepts]: Start accepts. Automaton has 12905 states and 16154 transitions. Word has length 460 [2018-07-22 11:36:53,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-22 11:36:53,864 INFO L471 AbstractCegarLoop]: Abstraction has 12905 states and 16154 transitions. [2018-07-22 11:36:53,864 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-22 11:36:53,864 INFO L276 IsEmpty]: Start isEmpty. Operand 12905 states and 16154 transitions. [2018-07-22 11:36:53,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 473 [2018-07-22 11:36:53,893 INFO L350 BasicCegarLoop]: Found error trace [2018-07-22 11:36:53,894 INFO L358 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-22 11:36:53,895 INFO L414 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-22 11:36:53,895 INFO L82 PathProgramCache]: Analyzing trace with hash 224224685, now seen corresponding path program 1 times [2018-07-22 11:36:53,895 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-22 11:36:53,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-22 11:36:53,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 11:36:53,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-22 11:36:53,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 11:36:53,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-22 11:36:54,330 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 304 proven. 0 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2018-07-22 11:36:54,331 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-22 11:36:54,331 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-22 11:36:54,332 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-22 11:36:54,332 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-22 11:36:54,332 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-22 11:36:54,332 INFO L87 Difference]: Start difference. First operand 12905 states and 16154 transitions. Second operand 3 states. [2018-07-22 11:36:55,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-22 11:36:55,660 INFO L93 Difference]: Finished difference Result 29147 states and 36669 transitions. [2018-07-22 11:36:55,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-22 11:36:55,661 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 472 [2018-07-22 11:36:55,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-22 11:36:55,701 INFO L225 Difference]: With dead ends: 29147 [2018-07-22 11:36:55,701 INFO L226 Difference]: Without dead ends: 16429 [2018-07-22 11:36:55,714 INFO L578 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-22 11:36:55,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16429 states. [2018-07-22 11:36:56,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16429 to 16418. [2018-07-22 11:36:56,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16418 states. [2018-07-22 11:36:56,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16418 states to 16418 states and 19885 transitions. [2018-07-22 11:36:56,110 INFO L78 Accepts]: Start accepts. Automaton has 16418 states and 19885 transitions. Word has length 472 [2018-07-22 11:36:56,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-22 11:36:56,110 INFO L471 AbstractCegarLoop]: Abstraction has 16418 states and 19885 transitions. [2018-07-22 11:36:56,110 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-22 11:36:56,110 INFO L276 IsEmpty]: Start isEmpty. Operand 16418 states and 19885 transitions. [2018-07-22 11:36:56,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 511 [2018-07-22 11:36:56,151 INFO L350 BasicCegarLoop]: Found error trace [2018-07-22 11:36:56,151 INFO L358 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2018-07-22 11:36:56,151 INFO L414 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-22 11:36:56,152 INFO L82 PathProgramCache]: Analyzing trace with hash -1140478088, now seen corresponding path program 1 times [2018-07-22 11:36:56,152 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-22 11:36:56,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-22 11:36:56,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 11:36:56,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-22 11:36:56,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 11:36:56,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-22 11:36:56,941 WARN L169 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 11 [2018-07-22 11:36:57,068 INFO L134 CoverageAnalysis]: Checked inductivity of 744 backedges. 619 proven. 0 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2018-07-22 11:36:57,069 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-22 11:36:57,069 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-22 11:36:57,069 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-22 11:36:57,070 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-22 11:36:57,070 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-22 11:36:57,070 INFO L87 Difference]: Start difference. First operand 16418 states and 19885 transitions. Second operand 4 states. [2018-07-22 11:36:59,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-22 11:36:59,527 INFO L93 Difference]: Finished difference Result 34878 states and 42542 transitions. [2018-07-22 11:36:59,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-22 11:36:59,532 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 510 [2018-07-22 11:36:59,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-22 11:36:59,564 INFO L225 Difference]: With dead ends: 34878 [2018-07-22 11:36:59,565 INFO L226 Difference]: Without dead ends: 18832 [2018-07-22 11:36:59,578 INFO L578 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-22 11:36:59,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18832 states. [2018-07-22 11:36:59,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18832 to 18631. [2018-07-22 11:36:59,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18631 states. [2018-07-22 11:36:59,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18631 states to 18631 states and 22040 transitions. [2018-07-22 11:36:59,868 INFO L78 Accepts]: Start accepts. Automaton has 18631 states and 22040 transitions. Word has length 510 [2018-07-22 11:36:59,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-22 11:36:59,869 INFO L471 AbstractCegarLoop]: Abstraction has 18631 states and 22040 transitions. [2018-07-22 11:36:59,869 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-22 11:36:59,870 INFO L276 IsEmpty]: Start isEmpty. Operand 18631 states and 22040 transitions. [2018-07-22 11:36:59,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 528 [2018-07-22 11:36:59,915 INFO L350 BasicCegarLoop]: Found error trace [2018-07-22 11:36:59,915 INFO L358 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-07-22 11:36:59,915 INFO L414 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-22 11:36:59,916 INFO L82 PathProgramCache]: Analyzing trace with hash -87370645, now seen corresponding path program 1 times [2018-07-22 11:36:59,916 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-22 11:36:59,916 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-22 11:36:59,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 11:36:59,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-22 11:36:59,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 11:37:00,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-22 11:37:00,777 INFO L134 CoverageAnalysis]: Checked inductivity of 795 backedges. 547 proven. 151 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2018-07-22 11:37:00,778 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-22 11:37:00,778 INFO L219 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-22 11:37:00,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-22 11:37:00,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-22 11:37:00,902 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-22 11:37:01,142 WARN L169 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-07-22 11:37:02,901 INFO L134 CoverageAnalysis]: Checked inductivity of 795 backedges. 460 proven. 238 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2018-07-22 11:37:02,921 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-22 11:37:02,922 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2018-07-22 11:37:02,922 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-22 11:37:02,923 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-22 11:37:02,923 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-07-22 11:37:02,923 INFO L87 Difference]: Start difference. First operand 18631 states and 22040 transitions. Second operand 11 states. [2018-07-22 11:37:12,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-22 11:37:12,668 INFO L93 Difference]: Finished difference Result 40839 states and 48027 transitions. [2018-07-22 11:37:12,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-07-22 11:37:12,669 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 527 [2018-07-22 11:37:12,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-22 11:37:12,670 INFO L225 Difference]: With dead ends: 40839 [2018-07-22 11:37:12,670 INFO L226 Difference]: Without dead ends: 0 [2018-07-22 11:37:12,686 INFO L578 BasicCegarLoop]: 0 DeclaredPredicates, 572 GetRequests, 543 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=248, Invalid=682, Unknown=0, NotChecked=0, Total=930 [2018-07-22 11:37:12,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-07-22 11:37:12,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-07-22 11:37:12,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-07-22 11:37:12,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-07-22 11:37:12,687 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 527 [2018-07-22 11:37:12,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-22 11:37:12,687 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-07-22 11:37:12,688 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-22 11:37:12,688 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-07-22 11:37:12,688 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-07-22 11:37:12,691 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-07-22 11:37:12,739 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 11:37:12,754 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 11:37:12,833 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 11:37:12,836 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 11:37:12,878 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 11:37:12,883 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 11:37:12,965 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 11:37:13,066 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 11:37:13,102 WARN L169 SmtUtils]: Spent 407.00 ms on a formula simplification. DAG size of input: 309 DAG size of output: 189 [2018-07-22 11:37:13,128 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 11:37:13,141 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 11:37:13,209 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 11:37:13,212 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 11:37:13,248 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 11:37:13,253 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 11:37:13,325 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 11:37:13,429 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 11:37:13,459 WARN L169 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 309 DAG size of output: 189 [2018-07-22 11:37:30,673 WARN L169 SmtUtils]: Spent 17.21 s on a formula simplification. DAG size of input: 177 DAG size of output: 78 [2018-07-22 11:37:38,483 WARN L169 SmtUtils]: Spent 7.81 s on a formula simplification. DAG size of input: 177 DAG size of output: 78 [2018-07-22 11:37:38,487 INFO L421 ceAbstractionStarter]: For program point L904(lines 904 914) no Hoare annotation was computed. [2018-07-22 11:37:38,487 INFO L421 ceAbstractionStarter]: For program point L903(lines 903 1024) no Hoare annotation was computed. [2018-07-22 11:37:38,487 INFO L421 ceAbstractionStarter]: For program point L904''(lines 904 914) no Hoare annotation was computed. [2018-07-22 11:37:38,487 INFO L421 ceAbstractionStarter]: For program point L478''(lines 478 486) no Hoare annotation was computed. [2018-07-22 11:37:38,487 INFO L421 ceAbstractionStarter]: For program point L927(lines 927 1024) no Hoare annotation was computed. [2018-07-22 11:37:38,488 INFO L421 ceAbstractionStarter]: For program point L916(lines 916 926) no Hoare annotation was computed. [2018-07-22 11:37:38,488 INFO L421 ceAbstractionStarter]: For program point L915(lines 915 1024) no Hoare annotation was computed. [2018-07-22 11:37:38,488 INFO L421 ceAbstractionStarter]: For program point L940(lines 940 952) no Hoare annotation was computed. [2018-07-22 11:37:38,488 INFO L421 ceAbstractionStarter]: For program point L970''(lines 970 980) no Hoare annotation was computed. [2018-07-22 11:37:38,488 INFO L421 ceAbstractionStarter]: For program point L706(lines 706 1024) no Hoare annotation was computed. [2018-07-22 11:37:38,488 INFO L421 ceAbstractionStarter]: For program point L932(lines 932 1024) no Hoare annotation was computed. [2018-07-22 11:37:38,488 INFO L421 ceAbstractionStarter]: For program point L939(lines 939 1024) no Hoare annotation was computed. [2018-07-22 11:37:38,488 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-07-22 11:37:38,489 INFO L421 ceAbstractionStarter]: For program point L963(lines 963 1024) no Hoare annotation was computed. [2018-07-22 11:37:38,489 INFO L421 ceAbstractionStarter]: For program point L969(lines 969 1024) no Hoare annotation was computed. [2018-07-22 11:37:38,489 INFO L421 ceAbstractionStarter]: For program point L953(lines 953 1024) no Hoare annotation was computed. [2018-07-22 11:37:38,489 INFO L421 ceAbstractionStarter]: For program point L712(lines 712 1024) no Hoare annotation was computed. [2018-07-22 11:37:38,489 INFO L421 ceAbstractionStarter]: For program point L718(lines 718 730) no Hoare annotation was computed. [2018-07-22 11:37:38,489 INFO L421 ceAbstractionStarter]: For program point L717(lines 717 1024) no Hoare annotation was computed. [2018-07-22 11:37:38,489 INFO L421 ceAbstractionStarter]: For program point L958(lines 958 1024) no Hoare annotation was computed. [2018-07-22 11:37:38,489 INFO L421 ceAbstractionStarter]: For program point L981(lines 981 1024) no Hoare annotation was computed. [2018-07-22 11:37:38,490 INFO L421 ceAbstractionStarter]: For program point L743(lines 743 1024) no Hoare annotation was computed. [2018-07-22 11:37:38,490 INFO L421 ceAbstractionStarter]: For program point L500(lines 500 1024) no Hoare annotation was computed. [2018-07-22 11:37:38,490 INFO L421 ceAbstractionStarter]: For program point L988(lines 988 1024) no Hoare annotation was computed. [2018-07-22 11:37:38,490 INFO L421 ceAbstractionStarter]: For program point L507(lines 507 1024) no Hoare annotation was computed. [2018-07-22 11:37:38,490 INFO L421 ceAbstractionStarter]: For program point L970(lines 970 980) no Hoare annotation was computed. [2018-07-22 11:37:38,490 INFO L421 ceAbstractionStarter]: For program point L731(lines 731 1024) no Hoare annotation was computed. [2018-07-22 11:37:38,490 INFO L421 ceAbstractionStarter]: For program point L738(lines 738 1024) no Hoare annotation was computed. [2018-07-22 11:37:38,490 INFO L421 ceAbstractionStarter]: For program point L769(lines 769 1024) no Hoare annotation was computed. [2018-07-22 11:37:38,490 INFO L421 ceAbstractionStarter]: For program point L526(lines 526 1024) no Hoare annotation was computed. [2018-07-22 11:37:38,491 INFO L421 ceAbstractionStarter]: For program point L993(lines 993 1024) no Hoare annotation was computed. [2018-07-22 11:37:38,491 INFO L421 ceAbstractionStarter]: For program point L750(lines 750 1024) no Hoare annotation was computed. [2018-07-22 11:37:38,491 INFO L421 ceAbstractionStarter]: For program point L758(lines 758 768) no Hoare annotation was computed. [2018-07-22 11:37:38,491 INFO L421 ceAbstractionStarter]: For program point L515(lines 515 525) no Hoare annotation was computed. [2018-07-22 11:37:38,491 INFO L421 ceAbstractionStarter]: For program point L757(lines 757 1024) no Hoare annotation was computed. [2018-07-22 11:37:38,491 INFO L421 ceAbstractionStarter]: For program point L514(lines 514 1024) no Hoare annotation was computed. [2018-07-22 11:37:38,491 INFO L421 ceAbstractionStarter]: For program point L780(lines 780 1024) no Hoare annotation was computed. [2018-07-22 11:37:38,491 INFO L421 ceAbstractionStarter]: For program point L542(lines 542 1024) no Hoare annotation was computed. [2018-07-22 11:37:38,491 INFO L421 ceAbstractionStarter]: For program point L787(lines 787 1024) no Hoare annotation was computed. [2018-07-22 11:37:38,491 INFO L421 ceAbstractionStarter]: For program point L549(lines 549 1024) no Hoare annotation was computed. [2018-07-22 11:37:38,492 INFO L421 ceAbstractionStarter]: For program point L305(lines 305 1024) no Hoare annotation was computed. [2018-07-22 11:37:38,492 INFO L421 ceAbstractionStarter]: For program point L531(lines 531 1024) no Hoare annotation was computed. [2018-07-22 11:37:38,492 INFO L421 ceAbstractionStarter]: For program point L774(lines 774 1024) no Hoare annotation was computed. [2018-07-22 11:37:38,492 INFO L421 ceAbstractionStarter]: For program point L537(lines 537 1024) no Hoare annotation was computed. [2018-07-22 11:37:38,492 INFO L421 ceAbstractionStarter]: For program point L587''(lines 587 597) no Hoare annotation was computed. [2018-07-22 11:37:38,492 INFO L421 ceAbstractionStarter]: For program point L322(lines 322 1024) no Hoare annotation was computed. [2018-07-22 11:37:38,492 INFO L421 ceAbstractionStarter]: For program point L561(lines 561 1024) no Hoare annotation was computed. [2018-07-22 11:37:38,492 INFO L421 ceAbstractionStarter]: For program point L566(lines 566 1024) no Hoare annotation was computed. [2018-07-22 11:37:38,492 INFO L421 ceAbstractionStarter]: For program point L329(lines 329 1024) no Hoare annotation was computed. [2018-07-22 11:37:38,493 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-07-22 11:37:38,493 INFO L421 ceAbstractionStarter]: For program point L310(lines 310 1024) no Hoare annotation was computed. [2018-07-22 11:37:38,493 INFO L421 ceAbstractionStarter]: For program point L792(lines 792 1024) no Hoare annotation was computed. [2018-07-22 11:37:38,493 INFO L421 ceAbstractionStarter]: For program point L799(lines 799 1024) no Hoare annotation was computed. [2018-07-22 11:37:38,493 INFO L421 ceAbstractionStarter]: For program point L555(lines 555 1024) no Hoare annotation was computed. [2018-07-22 11:37:38,493 INFO L421 ceAbstractionStarter]: For program point L317(lines 317 1024) no Hoare annotation was computed. [2018-07-22 11:37:38,493 INFO L421 ceAbstractionStarter]: For program point L340(lines 340 1024) no Hoare annotation was computed. [2018-07-22 11:37:38,493 INFO L421 ceAbstractionStarter]: For program point L581(lines 581 1024) no Hoare annotation was computed. [2018-07-22 11:37:38,493 INFO L421 ceAbstractionStarter]: For program point L102(line 102) no Hoare annotation was computed. [2018-07-22 11:37:38,494 INFO L421 ceAbstractionStarter]: For program point L586(lines 586 1024) no Hoare annotation was computed. [2018-07-22 11:37:38,494 INFO L421 ceAbstractionStarter]: For program point L101(lines 22 1026) no Hoare annotation was computed. [2018-07-22 11:37:38,494 INFO L421 ceAbstractionStarter]: For program point L105(line 105) no Hoare annotation was computed. [2018-07-22 11:37:38,494 INFO L421 ceAbstractionStarter]: For program point L104(lines 22 1026) no Hoare annotation was computed. [2018-07-22 11:37:38,494 INFO L421 ceAbstractionStarter]: For program point L346(lines 346 1024) no Hoare annotation was computed. [2018-07-22 11:37:38,494 INFO L421 ceAbstractionStarter]: For program point L587(lines 587 597) no Hoare annotation was computed. [2018-07-22 11:37:38,494 INFO L421 ceAbstractionStarter]: For program point L108(line 108) no Hoare annotation was computed. [2018-07-22 11:37:38,494 INFO L421 ceAbstractionStarter]: For program point L107(lines 22 1026) no Hoare annotation was computed. [2018-07-22 11:37:38,494 INFO L421 ceAbstractionStarter]: For program point L648''(lines 648 657) no Hoare annotation was computed. [2018-07-22 11:37:38,494 INFO L421 ceAbstractionStarter]: For program point L575(lines 575 1024) no Hoare annotation was computed. [2018-07-22 11:37:38,494 INFO L421 ceAbstractionStarter]: For program point L572(lines 572 1024) no Hoare annotation was computed. [2018-07-22 11:37:38,494 INFO L421 ceAbstractionStarter]: For program point L334(lines 334 1024) no Hoare annotation was computed. [2018-07-22 11:37:38,495 INFO L421 ceAbstractionStarter]: For program point L120(line 120) no Hoare annotation was computed. [2018-07-22 11:37:38,495 INFO L421 ceAbstractionStarter]: For program point L123(line 123) no Hoare annotation was computed. [2018-07-22 11:37:38,495 INFO L421 ceAbstractionStarter]: For program point L365(lines 365 1024) no Hoare annotation was computed. [2018-07-22 11:37:38,495 INFO L421 ceAbstractionStarter]: For program point L122(lines 22 1026) no Hoare annotation was computed. [2018-07-22 11:37:38,495 INFO L421 ceAbstractionStarter]: For program point L128(lines 22 1026) no Hoare annotation was computed. [2018-07-22 11:37:38,495 INFO L421 ceAbstractionStarter]: For program point L126(line 126) no Hoare annotation was computed. [2018-07-22 11:37:38,495 INFO L421 ceAbstractionStarter]: For program point L125(lines 22 1026) no Hoare annotation was computed. [2018-07-22 11:37:38,495 INFO L421 ceAbstractionStarter]: For program point L129(line 129) no Hoare annotation was computed. [2018-07-22 11:37:38,495 INFO L421 ceAbstractionStarter]: For program point L515''(lines 515 525) no Hoare annotation was computed. [2018-07-22 11:37:38,495 INFO L421 ceAbstractionStarter]: For program point L113(lines 22 1026) no Hoare annotation was computed. [2018-07-22 11:37:38,495 INFO L421 ceAbstractionStarter]: For program point L111(line 111) no Hoare annotation was computed. [2018-07-22 11:37:38,495 INFO L421 ceAbstractionStarter]: For program point L353(lines 353 1024) no Hoare annotation was computed. [2018-07-22 11:37:38,495 INFO L421 ceAbstractionStarter]: For program point L110(lines 22 1026) no Hoare annotation was computed. [2018-07-22 11:37:38,495 INFO L421 ceAbstractionStarter]: For program point L117(line 117) no Hoare annotation was computed. [2018-07-22 11:37:38,495 INFO L421 ceAbstractionStarter]: For program point L116(lines 22 1026) no Hoare annotation was computed. [2018-07-22 11:37:38,496 INFO L421 ceAbstractionStarter]: For program point L358(lines 358 1024) no Hoare annotation was computed. [2018-07-22 11:37:38,496 INFO L421 ceAbstractionStarter]: For program point L114(line 114) no Hoare annotation was computed. [2018-07-22 11:37:38,496 INFO L421 ceAbstractionStarter]: For program point L598(lines 598 1024) no Hoare annotation was computed. [2018-07-22 11:37:38,496 INFO L421 ceAbstractionStarter]: For program point L119(lines 22 1026) no Hoare annotation was computed. [2018-07-22 11:37:38,496 INFO L421 ceAbstractionStarter]: For program point L384(lines 384 1024) no Hoare annotation was computed. [2018-07-22 11:37:38,496 INFO L421 ceAbstractionStarter]: For program point L141(line 141) no Hoare annotation was computed. [2018-07-22 11:37:38,496 INFO L421 ceAbstractionStarter]: For program point L140(lines 22 1026) no Hoare annotation was computed. [2018-07-22 11:37:38,496 INFO L421 ceAbstractionStarter]: For program point L146(lines 22 1026) no Hoare annotation was computed. [2018-07-22 11:37:38,496 INFO L421 ceAbstractionStarter]: For program point L144(line 144) no Hoare annotation was computed. [2018-07-22 11:37:38,496 INFO L421 ceAbstractionStarter]: For program point L149(lines 22 1026) no Hoare annotation was computed. [2018-07-22 11:37:38,496 INFO L421 ceAbstractionStarter]: For program point L147(line 147) no Hoare annotation was computed. [2018-07-22 11:37:38,496 INFO L421 ceAbstractionStarter]: For program point L391(lines 391 1024) no Hoare annotation was computed. [2018-07-22 11:37:38,496 INFO L421 ceAbstractionStarter]: For program point L131(lines 22 1026) no Hoare annotation was computed. [2018-07-22 11:37:38,497 INFO L421 ceAbstractionStarter]: For program point L370(lines 370 1024) no Hoare annotation was computed. [2018-07-22 11:37:38,497 INFO L421 ceAbstractionStarter]: For program point L135(line 135) no Hoare annotation was computed. [2018-07-22 11:37:38,497 INFO L421 ceAbstractionStarter]: For program point L377(lines 377 1024) no Hoare annotation was computed. [2018-07-22 11:37:38,497 INFO L421 ceAbstractionStarter]: For program point L134(lines 22 1026) no Hoare annotation was computed. [2018-07-22 11:37:38,497 INFO L421 ceAbstractionStarter]: For program point L132(line 132) no Hoare annotation was computed. [2018-07-22 11:37:38,497 INFO L421 ceAbstractionStarter]: For program point L138(line 138) no Hoare annotation was computed. [2018-07-22 11:37:38,497 INFO L421 ceAbstractionStarter]: For program point L137(lines 22 1026) no Hoare annotation was computed. [2018-07-22 11:37:38,497 INFO L421 ceAbstractionStarter]: For program point L164(lines 22 1026) no Hoare annotation was computed. [2018-07-22 11:37:38,497 INFO L421 ceAbstractionStarter]: For program point L162(line 162) no Hoare annotation was computed. [2018-07-22 11:37:38,497 INFO L421 ceAbstractionStarter]: For program point L161(lines 22 1026) no Hoare annotation was computed. [2018-07-22 11:37:38,497 INFO L421 ceAbstractionStarter]: For program point L168(line 168) no Hoare annotation was computed. [2018-07-22 11:37:38,497 INFO L421 ceAbstractionStarter]: For program point L167(lines 22 1026) no Hoare annotation was computed. [2018-07-22 11:37:38,497 INFO L421 ceAbstractionStarter]: For program point L165(line 165) no Hoare annotation was computed. [2018-07-22 11:37:38,497 INFO L421 ceAbstractionStarter]: For program point L171(line 171) no Hoare annotation was computed. [2018-07-22 11:37:38,497 INFO L421 ceAbstractionStarter]: For program point L170(lines 22 1026) no Hoare annotation was computed. [2018-07-22 11:37:38,497 INFO L421 ceAbstractionStarter]: For program point L153(line 153) no Hoare annotation was computed. [2018-07-22 11:37:38,498 INFO L421 ceAbstractionStarter]: For program point L152(lines 22 1026) no Hoare annotation was computed. [2018-07-22 11:37:38,498 INFO L421 ceAbstractionStarter]: For program point L150(line 150) no Hoare annotation was computed. [2018-07-22 11:37:38,498 INFO L421 ceAbstractionStarter]: For program point L399(lines 399 410) no Hoare annotation was computed. [2018-07-22 11:37:38,498 INFO L421 ceAbstractionStarter]: For program point L156(line 156) no Hoare annotation was computed. [2018-07-22 11:37:38,498 INFO L421 ceAbstractionStarter]: For program point L398(lines 398 1024) no Hoare annotation was computed. [2018-07-22 11:37:38,498 INFO L421 ceAbstractionStarter]: For program point L155(lines 22 1026) no Hoare annotation was computed. [2018-07-22 11:37:38,498 INFO L421 ceAbstractionStarter]: For program point L159(line 159) no Hoare annotation was computed. [2018-07-22 11:37:38,498 INFO L421 ceAbstractionStarter]: For program point L158(lines 22 1026) no Hoare annotation was computed. [2018-07-22 11:37:38,498 INFO L421 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-07-22 11:37:38,498 INFO L421 ceAbstractionStarter]: For program point L604''(lines 604 614) no Hoare annotation was computed. [2018-07-22 11:37:38,498 INFO L421 ceAbstractionStarter]: For program point L186(line 186) no Hoare annotation was computed. [2018-07-22 11:37:38,498 INFO L421 ceAbstractionStarter]: For program point L185(lines 22 1026) no Hoare annotation was computed. [2018-07-22 11:37:38,498 INFO L421 ceAbstractionStarter]: For program point L183(line 183) no Hoare annotation was computed. [2018-07-22 11:37:38,498 INFO L421 ceAbstractionStarter]: For program point L189(line 189) no Hoare annotation was computed. [2018-07-22 11:37:38,498 INFO L421 ceAbstractionStarter]: For program point L188(lines 22 1026) no Hoare annotation was computed. [2018-07-22 11:37:38,498 INFO L421 ceAbstractionStarter]: For program point L192(line 192) no Hoare annotation was computed. [2018-07-22 11:37:38,498 INFO L421 ceAbstractionStarter]: For program point L191(lines 22 1026) no Hoare annotation was computed. [2018-07-22 11:37:38,499 INFO L421 ceAbstractionStarter]: For program point L174(line 174) no Hoare annotation was computed. [2018-07-22 11:37:38,499 INFO L421 ceAbstractionStarter]: For program point L173(lines 22 1026) no Hoare annotation was computed. [2018-07-22 11:37:38,499 INFO L421 ceAbstractionStarter]: For program point L179(lines 22 1026) no Hoare annotation was computed. [2018-07-22 11:37:38,499 INFO L421 ceAbstractionStarter]: For program point L177(line 177) no Hoare annotation was computed. [2018-07-22 11:37:38,499 INFO L421 ceAbstractionStarter]: For program point L176(lines 22 1026) no Hoare annotation was computed. [2018-07-22 11:37:38,499 INFO L421 ceAbstractionStarter]: For program point L182(lines 22 1026) no Hoare annotation was computed. [2018-07-22 11:37:38,499 INFO L421 ceAbstractionStarter]: For program point L180(line 180) no Hoare annotation was computed. [2018-07-22 11:37:38,499 INFO L421 ceAbstractionStarter]: For program point L197(lines 22 1026) no Hoare annotation was computed. [2018-07-22 11:37:38,499 INFO L421 ceAbstractionStarter]: For program point L195(line 195) no Hoare annotation was computed. [2018-07-22 11:37:38,499 INFO L421 ceAbstractionStarter]: For program point L194(lines 22 1026) no Hoare annotation was computed. [2018-07-22 11:37:38,499 INFO L421 ceAbstractionStarter]: For program point L198(line 198) no Hoare annotation was computed. [2018-07-22 11:37:38,499 INFO L421 ceAbstractionStarter]: For program point L23(lines 23 25) no Hoare annotation was computed. [2018-07-22 11:37:38,499 INFO L421 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2018-07-22 11:37:38,499 INFO L421 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2018-07-22 11:37:38,499 INFO L421 ceAbstractionStarter]: For program point L26(lines 22 1026) no Hoare annotation was computed. [2018-07-22 11:37:38,499 INFO L421 ceAbstractionStarter]: For program point L29(lines 22 1026) no Hoare annotation was computed. [2018-07-22 11:37:38,500 INFO L421 ceAbstractionStarter]: For program point L940''(lines 940 952) no Hoare annotation was computed. [2018-07-22 11:37:38,500 INFO L421 ceAbstractionStarter]: For program point L30(line 30) no Hoare annotation was computed. [2018-07-22 11:37:38,500 INFO L421 ceAbstractionStarter]: For program point L32(lines 22 1026) no Hoare annotation was computed. [2018-07-22 11:37:38,500 INFO L421 ceAbstractionStarter]: For program point L33(line 33) no Hoare annotation was computed. [2018-07-22 11:37:38,500 INFO L421 ceAbstractionStarter]: For program point L36(line 36) no Hoare annotation was computed. [2018-07-22 11:37:38,500 INFO L421 ceAbstractionStarter]: For program point L35(lines 22 1026) no Hoare annotation was computed. [2018-07-22 11:37:38,500 INFO L421 ceAbstractionStarter]: For program point L38(lines 22 1026) no Hoare annotation was computed. [2018-07-22 11:37:38,500 INFO L421 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2018-07-22 11:37:38,500 INFO L421 ceAbstractionStarter]: For program point L41(lines 22 1026) no Hoare annotation was computed. [2018-07-22 11:37:38,500 INFO L421 ceAbstractionStarter]: For program point L42(line 42) no Hoare annotation was computed. [2018-07-22 11:37:38,500 INFO L421 ceAbstractionStarter]: For program point L45(line 45) no Hoare annotation was computed. [2018-07-22 11:37:38,500 INFO L421 ceAbstractionStarter]: For program point L44(lines 22 1026) no Hoare annotation was computed. [2018-07-22 11:37:38,500 INFO L421 ceAbstractionStarter]: For program point L47(lines 22 1026) no Hoare annotation was computed. [2018-07-22 11:37:38,500 INFO L421 ceAbstractionStarter]: For program point L48(line 48) no Hoare annotation was computed. [2018-07-22 11:37:38,500 INFO L421 ceAbstractionStarter]: For program point L866''(lines 866 875) no Hoare annotation was computed. [2018-07-22 11:37:38,500 INFO L421 ceAbstractionStarter]: For program point L50(lines 22 1026) no Hoare annotation was computed. [2018-07-22 11:37:38,501 INFO L421 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2018-07-22 11:37:38,501 INFO L421 ceAbstractionStarter]: For program point L54(line 54) no Hoare annotation was computed. [2018-07-22 11:37:38,501 INFO L421 ceAbstractionStarter]: For program point L53(lines 22 1026) no Hoare annotation was computed. [2018-07-22 11:37:38,501 INFO L421 ceAbstractionStarter]: For program point L56(lines 22 1026) no Hoare annotation was computed. [2018-07-22 11:37:38,501 INFO L421 ceAbstractionStarter]: For program point L57(line 57) no Hoare annotation was computed. [2018-07-22 11:37:38,501 INFO L421 ceAbstractionStarter]: For program point L59(lines 22 1026) no Hoare annotation was computed. [2018-07-22 11:37:38,501 INFO L421 ceAbstractionStarter]: For program point L60(line 60) no Hoare annotation was computed. [2018-07-22 11:37:38,501 INFO L421 ceAbstractionStarter]: For program point L63(line 63) no Hoare annotation was computed. [2018-07-22 11:37:38,501 INFO L421 ceAbstractionStarter]: For program point L62(lines 22 1026) no Hoare annotation was computed. [2018-07-22 11:37:38,501 INFO L421 ceAbstractionStarter]: For program point L65(lines 22 1026) no Hoare annotation was computed. [2018-07-22 11:37:38,501 INFO L421 ceAbstractionStarter]: For program point L66(line 66) no Hoare annotation was computed. [2018-07-22 11:37:38,501 INFO L421 ceAbstractionStarter]: For program point L69(line 69) no Hoare annotation was computed. [2018-07-22 11:37:38,501 INFO L421 ceAbstractionStarter]: For program point L68(lines 22 1026) no Hoare annotation was computed. [2018-07-22 11:37:38,501 INFO L421 ceAbstractionStarter]: For program point L72(line 72) no Hoare annotation was computed. [2018-07-22 11:37:38,501 INFO L421 ceAbstractionStarter]: For program point L71(lines 22 1026) no Hoare annotation was computed. [2018-07-22 11:37:38,501 INFO L421 ceAbstractionStarter]: For program point L74(lines 22 1026) no Hoare annotation was computed. [2018-07-22 11:37:38,502 INFO L421 ceAbstractionStarter]: For program point L75(line 75) no Hoare annotation was computed. [2018-07-22 11:37:38,502 INFO L421 ceAbstractionStarter]: For program point L78(line 78) no Hoare annotation was computed. [2018-07-22 11:37:38,502 INFO L421 ceAbstractionStarter]: For program point L77(lines 22 1026) no Hoare annotation was computed. [2018-07-22 11:37:38,502 INFO L421 ceAbstractionStarter]: For program point L81(line 81) no Hoare annotation was computed. [2018-07-22 11:37:38,502 INFO L421 ceAbstractionStarter]: For program point L80(lines 22 1026) no Hoare annotation was computed. [2018-07-22 11:37:38,502 INFO L421 ceAbstractionStarter]: For program point L83(lines 22 1026) no Hoare annotation was computed. [2018-07-22 11:37:38,502 INFO L421 ceAbstractionStarter]: For program point L84(line 84) no Hoare annotation was computed. [2018-07-22 11:37:38,502 INFO L421 ceAbstractionStarter]: For program point L87(line 87) no Hoare annotation was computed. [2018-07-22 11:37:38,502 INFO L421 ceAbstractionStarter]: For program point L86(lines 22 1026) no Hoare annotation was computed. [2018-07-22 11:37:38,502 INFO L421 ceAbstractionStarter]: For program point L89(lines 22 1026) no Hoare annotation was computed. [2018-07-22 11:37:38,503 INFO L421 ceAbstractionStarter]: For program point L805(lines 805 815) no Hoare annotation was computed. [2018-07-22 11:37:38,503 INFO L421 ceAbstractionStarter]: For program point L804(lines 804 1024) no Hoare annotation was computed. [2018-07-22 11:37:38,503 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-07-22 11:37:38,503 INFO L421 ceAbstractionStarter]: For program point L916''(lines 916 926) no Hoare annotation was computed. [2018-07-22 11:37:38,503 INFO L421 ceAbstractionStarter]: For program point L90(line 90) no Hoare annotation was computed. [2018-07-22 11:37:38,503 INFO L421 ceAbstractionStarter]: For program point L92(lines 22 1026) no Hoare annotation was computed. [2018-07-22 11:37:38,503 INFO L421 ceAbstractionStarter]: For program point L93(line 93) no Hoare annotation was computed. [2018-07-22 11:37:38,503 INFO L421 ceAbstractionStarter]: For program point L96(line 96) no Hoare annotation was computed. [2018-07-22 11:37:38,503 INFO L421 ceAbstractionStarter]: For program point L95(lines 22 1026) no Hoare annotation was computed. [2018-07-22 11:37:38,503 INFO L421 ceAbstractionStarter]: For program point L98(lines 22 1026) no Hoare annotation was computed. [2018-07-22 11:37:38,504 INFO L421 ceAbstractionStarter]: For program point L99(line 99) no Hoare annotation was computed. [2018-07-22 11:37:38,504 INFO L421 ceAbstractionStarter]: For program point L825(lines 825 1024) no Hoare annotation was computed. [2018-07-22 11:37:38,504 INFO L421 ceAbstractionStarter]: For program point L822(lines 822 1024) no Hoare annotation was computed. [2018-07-22 11:37:38,504 INFO L421 ceAbstractionStarter]: For program point L816(lines 816 1024) no Hoare annotation was computed. [2018-07-22 11:37:38,504 INFO L421 ceAbstractionStarter]: For program point L841(lines 841 1024) no Hoare annotation was computed. [2018-07-22 11:37:38,504 INFO L421 ceAbstractionStarter]: For program point L604(lines 604 614) no Hoare annotation was computed. [2018-07-22 11:37:38,504 INFO L421 ceAbstractionStarter]: For program point L846(lines 846 1024) no Hoare annotation was computed. [2018-07-22 11:37:38,504 INFO L421 ceAbstractionStarter]: For program point L603(lines 603 1024) no Hoare annotation was computed. [2018-07-22 11:37:38,504 INFO L421 ceAbstractionStarter]: For program point L831(lines 831 1024) no Hoare annotation was computed. [2018-07-22 11:37:38,504 INFO L421 ceAbstractionStarter]: For program point L836(lines 836 1024) no Hoare annotation was computed. [2018-07-22 11:37:38,505 INFO L421 ceAbstractionStarter]: For program point L865(lines 865 1024) no Hoare annotation was computed. [2018-07-22 11:37:38,505 INFO L421 ceAbstractionStarter]: For program point L621(lines 621 1024) no Hoare annotation was computed. [2018-07-22 11:37:38,505 INFO L421 ceAbstractionStarter]: For program point L866(lines 866 875) no Hoare annotation was computed. [2018-07-22 11:37:38,505 INFO L421 ceAbstractionStarter]: For program point L628(lines 628 1024) no Hoare annotation was computed. [2018-07-22 11:37:38,505 INFO L421 ceAbstractionStarter]: For program point L852(lines 852 1024) no Hoare annotation was computed. [2018-07-22 11:37:38,505 INFO L421 ceAbstractionStarter]: For program point L615(lines 615 1024) no Hoare annotation was computed. [2018-07-22 11:37:38,505 INFO L421 ceAbstractionStarter]: For program point L859(lines 859 1024) no Hoare annotation was computed. [2018-07-22 11:37:38,505 INFO L421 ceAbstractionStarter]: For program point L881(lines 881 1024) no Hoare annotation was computed. [2018-07-22 11:37:38,505 INFO L421 ceAbstractionStarter]: For program point L886(lines 886 1024) no Hoare annotation was computed. [2018-07-22 11:37:38,505 INFO L421 ceAbstractionStarter]: For program point L642(lines 642 1024) no Hoare annotation was computed. [2018-07-22 11:37:38,505 INFO L421 ceAbstractionStarter]: For program point L648(lines 648 657) no Hoare annotation was computed. [2018-07-22 11:37:38,506 INFO L421 ceAbstractionStarter]: For program point L647(lines 647 1024) no Hoare annotation was computed. [2018-07-22 11:37:38,506 INFO L421 ceAbstractionStarter]: For program point L876(lines 876 1024) no Hoare annotation was computed. [2018-07-22 11:37:38,506 INFO L421 ceAbstractionStarter]: For program point L635(lines 635 1024) no Hoare annotation was computed. [2018-07-22 11:37:38,506 INFO L421 ceAbstractionStarter]: For program point L399''(lines 399 410) no Hoare annotation was computed. [2018-07-22 11:37:38,506 INFO L421 ceAbstractionStarter]: For program point L663(lines 663 1024) no Hoare annotation was computed. [2018-07-22 11:37:38,506 INFO L421 ceAbstractionStarter]: For program point L422(lines 422 1024) no Hoare annotation was computed. [2018-07-22 11:37:38,506 INFO L421 ceAbstractionStarter]: For program point L429(lines 429 1024) no Hoare annotation was computed. [2018-07-22 11:37:38,506 INFO L421 ceAbstractionStarter]: For program point L695''(lines 695 705) no Hoare annotation was computed. [2018-07-22 11:37:38,506 INFO L421 ceAbstractionStarter]: For program point L893(lines 893 1024) no Hoare annotation was computed. [2018-07-22 11:37:38,506 INFO L421 ceAbstractionStarter]: For program point L898(lines 898 1024) no Hoare annotation was computed. [2018-07-22 11:37:38,507 INFO L421 ceAbstractionStarter]: For program point L411(lines 411 1024) no Hoare annotation was computed. [2018-07-22 11:37:38,507 INFO L421 ceAbstractionStarter]: For program point L417(lines 417 1024) no Hoare annotation was computed. [2018-07-22 11:37:38,507 INFO L421 ceAbstractionStarter]: For program point L658(lines 658 1024) no Hoare annotation was computed. [2018-07-22 11:37:38,507 INFO L421 ceAbstractionStarter]: For program point L681(lines 681 1024) no Hoare annotation was computed. [2018-07-22 11:37:38,507 INFO L421 ceAbstractionStarter]: For program point L201(line 201) no Hoare annotation was computed. [2018-07-22 11:37:38,507 INFO L421 ceAbstractionStarter]: For program point L443(lines 443 1024) no Hoare annotation was computed. [2018-07-22 11:37:38,507 INFO L421 ceAbstractionStarter]: For program point L200(lines 22 1026) no Hoare annotation was computed. [2018-07-22 11:37:38,507 INFO L421 ceAbstractionStarter]: For program point L204(line 204) no Hoare annotation was computed. [2018-07-22 11:37:38,507 INFO L421 ceAbstractionStarter]: For program point L688(lines 688 1024) no Hoare annotation was computed. [2018-07-22 11:37:38,507 INFO L421 ceAbstractionStarter]: For program point L203(lines 22 1026) no Hoare annotation was computed. [2018-07-22 11:37:38,508 INFO L421 ceAbstractionStarter]: For program point L805''(lines 805 815) no Hoare annotation was computed. [2018-07-22 11:37:38,508 INFO L421 ceAbstractionStarter]: For program point L670(lines 670 1024) no Hoare annotation was computed. [2018-07-22 11:37:38,508 INFO L421 ceAbstractionStarter]: For program point L436(lines 436 1024) no Hoare annotation was computed. [2018-07-22 11:37:38,508 INFO L421 ceAbstractionStarter]: For program point L675(lines 675 1024) no Hoare annotation was computed. [2018-07-22 11:37:38,508 INFO L421 ceAbstractionStarter]: For program point L488''(lines 488 499) no Hoare annotation was computed. [2018-07-22 11:37:38,508 INFO L421 ceAbstractionStarter]: For program point L718''(lines 718 730) no Hoare annotation was computed. [2018-07-22 11:37:38,508 INFO L421 ceAbstractionStarter]: For program point L221(lines 221 1024) no Hoare annotation was computed. [2018-07-22 11:37:38,508 INFO L421 ceAbstractionStarter]: For program point L463(lines 463 1024) no Hoare annotation was computed. [2018-07-22 11:37:38,508 INFO L421 ceAbstractionStarter]: For program point L227(lines 227 1024) no Hoare annotation was computed. [2018-07-22 11:37:38,508 INFO L421 ceAbstractionStarter]: For program point L23'(lines 22 1026) no Hoare annotation was computed. [2018-07-22 11:37:38,509 INFO L421 ceAbstractionStarter]: For program point L450(lines 450 1024) no Hoare annotation was computed. [2018-07-22 11:37:38,510 INFO L421 ceAbstractionStarter]: For program point L695(lines 695 705) no Hoare annotation was computed. [2018-07-22 11:37:38,510 INFO L421 ceAbstractionStarter]: For program point L694(lines 694 1024) no Hoare annotation was computed. [2018-07-22 11:37:38,510 INFO L421 ceAbstractionStarter]: For program point L214(lines 214 1024) no Hoare annotation was computed. [2018-07-22 11:37:38,510 INFO L421 ceAbstractionStarter]: For program point L456(lines 456 1024) no Hoare annotation was computed. [2018-07-22 11:37:38,511 INFO L421 ceAbstractionStarter]: For program point L240(lines 240 1024) no Hoare annotation was computed. [2018-07-22 11:37:38,511 INFO L421 ceAbstractionStarter]: For program point L487(lines 487 1024) no Hoare annotation was computed. [2018-07-22 11:37:38,511 INFO L421 ceAbstractionStarter]: For program point L143'(lines 22 1026) no Hoare annotation was computed. [2018-07-22 11:37:38,511 INFO L421 ceAbstractionStarter]: For program point L247(lines 247 1024) no Hoare annotation was computed. [2018-07-22 11:37:38,511 INFO L421 ceAbstractionStarter]: For program point L488(lines 488 499) no Hoare annotation was computed. [2018-07-22 11:37:38,512 INFO L417 ceAbstractionStarter]: At program point L1034''(lines 1034 1043) the Hoare annotation is: (let ((.cse6 (= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25~0 10)) (.cse0 (<= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0 277)) (.cse7 (exists ((v_prenex_4 Int)) (and (<= 0 v_prenex_4) (<= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0 (+ (mod v_prenex_4 299861) 300139)) (< 277 v_prenex_4)))) (.cse11 (= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25~0 11)) (.cse3 (= 15 ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a8~0)) (.cse4 (= 1 ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3~0)) (.cse5 (= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4~0 1)) (.cse13 (= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25~0 13)) (.cse8 (< 0 (+ ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23~0 43))) (.cse12 (exists ((v_prenex_1 Int)) (let ((.cse14 (+ v_prenex_1 69157))) (and (<= 0 .cse14) (<= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0 (+ (mod .cse14 299861) 300138)) (<= 130 v_prenex_1))))) (.cse2 (or (<= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23~0 138) (< 306 ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23~0))) (.cse9 (= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25~0 9)) (.cse1 (<= 130 ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0)) (.cse10 (<= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0 599998))) (or (and .cse0 .cse1) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse2 .cse9 .cse0 .cse8) (and .cse6 (and .cse5 (<= 312 ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23~0) .cse10)) (and .cse10 .cse11) (and .cse2 .cse0 .cse6 .cse8) (and .cse3 .cse4 .cse6 (and .cse2 .cse5 .cse12)) (and .cse9 .cse3 .cse4 .cse5 .cse7) (and .cse2 .cse0 .cse13) (and .cse0 .cse3 .cse4 .cse5) (and .cse9 .cse5 (<= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0 130)) (and .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse11) (<= (+ ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0 22) 0) (and .cse3 .cse4 .cse5 .cse13 .cse8 .cse12) (and .cse2 .cse9 .cse1 .cse10))) [2018-07-22 11:37:38,512 INFO L421 ceAbstractionStarter]: For program point L470(lines 470 1024) no Hoare annotation was computed. [2018-07-22 11:37:38,512 INFO L421 ceAbstractionStarter]: For program point L233(lines 233 1024) no Hoare annotation was computed. [2018-07-22 11:37:38,512 INFO L421 ceAbstractionStarter]: For program point L478(lines 478 486) no Hoare annotation was computed. [2018-07-22 11:37:38,512 INFO L421 ceAbstractionStarter]: For program point L477(lines 477 1024) no Hoare annotation was computed. [2018-07-22 11:37:38,512 INFO L421 ceAbstractionStarter]: For program point L758''(lines 758 768) no Hoare annotation was computed. [2018-07-22 11:37:38,512 INFO L421 ceAbstractionStarter]: For program point L260(lines 260 1024) no Hoare annotation was computed. [2018-07-22 11:37:38,512 INFO L421 ceAbstractionStarter]: For program point L265(lines 265 1024) no Hoare annotation was computed. [2018-07-22 11:37:38,512 INFO L421 ceAbstractionStarter]: For program point L1012(lines 1012 1024) no Hoare annotation was computed. [2018-07-22 11:37:38,512 INFO L421 ceAbstractionStarter]: For program point L268(lines 268 1024) no Hoare annotation was computed. [2018-07-22 11:37:38,513 INFO L421 ceAbstractionStarter]: For program point L1017(lines 1017 1024) no Hoare annotation was computed. [2018-07-22 11:37:38,513 INFO L421 ceAbstractionStarter]: For program point L254(lines 254 1024) no Hoare annotation was computed. [2018-07-22 11:37:38,513 INFO L417 ceAbstractionStarter]: At program point L1025(lines 22 1026) the Hoare annotation is: (let ((.cse6 (= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25~0 10)) (.cse0 (<= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0 277)) (.cse7 (exists ((v_prenex_4 Int)) (and (<= 0 v_prenex_4) (<= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0 (+ (mod v_prenex_4 299861) 300139)) (< 277 v_prenex_4)))) (.cse11 (= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25~0 11)) (.cse3 (= 15 ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a8~0)) (.cse4 (= 1 ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3~0)) (.cse5 (= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4~0 1)) (.cse13 (= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25~0 13)) (.cse8 (< 0 (+ ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23~0 43))) (.cse12 (exists ((v_prenex_1 Int)) (let ((.cse14 (+ v_prenex_1 69157))) (and (<= 0 .cse14) (<= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0 (+ (mod .cse14 299861) 300138)) (<= 130 v_prenex_1))))) (.cse2 (or (<= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23~0 138) (< 306 ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23~0))) (.cse9 (= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25~0 9)) (.cse1 (<= 130 ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0)) (.cse10 (<= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0 599998))) (or (and .cse0 .cse1) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse2 .cse9 .cse0 .cse8) (and .cse6 (and .cse5 (<= 312 ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23~0) .cse10)) (and .cse10 .cse11) (and .cse2 .cse0 .cse6 .cse8) (and .cse3 .cse4 .cse6 (and .cse2 .cse5 .cse12)) (and .cse9 .cse3 .cse4 .cse5 .cse7) (and .cse2 .cse0 .cse13) (and .cse0 .cse3 .cse4 .cse5) (and .cse9 .cse5 (<= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0 130)) (and .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse11) (<= (+ ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29~0 22) 0) (and .cse3 .cse4 .cse5 .cse13 .cse8 .cse12) (and .cse2 .cse9 .cse1 .cse10))) [2018-07-22 11:37:38,513 INFO L424 ceAbstractionStarter]: At program point L1028(lines 1028 1044) the Hoare annotation is: true [2018-07-22 11:37:38,513 INFO L421 ceAbstractionStarter]: For program point L287(lines 287 1024) no Hoare annotation was computed. [2018-07-22 11:37:38,513 INFO L421 ceAbstractionStarter]: For program point L275(lines 275 1024) no Hoare annotation was computed. [2018-07-22 11:37:38,513 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startErr0AssertViolationERROR_FUNCTION(line 144) no Hoare annotation was computed. [2018-07-22 11:37:38,514 INFO L421 ceAbstractionStarter]: For program point L1000(lines 1000 1024) no Hoare annotation was computed. [2018-07-22 11:37:38,515 INFO L421 ceAbstractionStarter]: For program point L1005(lines 1005 1024) no Hoare annotation was computed. [2018-07-22 11:37:38,515 INFO L421 ceAbstractionStarter]: For program point L280(lines 280 1024) no Hoare annotation was computed. [2018-07-22 11:37:38,516 INFO L421 ceAbstractionStarter]: For program point L294(lines 294 1024) no Hoare annotation was computed. [2018-07-22 11:37:38,516 INFO L421 ceAbstractionStarter]: For program point L299(lines 299 1024) no Hoare annotation was computed. [2018-07-22 11:37:38,516 INFO L421 ceAbstractionStarter]: For program point L1034(lines 1034 1043) no Hoare annotation was computed. [2018-07-22 11:37:38,516 INFO L421 ceAbstractionStarter]: For program point L1039(line 1039) no Hoare annotation was computed. [2018-07-22 11:37:38,523 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-07-22 11:37:38,524 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-07-22 11:37:38,525 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-07-22 11:37:38,525 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-07-22 11:37:38,526 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-07-22 11:37:38,526 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-07-22 11:37:38,526 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-07-22 11:37:38,526 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-07-22 11:37:38,527 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-07-22 11:37:38,527 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-07-22 11:37:38,527 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-07-22 11:37:38,527 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-07-22 11:37:38,528 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-07-22 11:37:38,528 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-07-22 11:37:38,528 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-07-22 11:37:38,542 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-07-22 11:37:38,543 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-07-22 11:37:38,543 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-07-22 11:37:38,544 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-07-22 11:37:38,544 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-07-22 11:37:38,544 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-07-22 11:37:38,544 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-07-22 11:37:38,545 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-07-22 11:37:38,545 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-07-22 11:37:38,545 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-07-22 11:37:38,545 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-07-22 11:37:38,546 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-07-22 11:37:38,546 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-07-22 11:37:38,546 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-07-22 11:37:38,546 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-07-22 11:37:38,550 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-07-22 11:37:38,550 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-07-22 11:37:38,554 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-07-22 11:37:38,554 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-07-22 11:37:38,554 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-07-22 11:37:38,555 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-07-22 11:37:38,555 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-07-22 11:37:38,555 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-07-22 11:37:38,555 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-07-22 11:37:38,556 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-07-22 11:37:38,556 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-07-22 11:37:38,556 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-07-22 11:37:38,556 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-07-22 11:37:38,557 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-07-22 11:37:38,557 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-07-22 11:37:38,559 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-07-22 11:37:38,559 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-07-22 11:37:38,560 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-07-22 11:37:38,560 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-07-22 11:37:38,560 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-07-22 11:37:38,561 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-07-22 11:37:38,561 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-07-22 11:37:38,561 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-07-22 11:37:38,561 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-07-22 11:37:38,561 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-07-22 11:37:38,562 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-07-22 11:37:38,562 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-07-22 11:37:38,562 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-07-22 11:37:38,562 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-07-22 11:37:38,562 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-07-22 11:37:38,570 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.07 11:37:38 BoogieIcfgContainer [2018-07-22 11:37:38,570 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-22 11:37:38,571 INFO L168 Benchmark]: Toolchain (without parser) took 219250.29 ms. Allocated memory was 309.3 MB in the beginning and 1.3 GB in the end (delta: 1.0 GB). Free memory was 252.2 MB in the beginning and 223.0 MB in the end (delta: 29.2 MB). Peak memory consumption was 1.0 GB. Max. memory is 5.3 GB. [2018-07-22 11:37:38,572 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 309.3 MB. Free memory is still 274.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-07-22 11:37:38,573 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1066.25 ms. Allocated memory was 309.3 MB in the beginning and 336.6 MB in the end (delta: 27.3 MB). Free memory was 251.2 MB in the beginning and 293.0 MB in the end (delta: -41.8 MB). Peak memory consumption was 79.3 MB. Max. memory is 5.3 GB. [2018-07-22 11:37:38,573 INFO L168 Benchmark]: Boogie Procedure Inliner took 168.08 ms. Allocated memory is still 336.6 MB. Free memory was 293.0 MB in the beginning and 272.8 MB in the end (delta: 20.2 MB). Peak memory consumption was 20.2 MB. Max. memory is 5.3 GB. [2018-07-22 11:37:38,574 INFO L168 Benchmark]: Boogie Preprocessor took 430.95 ms. Allocated memory was 336.6 MB in the beginning and 520.1 MB in the end (delta: 183.5 MB). Free memory was 272.8 MB in the beginning and 479.6 MB in the end (delta: -206.8 MB). Peak memory consumption was 19.7 MB. Max. memory is 5.3 GB. [2018-07-22 11:37:38,575 INFO L168 Benchmark]: RCFGBuilder took 4346.32 ms. Allocated memory is still 520.1 MB. Free memory was 479.6 MB in the beginning and 291.6 MB in the end (delta: 188.0 MB). Peak memory consumption was 188.0 MB. Max. memory is 5.3 GB. [2018-07-22 11:37:38,575 INFO L168 Benchmark]: TraceAbstraction took 213226.30 ms. Allocated memory was 520.1 MB in the beginning and 1.3 GB in the end (delta: 803.2 MB). Free memory was 291.6 MB in the beginning and 223.0 MB in the end (delta: 68.6 MB). Peak memory consumption was 871.8 MB. Max. memory is 5.3 GB. [2018-07-22 11:37:38,579 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.17 ms. Allocated memory is still 309.3 MB. Free memory is still 274.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 1066.25 ms. Allocated memory was 309.3 MB in the beginning and 336.6 MB in the end (delta: 27.3 MB). Free memory was 251.2 MB in the beginning and 293.0 MB in the end (delta: -41.8 MB). Peak memory consumption was 79.3 MB. Max. memory is 5.3 GB. * Boogie Procedure Inliner took 168.08 ms. Allocated memory is still 336.6 MB. Free memory was 293.0 MB in the beginning and 272.8 MB in the end (delta: 20.2 MB). Peak memory consumption was 20.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 430.95 ms. Allocated memory was 336.6 MB in the beginning and 520.1 MB in the end (delta: 183.5 MB). Free memory was 272.8 MB in the beginning and 479.6 MB in the end (delta: -206.8 MB). Peak memory consumption was 19.7 MB. Max. memory is 5.3 GB. * RCFGBuilder took 4346.32 ms. Allocated memory is still 520.1 MB. Free memory was 479.6 MB in the beginning and 291.6 MB in the end (delta: 188.0 MB). Peak memory consumption was 188.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 213226.30 ms. Allocated memory was 520.1 MB in the beginning and 1.3 GB in the end (delta: 803.2 MB). Free memory was 291.6 MB in the beginning and 223.0 MB in the end (delta: 68.6 MB). Peak memory consumption was 871.8 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 144]: 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-22 11:37:38,589 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-07-22 11:37:38,589 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-07-22 11:37:38,590 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-07-22 11:37:38,590 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-07-22 11:37:38,590 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-07-22 11:37:38,590 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-07-22 11:37:38,591 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-07-22 11:37:38,591 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-07-22 11:37:38,591 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-07-22 11:37:38,591 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-07-22 11:37:38,591 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-07-22 11:37:38,592 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-07-22 11:37:38,592 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-07-22 11:37:38,592 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-07-22 11:37:38,592 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-07-22 11:37:38,594 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-07-22 11:37:38,595 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-07-22 11:37:38,595 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-07-22 11:37:38,595 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-07-22 11:37:38,595 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-07-22 11:37:38,596 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-07-22 11:37:38,596 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-07-22 11:37:38,596 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-07-22 11:37:38,596 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-07-22 11:37:38,596 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-07-22 11:37:38,597 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-07-22 11:37:38,597 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-07-22 11:37:38,597 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-07-22 11:37:38,597 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-07-22 11:37:38,597 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: ((((((((((((((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 <= 277 && 130 <= __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29) || (((((((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23 <= 138 || 306 < __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23) && 15 == __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a8) && 1 == __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 == 1) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25 == 10) && (\exists v_prenex_4 : int :: (0 <= v_prenex_4 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 <= v_prenex_4 % 299861 + 300139) && 277 < v_prenex_4)) && 0 < __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23 + 43)) || ((((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23 <= 138 || 306 < __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25 == 9) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 <= 277) && 0 < __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23 + 43)) || (__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25 == 10 && (__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 == 1 && 312 <= __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 <= 599998)) || (__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 <= 599998 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25 == 11)) || ((((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23 <= 138 || 306 < __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 <= 277) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25 == 10) && 0 < __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23 + 43)) || (((15 == __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a8 && 1 == __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25 == 10) && ((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23 <= 138 || 306 < __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 == 1) && (\exists v_prenex_1 : int :: (0 <= v_prenex_1 + 69157 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 <= (v_prenex_1 + 69157) % 299861 + 300138) && 130 <= v_prenex_1))) || ((((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25 == 9 && 15 == __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a8) && 1 == __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 == 1) && (\exists v_prenex_4 : int :: (0 <= v_prenex_4 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 <= v_prenex_4 % 299861 + 300139) && 277 < v_prenex_4))) || (((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23 <= 138 || 306 < __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 <= 277) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25 == 13)) || (((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 <= 277 && 15 == __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a8) && 1 == __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 == 1)) || ((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25 == 9 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 == 1) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 <= 130)) || (((((((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23 <= 138 || 306 < __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23) && 15 == __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a8) && 1 == __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 == 1) && (\exists v_prenex_4 : int :: (0 <= v_prenex_4 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 <= v_prenex_4 % 299861 + 300139) && 277 < v_prenex_4)) && 0 < __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23 + 43) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25 == 11)) || __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 + 22 <= 0) || (((((15 == __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a8 && 1 == __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 == 1) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25 == 13) && 0 < __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23 + 43) && (\exists v_prenex_1 : int :: (0 <= v_prenex_1 + 69157 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 <= (v_prenex_1 + 69157) % 299861 + 300138) && 130 <= v_prenex_1))) || ((((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23 <= 138 || 306 < __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25 == 9) && 130 <= __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 <= 599998) - InvariantResult [Line: 1034]: Loop Invariant [2018-07-22 11:37:38,600 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-07-22 11:37:38,600 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-07-22 11:37:38,600 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-07-22 11:37:38,600 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-07-22 11:37:38,601 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-07-22 11:37:38,601 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-07-22 11:37:38,601 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-07-22 11:37:38,601 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-07-22 11:37:38,601 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-07-22 11:37:38,602 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-07-22 11:37:38,602 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-07-22 11:37:38,602 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-07-22 11:37:38,602 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-07-22 11:37:38,602 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-07-22 11:37:38,603 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-07-22 11:37:38,604 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-07-22 11:37:38,610 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-07-22 11:37:38,611 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-07-22 11:37:38,611 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-07-22 11:37:38,611 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-07-22 11:37:38,611 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-07-22 11:37:38,612 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-07-22 11:37:38,612 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-07-22 11:37:38,612 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-07-22 11:37:38,612 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-07-22 11:37:38,612 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-07-22 11:37:38,612 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-07-22 11:37:38,613 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-07-22 11:37:38,613 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-07-22 11:37:38,613 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: ((((((((((((((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 <= 277 && 130 <= __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29) || (((((((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23 <= 138 || 306 < __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23) && 15 == __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a8) && 1 == __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 == 1) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25 == 10) && (\exists v_prenex_4 : int :: (0 <= v_prenex_4 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 <= v_prenex_4 % 299861 + 300139) && 277 < v_prenex_4)) && 0 < __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23 + 43)) || ((((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23 <= 138 || 306 < __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25 == 9) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 <= 277) && 0 < __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23 + 43)) || (__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25 == 10 && (__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 == 1 && 312 <= __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 <= 599998)) || (__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 <= 599998 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25 == 11)) || ((((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23 <= 138 || 306 < __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 <= 277) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25 == 10) && 0 < __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23 + 43)) || (((15 == __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a8 && 1 == __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25 == 10) && ((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23 <= 138 || 306 < __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 == 1) && (\exists v_prenex_1 : int :: (0 <= v_prenex_1 + 69157 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 <= (v_prenex_1 + 69157) % 299861 + 300138) && 130 <= v_prenex_1))) || ((((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25 == 9 && 15 == __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a8) && 1 == __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 == 1) && (\exists v_prenex_4 : int :: (0 <= v_prenex_4 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 <= v_prenex_4 % 299861 + 300139) && 277 < v_prenex_4))) || (((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23 <= 138 || 306 < __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 <= 277) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25 == 13)) || (((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 <= 277 && 15 == __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a8) && 1 == __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 == 1)) || ((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25 == 9 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 == 1) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 <= 130)) || (((((((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23 <= 138 || 306 < __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23) && 15 == __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a8) && 1 == __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 == 1) && (\exists v_prenex_4 : int :: (0 <= v_prenex_4 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 <= v_prenex_4 % 299861 + 300139) && 277 < v_prenex_4)) && 0 < __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23 + 43) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25 == 11)) || __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 + 22 <= 0) || (((((15 == __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a8 && 1 == __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a3) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a4 == 1) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25 == 13) && 0 < __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23 + 43) && (\exists v_prenex_1 : int :: (0 <= v_prenex_1 + 69157 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 <= (v_prenex_1 + 69157) % 299861 + 300138) && 130 <= v_prenex_1))) || ((((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23 <= 138 || 306 < __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a23) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a25 == 9) && 130 <= __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a29 <= 599998) - 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, 213.1s OverallTime, 9 OverallIterations, 5 TraceHistogramMax, 173.7s AutomataDifference, 0.0s DeadEndRemovalTime, 25.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 1751 SDtfs, 13161 SDslu, 1606 SDs, 0 SdLazy, 24513 SolverSat, 8151 SolverUnsat, 156 SolverUnknown, 0 SolverNotchecked, 158.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1437 GetRequests, 1359 SyntacticMatches, 2 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 475 ImplicationChecksByTransitivity, 14.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18631occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.7s AutomataMinimizationTime, 9 MinimizatonAttempts, 7488 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 260 NumberOfFragments, 623 HoareAnnotationTreeSize, 3 FomulaSimplifications, 18838 FormulaSimplificationTreeSizeReduction, 0.7s HoareSimplificationTime, 3 FomulaSimplificationsInter, 6414 FormulaSimplificationTreeSizeReductionInter, 25.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 9.3s InterpolantComputationTime, 4370 NumberOfCodeBlocks, 4370 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 4358 ConstructedInterpolants, 358 QuantifiedInterpolants, 10480672 SizeOfPredicates, 12 NumberOfNonLiveVariables, 1713 ConjunctsInSsa, 35 ConjunctsInUnsatCore, 12 InterpolantComputations, 7 PerfectInterpolantSequences, 3863/4659 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/Problem11_label57_true-unreach-call.c_svcomp-Reach-64bit-Automizer_Default.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-07-22_11-37-38-629.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/Problem11_label57_true-unreach-call.c_svcomp-Reach-64bit-Automizer_Default.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-22_11-37-38-629.csv Received shutdown request...