java -Xmx8000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --generate-csv --csv-dir csv -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem14_label23_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-dd2f093 [2018-07-24 02:58:44,263 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-24 02:58:44,265 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-24 02:58:44,282 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-24 02:58:44,283 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-24 02:58:44,285 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-24 02:58:44,286 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-24 02:58:44,289 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-24 02:58:44,290 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-24 02:58:44,291 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-24 02:58:44,292 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-24 02:58:44,293 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-24 02:58:44,296 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-24 02:58:44,297 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-24 02:58:44,298 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-24 02:58:44,300 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-24 02:58:44,301 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-24 02:58:44,308 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-24 02:58:44,314 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-24 02:58:44,315 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-24 02:58:44,316 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-24 02:58:44,318 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-24 02:58:44,325 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-24 02:58:44,325 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-24 02:58:44,325 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-24 02:58:44,326 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-24 02:58:44,327 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-24 02:58:44,331 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-24 02:58:44,332 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-24 02:58:44,335 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-24 02:58:44,335 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-24 02:58:44,336 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-24 02:58:44,336 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-24 02:58:44,336 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-24 02:58:44,337 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-24 02:58:44,339 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-24 02:58:44,339 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-07-24 02:58:44,368 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-24 02:58:44,369 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-24 02:58:44,369 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-07-24 02:58:44,370 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-07-24 02:58:44,370 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-07-24 02:58:44,374 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-07-24 02:58:44,374 INFO L133 SettingsManager]: * Use SBE=true [2018-07-24 02:58:44,375 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-07-24 02:58:44,375 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-07-24 02:58:44,375 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-07-24 02:58:44,375 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-07-24 02:58:44,375 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-07-24 02:58:44,375 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-07-24 02:58:44,376 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-07-24 02:58:44,376 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-07-24 02:58:44,376 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-24 02:58:44,378 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-07-24 02:58:44,378 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-07-24 02:58:44,378 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-07-24 02:58:44,378 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-07-24 02:58:44,379 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-24 02:58:44,379 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-07-24 02:58:44,379 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-07-24 02:58:44,379 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-07-24 02:58:44,380 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-07-24 02:58:44,380 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-07-24 02:58:44,380 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-24 02:58:44,380 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-07-24 02:58:44,437 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-24 02:58:44,451 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-24 02:58:44,454 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-24 02:58:44,456 INFO L271 PluginConnector]: Initializing CDTParser... [2018-07-24 02:58:44,456 INFO L276 PluginConnector]: CDTParser initialized [2018-07-24 02:58:44,457 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem14_label23_true-unreach-call_false-termination.c [2018-07-24 02:58:44,811 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27e2fae7b/070a3e21283141a3a8f8bb93769c14d1/FLAG2e9288e81 [2018-07-24 02:58:45,112 INFO L276 CDTParser]: Found 1 translation units. [2018-07-24 02:58:45,113 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem14_label23_true-unreach-call_false-termination.c [2018-07-24 02:58:45,145 INFO L324 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27e2fae7b/070a3e21283141a3a8f8bb93769c14d1/FLAG2e9288e81 [2018-07-24 02:58:45,172 INFO L332 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27e2fae7b/070a3e21283141a3a8f8bb93769c14d1 [2018-07-24 02:58:45,184 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-24 02:58:45,187 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-07-24 02:58:45,188 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-07-24 02:58:45,188 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-07-24 02:58:45,197 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-07-24 02:58:45,198 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.07 02:58:45" (1/1) ... [2018-07-24 02:58:45,202 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a3acb40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 02:58:45, skipping insertion in model container [2018-07-24 02:58:45,202 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.07 02:58:45" (1/1) ... [2018-07-24 02:58:45,396 INFO L179 PRDispatcher]: Starting pre-run dispatcher in SV-COMP mode [2018-07-24 02:58:45,718 INFO L175 PostProcessor]: Settings: Checked method=main [2018-07-24 02:58:45,738 INFO L422 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-07-24 02:58:45,916 INFO L175 PostProcessor]: Settings: Checked method=main [2018-07-24 02:58:45,969 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 02:58:45 WrapperNode [2018-07-24 02:58:45,970 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-07-24 02:58:45,971 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-07-24 02:58:45,971 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-07-24 02:58:45,971 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-07-24 02:58:45,981 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 02:58:45" (1/1) ... [2018-07-24 02:58:46,018 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 02:58:45" (1/1) ... [2018-07-24 02:58:46,121 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-07-24 02:58:46,122 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-24 02:58:46,122 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-24 02:58:46,122 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-24 02:58:46,134 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 02:58:45" (1/1) ... [2018-07-24 02:58:46,135 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 02:58:45" (1/1) ... [2018-07-24 02:58:46,141 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 02:58:45" (1/1) ... [2018-07-24 02:58:46,142 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 02:58:45" (1/1) ... [2018-07-24 02:58:46,366 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 02:58:45" (1/1) ... [2018-07-24 02:58:46,379 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 02:58:45" (1/1) ... [2018-07-24 02:58:46,391 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 02:58:45" (1/1) ... [2018-07-24 02:58:46,405 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-24 02:58:46,406 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-24 02:58:46,406 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-24 02:58:46,406 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-24 02:58:46,407 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 02:58:45" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-07-24 02:58:46,475 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-07-24 02:58:46,475 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-07-24 02:58:46,475 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-07-24 02:58:50,100 INFO L261 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-07-24 02:58:50,103 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.07 02:58:50 BoogieIcfgContainer [2018-07-24 02:58:50,103 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-24 02:58:50,105 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-24 02:58:50,105 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-24 02:58:50,116 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-24 02:58:50,116 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.07 02:58:45" (1/3) ... [2018-07-24 02:58:50,117 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49961d36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.07 02:58:50, skipping insertion in model container [2018-07-24 02:58:50,117 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 02:58:45" (2/3) ... [2018-07-24 02:58:50,119 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49961d36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.07 02:58:50, skipping insertion in model container [2018-07-24 02:58:50,119 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.07 02:58:50" (3/3) ... [2018-07-24 02:58:50,122 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem14_label23_true-unreach-call_false-termination.c [2018-07-24 02:58:50,139 INFO L132 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-07-24 02:58:50,155 INFO L144 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-24 02:58:50,223 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-24 02:58:50,224 INFO L373 AbstractCegarLoop]: Interprodecural is true [2018-07-24 02:58:50,226 INFO L374 AbstractCegarLoop]: Hoare is true [2018-07-24 02:58:50,227 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-07-24 02:58:50,227 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-07-24 02:58:50,227 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-24 02:58:50,227 INFO L378 AbstractCegarLoop]: Difference is false [2018-07-24 02:58:50,227 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-24 02:58:50,228 INFO L384 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-24 02:58:50,261 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states. [2018-07-24 02:58:50,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-07-24 02:58:50,268 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 02:58:50,269 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 02:58:50,270 INFO L414 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 02:58:50,274 INFO L82 PathProgramCache]: Analyzing trace with hash 575043410, now seen corresponding path program 1 times [2018-07-24 02:58:50,276 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 02:58:50,276 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 02:58:50,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 02:58:50,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 02:58:50,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 02:58:50,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 02:58:50,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 02:58:50,683 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 02:58:50,683 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-24 02:58:50,688 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-24 02:58:50,703 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-24 02:58:50,704 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 02:58:50,707 INFO L87 Difference]: Start difference. First operand 246 states. Second operand 4 states. [2018-07-24 02:58:53,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 02:58:53,802 INFO L93 Difference]: Finished difference Result 854 states and 1562 transitions. [2018-07-24 02:58:53,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-24 02:58:53,804 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2018-07-24 02:58:53,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 02:58:53,828 INFO L225 Difference]: With dead ends: 854 [2018-07-24 02:58:53,828 INFO L226 Difference]: Without dead ends: 601 [2018-07-24 02:58:53,833 INFO L573 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-24 02:58:53,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2018-07-24 02:58:53,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 601. [2018-07-24 02:58:53,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 601 states. [2018-07-24 02:58:53,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 1045 transitions. [2018-07-24 02:58:53,928 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 1045 transitions. Word has length 33 [2018-07-24 02:58:53,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 02:58:53,929 INFO L471 AbstractCegarLoop]: Abstraction has 601 states and 1045 transitions. [2018-07-24 02:58:53,929 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-24 02:58:53,929 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 1045 transitions. [2018-07-24 02:58:53,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-07-24 02:58:53,934 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 02:58:53,934 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 02:58:53,935 INFO L414 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 02:58:53,935 INFO L82 PathProgramCache]: Analyzing trace with hash -2032441875, now seen corresponding path program 1 times [2018-07-24 02:58:53,935 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 02:58:53,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 02:58:53,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 02:58:53,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 02:58:53,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 02:58:53,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 02:58:54,218 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 02:58:54,218 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 02:58:54,218 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-24 02:58:54,220 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-24 02:58:54,221 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-24 02:58:54,221 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 02:58:54,221 INFO L87 Difference]: Start difference. First operand 601 states and 1045 transitions. Second operand 4 states. [2018-07-24 02:58:57,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 02:58:57,017 INFO L93 Difference]: Finished difference Result 1379 states and 2382 transitions. [2018-07-24 02:58:57,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-24 02:58:57,019 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2018-07-24 02:58:57,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 02:58:57,025 INFO L225 Difference]: With dead ends: 1379 [2018-07-24 02:58:57,025 INFO L226 Difference]: Without dead ends: 780 [2018-07-24 02:58:57,029 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 02:58:57,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 780 states. [2018-07-24 02:58:57,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 780 to 780. [2018-07-24 02:58:57,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2018-07-24 02:58:57,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 1189 transitions. [2018-07-24 02:58:57,061 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 1189 transitions. Word has length 104 [2018-07-24 02:58:57,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 02:58:57,062 INFO L471 AbstractCegarLoop]: Abstraction has 780 states and 1189 transitions. [2018-07-24 02:58:57,062 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-24 02:58:57,062 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 1189 transitions. [2018-07-24 02:58:57,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-07-24 02:58:57,068 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 02:58:57,068 INFO L353 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-07-24 02:58:57,069 INFO L414 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 02:58:57,069 INFO L82 PathProgramCache]: Analyzing trace with hash 2057496071, now seen corresponding path program 1 times [2018-07-24 02:58:57,069 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 02:58:57,069 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 02:58:57,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 02:58:57,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 02:58:57,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 02:58:57,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 02:58:57,293 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-07-24 02:58:57,293 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 02:58:57,293 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-24 02:58:57,294 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-24 02:58:57,294 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-24 02:58:57,294 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 02:58:57,295 INFO L87 Difference]: Start difference. First operand 780 states and 1189 transitions. Second operand 4 states. [2018-07-24 02:59:00,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 02:59:00,552 INFO L93 Difference]: Finished difference Result 2990 states and 4628 transitions. [2018-07-24 02:59:00,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-24 02:59:00,553 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 179 [2018-07-24 02:59:00,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 02:59:00,565 INFO L225 Difference]: With dead ends: 2990 [2018-07-24 02:59:00,566 INFO L226 Difference]: Without dead ends: 2212 [2018-07-24 02:59:00,568 INFO L573 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-24 02:59:00,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2212 states. [2018-07-24 02:59:00,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2212 to 2212. [2018-07-24 02:59:00,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2212 states. [2018-07-24 02:59:00,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2212 states to 2212 states and 3097 transitions. [2018-07-24 02:59:00,614 INFO L78 Accepts]: Start accepts. Automaton has 2212 states and 3097 transitions. Word has length 179 [2018-07-24 02:59:00,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 02:59:00,615 INFO L471 AbstractCegarLoop]: Abstraction has 2212 states and 3097 transitions. [2018-07-24 02:59:00,615 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-24 02:59:00,615 INFO L276 IsEmpty]: Start isEmpty. Operand 2212 states and 3097 transitions. [2018-07-24 02:59:00,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-07-24 02:59:00,622 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 02:59:00,622 INFO L353 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 02:59:00,622 INFO L414 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 02:59:00,623 INFO L82 PathProgramCache]: Analyzing trace with hash 1142963764, now seen corresponding path program 1 times [2018-07-24 02:59:00,623 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 02:59:00,623 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 02:59:00,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 02:59:00,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 02:59:00,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 02:59:00,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 02:59:00,839 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-07-24 02:59:00,840 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 02:59:00,840 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-24 02:59:00,840 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-24 02:59:00,841 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-24 02:59:00,841 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 02:59:00,841 INFO L87 Difference]: Start difference. First operand 2212 states and 3097 transitions. Second operand 4 states. [2018-07-24 02:59:02,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 02:59:02,637 INFO L93 Difference]: Finished difference Result 6939 states and 9707 transitions. [2018-07-24 02:59:02,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-24 02:59:02,637 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 182 [2018-07-24 02:59:02,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 02:59:02,660 INFO L225 Difference]: With dead ends: 6939 [2018-07-24 02:59:02,660 INFO L226 Difference]: Without dead ends: 4729 [2018-07-24 02:59:02,665 INFO L573 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-24 02:59:02,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4729 states. [2018-07-24 02:59:02,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4729 to 4729. [2018-07-24 02:59:02,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4729 states. [2018-07-24 02:59:02,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4729 states to 4729 states and 6116 transitions. [2018-07-24 02:59:02,755 INFO L78 Accepts]: Start accepts. Automaton has 4729 states and 6116 transitions. Word has length 182 [2018-07-24 02:59:02,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 02:59:02,755 INFO L471 AbstractCegarLoop]: Abstraction has 4729 states and 6116 transitions. [2018-07-24 02:59:02,755 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-24 02:59:02,756 INFO L276 IsEmpty]: Start isEmpty. Operand 4729 states and 6116 transitions. [2018-07-24 02:59:02,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-07-24 02:59:02,759 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 02:59:02,759 INFO L353 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-07-24 02:59:02,759 INFO L414 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 02:59:02,760 INFO L82 PathProgramCache]: Analyzing trace with hash -2042309614, now seen corresponding path program 1 times [2018-07-24 02:59:02,760 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 02:59:02,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 02:59:02,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 02:59:02,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 02:59:02,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 02:59:02,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 02:59:03,166 WARN L169 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 9 [2018-07-24 02:59:03,404 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 134 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-07-24 02:59:03,404 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 02:59:03,405 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-24 02:59:03,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 02:59:03,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 02:59:03,496 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 02:59:03,622 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-07-24 02:59:03,652 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-07-24 02:59:03,652 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-07-24 02:59:03,653 INFO L450 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-24 02:59:03,653 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-24 02:59:03,653 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-07-24 02:59:03,653 INFO L87 Difference]: Start difference. First operand 4729 states and 6116 transitions. Second operand 6 states. [2018-07-24 02:59:09,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 02:59:09,060 INFO L93 Difference]: Finished difference Result 12150 states and 15539 transitions. [2018-07-24 02:59:09,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-24 02:59:09,061 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 194 [2018-07-24 02:59:09,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 02:59:09,090 INFO L225 Difference]: With dead ends: 12150 [2018-07-24 02:59:09,090 INFO L226 Difference]: Without dead ends: 7062 [2018-07-24 02:59:09,098 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 193 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-07-24 02:59:09,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7062 states. [2018-07-24 02:59:09,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7062 to 5612. [2018-07-24 02:59:09,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5612 states. [2018-07-24 02:59:09,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5612 states to 5612 states and 6374 transitions. [2018-07-24 02:59:09,214 INFO L78 Accepts]: Start accepts. Automaton has 5612 states and 6374 transitions. Word has length 194 [2018-07-24 02:59:09,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 02:59:09,214 INFO L471 AbstractCegarLoop]: Abstraction has 5612 states and 6374 transitions. [2018-07-24 02:59:09,214 INFO L472 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-24 02:59:09,215 INFO L276 IsEmpty]: Start isEmpty. Operand 5612 states and 6374 transitions. [2018-07-24 02:59:09,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2018-07-24 02:59:09,225 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 02:59:09,225 INFO L353 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 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-24 02:59:09,226 INFO L414 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 02:59:09,226 INFO L82 PathProgramCache]: Analyzing trace with hash -1390905873, now seen corresponding path program 1 times [2018-07-24 02:59:09,228 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 02:59:09,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 02:59:09,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 02:59:09,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 02:59:09,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 02:59:09,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 02:59:10,098 INFO L134 CoverageAnalysis]: Checked inductivity of 597 backedges. 419 proven. 46 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2018-07-24 02:59:10,098 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 02:59:10,098 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-24 02:59:10,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 02:59:10,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 02:59:10,247 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 02:59:10,742 INFO L134 CoverageAnalysis]: Checked inductivity of 597 backedges. 442 proven. 23 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2018-07-24 02:59:10,774 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-24 02:59:10,774 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2018-07-24 02:59:10,775 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-24 02:59:10,775 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-24 02:59:10,775 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-07-24 02:59:10,776 INFO L87 Difference]: Start difference. First operand 5612 states and 6374 transitions. Second operand 9 states. [2018-07-24 02:59:14,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 02:59:14,359 INFO L93 Difference]: Finished difference Result 11505 states and 13036 transitions. [2018-07-24 02:59:14,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-24 02:59:14,359 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 420 [2018-07-24 02:59:14,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 02:59:14,386 INFO L225 Difference]: With dead ends: 11505 [2018-07-24 02:59:14,386 INFO L226 Difference]: Without dead ends: 6074 [2018-07-24 02:59:14,393 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 431 GetRequests, 418 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2018-07-24 02:59:14,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6074 states. [2018-07-24 02:59:14,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6074 to 5791. [2018-07-24 02:59:14,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5791 states. [2018-07-24 02:59:14,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5791 states to 5791 states and 6553 transitions. [2018-07-24 02:59:14,489 INFO L78 Accepts]: Start accepts. Automaton has 5791 states and 6553 transitions. Word has length 420 [2018-07-24 02:59:14,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 02:59:14,490 INFO L471 AbstractCegarLoop]: Abstraction has 5791 states and 6553 transitions. [2018-07-24 02:59:14,490 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-24 02:59:14,490 INFO L276 IsEmpty]: Start isEmpty. Operand 5791 states and 6553 transitions. [2018-07-24 02:59:14,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 511 [2018-07-24 02:59:14,502 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 02:59:14,502 INFO L353 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 02:59:14,502 INFO L414 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 02:59:14,503 INFO L82 PathProgramCache]: Analyzing trace with hash -1927182412, now seen corresponding path program 1 times [2018-07-24 02:59:14,503 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 02:59:14,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 02:59:14,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 02:59:14,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 02:59:14,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 02:59:14,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 02:59:15,297 WARN L169 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 13 [2018-07-24 02:59:15,777 WARN L169 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 17 [2018-07-24 02:59:16,042 INFO L134 CoverageAnalysis]: Checked inductivity of 989 backedges. 463 proven. 0 refuted. 0 times theorem prover too weak. 526 trivial. 0 not checked. [2018-07-24 02:59:16,043 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 02:59:16,043 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-07-24 02:59:16,044 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-24 02:59:16,044 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-24 02:59:16,044 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-07-24 02:59:16,044 INFO L87 Difference]: Start difference. First operand 5791 states and 6553 transitions. Second operand 7 states. [2018-07-24 02:59:18,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 02:59:18,095 INFO L93 Difference]: Finished difference Result 12001 states and 13671 transitions. [2018-07-24 02:59:18,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-24 02:59:18,096 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 510 [2018-07-24 02:59:18,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 02:59:18,116 INFO L225 Difference]: With dead ends: 12001 [2018-07-24 02:59:18,116 INFO L226 Difference]: Without dead ends: 5788 [2018-07-24 02:59:18,123 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-07-24 02:59:18,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5788 states. [2018-07-24 02:59:18,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5788 to 5788. [2018-07-24 02:59:18,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5788 states. [2018-07-24 02:59:18,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5788 states to 5788 states and 6451 transitions. [2018-07-24 02:59:18,203 INFO L78 Accepts]: Start accepts. Automaton has 5788 states and 6451 transitions. Word has length 510 [2018-07-24 02:59:18,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 02:59:18,204 INFO L471 AbstractCegarLoop]: Abstraction has 5788 states and 6451 transitions. [2018-07-24 02:59:18,204 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-24 02:59:18,205 INFO L276 IsEmpty]: Start isEmpty. Operand 5788 states and 6451 transitions. [2018-07-24 02:59:18,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 738 [2018-07-24 02:59:18,226 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 02:59:18,227 INFO L353 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2018-07-24 02:59:18,227 INFO L414 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 02:59:18,228 INFO L82 PathProgramCache]: Analyzing trace with hash -48183419, now seen corresponding path program 1 times [2018-07-24 02:59:18,228 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 02:59:18,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 02:59:18,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 02:59:18,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 02:59:18,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 02:59:18,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 02:59:18,870 WARN L169 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-07-24 02:59:19,911 INFO L134 CoverageAnalysis]: Checked inductivity of 1638 backedges. 1059 proven. 330 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2018-07-24 02:59:19,912 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 02:59:19,912 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-24 02:59:19,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 02:59:20,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 02:59:20,147 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 02:59:21,008 INFO L134 CoverageAnalysis]: Checked inductivity of 1638 backedges. 1095 proven. 93 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2018-07-24 02:59:21,029 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-24 02:59:21,030 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4] total 10 [2018-07-24 02:59:21,031 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-24 02:59:21,031 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-24 02:59:21,031 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-07-24 02:59:21,031 INFO L87 Difference]: Start difference. First operand 5788 states and 6451 transitions. Second operand 11 states. [2018-07-24 02:59:24,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 02:59:24,326 INFO L93 Difference]: Finished difference Result 12012 states and 13433 transitions. [2018-07-24 02:59:24,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-24 02:59:24,326 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 737 [2018-07-24 02:59:24,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 02:59:24,349 INFO L225 Difference]: With dead ends: 12012 [2018-07-24 02:59:24,350 INFO L226 Difference]: Without dead ends: 6405 [2018-07-24 02:59:24,356 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 750 GetRequests, 736 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2018-07-24 02:59:24,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6405 states. [2018-07-24 02:59:24,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6405 to 6325. [2018-07-24 02:59:24,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6325 states. [2018-07-24 02:59:24,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6325 states to 6325 states and 7020 transitions. [2018-07-24 02:59:24,450 INFO L78 Accepts]: Start accepts. Automaton has 6325 states and 7020 transitions. Word has length 737 [2018-07-24 02:59:24,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 02:59:24,451 INFO L471 AbstractCegarLoop]: Abstraction has 6325 states and 7020 transitions. [2018-07-24 02:59:24,452 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-24 02:59:24,452 INFO L276 IsEmpty]: Start isEmpty. Operand 6325 states and 7020 transitions. [2018-07-24 02:59:24,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 764 [2018-07-24 02:59:24,462 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 02:59:24,463 INFO L353 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 02:59:24,463 INFO L414 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 02:59:24,464 INFO L82 PathProgramCache]: Analyzing trace with hash 246335204, now seen corresponding path program 1 times [2018-07-24 02:59:24,464 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 02:59:24,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 02:59:24,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 02:59:24,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 02:59:24,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 02:59:24,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 02:59:25,126 WARN L169 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 6 DAG size of output: 3 [2018-07-24 02:59:25,494 INFO L134 CoverageAnalysis]: Checked inductivity of 1664 backedges. 1160 proven. 156 refuted. 0 times theorem prover too weak. 348 trivial. 0 not checked. [2018-07-24 02:59:25,495 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 02:59:25,495 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-24 02:59:25,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 02:59:25,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 02:59:25,722 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 02:59:26,160 INFO L134 CoverageAnalysis]: Checked inductivity of 1664 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 1479 trivial. 0 not checked. [2018-07-24 02:59:26,198 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-07-24 02:59:26,199 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2018-07-24 02:59:26,201 INFO L450 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-24 02:59:26,201 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-24 02:59:26,201 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-07-24 02:59:26,202 INFO L87 Difference]: Start difference. First operand 6325 states and 7020 transitions. Second operand 6 states. [2018-07-24 02:59:30,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 02:59:30,611 INFO L93 Difference]: Finished difference Result 17136 states and 19327 transitions. [2018-07-24 02:59:30,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-07-24 02:59:30,611 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 763 [2018-07-24 02:59:30,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 02:59:30,644 INFO L225 Difference]: With dead ends: 17136 [2018-07-24 02:59:30,644 INFO L226 Difference]: Without dead ends: 10812 [2018-07-24 02:59:30,651 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 774 GetRequests, 767 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-07-24 02:59:30,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10812 states. [2018-07-24 02:59:30,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10812 to 9367. [2018-07-24 02:59:30,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9367 states. [2018-07-24 02:59:30,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9367 states to 9367 states and 10327 transitions. [2018-07-24 02:59:30,776 INFO L78 Accepts]: Start accepts. Automaton has 9367 states and 10327 transitions. Word has length 763 [2018-07-24 02:59:30,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 02:59:30,777 INFO L471 AbstractCegarLoop]: Abstraction has 9367 states and 10327 transitions. [2018-07-24 02:59:30,777 INFO L472 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-24 02:59:30,777 INFO L276 IsEmpty]: Start isEmpty. Operand 9367 states and 10327 transitions. [2018-07-24 02:59:30,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 822 [2018-07-24 02:59:30,787 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 02:59:30,787 INFO L353 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 02:59:30,787 INFO L414 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 02:59:30,788 INFO L82 PathProgramCache]: Analyzing trace with hash 640282093, now seen corresponding path program 1 times [2018-07-24 02:59:30,788 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 02:59:30,788 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 02:59:30,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 02:59:30,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 02:59:30,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 02:59:30,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 02:59:31,761 INFO L134 CoverageAnalysis]: Checked inductivity of 2165 backedges. 216 proven. 0 refuted. 0 times theorem prover too weak. 1949 trivial. 0 not checked. [2018-07-24 02:59:31,762 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 02:59:31,762 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-24 02:59:31,763 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-24 02:59:31,763 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-24 02:59:31,763 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 02:59:31,764 INFO L87 Difference]: Start difference. First operand 9367 states and 10327 transitions. Second operand 4 states. [2018-07-24 02:59:33,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 02:59:33,369 INFO L93 Difference]: Finished difference Result 19802 states and 21894 transitions. [2018-07-24 02:59:33,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-24 02:59:33,369 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 821 [2018-07-24 02:59:33,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 02:59:33,389 INFO L225 Difference]: With dead ends: 19802 [2018-07-24 02:59:33,389 INFO L226 Difference]: Without dead ends: 10616 [2018-07-24 02:59:33,398 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 02:59:33,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10616 states. [2018-07-24 02:59:33,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10616 to 10079. [2018-07-24 02:59:33,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10079 states. [2018-07-24 02:59:33,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10079 states to 10079 states and 10865 transitions. [2018-07-24 02:59:33,521 INFO L78 Accepts]: Start accepts. Automaton has 10079 states and 10865 transitions. Word has length 821 [2018-07-24 02:59:33,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 02:59:33,523 INFO L471 AbstractCegarLoop]: Abstraction has 10079 states and 10865 transitions. [2018-07-24 02:59:33,523 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-24 02:59:33,523 INFO L276 IsEmpty]: Start isEmpty. Operand 10079 states and 10865 transitions. [2018-07-24 02:59:33,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 825 [2018-07-24 02:59:33,534 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 02:59:33,535 INFO L353 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 02:59:33,535 INFO L414 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 02:59:33,536 INFO L82 PathProgramCache]: Analyzing trace with hash 336979085, now seen corresponding path program 1 times [2018-07-24 02:59:33,536 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 02:59:33,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 02:59:33,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 02:59:33,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 02:59:33,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 02:59:33,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 02:59:34,419 WARN L169 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-07-24 02:59:34,665 WARN L169 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-07-24 02:59:35,975 INFO L134 CoverageAnalysis]: Checked inductivity of 2181 backedges. 1196 proven. 0 refuted. 0 times theorem prover too weak. 985 trivial. 0 not checked. [2018-07-24 02:59:35,975 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 02:59:35,976 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-24 02:59:35,976 INFO L450 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-24 02:59:35,976 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-24 02:59:35,977 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-07-24 02:59:35,977 INFO L87 Difference]: Start difference. First operand 10079 states and 10865 transitions. Second operand 6 states. [2018-07-24 02:59:38,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 02:59:38,524 INFO L93 Difference]: Finished difference Result 20291 states and 21870 transitions. [2018-07-24 02:59:38,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-24 02:59:38,525 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 824 [2018-07-24 02:59:38,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 02:59:38,537 INFO L225 Difference]: With dead ends: 20291 [2018-07-24 02:59:38,537 INFO L226 Difference]: Without dead ends: 10393 [2018-07-24 02:59:38,547 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-07-24 02:59:38,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10393 states. [2018-07-24 02:59:38,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10393 to 10258. [2018-07-24 02:59:38,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10258 states. [2018-07-24 02:59:38,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10258 states to 10258 states and 11046 transitions. [2018-07-24 02:59:38,679 INFO L78 Accepts]: Start accepts. Automaton has 10258 states and 11046 transitions. Word has length 824 [2018-07-24 02:59:38,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 02:59:38,680 INFO L471 AbstractCegarLoop]: Abstraction has 10258 states and 11046 transitions. [2018-07-24 02:59:38,680 INFO L472 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-24 02:59:38,680 INFO L276 IsEmpty]: Start isEmpty. Operand 10258 states and 11046 transitions. [2018-07-24 02:59:38,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 942 [2018-07-24 02:59:38,692 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 02:59:38,692 INFO L353 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 02:59:38,693 INFO L414 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 02:59:38,693 INFO L82 PathProgramCache]: Analyzing trace with hash -772399207, now seen corresponding path program 1 times [2018-07-24 02:59:38,693 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 02:59:38,693 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 02:59:38,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 02:59:38,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 02:59:38,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 02:59:38,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 02:59:39,435 WARN L169 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 8 [2018-07-24 02:59:39,727 WARN L169 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 9 [2018-07-24 02:59:40,280 INFO L134 CoverageAnalysis]: Checked inductivity of 2766 backedges. 797 proven. 0 refuted. 0 times theorem prover too weak. 1969 trivial. 0 not checked. [2018-07-24 02:59:40,280 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 02:59:40,280 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-24 02:59:40,281 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-24 02:59:40,281 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-24 02:59:40,281 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-07-24 02:59:40,282 INFO L87 Difference]: Start difference. First operand 10258 states and 11046 transitions. Second operand 5 states. [2018-07-24 02:59:42,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 02:59:42,272 INFO L93 Difference]: Finished difference Result 22301 states and 24038 transitions. [2018-07-24 02:59:42,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-24 02:59:42,272 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 941 [2018-07-24 02:59:42,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 02:59:42,286 INFO L225 Difference]: With dead ends: 22301 [2018-07-24 02:59:42,286 INFO L226 Difference]: Without dead ends: 12224 [2018-07-24 02:59:42,295 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-07-24 02:59:42,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12224 states. [2018-07-24 02:59:42,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12224 to 12224. [2018-07-24 02:59:42,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12224 states. [2018-07-24 02:59:42,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12224 states to 12224 states and 12869 transitions. [2018-07-24 02:59:42,441 INFO L78 Accepts]: Start accepts. Automaton has 12224 states and 12869 transitions. Word has length 941 [2018-07-24 02:59:42,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 02:59:42,442 INFO L471 AbstractCegarLoop]: Abstraction has 12224 states and 12869 transitions. [2018-07-24 02:59:42,442 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-24 02:59:42,442 INFO L276 IsEmpty]: Start isEmpty. Operand 12224 states and 12869 transitions. [2018-07-24 02:59:42,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1025 [2018-07-24 02:59:42,461 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 02:59:42,462 INFO L353 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 02:59:42,462 INFO L414 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 02:59:42,463 INFO L82 PathProgramCache]: Analyzing trace with hash -1348324996, now seen corresponding path program 1 times [2018-07-24 02:59:42,463 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 02:59:42,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 02:59:42,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 02:59:42,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 02:59:42,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 02:59:42,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 02:59:44,058 INFO L134 CoverageAnalysis]: Checked inductivity of 3442 backedges. 908 proven. 0 refuted. 0 times theorem prover too weak. 2534 trivial. 0 not checked. [2018-07-24 02:59:44,058 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 02:59:44,059 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-07-24 02:59:44,059 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-24 02:59:44,060 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-24 02:59:44,060 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-07-24 02:59:44,060 INFO L87 Difference]: Start difference. First operand 12224 states and 12869 transitions. Second operand 7 states. [2018-07-24 02:59:46,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 02:59:46,505 INFO L93 Difference]: Finished difference Result 24932 states and 26311 transitions. [2018-07-24 02:59:46,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-24 02:59:46,505 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 1024 [2018-07-24 02:59:46,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 02:59:46,518 INFO L225 Difference]: With dead ends: 24932 [2018-07-24 02:59:46,519 INFO L226 Difference]: Without dead ends: 12041 [2018-07-24 02:59:46,531 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-07-24 02:59:46,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12041 states. [2018-07-24 02:59:46,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12041 to 12041. [2018-07-24 02:59:46,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12041 states. [2018-07-24 02:59:46,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12041 states to 12041 states and 12626 transitions. [2018-07-24 02:59:46,675 INFO L78 Accepts]: Start accepts. Automaton has 12041 states and 12626 transitions. Word has length 1024 [2018-07-24 02:59:46,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 02:59:46,676 INFO L471 AbstractCegarLoop]: Abstraction has 12041 states and 12626 transitions. [2018-07-24 02:59:46,676 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-24 02:59:46,677 INFO L276 IsEmpty]: Start isEmpty. Operand 12041 states and 12626 transitions. [2018-07-24 02:59:46,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1038 [2018-07-24 02:59:46,691 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 02:59:46,692 INFO L353 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 02:59:46,692 INFO L414 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 02:59:46,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1169893293, now seen corresponding path program 1 times [2018-07-24 02:59:46,693 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 02:59:46,693 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 02:59:46,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 02:59:46,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 02:59:46,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 02:59:46,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 02:59:47,395 WARN L169 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-07-24 02:59:48,065 INFO L134 CoverageAnalysis]: Checked inductivity of 3507 backedges. 897 proven. 0 refuted. 0 times theorem prover too weak. 2610 trivial. 0 not checked. [2018-07-24 02:59:48,065 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 02:59:48,065 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-24 02:59:48,066 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-24 02:59:48,066 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-24 02:59:48,066 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 02:59:48,066 INFO L87 Difference]: Start difference. First operand 12041 states and 12626 transitions. Second operand 4 states. [2018-07-24 02:59:49,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 02:59:49,354 INFO L93 Difference]: Finished difference Result 23901 states and 25070 transitions. [2018-07-24 02:59:49,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-24 02:59:49,354 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1037 [2018-07-24 02:59:49,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 02:59:49,366 INFO L225 Difference]: With dead ends: 23901 [2018-07-24 02:59:49,366 INFO L226 Difference]: Without dead ends: 11861 [2018-07-24 02:59:49,374 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 02:59:49,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11861 states. [2018-07-24 02:59:49,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11861 to 11861. [2018-07-24 02:59:49,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11861 states. [2018-07-24 02:59:49,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11861 states to 11861 states and 12414 transitions. [2018-07-24 02:59:49,483 INFO L78 Accepts]: Start accepts. Automaton has 11861 states and 12414 transitions. Word has length 1037 [2018-07-24 02:59:49,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 02:59:49,484 INFO L471 AbstractCegarLoop]: Abstraction has 11861 states and 12414 transitions. [2018-07-24 02:59:49,484 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-24 02:59:49,484 INFO L276 IsEmpty]: Start isEmpty. Operand 11861 states and 12414 transitions. [2018-07-24 02:59:49,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1043 [2018-07-24 02:59:49,498 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 02:59:49,499 INFO L353 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 02:59:49,499 INFO L414 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 02:59:49,499 INFO L82 PathProgramCache]: Analyzing trace with hash -1378193143, now seen corresponding path program 1 times [2018-07-24 02:59:49,499 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 02:59:49,499 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 02:59:49,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 02:59:49,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 02:59:49,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 02:59:49,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 02:59:50,171 WARN L169 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-07-24 02:59:51,065 INFO L134 CoverageAnalysis]: Checked inductivity of 3532 backedges. 900 proven. 0 refuted. 0 times theorem prover too weak. 2632 trivial. 0 not checked. [2018-07-24 02:59:51,066 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 02:59:51,066 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-24 02:59:51,066 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-24 02:59:51,067 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-24 02:59:51,067 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 02:59:51,067 INFO L87 Difference]: Start difference. First operand 11861 states and 12414 transitions. Second operand 4 states. [2018-07-24 02:59:52,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 02:59:52,447 INFO L93 Difference]: Finished difference Result 23541 states and 24646 transitions. [2018-07-24 02:59:52,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-24 02:59:52,448 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1042 [2018-07-24 02:59:52,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 02:59:52,458 INFO L225 Difference]: With dead ends: 23541 [2018-07-24 02:59:52,458 INFO L226 Difference]: Without dead ends: 11681 [2018-07-24 02:59:52,464 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 02:59:52,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11681 states. [2018-07-24 02:59:52,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11681 to 11681. [2018-07-24 02:59:52,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11681 states. [2018-07-24 02:59:52,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11681 states to 11681 states and 12203 transitions. [2018-07-24 02:59:52,591 INFO L78 Accepts]: Start accepts. Automaton has 11681 states and 12203 transitions. Word has length 1042 [2018-07-24 02:59:52,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 02:59:52,592 INFO L471 AbstractCegarLoop]: Abstraction has 11681 states and 12203 transitions. [2018-07-24 02:59:52,592 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-24 02:59:52,592 INFO L276 IsEmpty]: Start isEmpty. Operand 11681 states and 12203 transitions. [2018-07-24 02:59:52,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1068 [2018-07-24 02:59:52,602 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 02:59:52,603 INFO L353 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 02:59:52,603 INFO L414 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 02:59:52,604 INFO L82 PathProgramCache]: Analyzing trace with hash -1092475976, now seen corresponding path program 1 times [2018-07-24 02:59:52,604 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 02:59:52,604 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 02:59:52,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 02:59:52,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 02:59:52,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 02:59:52,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 02:59:53,922 INFO L134 CoverageAnalysis]: Checked inductivity of 3606 backedges. 908 proven. 0 refuted. 0 times theorem prover too weak. 2698 trivial. 0 not checked. [2018-07-24 02:59:53,922 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 02:59:53,922 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-07-24 02:59:53,923 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-24 02:59:53,923 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-24 02:59:53,924 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-07-24 02:59:53,924 INFO L87 Difference]: Start difference. First operand 11681 states and 12203 transitions. Second operand 7 states. [2018-07-24 02:59:56,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 02:59:56,158 INFO L93 Difference]: Finished difference Result 22891 states and 23907 transitions. [2018-07-24 02:59:56,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-24 02:59:56,159 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 1067 [2018-07-24 02:59:56,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 02:59:56,169 INFO L225 Difference]: With dead ends: 22891 [2018-07-24 02:59:56,169 INFO L226 Difference]: Without dead ends: 10781 [2018-07-24 02:59:56,176 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-07-24 02:59:56,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10781 states. [2018-07-24 02:59:56,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10781 to 10781. [2018-07-24 02:59:56,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10781 states. [2018-07-24 02:59:56,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10781 states to 10781 states and 11194 transitions. [2018-07-24 02:59:56,292 INFO L78 Accepts]: Start accepts. Automaton has 10781 states and 11194 transitions. Word has length 1067 [2018-07-24 02:59:56,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 02:59:56,293 INFO L471 AbstractCegarLoop]: Abstraction has 10781 states and 11194 transitions. [2018-07-24 02:59:56,293 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-24 02:59:56,293 INFO L276 IsEmpty]: Start isEmpty. Operand 10781 states and 11194 transitions. [2018-07-24 02:59:56,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1119 [2018-07-24 02:59:56,305 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 02:59:56,306 INFO L353 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 02:59:56,306 INFO L414 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 02:59:56,306 INFO L82 PathProgramCache]: Analyzing trace with hash -1713622009, now seen corresponding path program 1 times [2018-07-24 02:59:56,306 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 02:59:56,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 02:59:56,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 02:59:56,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 02:59:56,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 02:59:56,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 02:59:57,860 INFO L134 CoverageAnalysis]: Checked inductivity of 3704 backedges. 2355 proven. 0 refuted. 0 times theorem prover too weak. 1349 trivial. 0 not checked. [2018-07-24 02:59:57,860 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 02:59:57,860 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-24 02:59:57,861 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-24 02:59:57,861 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-24 02:59:57,861 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-07-24 02:59:57,862 INFO L87 Difference]: Start difference. First operand 10781 states and 11194 transitions. Second operand 5 states. [2018-07-24 02:59:59,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 02:59:59,303 INFO L93 Difference]: Finished difference Result 22098 states and 22945 transitions. [2018-07-24 02:59:59,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-24 02:59:59,303 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1118 [2018-07-24 02:59:59,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 02:59:59,313 INFO L225 Difference]: With dead ends: 22098 [2018-07-24 02:59:59,314 INFO L226 Difference]: Without dead ends: 11498 [2018-07-24 02:59:59,321 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-07-24 02:59:59,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11498 states. [2018-07-24 02:59:59,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11498 to 10960. [2018-07-24 02:59:59,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10960 states. [2018-07-24 02:59:59,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10960 states to 10960 states and 11374 transitions. [2018-07-24 02:59:59,431 INFO L78 Accepts]: Start accepts. Automaton has 10960 states and 11374 transitions. Word has length 1118 [2018-07-24 02:59:59,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 02:59:59,432 INFO L471 AbstractCegarLoop]: Abstraction has 10960 states and 11374 transitions. [2018-07-24 02:59:59,432 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-24 02:59:59,432 INFO L276 IsEmpty]: Start isEmpty. Operand 10960 states and 11374 transitions. [2018-07-24 02:59:59,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1373 [2018-07-24 02:59:59,445 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 02:59:59,446 INFO L353 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 6, 6, 5, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 02:59:59,446 INFO L414 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 02:59:59,447 INFO L82 PathProgramCache]: Analyzing trace with hash -1434531499, now seen corresponding path program 1 times [2018-07-24 02:59:59,447 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 02:59:59,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 02:59:59,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 02:59:59,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 02:59:59,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 02:59:59,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 03:00:00,523 WARN L169 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 8 [2018-07-24 03:00:01,460 INFO L134 CoverageAnalysis]: Checked inductivity of 5751 backedges. 3408 proven. 21 refuted. 0 times theorem prover too weak. 2322 trivial. 0 not checked. [2018-07-24 03:00:01,461 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 03:00:01,461 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-24 03:00:01,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 03:00:01,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 03:00:01,865 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 03:00:02,737 INFO L134 CoverageAnalysis]: Checked inductivity of 5751 backedges. 1130 proven. 0 refuted. 0 times theorem prover too weak. 4621 trivial. 0 not checked. [2018-07-24 03:00:02,759 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-07-24 03:00:02,759 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2018-07-24 03:00:02,760 INFO L450 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-24 03:00:02,760 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-24 03:00:02,760 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-07-24 03:00:02,761 INFO L87 Difference]: Start difference. First operand 10960 states and 11374 transitions. Second operand 6 states. [2018-07-24 03:00:05,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 03:00:05,726 INFO L93 Difference]: Finished difference Result 21017 states and 21807 transitions. [2018-07-24 03:00:05,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-07-24 03:00:05,726 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 1372 [2018-07-24 03:00:05,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 03:00:05,728 INFO L225 Difference]: With dead ends: 21017 [2018-07-24 03:00:05,729 INFO L226 Difference]: Without dead ends: 0 [2018-07-24 03:00:05,738 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 1383 GetRequests, 1375 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-07-24 03:00:05,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-07-24 03:00:05,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-07-24 03:00:05,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-07-24 03:00:05,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-07-24 03:00:05,739 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1372 [2018-07-24 03:00:05,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 03:00:05,739 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-07-24 03:00:05,739 INFO L472 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-24 03:00:05,739 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-07-24 03:00:05,739 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-07-24 03:00:05,744 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-07-24 03:00:05,839 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 03:00:05,869 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 03:00:05,891 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 03:00:06,005 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 03:00:06,088 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 03:00:06,090 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 03:00:06,090 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 03:00:06,090 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 03:00:06,092 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 03:00:06,092 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 03:00:06,094 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 03:00:06,108 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 03:00:06,120 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 03:00:06,125 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 03:00:06,130 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 03:00:06,137 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 03:00:06,139 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 03:00:06,149 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 03:00:06,178 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 03:00:06,211 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 03:00:06,238 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 03:00:06,244 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 03:00:06,294 WARN L169 SmtUtils]: Spent 546.00 ms on a formula simplification. DAG size of input: 417 DAG size of output: 235 [2018-07-24 03:00:06,328 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 03:00:06,360 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 03:00:06,375 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 03:00:06,454 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 03:00:06,524 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 03:00:06,525 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 03:00:06,526 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 03:00:06,526 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 03:00:06,527 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 03:00:06,527 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 03:00:06,529 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 03:00:06,540 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 03:00:06,550 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 03:00:06,553 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 03:00:06,558 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 03:00:06,563 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 03:00:06,565 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 03:00:06,573 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 03:00:06,594 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 03:00:06,626 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 03:00:06,640 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 03:00:06,645 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 03:00:06,689 WARN L169 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 420 DAG size of output: 236 [2018-07-24 03:00:08,892 WARN L169 SmtUtils]: Spent 2.19 s on a formula simplification. DAG size of input: 196 DAG size of output: 65 [2018-07-24 03:00:12,345 WARN L169 SmtUtils]: Spent 3.45 s on a formula simplification. DAG size of input: 196 DAG size of output: 65 [2018-07-24 03:00:12,349 INFO L421 ceAbstractionStarter]: For program point L700(lines 700 870) no Hoare annotation was computed. [2018-07-24 03:00:12,349 INFO L421 ceAbstractionStarter]: For program point L706(lines 706 870) no Hoare annotation was computed. [2018-07-24 03:00:12,349 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-07-24 03:00:12,349 INFO L421 ceAbstractionStarter]: For program point L724(lines 724 870) no Hoare annotation was computed. [2018-07-24 03:00:12,350 INFO L421 ceAbstractionStarter]: For program point L712(lines 712 870) no Hoare annotation was computed. [2018-07-24 03:00:12,350 INFO L421 ceAbstractionStarter]: For program point L718(lines 718 870) no Hoare annotation was computed. [2018-07-24 03:00:12,350 INFO L421 ceAbstractionStarter]: For program point L500(lines 500 870) no Hoare annotation was computed. [2018-07-24 03:00:12,350 INFO L421 ceAbstractionStarter]: For program point L741(lines 741 870) no Hoare annotation was computed. [2018-07-24 03:00:12,350 INFO L421 ceAbstractionStarter]: For program point L506(lines 506 870) no Hoare annotation was computed. [2018-07-24 03:00:12,350 INFO L421 ceAbstractionStarter]: For program point L747(lines 747 870) no Hoare annotation was computed. [2018-07-24 03:00:12,350 INFO L421 ceAbstractionStarter]: For program point L99'(lines 20 872) no Hoare annotation was computed. [2018-07-24 03:00:12,350 INFO L421 ceAbstractionStarter]: For program point L730(lines 730 870) no Hoare annotation was computed. [2018-07-24 03:00:12,350 INFO L421 ceAbstractionStarter]: For program point L735(lines 735 870) no Hoare annotation was computed. [2018-07-24 03:00:12,350 INFO L421 ceAbstractionStarter]: For program point L524(lines 524 870) no Hoare annotation was computed. [2018-07-24 03:00:12,350 INFO L421 ceAbstractionStarter]: For program point L764(lines 764 870) no Hoare annotation was computed. [2018-07-24 03:00:12,350 INFO L421 ceAbstractionStarter]: For program point L512(lines 512 870) no Hoare annotation was computed. [2018-07-24 03:00:12,351 INFO L421 ceAbstractionStarter]: For program point L752(lines 752 870) no Hoare annotation was computed. [2018-07-24 03:00:12,351 INFO L421 ceAbstractionStarter]: For program point L758(lines 758 870) no Hoare annotation was computed. [2018-07-24 03:00:12,351 INFO L421 ceAbstractionStarter]: For program point L518(lines 518 870) no Hoare annotation was computed. [2018-07-24 03:00:12,351 INFO L421 ceAbstractionStarter]: For program point L541(lines 541 870) no Hoare annotation was computed. [2018-07-24 03:00:12,351 INFO L421 ceAbstractionStarter]: For program point L783(lines 783 870) no Hoare annotation was computed. [2018-07-24 03:00:12,351 INFO L421 ceAbstractionStarter]: For program point L305(lines 305 870) no Hoare annotation was computed. [2018-07-24 03:00:12,351 INFO L421 ceAbstractionStarter]: For program point L547(lines 547 870) no Hoare annotation was computed. [2018-07-24 03:00:12,351 INFO L421 ceAbstractionStarter]: For program point L789(lines 789 870) no Hoare annotation was computed. [2018-07-24 03:00:12,351 INFO L421 ceAbstractionStarter]: For program point L530(lines 530 870) no Hoare annotation was computed. [2018-07-24 03:00:12,351 INFO L421 ceAbstractionStarter]: For program point L771(lines 771 870) no Hoare annotation was computed. [2018-07-24 03:00:12,351 INFO L421 ceAbstractionStarter]: For program point L777(lines 777 870) no Hoare annotation was computed. [2018-07-24 03:00:12,351 INFO L421 ceAbstractionStarter]: For program point L536(lines 536 870) no Hoare annotation was computed. [2018-07-24 03:00:12,351 INFO L421 ceAbstractionStarter]: For program point L561(lines 561 870) no Hoare annotation was computed. [2018-07-24 03:00:12,351 INFO L421 ceAbstractionStarter]: For program point L568(lines 568 870) no Hoare annotation was computed. [2018-07-24 03:00:12,351 INFO L421 ceAbstractionStarter]: For program point L323(lines 323 870) no Hoare annotation was computed. [2018-07-24 03:00:12,352 INFO L421 ceAbstractionStarter]: For program point L329(lines 329 870) no Hoare annotation was computed. [2018-07-24 03:00:12,352 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-07-24 03:00:12,352 INFO L421 ceAbstractionStarter]: For program point L311(lines 311 870) no Hoare annotation was computed. [2018-07-24 03:00:12,352 INFO L421 ceAbstractionStarter]: For program point L795(lines 795 870) no Hoare annotation was computed. [2018-07-24 03:00:12,352 INFO L421 ceAbstractionStarter]: For program point L552(lines 552 870) no Hoare annotation was computed. [2018-07-24 03:00:12,352 INFO L421 ceAbstractionStarter]: For program point L555(lines 555 870) no Hoare annotation was computed. [2018-07-24 03:00:12,352 INFO L421 ceAbstractionStarter]: For program point L317(lines 317 870) no Hoare annotation was computed. [2018-07-24 03:00:12,352 INFO L421 ceAbstractionStarter]: For program point L102(lines 20 872) no Hoare annotation was computed. [2018-07-24 03:00:12,352 INFO L421 ceAbstractionStarter]: For program point L585(lines 585 870) no Hoare annotation was computed. [2018-07-24 03:00:12,352 INFO L421 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-07-24 03:00:12,353 INFO L421 ceAbstractionStarter]: For program point L341(lines 341 870) no Hoare annotation was computed. [2018-07-24 03:00:12,353 INFO L421 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2018-07-24 03:00:12,353 INFO L421 ceAbstractionStarter]: For program point L105(lines 20 872) no Hoare annotation was computed. [2018-07-24 03:00:12,353 INFO L421 ceAbstractionStarter]: For program point L347(lines 347 870) no Hoare annotation was computed. [2018-07-24 03:00:12,353 INFO L421 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2018-07-24 03:00:12,353 INFO L421 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2018-07-24 03:00:12,353 INFO L421 ceAbstractionStarter]: For program point L108(lines 20 872) no Hoare annotation was computed. [2018-07-24 03:00:12,353 INFO L421 ceAbstractionStarter]: For program point L573(lines 573 870) no Hoare annotation was computed. [2018-07-24 03:00:12,353 INFO L421 ceAbstractionStarter]: For program point L579(lines 579 870) no Hoare annotation was computed. [2018-07-24 03:00:12,354 INFO L421 ceAbstractionStarter]: For program point L335(lines 335 870) no Hoare annotation was computed. [2018-07-24 03:00:12,354 INFO L421 ceAbstractionStarter]: For program point L120(lines 20 872) no Hoare annotation was computed. [2018-07-24 03:00:12,354 INFO L421 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2018-07-24 03:00:12,354 INFO L421 ceAbstractionStarter]: For program point L366(lines 366 870) no Hoare annotation was computed. [2018-07-24 03:00:12,354 INFO L421 ceAbstractionStarter]: For program point L123(lines 20 872) no Hoare annotation was computed. [2018-07-24 03:00:12,354 INFO L421 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2018-07-24 03:00:12,354 INFO L421 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2018-07-24 03:00:12,354 INFO L421 ceAbstractionStarter]: For program point L126(lines 20 872) no Hoare annotation was computed. [2018-07-24 03:00:12,355 INFO L421 ceAbstractionStarter]: For program point L129(lines 20 872) no Hoare annotation was computed. [2018-07-24 03:00:12,355 INFO L421 ceAbstractionStarter]: For program point L591(lines 591 870) no Hoare annotation was computed. [2018-07-24 03:00:12,355 INFO L421 ceAbstractionStarter]: For program point L597(lines 597 870) no Hoare annotation was computed. [2018-07-24 03:00:12,355 INFO L421 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2018-07-24 03:00:12,355 INFO L421 ceAbstractionStarter]: For program point L111(lines 20 872) no Hoare annotation was computed. [2018-07-24 03:00:12,355 INFO L421 ceAbstractionStarter]: For program point L353(lines 353 870) no Hoare annotation was computed. [2018-07-24 03:00:12,355 INFO L421 ceAbstractionStarter]: For program point L117(lines 20 872) no Hoare annotation was computed. [2018-07-24 03:00:12,355 INFO L421 ceAbstractionStarter]: For program point L359(lines 359 870) no Hoare annotation was computed. [2018-07-24 03:00:12,355 INFO L421 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2018-07-24 03:00:12,355 INFO L421 ceAbstractionStarter]: For program point L114(lines 20 872) no Hoare annotation was computed. [2018-07-24 03:00:12,356 INFO L421 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2018-07-24 03:00:12,356 INFO L421 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2018-07-24 03:00:12,356 INFO L421 ceAbstractionStarter]: For program point L384(lines 384 870) no Hoare annotation was computed. [2018-07-24 03:00:12,356 INFO L421 ceAbstractionStarter]: For program point L141(lines 20 872) no Hoare annotation was computed. [2018-07-24 03:00:12,356 INFO L421 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2018-07-24 03:00:12,356 INFO L421 ceAbstractionStarter]: For program point L144(lines 20 872) no Hoare annotation was computed. [2018-07-24 03:00:12,356 INFO L421 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2018-07-24 03:00:12,356 INFO L421 ceAbstractionStarter]: For program point L147(lines 20 872) no Hoare annotation was computed. [2018-07-24 03:00:12,356 INFO L421 ceAbstractionStarter]: For program point L390(lines 390 870) no Hoare annotation was computed. [2018-07-24 03:00:12,356 INFO L421 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2018-07-24 03:00:12,357 INFO L421 ceAbstractionStarter]: For program point L372(lines 372 870) no Hoare annotation was computed. [2018-07-24 03:00:12,357 INFO L421 ceAbstractionStarter]: For program point L135(lines 20 872) no Hoare annotation was computed. [2018-07-24 03:00:12,357 INFO L421 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2018-07-24 03:00:12,357 INFO L421 ceAbstractionStarter]: For program point L132(lines 20 872) no Hoare annotation was computed. [2018-07-24 03:00:12,357 INFO L421 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2018-07-24 03:00:12,357 INFO L421 ceAbstractionStarter]: For program point L138(lines 20 872) no Hoare annotation was computed. [2018-07-24 03:00:12,357 INFO L421 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2018-07-24 03:00:12,357 INFO L421 ceAbstractionStarter]: For program point L378(lines 378 870) no Hoare annotation was computed. [2018-07-24 03:00:12,357 INFO L421 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2018-07-24 03:00:12,357 INFO L421 ceAbstractionStarter]: For program point L162(lines 20 872) no Hoare annotation was computed. [2018-07-24 03:00:12,358 INFO L421 ceAbstractionStarter]: For program point L168(lines 20 872) no Hoare annotation was computed. [2018-07-24 03:00:12,358 INFO L421 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2018-07-24 03:00:12,358 INFO L421 ceAbstractionStarter]: For program point L165(lines 20 872) no Hoare annotation was computed. [2018-07-24 03:00:12,358 INFO L421 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2018-07-24 03:00:12,358 INFO L421 ceAbstractionStarter]: For program point L171(lines 20 872) no Hoare annotation was computed. [2018-07-24 03:00:12,358 INFO L421 ceAbstractionStarter]: For program point L153(lines 20 872) no Hoare annotation was computed. [2018-07-24 03:00:12,358 INFO L421 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2018-07-24 03:00:12,358 INFO L421 ceAbstractionStarter]: For program point L150(lines 20 872) no Hoare annotation was computed. [2018-07-24 03:00:12,358 INFO L421 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2018-07-24 03:00:12,358 INFO L421 ceAbstractionStarter]: For program point L156(lines 20 872) no Hoare annotation was computed. [2018-07-24 03:00:12,359 INFO L421 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2018-07-24 03:00:12,359 INFO L421 ceAbstractionStarter]: For program point L396(lines 396 870) no Hoare annotation was computed. [2018-07-24 03:00:12,359 INFO L421 ceAbstractionStarter]: For program point L159(lines 20 872) no Hoare annotation was computed. [2018-07-24 03:00:12,359 INFO L421 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-07-24 03:00:12,359 INFO L421 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2018-07-24 03:00:12,359 INFO L421 ceAbstractionStarter]: For program point L186(lines 20 872) no Hoare annotation was computed. [2018-07-24 03:00:12,359 INFO L421 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2018-07-24 03:00:12,359 INFO L421 ceAbstractionStarter]: For program point L183(lines 20 872) no Hoare annotation was computed. [2018-07-24 03:00:12,359 INFO L421 ceAbstractionStarter]: For program point L189(lines 20 872) no Hoare annotation was computed. [2018-07-24 03:00:12,359 INFO L421 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2018-07-24 03:00:12,359 INFO L421 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2018-07-24 03:00:12,360 INFO L421 ceAbstractionStarter]: For program point L192(lines 20 872) no Hoare annotation was computed. [2018-07-24 03:00:12,360 INFO L421 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2018-07-24 03:00:12,360 INFO L421 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2018-07-24 03:00:12,360 INFO L421 ceAbstractionStarter]: For program point L174(lines 20 872) no Hoare annotation was computed. [2018-07-24 03:00:12,360 INFO L421 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2018-07-24 03:00:12,360 INFO L421 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2018-07-24 03:00:12,360 INFO L421 ceAbstractionStarter]: For program point L177(lines 20 872) no Hoare annotation was computed. [2018-07-24 03:00:12,360 INFO L421 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2018-07-24 03:00:12,360 INFO L421 ceAbstractionStarter]: For program point L180(lines 20 872) no Hoare annotation was computed. [2018-07-24 03:00:12,360 INFO L421 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2018-07-24 03:00:12,361 INFO L421 ceAbstractionStarter]: For program point L195(lines 20 872) no Hoare annotation was computed. [2018-07-24 03:00:12,361 INFO L421 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2018-07-24 03:00:12,361 INFO L421 ceAbstractionStarter]: For program point L198(lines 20 872) no Hoare annotation was computed. [2018-07-24 03:00:12,361 INFO L421 ceAbstractionStarter]: For program point L21(lines 21 23) no Hoare annotation was computed. [2018-07-24 03:00:12,361 INFO L421 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2018-07-24 03:00:12,361 INFO L421 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-07-24 03:00:12,361 INFO L421 ceAbstractionStarter]: For program point L24(lines 20 872) no Hoare annotation was computed. [2018-07-24 03:00:12,361 INFO L421 ceAbstractionStarter]: For program point L27(lines 20 872) no Hoare annotation was computed. [2018-07-24 03:00:12,361 INFO L421 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2018-07-24 03:00:12,361 INFO L421 ceAbstractionStarter]: For program point L30(lines 20 872) no Hoare annotation was computed. [2018-07-24 03:00:12,362 INFO L421 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2018-07-24 03:00:12,362 INFO L421 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2018-07-24 03:00:12,362 INFO L421 ceAbstractionStarter]: For program point L33(lines 20 872) no Hoare annotation was computed. [2018-07-24 03:00:12,362 INFO L421 ceAbstractionStarter]: For program point L36(lines 20 872) no Hoare annotation was computed. [2018-07-24 03:00:12,362 INFO L421 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2018-07-24 03:00:12,362 INFO L421 ceAbstractionStarter]: For program point L39(lines 20 872) no Hoare annotation was computed. [2018-07-24 03:00:12,362 INFO L421 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2018-07-24 03:00:12,362 INFO L421 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2018-07-24 03:00:12,362 INFO L421 ceAbstractionStarter]: For program point L42(lines 20 872) no Hoare annotation was computed. [2018-07-24 03:00:12,362 INFO L421 ceAbstractionStarter]: For program point L45(lines 20 872) no Hoare annotation was computed. [2018-07-24 03:00:12,363 INFO L421 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2018-07-24 03:00:12,363 INFO L421 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2018-07-24 03:00:12,363 INFO L421 ceAbstractionStarter]: For program point L48(lines 20 872) no Hoare annotation was computed. [2018-07-24 03:00:12,363 INFO L421 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2018-07-24 03:00:12,363 INFO L421 ceAbstractionStarter]: For program point L51(lines 20 872) no Hoare annotation was computed. [2018-07-24 03:00:12,363 INFO L421 ceAbstractionStarter]: For program point L54(lines 20 872) no Hoare annotation was computed. [2018-07-24 03:00:12,363 INFO L421 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2018-07-24 03:00:12,363 INFO L421 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2018-07-24 03:00:12,363 INFO L421 ceAbstractionStarter]: For program point L57(lines 20 872) no Hoare annotation was computed. [2018-07-24 03:00:12,363 INFO L421 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2018-07-24 03:00:12,363 INFO L421 ceAbstractionStarter]: For program point L60(lines 20 872) no Hoare annotation was computed. [2018-07-24 03:00:12,364 INFO L421 ceAbstractionStarter]: For program point L63(lines 20 872) no Hoare annotation was computed. [2018-07-24 03:00:12,364 INFO L421 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2018-07-24 03:00:12,364 INFO L421 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2018-07-24 03:00:12,364 INFO L421 ceAbstractionStarter]: For program point L66(lines 20 872) no Hoare annotation was computed. [2018-07-24 03:00:12,364 INFO L421 ceAbstractionStarter]: For program point L69(lines 20 872) no Hoare annotation was computed. [2018-07-24 03:00:12,364 INFO L421 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2018-07-24 03:00:12,364 INFO L421 ceAbstractionStarter]: For program point L72(lines 20 872) no Hoare annotation was computed. [2018-07-24 03:00:12,364 INFO L421 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2018-07-24 03:00:12,364 INFO L421 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2018-07-24 03:00:12,364 INFO L421 ceAbstractionStarter]: For program point L75(lines 20 872) no Hoare annotation was computed. [2018-07-24 03:00:12,364 INFO L421 ceAbstractionStarter]: For program point L78(lines 20 872) no Hoare annotation was computed. [2018-07-24 03:00:12,365 INFO L421 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2018-07-24 03:00:12,365 INFO L421 ceAbstractionStarter]: For program point L81(lines 20 872) no Hoare annotation was computed. [2018-07-24 03:00:12,365 INFO L421 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2018-07-24 03:00:12,365 INFO L421 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2018-07-24 03:00:12,365 INFO L421 ceAbstractionStarter]: For program point L84(lines 20 872) no Hoare annotation was computed. [2018-07-24 03:00:12,365 INFO L421 ceAbstractionStarter]: For program point L87(lines 20 872) no Hoare annotation was computed. [2018-07-24 03:00:12,365 INFO L421 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2018-07-24 03:00:12,365 INFO L421 ceAbstractionStarter]: For program point L801(lines 801 870) no Hoare annotation was computed. [2018-07-24 03:00:12,365 INFO L421 ceAbstractionStarter]: For program point L807(lines 807 870) no Hoare annotation was computed. [2018-07-24 03:00:12,365 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-07-24 03:00:12,365 INFO L421 ceAbstractionStarter]: For program point L90(lines 20 872) no Hoare annotation was computed. [2018-07-24 03:00:12,366 INFO L421 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2018-07-24 03:00:12,366 INFO L421 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2018-07-24 03:00:12,366 INFO L421 ceAbstractionStarter]: For program point L93(lines 20 872) no Hoare annotation was computed. [2018-07-24 03:00:12,366 INFO L421 ceAbstractionStarter]: For program point L96(lines 20 872) no Hoare annotation was computed. [2018-07-24 03:00:12,366 INFO L421 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2018-07-24 03:00:12,366 INFO L421 ceAbstractionStarter]: For program point L825(lines 825 870) no Hoare annotation was computed. [2018-07-24 03:00:12,366 INFO L421 ceAbstractionStarter]: For program point L814(lines 814 870) no Hoare annotation was computed. [2018-07-24 03:00:12,366 INFO L421 ceAbstractionStarter]: For program point L819(lines 819 870) no Hoare annotation was computed. [2018-07-24 03:00:12,366 INFO L421 ceAbstractionStarter]: For program point L842(lines 842 870) no Hoare annotation was computed. [2018-07-24 03:00:12,366 INFO L421 ceAbstractionStarter]: For program point L603(lines 603 870) no Hoare annotation was computed. [2018-07-24 03:00:12,366 INFO L421 ceAbstractionStarter]: For program point L609(lines 609 870) no Hoare annotation was computed. [2018-07-24 03:00:12,367 INFO L421 ceAbstractionStarter]: For program point L848(lines 848 870) no Hoare annotation was computed. [2018-07-24 03:00:12,367 INFO L421 ceAbstractionStarter]: For program point L831(lines 831 870) no Hoare annotation was computed. [2018-07-24 03:00:12,367 INFO L421 ceAbstractionStarter]: For program point L837(lines 837 870) no Hoare annotation was computed. [2018-07-24 03:00:12,367 INFO L421 ceAbstractionStarter]: For program point L865(lines 865 870) no Hoare annotation was computed. [2018-07-24 03:00:12,367 INFO L421 ceAbstractionStarter]: For program point L621(lines 621 870) no Hoare annotation was computed. [2018-07-24 03:00:12,367 INFO L421 ceAbstractionStarter]: For program point L626(lines 626 870) no Hoare annotation was computed. [2018-07-24 03:00:12,367 INFO L421 ceAbstractionStarter]: For program point L854(lines 854 870) no Hoare annotation was computed. [2018-07-24 03:00:12,367 INFO L421 ceAbstractionStarter]: For program point L615(lines 615 870) no Hoare annotation was computed. [2018-07-24 03:00:12,367 INFO L421 ceAbstractionStarter]: For program point L859(lines 859 870) no Hoare annotation was computed. [2018-07-24 03:00:12,367 INFO L421 ceAbstractionStarter]: For program point L880(lines 880 889) no Hoare annotation was computed. [2018-07-24 03:00:12,367 INFO L421 ceAbstractionStarter]: For program point L402(lines 402 870) no Hoare annotation was computed. [2018-07-24 03:00:12,368 INFO L421 ceAbstractionStarter]: For program point L644(lines 644 870) no Hoare annotation was computed. [2018-07-24 03:00:12,368 INFO L421 ceAbstractionStarter]: For program point L885(line 885) no Hoare annotation was computed. [2018-07-24 03:00:12,368 INFO L421 ceAbstractionStarter]: For program point L408(lines 408 870) no Hoare annotation was computed. [2018-07-24 03:00:12,368 INFO L417 ceAbstractionStarter]: At program point L871(lines 20 872) the Hoare annotation is: (let ((.cse0 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24~0 1))) (let ((.cse5 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 9)) (.cse15 (+ ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0 43)) (.cse17 (< 11 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0)) (.cse12 (and .cse0 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15~0 8))) (.cse13 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15~0 9))) (let ((.cse2 (not .cse13)) (.cse4 (or (<= .cse15 0) .cse17 .cse12)) (.cse1 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15~0 6))) (.cse14 (not .cse5)) (.cse16 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15~0 5))) (let ((.cse3 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 6)) (.cse6 (not .cse16)) (.cse11 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 10)) (.cse9 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 7)) (.cse10 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0 80)) (.cse8 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 8)) (.cse7 (and .cse2 .cse4 .cse0 .cse1 .cse14))) (or (and .cse0 .cse1 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 6)) (and .cse2 .cse3 (<= (+ ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0 49) 0) .cse1) (and .cse4 .cse0 .cse5 .cse6) (and .cse7 .cse6 .cse8) (and (and .cse7 .cse3) .cse6) (and .cse9 .cse0 .cse1 .cse6) (and (and .cse0 .cse4 .cse10) .cse5) (and .cse11 .cse12) (and .cse13 (and .cse0 .cse14)) (and .cse3 .cse0 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0 73282) .cse6) (and .cse0 .cse10 .cse6 .cse8) (and .cse7 .cse11 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15~0 7)) (and .cse2 (< 0 .cse15) .cse0 .cse6 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0 11)) (and .cse11 .cse0 .cse16) (and .cse9 .cse4 .cse0 .cse1 .cse10) (and .cse17 .cse10 .cse8 .cse7)))))) [2018-07-24 03:00:12,369 INFO L421 ceAbstractionStarter]: For program point L632(lines 632 870) no Hoare annotation was computed. [2018-07-24 03:00:12,369 INFO L424 ceAbstractionStarter]: At program point L874(lines 874 890) the Hoare annotation is: true [2018-07-24 03:00:12,369 INFO L421 ceAbstractionStarter]: For program point L638(lines 638 870) no Hoare annotation was computed. [2018-07-24 03:00:12,369 INFO L421 ceAbstractionStarter]: For program point L420(lines 420 870) no Hoare annotation was computed. [2018-07-24 03:00:12,369 INFO L421 ceAbstractionStarter]: For program point L662(lines 662 870) no Hoare annotation was computed. [2018-07-24 03:00:12,369 INFO L421 ceAbstractionStarter]: For program point L426(lines 426 870) no Hoare annotation was computed. [2018-07-24 03:00:12,369 INFO L421 ceAbstractionStarter]: For program point L668(lines 668 870) no Hoare annotation was computed. [2018-07-24 03:00:12,369 INFO L417 ceAbstractionStarter]: At program point L880''(lines 880 889) the Hoare annotation is: (let ((.cse0 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24~0 1))) (let ((.cse5 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 9)) (.cse15 (+ ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0 43)) (.cse17 (< 11 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0)) (.cse12 (and .cse0 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15~0 8))) (.cse13 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15~0 9))) (let ((.cse2 (not .cse13)) (.cse4 (or (<= .cse15 0) .cse17 .cse12)) (.cse1 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15~0 6))) (.cse14 (not .cse5)) (.cse16 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15~0 5))) (let ((.cse3 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 6)) (.cse6 (not .cse16)) (.cse11 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 10)) (.cse9 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 7)) (.cse10 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0 80)) (.cse8 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 8)) (.cse7 (and .cse2 .cse4 .cse0 .cse1 .cse14))) (or (and .cse0 .cse1 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 6)) (and .cse2 .cse3 (<= (+ ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0 49) 0) .cse1) (and .cse4 .cse0 .cse5 .cse6) (and .cse7 .cse6 .cse8) (and (and .cse7 .cse3) .cse6) (and .cse9 .cse0 .cse1 .cse6) (and (and .cse0 .cse4 .cse10) .cse5) (and .cse11 .cse12) (and .cse13 (and .cse0 .cse14)) (and .cse3 .cse0 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0 73282) .cse6) (and .cse0 .cse10 .cse6 .cse8) (and .cse7 .cse11 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15~0 7)) (and .cse2 (< 0 .cse15) .cse0 .cse6 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0 11)) (and .cse11 .cse0 .cse16) (and .cse9 .cse4 .cse0 .cse1 .cse10) (and .cse17 .cse10 .cse8 .cse7)))))) [2018-07-24 03:00:12,370 INFO L421 ceAbstractionStarter]: For program point L650(lines 650 870) no Hoare annotation was computed. [2018-07-24 03:00:12,370 INFO L421 ceAbstractionStarter]: For program point L414(lines 414 870) no Hoare annotation was computed. [2018-07-24 03:00:12,370 INFO L421 ceAbstractionStarter]: For program point L656(lines 656 870) no Hoare annotation was computed. [2018-07-24 03:00:12,370 INFO L421 ceAbstractionStarter]: For program point L201(lines 20 872) no Hoare annotation was computed. [2018-07-24 03:00:12,370 INFO L421 ceAbstractionStarter]: For program point L683(lines 683 870) no Hoare annotation was computed. [2018-07-24 03:00:12,370 INFO L421 ceAbstractionStarter]: For program point L688(lines 688 870) no Hoare annotation was computed. [2018-07-24 03:00:12,370 INFO L421 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2018-07-24 03:00:12,370 INFO L421 ceAbstractionStarter]: For program point L444(lines 444 870) no Hoare annotation was computed. [2018-07-24 03:00:12,370 INFO L421 ceAbstractionStarter]: For program point L449(lines 449 870) no Hoare annotation was computed. [2018-07-24 03:00:12,370 INFO L421 ceAbstractionStarter]: For program point L21'(lines 20 872) no Hoare annotation was computed. [2018-07-24 03:00:12,370 INFO L421 ceAbstractionStarter]: For program point L432(lines 432 870) no Hoare annotation was computed. [2018-07-24 03:00:12,370 INFO L421 ceAbstractionStarter]: For program point L674(lines 674 870) no Hoare annotation was computed. [2018-07-24 03:00:12,371 INFO L421 ceAbstractionStarter]: For program point L677(lines 677 870) no Hoare annotation was computed. [2018-07-24 03:00:12,371 INFO L421 ceAbstractionStarter]: For program point L438(lines 438 870) no Hoare annotation was computed. [2018-07-24 03:00:12,371 INFO L421 ceAbstractionStarter]: For program point L460(lines 460 870) no Hoare annotation was computed. [2018-07-24 03:00:12,371 INFO L421 ceAbstractionStarter]: For program point L223(lines 223 870) no Hoare annotation was computed. [2018-07-24 03:00:12,371 INFO L421 ceAbstractionStarter]: For program point L467(lines 467 870) no Hoare annotation was computed. [2018-07-24 03:00:12,371 INFO L421 ceAbstractionStarter]: For program point L229(lines 229 870) no Hoare annotation was computed. [2018-07-24 03:00:12,371 INFO L421 ceAbstractionStarter]: For program point L454(lines 454 870) no Hoare annotation was computed. [2018-07-24 03:00:12,371 INFO L421 ceAbstractionStarter]: For program point L211(lines 211 870) no Hoare annotation was computed. [2018-07-24 03:00:12,371 INFO L421 ceAbstractionStarter]: For program point L694(lines 694 870) no Hoare annotation was computed. [2018-07-24 03:00:12,371 INFO L421 ceAbstractionStarter]: For program point L217(lines 217 870) no Hoare annotation was computed. [2018-07-24 03:00:12,372 INFO L421 ceAbstractionStarter]: For program point L241(lines 241 870) no Hoare annotation was computed. [2018-07-24 03:00:12,372 INFO L421 ceAbstractionStarter]: For program point L484(lines 484 870) no Hoare annotation was computed. [2018-07-24 03:00:12,372 INFO L421 ceAbstractionStarter]: For program point L247(lines 247 870) no Hoare annotation was computed. [2018-07-24 03:00:12,372 INFO L421 ceAbstractionStarter]: For program point L490(lines 490 870) no Hoare annotation was computed. [2018-07-24 03:00:12,372 INFO L421 ceAbstractionStarter]: For program point L472(lines 472 870) no Hoare annotation was computed. [2018-07-24 03:00:12,372 INFO L421 ceAbstractionStarter]: For program point L478(lines 478 870) no Hoare annotation was computed. [2018-07-24 03:00:12,372 INFO L421 ceAbstractionStarter]: For program point L235(lines 235 870) no Hoare annotation was computed. [2018-07-24 03:00:12,372 INFO L421 ceAbstractionStarter]: For program point L264(lines 264 870) no Hoare annotation was computed. [2018-07-24 03:00:12,372 INFO L421 ceAbstractionStarter]: For program point L269(lines 269 870) no Hoare annotation was computed. [2018-07-24 03:00:12,373 INFO L421 ceAbstractionStarter]: For program point L252(lines 252 870) no Hoare annotation was computed. [2018-07-24 03:00:12,373 INFO L421 ceAbstractionStarter]: For program point L495(lines 495 870) no Hoare annotation was computed. [2018-07-24 03:00:12,373 INFO L421 ceAbstractionStarter]: For program point L258(lines 258 870) no Hoare annotation was computed. [2018-07-24 03:00:12,373 INFO L421 ceAbstractionStarter]: For program point L286(lines 286 870) no Hoare annotation was computed. [2018-07-24 03:00:12,373 INFO L421 ceAbstractionStarter]: For program point L275(lines 275 870) no Hoare annotation was computed. [2018-07-24 03:00:12,373 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startErr0AssertViolationERROR_FUNCTION(line 100) no Hoare annotation was computed. [2018-07-24 03:00:12,373 INFO L421 ceAbstractionStarter]: For program point L280(lines 280 870) no Hoare annotation was computed. [2018-07-24 03:00:12,373 INFO L421 ceAbstractionStarter]: For program point L293(lines 293 870) no Hoare annotation was computed. [2018-07-24 03:00:12,373 INFO L421 ceAbstractionStarter]: For program point L299(lines 299 870) no Hoare annotation was computed. [2018-07-24 03:00:12,416 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.07 03:00:12 BoogieIcfgContainer [2018-07-24 03:00:12,416 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-24 03:00:12,417 INFO L168 Benchmark]: Toolchain (without parser) took 87232.47 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 2.4 GB in the end (delta: -941.2 MB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2018-07-24 03:00:12,418 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-24 03:00:12,419 INFO L168 Benchmark]: CACSL2BoogieTranslator took 782.22 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-07-24 03:00:12,420 INFO L168 Benchmark]: Boogie Procedure Inliner took 150.78 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-07-24 03:00:12,420 INFO L168 Benchmark]: Boogie Preprocessor took 283.86 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 777.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -877.3 MB). Peak memory consumption was 34.8 MB. Max. memory is 7.1 GB. [2018-07-24 03:00:12,421 INFO L168 Benchmark]: RCFGBuilder took 3697.57 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 140.2 MB). Peak memory consumption was 140.2 MB. Max. memory is 7.1 GB. [2018-07-24 03:00:12,422 INFO L168 Benchmark]: TraceAbstraction took 82311.70 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 2.1 GB in the beginning and 2.4 GB in the end (delta: -257.1 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2018-07-24 03:00:12,427 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.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 782.22 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 150.78 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 283.86 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 777.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -877.3 MB). Peak memory consumption was 34.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3697.57 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 140.2 MB). Peak memory consumption was 140.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 82311.70 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 2.1 GB in the beginning and 2.4 GB in the end (delta: -257.1 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 100]: 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: 20]: Loop Invariant Derived loop invariant: ((((((((((((((((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1 && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 6)) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 6) || (((!(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 9) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 <= 6) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 + 49 <= 0) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 6))) || (((((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 + 43 <= 0 || 11 < __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12) || (__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 8)) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 9) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 5))) || ((((((!(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 9) && ((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 + 43 <= 0 || 11 < __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12) || (__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 8))) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 6)) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 9)) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 5)) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 8)) || ((((((!(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 9) && ((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 + 43 <= 0 || 11 < __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12) || (__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 8))) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 6)) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 9)) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 <= 6) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 5))) || (((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 7 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 6)) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 5))) || (((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1 && ((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 + 43 <= 0 || 11 < __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12) || (__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 8))) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 <= 80) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 9)) || (__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 10 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 8)) || (__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 9 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1 && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 9))) || (((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 <= 6 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 <= 73282) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 5))) || (((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 <= 80) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 5)) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 8)) || ((((((!(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 9) && ((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 + 43 <= 0 || 11 < __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12) || (__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 8))) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 6)) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 9)) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 10) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 7)) || ((((!(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 9) && 0 < __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 + 43) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 5)) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 <= 11)) || ((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 10 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 5)) || ((((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 7 && ((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 + 43 <= 0 || 11 < __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12) || (__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 8))) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 6)) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 <= 80)) || (((11 < __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 <= 80) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 8) && (((!(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 9) && ((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 + 43 <= 0 || 11 < __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12) || (__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 8))) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 6)) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 9)) - InvariantResult [Line: 880]: Loop Invariant Derived loop invariant: ((((((((((((((((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1 && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 6)) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 6) || (((!(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 9) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 <= 6) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 + 49 <= 0) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 6))) || (((((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 + 43 <= 0 || 11 < __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12) || (__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 8)) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 9) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 5))) || ((((((!(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 9) && ((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 + 43 <= 0 || 11 < __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12) || (__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 8))) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 6)) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 9)) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 5)) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 8)) || ((((((!(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 9) && ((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 + 43 <= 0 || 11 < __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12) || (__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 8))) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 6)) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 9)) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 <= 6) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 5))) || (((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 7 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 6)) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 5))) || (((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1 && ((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 + 43 <= 0 || 11 < __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12) || (__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 8))) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 <= 80) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 9)) || (__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 10 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 8)) || (__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 9 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1 && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 9))) || (((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 <= 6 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 <= 73282) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 5))) || (((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 <= 80) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 5)) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 8)) || ((((((!(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 9) && ((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 + 43 <= 0 || 11 < __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12) || (__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 8))) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 6)) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 9)) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 10) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 7)) || ((((!(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 9) && 0 < __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 + 43) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 5)) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 <= 11)) || ((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 10 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 5)) || ((((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 7 && ((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 + 43 <= 0 || 11 < __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12) || (__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 8))) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 6)) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 <= 80)) || (((11 < __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 <= 80) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 8) && (((!(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 9) && ((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 + 43 <= 0 || 11 < __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12) || (__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 8))) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 6)) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 9)) - InvariantResult [Line: 874]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 246 locations, 1 error locations. SAFE Result, 82.1s OverallTime, 18 OverallIterations, 12 TraceHistogramMax, 48.0s AutomataDifference, 0.0s DeadEndRemovalTime, 6.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 1750 SDtfs, 11275 SDslu, 2308 SDs, 0 SdLazy, 27227 SolverSat, 3242 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 39.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3597 GetRequests, 3505 SyntacticMatches, 6 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 6.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12224occurred in iteration=12, 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, 18 MinimizatonAttempts, 4468 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 156 NumberOfFragments, 743 HoareAnnotationTreeSize, 3 FomulaSimplifications, 30881 FormulaSimplificationTreeSizeReduction, 0.9s HoareSimplificationTime, 3 FomulaSimplificationsInter, 8380 FormulaSimplificationTreeSizeReductionInter, 5.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 14.0s InterpolantComputationTime, 15854 NumberOfCodeBlocks, 15854 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 15831 ConstructedInterpolants, 0 QuantifiedInterpolants, 41896353 SizeOfPredicates, 13 NumberOfNonLiveVariables, 4324 ConjunctsInSsa, 34 ConjunctsInUnsatCore, 23 InterpolantComputations, 16 PerfectInterpolantSequences, 45083/45757 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem14_label23_true-unreach-call_false-termination.c_svcomp-Reach-64bit-Automizer_Default.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-07-24_03-00-12-454.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem14_label23_true-unreach-call_false-termination.c_svcomp-Reach-64bit-Automizer_Default.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-24_03-00-12-454.csv Received shutdown request...