java -Xss4m -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem14_label45_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-71425fa [2018-07-22 13:04:27,194 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-22 13:04:27,196 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-22 13:04:27,209 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-22 13:04:27,209 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-22 13:04:27,210 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-22 13:04:27,212 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-22 13:04:27,220 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-22 13:04:27,222 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-22 13:04:27,225 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-22 13:04:27,226 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-22 13:04:27,226 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-22 13:04:27,227 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-22 13:04:27,230 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-22 13:04:27,231 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-22 13:04:27,232 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-22 13:04:27,233 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-22 13:04:27,234 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-22 13:04:27,236 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-22 13:04:27,238 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-22 13:04:27,239 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-22 13:04:27,240 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-22 13:04:27,242 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-22 13:04:27,243 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-22 13:04:27,243 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-22 13:04:27,244 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-22 13:04:27,245 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-22 13:04:27,246 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-22 13:04:27,246 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-22 13:04:27,248 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-22 13:04:27,248 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-22 13:04:27,249 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-22 13:04:27,249 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-22 13:04:27,249 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-22 13:04:27,250 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-22 13:04:27,251 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-22 13:04:27,251 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-07-22 13:04:27,266 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-22 13:04:27,266 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-22 13:04:27,267 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-07-22 13:04:27,267 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-07-22 13:04:27,268 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-07-22 13:04:27,268 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-07-22 13:04:27,268 INFO L133 SettingsManager]: * Use SBE=true [2018-07-22 13:04:27,268 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-07-22 13:04:27,268 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-07-22 13:04:27,269 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-07-22 13:04:27,269 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-07-22 13:04:27,269 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-07-22 13:04:27,269 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-07-22 13:04:27,269 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-07-22 13:04:27,270 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-07-22 13:04:27,270 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-22 13:04:27,270 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-07-22 13:04:27,270 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-07-22 13:04:27,270 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-07-22 13:04:27,271 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-07-22 13:04:27,271 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-22 13:04:27,271 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-07-22 13:04:27,271 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-07-22 13:04:27,271 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-07-22 13:04:27,271 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-07-22 13:04:27,272 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-07-22 13:04:27,272 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-07-22 13:04:27,272 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-22 13:04:27,272 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-07-22 13:04:27,322 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-22 13:04:27,341 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-22 13:04:27,344 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-22 13:04:27,346 INFO L271 PluginConnector]: Initializing CDTParser... [2018-07-22 13:04:27,346 INFO L276 PluginConnector]: CDTParser initialized [2018-07-22 13:04:27,347 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem14_label45_true-unreach-call_false-termination.c [2018-07-22 13:04:27,719 INFO L220 CDTParser]: Created temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/6a7b89fb2/73ea8ad5d73448c3952848e8c3b739e8/FLAGcae9a1a6e [2018-07-22 13:04:28,023 INFO L276 CDTParser]: Found 1 translation units. [2018-07-22 13:04:28,024 INFO L158 CDTParser]: Scanning /storage/ultimate/trunk/examples/svcomp/eca-rers2012/Problem14_label45_true-unreach-call_false-termination.c [2018-07-22 13:04:28,045 INFO L324 CDTParser]: About to delete temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/6a7b89fb2/73ea8ad5d73448c3952848e8c3b739e8/FLAGcae9a1a6e [2018-07-22 13:04:28,065 INFO L332 CDTParser]: Successfully deleted /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/6a7b89fb2/73ea8ad5d73448c3952848e8c3b739e8 [2018-07-22 13:04:28,079 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-22 13:04:28,087 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-07-22 13:04:28,089 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-07-22 13:04:28,089 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-07-22 13:04:28,095 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-07-22 13:04:28,095 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 01:04:28" (1/1) ... [2018-07-22 13:04:28,098 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@148681d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:04:28, skipping insertion in model container [2018-07-22 13:04:28,098 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 01:04:28" (1/1) ... [2018-07-22 13:04:28,318 INFO L179 PRDispatcher]: Starting pre-run dispatcher in SV-COMP mode [2018-07-22 13:04:28,627 INFO L175 PostProcessor]: Settings: Checked method=main [2018-07-22 13:04:28,645 INFO L422 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-07-22 13:04:28,840 INFO L175 PostProcessor]: Settings: Checked method=main [2018-07-22 13:04:28,904 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:04:28 WrapperNode [2018-07-22 13:04:28,905 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-07-22 13:04:28,906 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-07-22 13:04:28,906 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-07-22 13:04:28,906 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-07-22 13:04:28,920 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:04:28" (1/1) ... [2018-07-22 13:04:28,968 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:04:28" (1/1) ... [2018-07-22 13:04:29,074 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-07-22 13:04:29,074 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-22 13:04:29,074 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-22 13:04:29,074 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-22 13:04:29,086 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:04:28" (1/1) ... [2018-07-22 13:04:29,086 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:04:28" (1/1) ... [2018-07-22 13:04:29,098 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:04:28" (1/1) ... [2018-07-22 13:04:29,098 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:04:28" (1/1) ... [2018-07-22 13:04:29,145 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:04:28" (1/1) ... [2018-07-22 13:04:29,374 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:04:28" (1/1) ... [2018-07-22 13:04:29,394 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:04:28" (1/1) ... [2018-07-22 13:04:29,414 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-22 13:04:29,415 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-22 13:04:29,415 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-22 13:04:29,415 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-22 13:04:29,416 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:04:28" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-07-22 13:04:29,484 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-07-22 13:04:29,485 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-07-22 13:04:29,485 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-07-22 13:04:33,332 INFO L261 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-07-22 13:04:33,333 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 01:04:33 BoogieIcfgContainer [2018-07-22 13:04:33,333 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-22 13:04:33,334 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-22 13:04:33,334 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-22 13:04:33,338 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-22 13:04:33,338 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 01:04:28" (1/3) ... [2018-07-22 13:04:33,339 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56f032ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 01:04:33, skipping insertion in model container [2018-07-22 13:04:33,339 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:04:28" (2/3) ... [2018-07-22 13:04:33,339 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56f032ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 01:04:33, skipping insertion in model container [2018-07-22 13:04:33,340 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 01:04:33" (3/3) ... [2018-07-22 13:04:33,342 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem14_label45_true-unreach-call_false-termination.c [2018-07-22 13:04:33,351 INFO L132 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-07-22 13:04:33,360 INFO L144 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-22 13:04:33,412 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-22 13:04:33,413 INFO L373 AbstractCegarLoop]: Interprodecural is true [2018-07-22 13:04:33,413 INFO L374 AbstractCegarLoop]: Hoare is true [2018-07-22 13:04:33,413 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-07-22 13:04:33,413 INFO L376 AbstractCegarLoop]: Backedges is TWOTRACK [2018-07-22 13:04:33,413 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-22 13:04:33,414 INFO L378 AbstractCegarLoop]: Difference is false [2018-07-22 13:04:33,414 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-22 13:04:33,414 INFO L384 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-22 13:04:33,437 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states. [2018-07-22 13:04:33,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-07-22 13:04:33,446 INFO L350 BasicCegarLoop]: Found error trace [2018-07-22 13:04:33,447 INFO L358 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-22 13:04:33,448 INFO L414 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-22 13:04:33,453 INFO L82 PathProgramCache]: Analyzing trace with hash 680225122, now seen corresponding path program 1 times [2018-07-22 13:04:33,456 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-22 13:04:33,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-22 13:04:33,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 13:04:33,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-22 13:04:33,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 13:04:33,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-22 13:04:33,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-22 13:04:33,880 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-22 13:04:33,880 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-22 13:04:33,883 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-22 13:04:33,896 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-22 13:04:33,897 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-22 13:04:33,900 INFO L87 Difference]: Start difference. First operand 246 states. Second operand 4 states. [2018-07-22 13:04:36,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-22 13:04:36,656 INFO L93 Difference]: Finished difference Result 870 states and 1578 transitions. [2018-07-22 13:04:36,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-22 13:04:36,658 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2018-07-22 13:04:36,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-22 13:04:36,682 INFO L225 Difference]: With dead ends: 870 [2018-07-22 13:04:36,682 INFO L226 Difference]: Without dead ends: 617 [2018-07-22 13:04:36,688 INFO L578 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-22 13:04:36,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2018-07-22 13:04:36,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 422. [2018-07-22 13:04:36,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2018-07-22 13:04:36,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 648 transitions. [2018-07-22 13:04:36,764 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 648 transitions. Word has length 37 [2018-07-22 13:04:36,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-22 13:04:36,764 INFO L471 AbstractCegarLoop]: Abstraction has 422 states and 648 transitions. [2018-07-22 13:04:36,764 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-22 13:04:36,765 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 648 transitions. [2018-07-22 13:04:36,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-07-22 13:04:36,769 INFO L350 BasicCegarLoop]: Found error trace [2018-07-22 13:04:36,769 INFO L358 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-22 13:04:36,770 INFO L414 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-22 13:04:36,770 INFO L82 PathProgramCache]: Analyzing trace with hash -1683224818, now seen corresponding path program 1 times [2018-07-22 13:04:36,770 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-22 13:04:36,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-22 13:04:36,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 13:04:36,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-22 13:04:36,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 13:04:36,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-22 13:04:37,075 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-22 13:04:37,075 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-22 13:04:37,076 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-22 13:04:37,079 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-22 13:04:37,079 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-22 13:04:37,079 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-22 13:04:37,079 INFO L87 Difference]: Start difference. First operand 422 states and 648 transitions. Second operand 4 states. [2018-07-22 13:04:39,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-22 13:04:39,793 INFO L93 Difference]: Finished difference Result 1558 states and 2464 transitions. [2018-07-22 13:04:39,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-22 13:04:39,795 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 117 [2018-07-22 13:04:39,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-22 13:04:39,805 INFO L225 Difference]: With dead ends: 1558 [2018-07-22 13:04:39,805 INFO L226 Difference]: Without dead ends: 760 [2018-07-22 13:04:39,814 INFO L578 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-22 13:04:39,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2018-07-22 13:04:39,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 760. [2018-07-22 13:04:39,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 760 states. [2018-07-22 13:04:39,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 1122 transitions. [2018-07-22 13:04:39,887 INFO L78 Accepts]: Start accepts. Automaton has 760 states and 1122 transitions. Word has length 117 [2018-07-22 13:04:39,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-22 13:04:39,888 INFO L471 AbstractCegarLoop]: Abstraction has 760 states and 1122 transitions. [2018-07-22 13:04:39,888 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-22 13:04:39,888 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 1122 transitions. [2018-07-22 13:04:39,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-07-22 13:04:39,895 INFO L350 BasicCegarLoop]: Found error trace [2018-07-22 13:04:39,895 INFO L358 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-22 13:04:39,896 INFO L414 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-22 13:04:39,896 INFO L82 PathProgramCache]: Analyzing trace with hash -380483028, now seen corresponding path program 1 times [2018-07-22 13:04:39,897 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-22 13:04:39,897 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-22 13:04:39,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 13:04:39,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-22 13:04:39,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 13:04:39,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-22 13:04:40,441 WARN L169 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 17 [2018-07-22 13:04:40,508 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-22 13:04:40,509 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-22 13:04:40,509 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-07-22 13:04:40,510 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-22 13:04:40,510 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-22 13:04:40,510 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-07-22 13:04:40,510 INFO L87 Difference]: Start difference. First operand 760 states and 1122 transitions. Second operand 7 states. [2018-07-22 13:04:42,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-22 13:04:42,622 INFO L93 Difference]: Finished difference Result 1704 states and 2469 transitions. [2018-07-22 13:04:42,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-22 13:04:42,622 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 129 [2018-07-22 13:04:42,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-22 13:04:42,628 INFO L225 Difference]: With dead ends: 1704 [2018-07-22 13:04:42,628 INFO L226 Difference]: Without dead ends: 946 [2018-07-22 13:04:42,630 INFO L578 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-07-22 13:04:42,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 946 states. [2018-07-22 13:04:42,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 946 to 939. [2018-07-22 13:04:42,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 939 states. [2018-07-22 13:04:42,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 939 states to 939 states and 1307 transitions. [2018-07-22 13:04:42,666 INFO L78 Accepts]: Start accepts. Automaton has 939 states and 1307 transitions. Word has length 129 [2018-07-22 13:04:42,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-22 13:04:42,667 INFO L471 AbstractCegarLoop]: Abstraction has 939 states and 1307 transitions. [2018-07-22 13:04:42,667 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-22 13:04:42,667 INFO L276 IsEmpty]: Start isEmpty. Operand 939 states and 1307 transitions. [2018-07-22 13:04:42,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-07-22 13:04:42,674 INFO L350 BasicCegarLoop]: Found error trace [2018-07-22 13:04:42,675 INFO L358 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-22 13:04:42,675 INFO L414 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-22 13:04:42,675 INFO L82 PathProgramCache]: Analyzing trace with hash -807525568, now seen corresponding path program 1 times [2018-07-22 13:04:42,675 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-22 13:04:42,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-22 13:04:42,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 13:04:42,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-22 13:04:42,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 13:04:42,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-22 13:04:43,254 WARN L169 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 9 [2018-07-22 13:04:43,642 WARN L169 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 16 [2018-07-22 13:04:43,693 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 139 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-07-22 13:04:43,693 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-22 13:04:43,693 INFO L219 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-22 13:04:43,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-22 13:04:43,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-22 13:04:43,796 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-22 13:04:43,872 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-07-22 13:04:43,898 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-07-22 13:04:43,899 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2018-07-22 13:04:43,899 INFO L450 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-22 13:04:43,900 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-22 13:04:43,900 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-07-22 13:04:43,900 INFO L87 Difference]: Start difference. First operand 939 states and 1307 transitions. Second operand 6 states. [2018-07-22 13:04:47,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-22 13:04:47,991 INFO L93 Difference]: Finished difference Result 3524 states and 4877 transitions. [2018-07-22 13:04:47,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-07-22 13:04:47,991 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 210 [2018-07-22 13:04:47,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-22 13:04:48,001 INFO L225 Difference]: With dead ends: 3524 [2018-07-22 13:04:48,002 INFO L226 Difference]: Without dead ends: 2376 [2018-07-22 13:04:48,004 INFO L578 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 212 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2018-07-22 13:04:48,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2376 states. [2018-07-22 13:04:48,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2376 to 1833. [2018-07-22 13:04:48,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1833 states. [2018-07-22 13:04:48,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1833 states to 1833 states and 2081 transitions. [2018-07-22 13:04:48,064 INFO L78 Accepts]: Start accepts. Automaton has 1833 states and 2081 transitions. Word has length 210 [2018-07-22 13:04:48,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-22 13:04:48,064 INFO L471 AbstractCegarLoop]: Abstraction has 1833 states and 2081 transitions. [2018-07-22 13:04:48,064 INFO L472 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-22 13:04:48,066 INFO L276 IsEmpty]: Start isEmpty. Operand 1833 states and 2081 transitions. [2018-07-22 13:04:48,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2018-07-22 13:04:48,071 INFO L350 BasicCegarLoop]: Found error trace [2018-07-22 13:04:48,072 INFO L358 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-22 13:04:48,072 INFO L414 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-22 13:04:48,072 INFO L82 PathProgramCache]: Analyzing trace with hash 626607161, now seen corresponding path program 1 times [2018-07-22 13:04:48,072 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-22 13:04:48,073 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-22 13:04:48,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 13:04:48,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-22 13:04:48,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 13:04:48,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-22 13:04:48,496 WARN L169 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-07-22 13:04:48,828 WARN L169 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 12 [2018-07-22 13:04:49,310 WARN L169 SmtUtils]: Spent 421.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 19 [2018-07-22 13:04:49,733 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 159 proven. 132 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2018-07-22 13:04:49,733 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-22 13:04:49,733 INFO L219 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-22 13:04:49,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-22 13:04:49,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-22 13:04:49,866 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-22 13:04:50,013 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2018-07-22 13:04:50,034 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-07-22 13:04:50,034 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2018-07-22 13:04:50,035 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-22 13:04:50,035 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-22 13:04:50,035 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-07-22 13:04:50,035 INFO L87 Difference]: Start difference. First operand 1833 states and 2081 transitions. Second operand 7 states. [2018-07-22 13:04:51,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-22 13:04:51,308 INFO L93 Difference]: Finished difference Result 4384 states and 5007 transitions. [2018-07-22 13:04:51,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-07-22 13:04:51,308 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 333 [2018-07-22 13:04:51,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-22 13:04:51,324 INFO L225 Difference]: With dead ends: 4384 [2018-07-22 13:04:51,324 INFO L226 Difference]: Without dead ends: 2732 [2018-07-22 13:04:51,327 INFO L578 BasicCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 333 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-07-22 13:04:51,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2732 states. [2018-07-22 13:04:51,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2732 to 2728. [2018-07-22 13:04:51,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2728 states. [2018-07-22 13:04:51,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2728 states to 2728 states and 3005 transitions. [2018-07-22 13:04:51,393 INFO L78 Accepts]: Start accepts. Automaton has 2728 states and 3005 transitions. Word has length 333 [2018-07-22 13:04:51,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-22 13:04:51,394 INFO L471 AbstractCegarLoop]: Abstraction has 2728 states and 3005 transitions. [2018-07-22 13:04:51,394 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-22 13:04:51,394 INFO L276 IsEmpty]: Start isEmpty. Operand 2728 states and 3005 transitions. [2018-07-22 13:04:51,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 443 [2018-07-22 13:04:51,404 INFO L350 BasicCegarLoop]: Found error trace [2018-07-22 13:04:51,405 INFO L358 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-22 13:04:51,405 INFO L414 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-22 13:04:51,405 INFO L82 PathProgramCache]: Analyzing trace with hash 1453595235, now seen corresponding path program 1 times [2018-07-22 13:04:51,405 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-22 13:04:51,405 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-22 13:04:51,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 13:04:51,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-22 13:04:51,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 13:04:51,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-22 13:04:51,760 INFO L134 CoverageAnalysis]: Checked inductivity of 704 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 565 trivial. 0 not checked. [2018-07-22 13:04:51,760 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-22 13:04:51,760 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-22 13:04:51,761 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-22 13:04:51,761 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-22 13:04:51,761 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-22 13:04:51,761 INFO L87 Difference]: Start difference. First operand 2728 states and 3005 transitions. Second operand 4 states. [2018-07-22 13:04:52,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-22 13:04:52,801 INFO L93 Difference]: Finished difference Result 6707 states and 7633 transitions. [2018-07-22 13:04:52,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-22 13:04:52,802 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 442 [2018-07-22 13:04:52,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-22 13:04:52,818 INFO L225 Difference]: With dead ends: 6707 [2018-07-22 13:04:52,818 INFO L226 Difference]: Without dead ends: 4160 [2018-07-22 13:04:52,823 INFO L578 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-22 13:04:52,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4160 states. [2018-07-22 13:04:52,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4160 to 4160. [2018-07-22 13:04:52,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4160 states. [2018-07-22 13:04:52,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4160 states to 4160 states and 4651 transitions. [2018-07-22 13:04:52,913 INFO L78 Accepts]: Start accepts. Automaton has 4160 states and 4651 transitions. Word has length 442 [2018-07-22 13:04:52,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-22 13:04:52,914 INFO L471 AbstractCegarLoop]: Abstraction has 4160 states and 4651 transitions. [2018-07-22 13:04:52,914 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-22 13:04:52,914 INFO L276 IsEmpty]: Start isEmpty. Operand 4160 states and 4651 transitions. [2018-07-22 13:04:52,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 476 [2018-07-22 13:04:52,929 INFO L350 BasicCegarLoop]: Found error trace [2018-07-22 13:04:52,929 INFO L358 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-22 13:04:52,930 INFO L414 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-22 13:04:52,930 INFO L82 PathProgramCache]: Analyzing trace with hash 993275040, now seen corresponding path program 1 times [2018-07-22 13:04:52,930 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-22 13:04:52,930 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-22 13:04:52,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 13:04:52,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-22 13:04:52,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 13:04:53,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-22 13:04:53,460 WARN L169 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 8 [2018-07-22 13:04:53,570 INFO L134 CoverageAnalysis]: Checked inductivity of 777 backedges. 637 proven. 0 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2018-07-22 13:04:53,570 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-22 13:04:53,570 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-22 13:04:53,571 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-22 13:04:53,571 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-22 13:04:53,571 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-22 13:04:53,573 INFO L87 Difference]: Start difference. First operand 4160 states and 4651 transitions. Second operand 4 states. [2018-07-22 13:04:54,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-22 13:04:54,352 INFO L93 Difference]: Finished difference Result 8139 states and 9120 transitions. [2018-07-22 13:04:54,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-22 13:04:54,353 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 475 [2018-07-22 13:04:54,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-22 13:04:54,366 INFO L225 Difference]: With dead ends: 8139 [2018-07-22 13:04:54,366 INFO L226 Difference]: Without dead ends: 4160 [2018-07-22 13:04:54,370 INFO L578 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-22 13:04:54,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4160 states. [2018-07-22 13:04:54,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4160 to 4160. [2018-07-22 13:04:54,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4160 states. [2018-07-22 13:04:54,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4160 states to 4160 states and 4445 transitions. [2018-07-22 13:04:54,447 INFO L78 Accepts]: Start accepts. Automaton has 4160 states and 4445 transitions. Word has length 475 [2018-07-22 13:04:54,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-22 13:04:54,448 INFO L471 AbstractCegarLoop]: Abstraction has 4160 states and 4445 transitions. [2018-07-22 13:04:54,449 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-22 13:04:54,449 INFO L276 IsEmpty]: Start isEmpty. Operand 4160 states and 4445 transitions. [2018-07-22 13:04:54,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 500 [2018-07-22 13:04:54,464 INFO L350 BasicCegarLoop]: Found error trace [2018-07-22 13:04:54,465 INFO L358 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-22 13:04:54,465 INFO L414 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-22 13:04:54,465 INFO L82 PathProgramCache]: Analyzing trace with hash -958550812, now seen corresponding path program 1 times [2018-07-22 13:04:54,466 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-22 13:04:54,466 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-22 13:04:54,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 13:04:54,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-22 13:04:54,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 13:04:54,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-22 13:04:54,912 WARN L169 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 12 [2018-07-22 13:04:55,310 INFO L134 CoverageAnalysis]: Checked inductivity of 791 backedges. 566 proven. 46 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2018-07-22 13:04:55,310 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-22 13:04:55,310 INFO L219 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-22 13:04:55,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-22 13:04:55,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-22 13:04:55,428 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-22 13:04:55,883 INFO L134 CoverageAnalysis]: Checked inductivity of 791 backedges. 589 proven. 23 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2018-07-22 13:04:55,915 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-22 13:04:55,915 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2018-07-22 13:04:55,916 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-22 13:04:55,916 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-22 13:04:55,916 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-07-22 13:04:55,916 INFO L87 Difference]: Start difference. First operand 4160 states and 4445 transitions. Second operand 9 states. [2018-07-22 13:04:58,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-22 13:04:58,570 INFO L93 Difference]: Finished difference Result 9293 states and 9925 transitions. [2018-07-22 13:04:58,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-22 13:04:58,621 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 499 [2018-07-22 13:04:58,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-22 13:04:58,637 INFO L225 Difference]: With dead ends: 9293 [2018-07-22 13:04:58,637 INFO L226 Difference]: Without dead ends: 5134 [2018-07-22 13:04:58,640 INFO L578 BasicCegarLoop]: 0 DeclaredPredicates, 508 GetRequests, 497 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2018-07-22 13:04:58,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5134 states. [2018-07-22 13:04:58,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5134 to 4875. [2018-07-22 13:04:58,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4875 states. [2018-07-22 13:04:58,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4875 states to 4875 states and 5181 transitions. [2018-07-22 13:04:58,725 INFO L78 Accepts]: Start accepts. Automaton has 4875 states and 5181 transitions. Word has length 499 [2018-07-22 13:04:58,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-22 13:04:58,725 INFO L471 AbstractCegarLoop]: Abstraction has 4875 states and 5181 transitions. [2018-07-22 13:04:58,725 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-22 13:04:58,725 INFO L276 IsEmpty]: Start isEmpty. Operand 4875 states and 5181 transitions. [2018-07-22 13:04:58,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 657 [2018-07-22 13:04:58,730 INFO L350 BasicCegarLoop]: Found error trace [2018-07-22 13:04:58,731 INFO L358 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-22 13:04:58,731 INFO L414 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-22 13:04:58,731 INFO L82 PathProgramCache]: Analyzing trace with hash -544950873, now seen corresponding path program 1 times [2018-07-22 13:04:58,731 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-22 13:04:58,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-22 13:04:58,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 13:04:58,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-22 13:04:58,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 13:04:58,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-22 13:04:59,397 INFO L134 CoverageAnalysis]: Checked inductivity of 1259 backedges. 907 proven. 0 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2018-07-22 13:04:59,397 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-22 13:04:59,397 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-22 13:04:59,398 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-22 13:04:59,398 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-22 13:04:59,398 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-22 13:04:59,398 INFO L87 Difference]: Start difference. First operand 4875 states and 5181 transitions. Second operand 3 states. [2018-07-22 13:04:59,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-22 13:04:59,970 INFO L93 Difference]: Finished difference Result 11717 states and 12551 transitions. [2018-07-22 13:04:59,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-22 13:04:59,971 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 656 [2018-07-22 13:04:59,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-22 13:04:59,995 INFO L225 Difference]: With dead ends: 11717 [2018-07-22 13:04:59,996 INFO L226 Difference]: Without dead ends: 7023 [2018-07-22 13:05:00,005 INFO L578 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-22 13:05:00,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7023 states. [2018-07-22 13:05:00,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7023 to 7023. [2018-07-22 13:05:00,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7023 states. [2018-07-22 13:05:00,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7023 states to 7023 states and 7503 transitions. [2018-07-22 13:05:00,128 INFO L78 Accepts]: Start accepts. Automaton has 7023 states and 7503 transitions. Word has length 656 [2018-07-22 13:05:00,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-22 13:05:00,129 INFO L471 AbstractCegarLoop]: Abstraction has 7023 states and 7503 transitions. [2018-07-22 13:05:00,129 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-22 13:05:00,129 INFO L276 IsEmpty]: Start isEmpty. Operand 7023 states and 7503 transitions. [2018-07-22 13:05:00,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 705 [2018-07-22 13:05:00,142 INFO L350 BasicCegarLoop]: Found error trace [2018-07-22 13:05:00,142 INFO L358 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, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2018-07-22 13:05:00,142 INFO L414 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-22 13:05:00,143 INFO L82 PathProgramCache]: Analyzing trace with hash -470063910, now seen corresponding path program 1 times [2018-07-22 13:05:00,143 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-22 13:05:00,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-22 13:05:00,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 13:05:00,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-22 13:05:00,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 13:05:00,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-22 13:05:00,957 WARN L169 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 13 [2018-07-22 13:05:01,335 INFO L134 CoverageAnalysis]: Checked inductivity of 1633 backedges. 1014 proven. 0 refuted. 0 times theorem prover too weak. 619 trivial. 0 not checked. [2018-07-22 13:05:01,335 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-22 13:05:01,335 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-07-22 13:05:01,336 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-22 13:05:01,336 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-22 13:05:01,336 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-07-22 13:05:01,336 INFO L87 Difference]: Start difference. First operand 7023 states and 7503 transitions. Second operand 7 states. [2018-07-22 13:05:02,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-22 13:05:02,630 INFO L93 Difference]: Finished difference Result 14100 states and 15072 transitions. [2018-07-22 13:05:02,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-22 13:05:02,631 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 704 [2018-07-22 13:05:02,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-22 13:05:02,652 INFO L225 Difference]: With dead ends: 14100 [2018-07-22 13:05:02,652 INFO L226 Difference]: Without dead ends: 6662 [2018-07-22 13:05:02,667 INFO L578 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-07-22 13:05:02,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6662 states. [2018-07-22 13:05:02,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6662 to 6483. [2018-07-22 13:05:02,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6483 states. [2018-07-22 13:05:02,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6483 states to 6483 states and 6884 transitions. [2018-07-22 13:05:02,773 INFO L78 Accepts]: Start accepts. Automaton has 6483 states and 6884 transitions. Word has length 704 [2018-07-22 13:05:02,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-22 13:05:02,775 INFO L471 AbstractCegarLoop]: Abstraction has 6483 states and 6884 transitions. [2018-07-22 13:05:02,775 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-22 13:05:02,775 INFO L276 IsEmpty]: Start isEmpty. Operand 6483 states and 6884 transitions. [2018-07-22 13:05:02,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 730 [2018-07-22 13:05:02,787 INFO L350 BasicCegarLoop]: Found error trace [2018-07-22 13:05:02,787 INFO L358 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, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-22 13:05:02,787 INFO L414 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-22 13:05:02,788 INFO L82 PathProgramCache]: Analyzing trace with hash -1841303999, now seen corresponding path program 1 times [2018-07-22 13:05:02,788 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-22 13:05:02,788 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-22 13:05:02,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 13:05:02,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-22 13:05:02,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 13:05:02,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-22 13:05:03,381 INFO L134 CoverageAnalysis]: Checked inductivity of 1658 backedges. 1155 proven. 0 refuted. 0 times theorem prover too weak. 503 trivial. 0 not checked. [2018-07-22 13:05:03,381 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-22 13:05:03,381 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-22 13:05:03,382 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-22 13:05:03,382 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-22 13:05:03,382 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-22 13:05:03,382 INFO L87 Difference]: Start difference. First operand 6483 states and 6884 transitions. Second operand 3 states. [2018-07-22 13:05:05,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-22 13:05:05,041 INFO L93 Difference]: Finished difference Result 14396 states and 15314 transitions. [2018-07-22 13:05:05,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-22 13:05:05,041 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 729 [2018-07-22 13:05:05,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-22 13:05:05,062 INFO L225 Difference]: With dead ends: 14396 [2018-07-22 13:05:05,062 INFO L226 Difference]: Without dead ends: 8094 [2018-07-22 13:05:05,069 INFO L578 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-22 13:05:05,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8094 states. [2018-07-22 13:05:05,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8094 to 8094. [2018-07-22 13:05:05,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8094 states. [2018-07-22 13:05:05,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8094 states to 8094 states and 8564 transitions. [2018-07-22 13:05:05,177 INFO L78 Accepts]: Start accepts. Automaton has 8094 states and 8564 transitions. Word has length 729 [2018-07-22 13:05:05,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-22 13:05:05,178 INFO L471 AbstractCegarLoop]: Abstraction has 8094 states and 8564 transitions. [2018-07-22 13:05:05,178 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-22 13:05:05,178 INFO L276 IsEmpty]: Start isEmpty. Operand 8094 states and 8564 transitions. [2018-07-22 13:05:05,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 886 [2018-07-22 13:05:05,191 INFO L350 BasicCegarLoop]: Found error trace [2018-07-22 13:05:05,191 INFO L358 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, 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, 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, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-22 13:05:05,191 INFO L414 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-22 13:05:05,192 INFO L82 PathProgramCache]: Analyzing trace with hash -233229417, now seen corresponding path program 1 times [2018-07-22 13:05:05,192 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-22 13:05:05,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-22 13:05:05,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 13:05:05,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-22 13:05:05,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 13:05:05,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-22 13:05:06,018 INFO L134 CoverageAnalysis]: Checked inductivity of 2364 backedges. 1535 proven. 0 refuted. 0 times theorem prover too weak. 829 trivial. 0 not checked. [2018-07-22 13:05:06,019 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-22 13:05:06,019 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-22 13:05:06,019 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-22 13:05:06,020 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-22 13:05:06,020 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-22 13:05:06,020 INFO L87 Difference]: Start difference. First operand 8094 states and 8564 transitions. Second operand 4 states. [2018-07-22 13:05:06,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-22 13:05:06,949 INFO L93 Difference]: Finished difference Result 17797 states and 18885 transitions. [2018-07-22 13:05:06,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-22 13:05:06,949 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 885 [2018-07-22 13:05:06,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-22 13:05:06,967 INFO L225 Difference]: With dead ends: 17797 [2018-07-22 13:05:06,967 INFO L226 Difference]: Without dead ends: 9884 [2018-07-22 13:05:06,975 INFO L578 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-22 13:05:06,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9884 states. [2018-07-22 13:05:07,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9884 to 9884. [2018-07-22 13:05:07,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9884 states. [2018-07-22 13:05:07,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9884 states to 9884 states and 10400 transitions. [2018-07-22 13:05:07,104 INFO L78 Accepts]: Start accepts. Automaton has 9884 states and 10400 transitions. Word has length 885 [2018-07-22 13:05:07,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-22 13:05:07,104 INFO L471 AbstractCegarLoop]: Abstraction has 9884 states and 10400 transitions. [2018-07-22 13:05:07,104 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-22 13:05:07,105 INFO L276 IsEmpty]: Start isEmpty. Operand 9884 states and 10400 transitions. [2018-07-22 13:05:07,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1058 [2018-07-22 13:05:07,118 INFO L350 BasicCegarLoop]: Found error trace [2018-07-22 13:05:07,119 INFO L358 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 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, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-22 13:05:07,119 INFO L414 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-22 13:05:07,120 INFO L82 PathProgramCache]: Analyzing trace with hash 844250533, now seen corresponding path program 1 times [2018-07-22 13:05:07,120 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-22 13:05:07,120 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-22 13:05:07,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 13:05:07,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-22 13:05:07,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 13:05:07,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-22 13:05:08,193 WARN L169 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 8 [2018-07-22 13:05:08,735 INFO L134 CoverageAnalysis]: Checked inductivity of 3596 backedges. 1099 proven. 0 refuted. 0 times theorem prover too weak. 2497 trivial. 0 not checked. [2018-07-22 13:05:08,735 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-22 13:05:08,735 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-22 13:05:08,736 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-22 13:05:08,736 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-22 13:05:08,736 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-22 13:05:08,736 INFO L87 Difference]: Start difference. First operand 9884 states and 10400 transitions. Second operand 4 states. [2018-07-22 13:05:09,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-22 13:05:09,583 INFO L93 Difference]: Finished difference Result 20303 states and 21395 transitions. [2018-07-22 13:05:09,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-22 13:05:09,583 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1057 [2018-07-22 13:05:09,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-22 13:05:09,596 INFO L225 Difference]: With dead ends: 20303 [2018-07-22 13:05:09,597 INFO L226 Difference]: Without dead ends: 9881 [2018-07-22 13:05:09,607 INFO L578 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-22 13:05:09,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9881 states. [2018-07-22 13:05:09,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9881 to 9523. [2018-07-22 13:05:09,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9523 states. [2018-07-22 13:05:09,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9523 states to 9523 states and 9875 transitions. [2018-07-22 13:05:09,741 INFO L78 Accepts]: Start accepts. Automaton has 9523 states and 9875 transitions. Word has length 1057 [2018-07-22 13:05:09,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-22 13:05:09,742 INFO L471 AbstractCegarLoop]: Abstraction has 9523 states and 9875 transitions. [2018-07-22 13:05:09,742 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-22 13:05:09,742 INFO L276 IsEmpty]: Start isEmpty. Operand 9523 states and 9875 transitions. [2018-07-22 13:05:09,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1106 [2018-07-22 13:05:09,759 INFO L350 BasicCegarLoop]: Found error trace [2018-07-22 13:05:09,760 INFO L358 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 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, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-22 13:05:09,760 INFO L414 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-22 13:05:09,763 INFO L82 PathProgramCache]: Analyzing trace with hash 659954717, now seen corresponding path program 1 times [2018-07-22 13:05:09,763 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-22 13:05:09,763 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-22 13:05:09,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 13:05:09,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-22 13:05:09,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 13:05:09,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-22 13:05:11,326 INFO L134 CoverageAnalysis]: Checked inductivity of 3833 backedges. 2480 proven. 0 refuted. 0 times theorem prover too weak. 1353 trivial. 0 not checked. [2018-07-22 13:05:11,327 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-22 13:05:11,327 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-22 13:05:11,332 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-22 13:05:11,332 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-22 13:05:11,332 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-07-22 13:05:11,332 INFO L87 Difference]: Start difference. First operand 9523 states and 9875 transitions. Second operand 5 states. [2018-07-22 13:05:13,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-22 13:05:13,233 INFO L93 Difference]: Finished difference Result 19942 states and 20686 transitions. [2018-07-22 13:05:13,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-22 13:05:13,234 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1105 [2018-07-22 13:05:13,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-22 13:05:13,247 INFO L225 Difference]: With dead ends: 19942 [2018-07-22 13:05:13,247 INFO L226 Difference]: Without dead ends: 10600 [2018-07-22 13:05:13,254 INFO L578 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-07-22 13:05:13,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10600 states. [2018-07-22 13:05:13,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10600 to 9702. [2018-07-22 13:05:13,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9702 states. [2018-07-22 13:05:13,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9702 states to 9702 states and 10057 transitions. [2018-07-22 13:05:13,382 INFO L78 Accepts]: Start accepts. Automaton has 9702 states and 10057 transitions. Word has length 1105 [2018-07-22 13:05:13,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-22 13:05:13,383 INFO L471 AbstractCegarLoop]: Abstraction has 9702 states and 10057 transitions. [2018-07-22 13:05:13,384 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-22 13:05:13,384 INFO L276 IsEmpty]: Start isEmpty. Operand 9702 states and 10057 transitions. [2018-07-22 13:05:13,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1647 [2018-07-22 13:05:13,410 INFO L350 BasicCegarLoop]: Found error trace [2018-07-22 13:05:13,411 INFO L358 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 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, 10, 9, 9, 9, 8, 8, 8, 8, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1] [2018-07-22 13:05:13,411 INFO L414 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-22 13:05:13,412 INFO L82 PathProgramCache]: Analyzing trace with hash 1518888912, now seen corresponding path program 1 times [2018-07-22 13:05:13,412 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-22 13:05:13,412 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-22 13:05:13,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 13:05:13,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-22 13:05:13,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 13:05:13,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-22 13:05:15,721 INFO L134 CoverageAnalysis]: Checked inductivity of 8578 backedges. 3516 proven. 441 refuted. 0 times theorem prover too weak. 4621 trivial. 0 not checked. [2018-07-22 13:05:15,722 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-22 13:05:15,737 INFO L219 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-22 13:05:15,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-22 13:05:16,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-22 13:05:16,136 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-22 13:05:18,359 INFO L134 CoverageAnalysis]: Checked inductivity of 8578 backedges. 3586 proven. 371 refuted. 0 times theorem prover too weak. 4621 trivial. 0 not checked. [2018-07-22 13:05:18,380 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-22 13:05:18,380 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 10 [2018-07-22 13:05:18,381 INFO L450 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-22 13:05:18,381 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-22 13:05:18,382 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-07-22 13:05:18,382 INFO L87 Difference]: Start difference. First operand 9702 states and 10057 transitions. Second operand 10 states. [2018-07-22 13:05:22,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-22 13:05:22,013 INFO L93 Difference]: Finished difference Result 21200 states and 22001 transitions. [2018-07-22 13:05:22,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-22 13:05:22,014 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 1646 [2018-07-22 13:05:22,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-22 13:05:22,030 INFO L225 Difference]: With dead ends: 21200 [2018-07-22 13:05:22,030 INFO L226 Difference]: Without dead ends: 11679 [2018-07-22 13:05:22,039 INFO L578 BasicCegarLoop]: 0 DeclaredPredicates, 1660 GetRequests, 1647 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2018-07-22 13:05:22,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11679 states. [2018-07-22 13:05:22,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11679 to 10961. [2018-07-22 13:05:22,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10961 states. [2018-07-22 13:05:22,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10961 states to 10961 states and 11284 transitions. [2018-07-22 13:05:22,185 INFO L78 Accepts]: Start accepts. Automaton has 10961 states and 11284 transitions. Word has length 1646 [2018-07-22 13:05:22,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-22 13:05:22,186 INFO L471 AbstractCegarLoop]: Abstraction has 10961 states and 11284 transitions. [2018-07-22 13:05:22,186 INFO L472 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-22 13:05:22,187 INFO L276 IsEmpty]: Start isEmpty. Operand 10961 states and 11284 transitions. [2018-07-22 13:05:22,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1821 [2018-07-22 13:05:22,217 INFO L350 BasicCegarLoop]: Found error trace [2018-07-22 13:05:22,218 INFO L358 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 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, 10, 9, 9, 9, 9, 9, 9, 8, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-22 13:05:22,218 INFO L414 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-22 13:05:22,219 INFO L82 PathProgramCache]: Analyzing trace with hash -1871214169, now seen corresponding path program 1 times [2018-07-22 13:05:22,219 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-22 13:05:22,219 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-22 13:05:22,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 13:05:22,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-22 13:05:22,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 13:05:22,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-22 13:05:24,491 INFO L134 CoverageAnalysis]: Checked inductivity of 10200 backedges. 4382 proven. 0 refuted. 0 times theorem prover too weak. 5818 trivial. 0 not checked. [2018-07-22 13:05:24,491 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-22 13:05:24,491 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-22 13:05:24,492 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-22 13:05:24,492 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-22 13:05:24,492 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-22 13:05:24,493 INFO L87 Difference]: Start difference. First operand 10961 states and 11284 transitions. Second operand 4 states. [2018-07-22 13:05:25,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-22 13:05:25,523 INFO L93 Difference]: Finished difference Result 19761 states and 20309 transitions. [2018-07-22 13:05:25,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-22 13:05:25,524 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1820 [2018-07-22 13:05:25,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-22 13:05:25,525 INFO L225 Difference]: With dead ends: 19761 [2018-07-22 13:05:25,525 INFO L226 Difference]: Without dead ends: 0 [2018-07-22 13:05:25,531 INFO L578 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-22 13:05:25,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-07-22 13:05:25,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-07-22 13:05:25,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-07-22 13:05:25,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-07-22 13:05:25,531 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1820 [2018-07-22 13:05:25,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-22 13:05:25,532 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-07-22 13:05:25,532 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-22 13:05:25,532 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-07-22 13:05:25,532 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-07-22 13:05:25,536 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-07-22 13:05:25,611 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 13:05:25,639 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 13:05:25,645 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 13:05:25,651 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 13:05:25,670 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 13:05:25,676 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 13:05:25,679 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 13:05:25,690 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 13:05:25,723 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 13:05:25,730 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 13:05:25,751 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 13:05:25,752 WARN L169 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 236 DAG size of output: 169 [2018-07-22 13:05:25,795 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 13:05:25,817 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 13:05:25,822 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 13:05:25,827 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 13:05:25,846 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 13:05:25,852 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 13:05:25,855 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 13:05:25,866 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 13:05:25,898 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 13:05:25,905 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 13:05:25,925 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 13:05:25,926 WARN L169 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 239 DAG size of output: 167 [2018-07-22 13:05:27,579 WARN L169 SmtUtils]: Spent 1.65 s on a formula simplification. DAG size of input: 150 DAG size of output: 83 [2018-07-22 13:05:30,327 WARN L169 SmtUtils]: Spent 2.75 s on a formula simplification. DAG size of input: 147 DAG size of output: 79 [2018-07-22 13:05:30,329 INFO L421 ceAbstractionStarter]: For program point L700(lines 700 870) no Hoare annotation was computed. [2018-07-22 13:05:30,330 INFO L421 ceAbstractionStarter]: For program point L706(lines 706 870) no Hoare annotation was computed. [2018-07-22 13:05:30,330 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-07-22 13:05:30,330 INFO L421 ceAbstractionStarter]: For program point L724(lines 724 870) no Hoare annotation was computed. [2018-07-22 13:05:30,330 INFO L421 ceAbstractionStarter]: For program point L712(lines 712 870) no Hoare annotation was computed. [2018-07-22 13:05:30,330 INFO L421 ceAbstractionStarter]: For program point L718(lines 718 870) no Hoare annotation was computed. [2018-07-22 13:05:30,330 INFO L421 ceAbstractionStarter]: For program point L500(lines 500 870) no Hoare annotation was computed. [2018-07-22 13:05:30,330 INFO L421 ceAbstractionStarter]: For program point L741(lines 741 870) no Hoare annotation was computed. [2018-07-22 13:05:30,330 INFO L421 ceAbstractionStarter]: For program point L506(lines 506 870) no Hoare annotation was computed. [2018-07-22 13:05:30,330 INFO L421 ceAbstractionStarter]: For program point L747(lines 747 870) no Hoare annotation was computed. [2018-07-22 13:05:30,330 INFO L421 ceAbstractionStarter]: For program point L730(lines 730 870) no Hoare annotation was computed. [2018-07-22 13:05:30,330 INFO L421 ceAbstractionStarter]: For program point L735(lines 735 870) no Hoare annotation was computed. [2018-07-22 13:05:30,330 INFO L421 ceAbstractionStarter]: For program point L524(lines 524 870) no Hoare annotation was computed. [2018-07-22 13:05:30,330 INFO L421 ceAbstractionStarter]: For program point L764(lines 764 870) no Hoare annotation was computed. [2018-07-22 13:05:30,330 INFO L421 ceAbstractionStarter]: For program point L512(lines 512 870) no Hoare annotation was computed. [2018-07-22 13:05:30,330 INFO L421 ceAbstractionStarter]: For program point L752(lines 752 870) no Hoare annotation was computed. [2018-07-22 13:05:30,330 INFO L421 ceAbstractionStarter]: For program point L758(lines 758 870) no Hoare annotation was computed. [2018-07-22 13:05:30,331 INFO L421 ceAbstractionStarter]: For program point L518(lines 518 870) no Hoare annotation was computed. [2018-07-22 13:05:30,331 INFO L421 ceAbstractionStarter]: For program point L541(lines 541 870) no Hoare annotation was computed. [2018-07-22 13:05:30,331 INFO L421 ceAbstractionStarter]: For program point L783(lines 783 870) no Hoare annotation was computed. [2018-07-22 13:05:30,331 INFO L421 ceAbstractionStarter]: For program point L305(lines 305 870) no Hoare annotation was computed. [2018-07-22 13:05:30,331 INFO L421 ceAbstractionStarter]: For program point L547(lines 547 870) no Hoare annotation was computed. [2018-07-22 13:05:30,331 INFO L421 ceAbstractionStarter]: For program point L789(lines 789 870) no Hoare annotation was computed. [2018-07-22 13:05:30,331 INFO L421 ceAbstractionStarter]: For program point L530(lines 530 870) no Hoare annotation was computed. [2018-07-22 13:05:30,331 INFO L421 ceAbstractionStarter]: For program point L771(lines 771 870) no Hoare annotation was computed. [2018-07-22 13:05:30,331 INFO L421 ceAbstractionStarter]: For program point L777(lines 777 870) no Hoare annotation was computed. [2018-07-22 13:05:30,331 INFO L421 ceAbstractionStarter]: For program point L536(lines 536 870) no Hoare annotation was computed. [2018-07-22 13:05:30,331 INFO L421 ceAbstractionStarter]: For program point L561(lines 561 870) no Hoare annotation was computed. [2018-07-22 13:05:30,331 INFO L421 ceAbstractionStarter]: For program point L568(lines 568 870) no Hoare annotation was computed. [2018-07-22 13:05:30,331 INFO L421 ceAbstractionStarter]: For program point L323(lines 323 870) no Hoare annotation was computed. [2018-07-22 13:05:30,331 INFO L421 ceAbstractionStarter]: For program point L329(lines 329 870) no Hoare annotation was computed. [2018-07-22 13:05:30,331 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-07-22 13:05:30,331 INFO L421 ceAbstractionStarter]: For program point L311(lines 311 870) no Hoare annotation was computed. [2018-07-22 13:05:30,331 INFO L421 ceAbstractionStarter]: For program point L795(lines 795 870) no Hoare annotation was computed. [2018-07-22 13:05:30,332 INFO L421 ceAbstractionStarter]: For program point L552(lines 552 870) no Hoare annotation was computed. [2018-07-22 13:05:30,332 INFO L421 ceAbstractionStarter]: For program point L555(lines 555 870) no Hoare annotation was computed. [2018-07-22 13:05:30,332 INFO L421 ceAbstractionStarter]: For program point L317(lines 317 870) no Hoare annotation was computed. [2018-07-22 13:05:30,332 INFO L421 ceAbstractionStarter]: For program point L102(lines 20 872) no Hoare annotation was computed. [2018-07-22 13:05:30,332 INFO L421 ceAbstractionStarter]: For program point L585(lines 585 870) no Hoare annotation was computed. [2018-07-22 13:05:30,332 INFO L421 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-07-22 13:05:30,332 INFO L421 ceAbstractionStarter]: For program point L341(lines 341 870) no Hoare annotation was computed. [2018-07-22 13:05:30,332 INFO L421 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2018-07-22 13:05:30,332 INFO L421 ceAbstractionStarter]: For program point L105(lines 20 872) no Hoare annotation was computed. [2018-07-22 13:05:30,332 INFO L421 ceAbstractionStarter]: For program point L347(lines 347 870) no Hoare annotation was computed. [2018-07-22 13:05:30,332 INFO L421 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2018-07-22 13:05:30,332 INFO L421 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2018-07-22 13:05:30,332 INFO L421 ceAbstractionStarter]: For program point L108(lines 20 872) no Hoare annotation was computed. [2018-07-22 13:05:30,332 INFO L421 ceAbstractionStarter]: For program point L573(lines 573 870) no Hoare annotation was computed. [2018-07-22 13:05:30,332 INFO L421 ceAbstractionStarter]: For program point L579(lines 579 870) no Hoare annotation was computed. [2018-07-22 13:05:30,332 INFO L421 ceAbstractionStarter]: For program point L335(lines 335 870) no Hoare annotation was computed. [2018-07-22 13:05:30,332 INFO L421 ceAbstractionStarter]: For program point L120(lines 20 872) no Hoare annotation was computed. [2018-07-22 13:05:30,333 INFO L421 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2018-07-22 13:05:30,333 INFO L421 ceAbstractionStarter]: For program point L366(lines 366 870) no Hoare annotation was computed. [2018-07-22 13:05:30,333 INFO L421 ceAbstractionStarter]: For program point L123(lines 20 872) no Hoare annotation was computed. [2018-07-22 13:05:30,333 INFO L421 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2018-07-22 13:05:30,333 INFO L421 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2018-07-22 13:05:30,333 INFO L421 ceAbstractionStarter]: For program point L126(lines 20 872) no Hoare annotation was computed. [2018-07-22 13:05:30,333 INFO L421 ceAbstractionStarter]: For program point L129(lines 20 872) no Hoare annotation was computed. [2018-07-22 13:05:30,333 INFO L421 ceAbstractionStarter]: For program point L591(lines 591 870) no Hoare annotation was computed. [2018-07-22 13:05:30,333 INFO L421 ceAbstractionStarter]: For program point L597(lines 597 870) no Hoare annotation was computed. [2018-07-22 13:05:30,333 INFO L421 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2018-07-22 13:05:30,333 INFO L421 ceAbstractionStarter]: For program point L353(lines 353 870) no Hoare annotation was computed. [2018-07-22 13:05:30,333 INFO L421 ceAbstractionStarter]: For program point L117(lines 20 872) no Hoare annotation was computed. [2018-07-22 13:05:30,333 INFO L421 ceAbstractionStarter]: For program point L359(lines 359 870) no Hoare annotation was computed. [2018-07-22 13:05:30,333 INFO L421 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2018-07-22 13:05:30,334 INFO L421 ceAbstractionStarter]: For program point L114(lines 20 872) no Hoare annotation was computed. [2018-07-22 13:05:30,334 INFO L421 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2018-07-22 13:05:30,334 INFO L421 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2018-07-22 13:05:30,334 INFO L421 ceAbstractionStarter]: For program point L384(lines 384 870) no Hoare annotation was computed. [2018-07-22 13:05:30,334 INFO L421 ceAbstractionStarter]: For program point L141(lines 20 872) no Hoare annotation was computed. [2018-07-22 13:05:30,334 INFO L421 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2018-07-22 13:05:30,334 INFO L421 ceAbstractionStarter]: For program point L144(lines 20 872) no Hoare annotation was computed. [2018-07-22 13:05:30,334 INFO L421 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2018-07-22 13:05:30,334 INFO L421 ceAbstractionStarter]: For program point L147(lines 20 872) no Hoare annotation was computed. [2018-07-22 13:05:30,334 INFO L421 ceAbstractionStarter]: For program point L390(lines 390 870) no Hoare annotation was computed. [2018-07-22 13:05:30,334 INFO L421 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2018-07-22 13:05:30,334 INFO L421 ceAbstractionStarter]: For program point L372(lines 372 870) no Hoare annotation was computed. [2018-07-22 13:05:30,334 INFO L421 ceAbstractionStarter]: For program point L135(lines 20 872) no Hoare annotation was computed. [2018-07-22 13:05:30,334 INFO L421 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2018-07-22 13:05:30,335 INFO L421 ceAbstractionStarter]: For program point L132(lines 20 872) no Hoare annotation was computed. [2018-07-22 13:05:30,335 INFO L421 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2018-07-22 13:05:30,335 INFO L421 ceAbstractionStarter]: For program point L138(lines 20 872) no Hoare annotation was computed. [2018-07-22 13:05:30,335 INFO L421 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2018-07-22 13:05:30,335 INFO L421 ceAbstractionStarter]: For program point L378(lines 378 870) no Hoare annotation was computed. [2018-07-22 13:05:30,335 INFO L421 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2018-07-22 13:05:30,335 INFO L421 ceAbstractionStarter]: For program point L162(lines 20 872) no Hoare annotation was computed. [2018-07-22 13:05:30,335 INFO L421 ceAbstractionStarter]: For program point L168(lines 20 872) no Hoare annotation was computed. [2018-07-22 13:05:30,335 INFO L421 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2018-07-22 13:05:30,335 INFO L421 ceAbstractionStarter]: For program point L111'(lines 20 872) no Hoare annotation was computed. [2018-07-22 13:05:30,335 INFO L421 ceAbstractionStarter]: For program point L165(lines 20 872) no Hoare annotation was computed. [2018-07-22 13:05:30,335 INFO L421 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2018-07-22 13:05:30,335 INFO L421 ceAbstractionStarter]: For program point L171(lines 20 872) no Hoare annotation was computed. [2018-07-22 13:05:30,335 INFO L421 ceAbstractionStarter]: For program point L153(lines 20 872) no Hoare annotation was computed. [2018-07-22 13:05:30,335 INFO L421 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2018-07-22 13:05:30,335 INFO L421 ceAbstractionStarter]: For program point L150(lines 20 872) no Hoare annotation was computed. [2018-07-22 13:05:30,335 INFO L421 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2018-07-22 13:05:30,336 INFO L421 ceAbstractionStarter]: For program point L156(lines 20 872) no Hoare annotation was computed. [2018-07-22 13:05:30,336 INFO L421 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2018-07-22 13:05:30,336 INFO L421 ceAbstractionStarter]: For program point L396(lines 396 870) no Hoare annotation was computed. [2018-07-22 13:05:30,336 INFO L421 ceAbstractionStarter]: For program point L159(lines 20 872) no Hoare annotation was computed. [2018-07-22 13:05:30,336 INFO L421 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-07-22 13:05:30,336 INFO L421 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2018-07-22 13:05:30,336 INFO L421 ceAbstractionStarter]: For program point L186(lines 20 872) no Hoare annotation was computed. [2018-07-22 13:05:30,336 INFO L421 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2018-07-22 13:05:30,336 INFO L421 ceAbstractionStarter]: For program point L183(lines 20 872) no Hoare annotation was computed. [2018-07-22 13:05:30,336 INFO L421 ceAbstractionStarter]: For program point L189(lines 20 872) no Hoare annotation was computed. [2018-07-22 13:05:30,336 INFO L421 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2018-07-22 13:05:30,337 INFO L421 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2018-07-22 13:05:30,337 INFO L421 ceAbstractionStarter]: For program point L192(lines 20 872) no Hoare annotation was computed. [2018-07-22 13:05:30,337 INFO L421 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2018-07-22 13:05:30,337 INFO L421 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2018-07-22 13:05:30,337 INFO L421 ceAbstractionStarter]: For program point L174(lines 20 872) no Hoare annotation was computed. [2018-07-22 13:05:30,337 INFO L421 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2018-07-22 13:05:30,337 INFO L421 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2018-07-22 13:05:30,337 INFO L421 ceAbstractionStarter]: For program point L177(lines 20 872) no Hoare annotation was computed. [2018-07-22 13:05:30,337 INFO L421 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2018-07-22 13:05:30,337 INFO L421 ceAbstractionStarter]: For program point L180(lines 20 872) no Hoare annotation was computed. [2018-07-22 13:05:30,338 INFO L421 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2018-07-22 13:05:30,338 INFO L421 ceAbstractionStarter]: For program point L195(lines 20 872) no Hoare annotation was computed. [2018-07-22 13:05:30,338 INFO L421 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2018-07-22 13:05:30,338 INFO L421 ceAbstractionStarter]: For program point L198(lines 20 872) no Hoare annotation was computed. [2018-07-22 13:05:30,338 INFO L421 ceAbstractionStarter]: For program point L21(lines 21 23) no Hoare annotation was computed. [2018-07-22 13:05:30,338 INFO L421 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2018-07-22 13:05:30,338 INFO L421 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-07-22 13:05:30,338 INFO L421 ceAbstractionStarter]: For program point L24(lines 20 872) no Hoare annotation was computed. [2018-07-22 13:05:30,338 INFO L421 ceAbstractionStarter]: For program point L27(lines 20 872) no Hoare annotation was computed. [2018-07-22 13:05:30,338 INFO L421 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2018-07-22 13:05:30,339 INFO L421 ceAbstractionStarter]: For program point L30(lines 20 872) no Hoare annotation was computed. [2018-07-22 13:05:30,339 INFO L421 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2018-07-22 13:05:30,339 INFO L421 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2018-07-22 13:05:30,339 INFO L421 ceAbstractionStarter]: For program point L33(lines 20 872) no Hoare annotation was computed. [2018-07-22 13:05:30,339 INFO L421 ceAbstractionStarter]: For program point L36(lines 20 872) no Hoare annotation was computed. [2018-07-22 13:05:30,339 INFO L421 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2018-07-22 13:05:30,339 INFO L421 ceAbstractionStarter]: For program point L39(lines 20 872) no Hoare annotation was computed. [2018-07-22 13:05:30,339 INFO L421 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2018-07-22 13:05:30,339 INFO L421 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2018-07-22 13:05:30,339 INFO L421 ceAbstractionStarter]: For program point L42(lines 20 872) no Hoare annotation was computed. [2018-07-22 13:05:30,340 INFO L421 ceAbstractionStarter]: For program point L45(lines 20 872) no Hoare annotation was computed. [2018-07-22 13:05:30,340 INFO L421 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2018-07-22 13:05:30,340 INFO L421 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2018-07-22 13:05:30,340 INFO L421 ceAbstractionStarter]: For program point L48(lines 20 872) no Hoare annotation was computed. [2018-07-22 13:05:30,340 INFO L421 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2018-07-22 13:05:30,340 INFO L421 ceAbstractionStarter]: For program point L51(lines 20 872) no Hoare annotation was computed. [2018-07-22 13:05:30,340 INFO L421 ceAbstractionStarter]: For program point L54(lines 20 872) no Hoare annotation was computed. [2018-07-22 13:05:30,340 INFO L421 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2018-07-22 13:05:30,340 INFO L421 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2018-07-22 13:05:30,340 INFO L421 ceAbstractionStarter]: For program point L57(lines 20 872) no Hoare annotation was computed. [2018-07-22 13:05:30,340 INFO L421 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2018-07-22 13:05:30,341 INFO L421 ceAbstractionStarter]: For program point L60(lines 20 872) no Hoare annotation was computed. [2018-07-22 13:05:30,341 INFO L421 ceAbstractionStarter]: For program point L63(lines 20 872) no Hoare annotation was computed. [2018-07-22 13:05:30,341 INFO L421 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2018-07-22 13:05:30,341 INFO L421 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2018-07-22 13:05:30,341 INFO L421 ceAbstractionStarter]: For program point L66(lines 20 872) no Hoare annotation was computed. [2018-07-22 13:05:30,341 INFO L421 ceAbstractionStarter]: For program point L69(lines 20 872) no Hoare annotation was computed. [2018-07-22 13:05:30,341 INFO L421 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2018-07-22 13:05:30,341 INFO L421 ceAbstractionStarter]: For program point L72(lines 20 872) no Hoare annotation was computed. [2018-07-22 13:05:30,341 INFO L421 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2018-07-22 13:05:30,341 INFO L421 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2018-07-22 13:05:30,342 INFO L421 ceAbstractionStarter]: For program point L75(lines 20 872) no Hoare annotation was computed. [2018-07-22 13:05:30,342 INFO L421 ceAbstractionStarter]: For program point L78(lines 20 872) no Hoare annotation was computed. [2018-07-22 13:05:30,342 INFO L421 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2018-07-22 13:05:30,342 INFO L421 ceAbstractionStarter]: For program point L81(lines 20 872) no Hoare annotation was computed. [2018-07-22 13:05:30,342 INFO L421 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2018-07-22 13:05:30,342 INFO L421 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2018-07-22 13:05:30,342 INFO L421 ceAbstractionStarter]: For program point L84(lines 20 872) no Hoare annotation was computed. [2018-07-22 13:05:30,343 INFO L421 ceAbstractionStarter]: For program point L87(lines 20 872) no Hoare annotation was computed. [2018-07-22 13:05:30,343 INFO L421 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2018-07-22 13:05:30,343 INFO L421 ceAbstractionStarter]: For program point L801(lines 801 870) no Hoare annotation was computed. [2018-07-22 13:05:30,343 INFO L421 ceAbstractionStarter]: For program point L807(lines 807 870) no Hoare annotation was computed. [2018-07-22 13:05:30,343 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-07-22 13:05:30,343 INFO L421 ceAbstractionStarter]: For program point L90(lines 20 872) no Hoare annotation was computed. [2018-07-22 13:05:30,343 INFO L421 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2018-07-22 13:05:30,343 INFO L421 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2018-07-22 13:05:30,343 INFO L421 ceAbstractionStarter]: For program point L93(lines 20 872) no Hoare annotation was computed. [2018-07-22 13:05:30,343 INFO L421 ceAbstractionStarter]: For program point L96(lines 20 872) no Hoare annotation was computed. [2018-07-22 13:05:30,343 INFO L421 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2018-07-22 13:05:30,344 INFO L421 ceAbstractionStarter]: For program point L99(lines 20 872) no Hoare annotation was computed. [2018-07-22 13:05:30,344 INFO L421 ceAbstractionStarter]: For program point L825(lines 825 870) no Hoare annotation was computed. [2018-07-22 13:05:30,344 INFO L421 ceAbstractionStarter]: For program point L814(lines 814 870) no Hoare annotation was computed. [2018-07-22 13:05:30,344 INFO L421 ceAbstractionStarter]: For program point L819(lines 819 870) no Hoare annotation was computed. [2018-07-22 13:05:30,344 INFO L421 ceAbstractionStarter]: For program point L842(lines 842 870) no Hoare annotation was computed. [2018-07-22 13:05:30,344 INFO L421 ceAbstractionStarter]: For program point L603(lines 603 870) no Hoare annotation was computed. [2018-07-22 13:05:30,344 INFO L421 ceAbstractionStarter]: For program point L609(lines 609 870) no Hoare annotation was computed. [2018-07-22 13:05:30,344 INFO L421 ceAbstractionStarter]: For program point L848(lines 848 870) no Hoare annotation was computed. [2018-07-22 13:05:30,344 INFO L421 ceAbstractionStarter]: For program point L831(lines 831 870) no Hoare annotation was computed. [2018-07-22 13:05:30,344 INFO L421 ceAbstractionStarter]: For program point L837(lines 837 870) no Hoare annotation was computed. [2018-07-22 13:05:30,345 INFO L421 ceAbstractionStarter]: For program point L865(lines 865 870) no Hoare annotation was computed. [2018-07-22 13:05:30,345 INFO L421 ceAbstractionStarter]: For program point L621(lines 621 870) no Hoare annotation was computed. [2018-07-22 13:05:30,345 INFO L421 ceAbstractionStarter]: For program point L626(lines 626 870) no Hoare annotation was computed. [2018-07-22 13:05:30,345 INFO L421 ceAbstractionStarter]: For program point L854(lines 854 870) no Hoare annotation was computed. [2018-07-22 13:05:30,345 INFO L421 ceAbstractionStarter]: For program point L615(lines 615 870) no Hoare annotation was computed. [2018-07-22 13:05:30,345 INFO L421 ceAbstractionStarter]: For program point L859(lines 859 870) no Hoare annotation was computed. [2018-07-22 13:05:30,345 INFO L421 ceAbstractionStarter]: For program point L880(lines 880 889) no Hoare annotation was computed. [2018-07-22 13:05:30,345 INFO L421 ceAbstractionStarter]: For program point L402(lines 402 870) no Hoare annotation was computed. [2018-07-22 13:05:30,345 INFO L421 ceAbstractionStarter]: For program point L644(lines 644 870) no Hoare annotation was computed. [2018-07-22 13:05:30,345 INFO L421 ceAbstractionStarter]: For program point L885(line 885) no Hoare annotation was computed. [2018-07-22 13:05:30,346 INFO L421 ceAbstractionStarter]: For program point L408(lines 408 870) no Hoare annotation was computed. [2018-07-22 13:05:30,346 INFO L417 ceAbstractionStarter]: At program point L871(lines 20 872) the Hoare annotation is: (let ((.cse1 (= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15~0 8)) (.cse16 (= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 6)) (.cse13 (= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 10)) (.cse4 (= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 7)) (.cse20 (+ ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0 43))) (let ((.cse7 (< 0 .cse20)) (.cse8 (<= .cse20 0)) (.cse3 (< 80 ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0)) (.cse17 (not .cse4)) (.cse18 (not .cse13)) (.cse19 (not .cse16)) (.cse6 (= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 8)) (.cse12 (= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15~0 7)) (.cse2 (<= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 6)) (.cse5 (<= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0 11)) (.cse0 (= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24~0 1)) (.cse9 (not .cse1)) (.cse14 (<= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0 72)) (.cse10 (<= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15~0 8)) (.cse15 (<= 19 ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0)) (.cse11 (not (= 7 ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15~0)))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3 .cse4) (and .cse0 (<= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0 95434) .cse2 (<= 95381 ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0)) (and .cse0 .cse5 .cse6 .cse7) (and .cse0 (<= (+ ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0 526767) 0) .cse6) (and .cse0 .cse1 .cse5 .cse7) (and .cse8 .cse9 .cse10 .cse2 .cse11) (and .cse0 .cse12 .cse13) (and (and .cse0 .cse8 .cse4) .cse12) (and .cse0 .cse3 .cse9 .cse6) (and .cse0 .cse14 .cse6 .cse15) (and .cse0 .cse9 .cse14 .cse10 .cse15 .cse13) (and .cse0 (= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15~0 5) .cse16) (and .cse0 .cse3 .cse13) (and .cse0 .cse1 (not (= ULTIMATE.start___U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_output_~input 3)) (<= (+ ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0 49) 0)) (and .cse0 .cse3 .cse9 (= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 9)) (and .cse0 (<= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0 80) .cse17 .cse10 .cse18 .cse19 .cse11) (and .cse0 .cse17 .cse14 .cse10 .cse18 .cse15 .cse19) (= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15~0 6) (and .cse0 .cse10 (<= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0 73282) .cse6) (and .cse0 .cse12 .cse2) (and .cse0 .cse5 .cse13) (and .cse0 .cse9 .cse14 .cse10 .cse15 .cse4 .cse11)))) [2018-07-22 13:05:30,346 INFO L421 ceAbstractionStarter]: For program point L632(lines 632 870) no Hoare annotation was computed. [2018-07-22 13:05:30,346 INFO L424 ceAbstractionStarter]: At program point L874(lines 874 890) the Hoare annotation is: true [2018-07-22 13:05:30,346 INFO L421 ceAbstractionStarter]: For program point L638(lines 638 870) no Hoare annotation was computed. [2018-07-22 13:05:30,347 INFO L421 ceAbstractionStarter]: For program point L420(lines 420 870) no Hoare annotation was computed. [2018-07-22 13:05:30,347 INFO L421 ceAbstractionStarter]: For program point L662(lines 662 870) no Hoare annotation was computed. [2018-07-22 13:05:30,347 INFO L421 ceAbstractionStarter]: For program point L426(lines 426 870) no Hoare annotation was computed. [2018-07-22 13:05:30,347 INFO L421 ceAbstractionStarter]: For program point L668(lines 668 870) no Hoare annotation was computed. [2018-07-22 13:05:30,347 INFO L417 ceAbstractionStarter]: At program point L880''(lines 880 889) the Hoare annotation is: (let ((.cse1 (= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15~0 8)) (.cse16 (= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 6)) (.cse13 (= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 10)) (.cse4 (= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 7)) (.cse20 (+ ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0 43))) (let ((.cse7 (< 0 .cse20)) (.cse8 (<= .cse20 0)) (.cse3 (< 80 ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0)) (.cse17 (not .cse4)) (.cse18 (not .cse13)) (.cse19 (not .cse16)) (.cse6 (= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 8)) (.cse12 (= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15~0 7)) (.cse2 (<= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 6)) (.cse5 (<= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0 11)) (.cse0 (= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24~0 1)) (.cse9 (not .cse1)) (.cse14 (<= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0 72)) (.cse10 (<= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15~0 8)) (.cse15 (<= 19 ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0)) (.cse11 (not (= 7 ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15~0)))) (or (and .cse0 .cse1 (<= (+ ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0 49) 0)) (and .cse0 .cse1 .cse2) (and .cse0 .cse3 .cse4) (and .cse0 (<= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0 95434) .cse2 (<= 95381 ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0)) (and .cse0 .cse5 .cse6 .cse7) (and .cse0 (<= (+ ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0 526767) 0) .cse6) (and .cse0 .cse1 .cse5 .cse7) (and .cse8 .cse9 .cse10 .cse2 .cse11) (and .cse0 .cse12 .cse13) (and (and .cse0 .cse8 .cse4) .cse12) (and .cse0 .cse3 .cse9 .cse6) (and .cse0 .cse14 .cse6 .cse15) (and .cse0 .cse9 .cse14 .cse10 .cse15 .cse13) (and .cse0 (= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15~0 5) .cse16) (and .cse0 .cse3 .cse13) (and .cse0 .cse3 .cse9 (= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 9)) (and .cse0 (<= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0 80) .cse17 .cse10 .cse18 .cse19 .cse11) (and .cse0 .cse17 .cse14 .cse10 .cse18 .cse15 .cse19) (= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15~0 6) (and .cse0 .cse10 (<= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0 73282) .cse6) (and .cse0 .cse12 .cse2) (and .cse0 .cse5 .cse13) (and .cse0 .cse9 .cse14 .cse10 .cse15 .cse4 .cse11)))) [2018-07-22 13:05:30,347 INFO L421 ceAbstractionStarter]: For program point L650(lines 650 870) no Hoare annotation was computed. [2018-07-22 13:05:30,347 INFO L421 ceAbstractionStarter]: For program point L414(lines 414 870) no Hoare annotation was computed. [2018-07-22 13:05:30,348 INFO L421 ceAbstractionStarter]: For program point L656(lines 656 870) no Hoare annotation was computed. [2018-07-22 13:05:30,348 INFO L421 ceAbstractionStarter]: For program point L201(lines 20 872) no Hoare annotation was computed. [2018-07-22 13:05:30,348 INFO L421 ceAbstractionStarter]: For program point L683(lines 683 870) no Hoare annotation was computed. [2018-07-22 13:05:30,348 INFO L421 ceAbstractionStarter]: For program point L688(lines 688 870) no Hoare annotation was computed. [2018-07-22 13:05:30,348 INFO L421 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2018-07-22 13:05:30,348 INFO L421 ceAbstractionStarter]: For program point L444(lines 444 870) no Hoare annotation was computed. [2018-07-22 13:05:30,348 INFO L421 ceAbstractionStarter]: For program point L449(lines 449 870) no Hoare annotation was computed. [2018-07-22 13:05:30,348 INFO L421 ceAbstractionStarter]: For program point L21'(lines 20 872) no Hoare annotation was computed. [2018-07-22 13:05:30,348 INFO L421 ceAbstractionStarter]: For program point L432(lines 432 870) no Hoare annotation was computed. [2018-07-22 13:05:30,348 INFO L421 ceAbstractionStarter]: For program point L674(lines 674 870) no Hoare annotation was computed. [2018-07-22 13:05:30,349 INFO L421 ceAbstractionStarter]: For program point L677(lines 677 870) no Hoare annotation was computed. [2018-07-22 13:05:30,349 INFO L421 ceAbstractionStarter]: For program point L438(lines 438 870) no Hoare annotation was computed. [2018-07-22 13:05:30,349 INFO L421 ceAbstractionStarter]: For program point L460(lines 460 870) no Hoare annotation was computed. [2018-07-22 13:05:30,349 INFO L421 ceAbstractionStarter]: For program point L223(lines 223 870) no Hoare annotation was computed. [2018-07-22 13:05:30,349 INFO L421 ceAbstractionStarter]: For program point L467(lines 467 870) no Hoare annotation was computed. [2018-07-22 13:05:30,349 INFO L421 ceAbstractionStarter]: For program point L229(lines 229 870) no Hoare annotation was computed. [2018-07-22 13:05:30,349 INFO L421 ceAbstractionStarter]: For program point L454(lines 454 870) no Hoare annotation was computed. [2018-07-22 13:05:30,349 INFO L421 ceAbstractionStarter]: For program point L211(lines 211 870) no Hoare annotation was computed. [2018-07-22 13:05:30,349 INFO L421 ceAbstractionStarter]: For program point L694(lines 694 870) no Hoare annotation was computed. [2018-07-22 13:05:30,349 INFO L421 ceAbstractionStarter]: For program point L217(lines 217 870) no Hoare annotation was computed. [2018-07-22 13:05:30,350 INFO L421 ceAbstractionStarter]: For program point L241(lines 241 870) no Hoare annotation was computed. [2018-07-22 13:05:30,350 INFO L421 ceAbstractionStarter]: For program point L484(lines 484 870) no Hoare annotation was computed. [2018-07-22 13:05:30,350 INFO L421 ceAbstractionStarter]: For program point L247(lines 247 870) no Hoare annotation was computed. [2018-07-22 13:05:30,350 INFO L421 ceAbstractionStarter]: For program point L490(lines 490 870) no Hoare annotation was computed. [2018-07-22 13:05:30,350 INFO L421 ceAbstractionStarter]: For program point L472(lines 472 870) no Hoare annotation was computed. [2018-07-22 13:05:30,350 INFO L421 ceAbstractionStarter]: For program point L478(lines 478 870) no Hoare annotation was computed. [2018-07-22 13:05:30,350 INFO L421 ceAbstractionStarter]: For program point L235(lines 235 870) no Hoare annotation was computed. [2018-07-22 13:05:30,350 INFO L421 ceAbstractionStarter]: For program point L264(lines 264 870) no Hoare annotation was computed. [2018-07-22 13:05:30,350 INFO L421 ceAbstractionStarter]: For program point L269(lines 269 870) no Hoare annotation was computed. [2018-07-22 13:05:30,350 INFO L421 ceAbstractionStarter]: For program point L252(lines 252 870) no Hoare annotation was computed. [2018-07-22 13:05:30,350 INFO L421 ceAbstractionStarter]: For program point L495(lines 495 870) no Hoare annotation was computed. [2018-07-22 13:05:30,351 INFO L421 ceAbstractionStarter]: For program point L258(lines 258 870) no Hoare annotation was computed. [2018-07-22 13:05:30,351 INFO L421 ceAbstractionStarter]: For program point L286(lines 286 870) no Hoare annotation was computed. [2018-07-22 13:05:30,351 INFO L421 ceAbstractionStarter]: For program point L275(lines 275 870) no Hoare annotation was computed. [2018-07-22 13:05:30,351 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startErr0AssertViolationERROR_FUNCTION(line 112) no Hoare annotation was computed. [2018-07-22 13:05:30,351 INFO L421 ceAbstractionStarter]: For program point L280(lines 280 870) no Hoare annotation was computed. [2018-07-22 13:05:30,351 INFO L421 ceAbstractionStarter]: For program point L293(lines 293 870) no Hoare annotation was computed. [2018-07-22 13:05:30,351 INFO L421 ceAbstractionStarter]: For program point L299(lines 299 870) no Hoare annotation was computed. [2018-07-22 13:05:30,399 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.07 01:05:30 BoogieIcfgContainer [2018-07-22 13:05:30,399 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-22 13:05:30,400 INFO L168 Benchmark]: Toolchain (without parser) took 62320.59 ms. Allocated memory was 307.2 MB in the beginning and 2.3 GB in the end (delta: 1.9 GB). Free memory was 252.2 MB in the beginning and 1.9 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.7 GB. Max. memory is 5.3 GB. [2018-07-22 13:05:30,401 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 307.2 MB. Free memory is still 272.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-07-22 13:05:30,403 INFO L168 Benchmark]: CACSL2BoogieTranslator took 816.09 ms. Allocated memory is still 307.2 MB. Free memory was 251.2 MB in the beginning and 206.6 MB in the end (delta: 44.6 MB). Peak memory consumption was 44.6 MB. Max. memory is 5.3 GB. [2018-07-22 13:05:30,404 INFO L168 Benchmark]: Boogie Procedure Inliner took 168.03 ms. Allocated memory is still 307.2 MB. Free memory was 206.6 MB in the beginning and 196.7 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-07-22 13:05:30,404 INFO L168 Benchmark]: Boogie Preprocessor took 340.23 ms. Allocated memory was 307.2 MB in the beginning and 490.7 MB in the end (delta: 183.5 MB). Free memory was 196.7 MB in the beginning and 454.7 MB in the end (delta: -258.0 MB). Peak memory consumption was 33.8 MB. Max. memory is 5.3 GB. [2018-07-22 13:05:30,405 INFO L168 Benchmark]: RCFGBuilder took 3918.35 ms. Allocated memory was 490.7 MB in the beginning and 506.5 MB in the end (delta: 15.7 MB). Free memory was 454.7 MB in the beginning and 454.8 MB in the end (delta: -64.8 kB). Peak memory consumption was 134.7 MB. Max. memory is 5.3 GB. [2018-07-22 13:05:30,407 INFO L168 Benchmark]: TraceAbstraction took 57065.28 ms. Allocated memory was 506.5 MB in the beginning and 2.3 GB in the end (delta: 1.7 GB). Free memory was 454.8 MB in the beginning and 1.9 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.7 GB. Max. memory is 5.3 GB. [2018-07-22 13:05:30,414 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.15 ms. Allocated memory is still 307.2 MB. Free memory is still 272.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 816.09 ms. Allocated memory is still 307.2 MB. Free memory was 251.2 MB in the beginning and 206.6 MB in the end (delta: 44.6 MB). Peak memory consumption was 44.6 MB. Max. memory is 5.3 GB. * Boogie Procedure Inliner took 168.03 ms. Allocated memory is still 307.2 MB. Free memory was 206.6 MB in the beginning and 196.7 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 340.23 ms. Allocated memory was 307.2 MB in the beginning and 490.7 MB in the end (delta: 183.5 MB). Free memory was 196.7 MB in the beginning and 454.7 MB in the end (delta: -258.0 MB). Peak memory consumption was 33.8 MB. Max. memory is 5.3 GB. * RCFGBuilder took 3918.35 ms. Allocated memory was 490.7 MB in the beginning and 506.5 MB in the end (delta: 15.7 MB). Free memory was 454.7 MB in the beginning and 454.8 MB in the end (delta: -64.8 kB). Peak memory consumption was 134.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 57065.28 ms. Allocated memory was 506.5 MB in the beginning and 2.3 GB in the end (delta: 1.7 GB). Free memory was 454.8 MB in the beginning and 1.9 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.7 GB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 112]: 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_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 8) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 <= 6) || ((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1 && 80 < __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 7)) || (((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 <= 95434) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 <= 6) && 95381 <= __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12)) || (((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 <= 11) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 8) && 0 < __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 + 43)) || ((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 + 526767 <= 0) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 8)) || (((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 8) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 <= 11) && 0 < __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 + 43)) || ((((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 + 43 <= 0 && !(__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 8)) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 <= 8) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 <= 6) && !(7 == __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15))) || ((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 7) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 10)) || (((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 + 43 <= 0) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 7) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 7)) || (((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1 && 80 < __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12) && !(__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 8)) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 8)) || (((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 <= 72) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 8) && 19 <= __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12)) || (((((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1 && !(__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 8)) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 <= 72) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 <= 8) && 19 <= __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 10)) || ((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 5) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 6)) || ((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1 && 80 < __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 10)) || (((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 8) && !(input == 3)) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 + 49 <= 0)) || (((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1 && 80 < __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12) && !(__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 8)) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 9)) || ((((((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 <= 80) && !(__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 7)) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 <= 8) && !(__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 10)) && !(__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 6)) && !(7 == __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15))) || ((((((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1 && !(__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 7)) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 <= 72) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 <= 8) && !(__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 10)) && 19 <= __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12) && !(__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 6))) || __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 6) || (((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 <= 8) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 <= 73282) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 8)) || ((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 7) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 <= 6)) || ((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 <= 11) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 10)) || ((((((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1 && !(__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 8)) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 <= 72) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 <= 8) && 19 <= __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 7) && !(7 == __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15)) - InvariantResult [Line: 880]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 8) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 + 49 <= 0) || ((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 8) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 <= 6)) || ((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1 && 80 < __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 7)) || (((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 <= 95434) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 <= 6) && 95381 <= __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12)) || (((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 <= 11) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 8) && 0 < __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 + 43)) || ((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 + 526767 <= 0) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 8)) || (((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 8) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 <= 11) && 0 < __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 + 43)) || ((((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 + 43 <= 0 && !(__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 8)) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 <= 8) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 <= 6) && !(7 == __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15))) || ((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 7) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 10)) || (((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 + 43 <= 0) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 7) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 7)) || (((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1 && 80 < __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12) && !(__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 8)) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 8)) || (((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 <= 72) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 8) && 19 <= __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12)) || (((((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1 && !(__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 8)) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 <= 72) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 <= 8) && 19 <= __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 10)) || ((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 5) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 6)) || ((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1 && 80 < __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 10)) || (((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1 && 80 < __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12) && !(__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 8)) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 9)) || ((((((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 <= 80) && !(__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 7)) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 <= 8) && !(__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 10)) && !(__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 6)) && !(7 == __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15))) || ((((((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1 && !(__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 7)) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 <= 72) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 <= 8) && !(__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 10)) && 19 <= __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12) && !(__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 6))) || __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 6) || (((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 <= 8) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 <= 73282) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 8)) || ((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 7) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 <= 6)) || ((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 <= 11) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 10)) || ((((((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1 && !(__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 8)) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 <= 72) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 <= 8) && 19 <= __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 7) && !(7 == __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15)) - 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, 56.9s OverallTime, 16 OverallIterations, 15 TraceHistogramMax, 29.7s AutomataDifference, 0.0s DeadEndRemovalTime, 4.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 2341 SDtfs, 7500 SDslu, 1529 SDs, 0 SdLazy, 24261 SolverSat, 2232 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 24.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2784 GetRequests, 2711 SyntacticMatches, 7 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 6.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10961occurred in iteration=15, 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.4s AutomataMinimizationTime, 16 MinimizatonAttempts, 3161 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 134 NumberOfFragments, 657 HoareAnnotationTreeSize, 3 FomulaSimplifications, 9107 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 3 FomulaSimplificationsInter, 3534 FormulaSimplificationTreeSizeReductionInter, 4.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 12.4s InterpolantComputationTime, 13532 NumberOfCodeBlocks, 13532 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 13512 ConstructedInterpolants, 0 QuantifiedInterpolants, 28652908 SizeOfPredicates, 6 NumberOfNonLiveVariables, 3338 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 20 InterpolantComputations, 14 PerfectInterpolantSequences, 44858/45876 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/Problem14_label45_true-unreach-call_false-termination.c_svcomp-Reach-64bit-Automizer_Default.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-07-22_13-05-30-465.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/Problem14_label45_true-unreach-call_false-termination.c_svcomp-Reach-64bit-Automizer_Default.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-22_13-05-30-465.csv Received shutdown request...