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/Problem01_label45_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-71425fa [2018-07-22 05:54:56,281 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-22 05:54:56,282 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-22 05:54:56,297 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-22 05:54:56,297 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-22 05:54:56,299 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-22 05:54:56,300 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-22 05:54:56,302 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-22 05:54:56,304 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-22 05:54:56,304 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-22 05:54:56,306 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-22 05:54:56,306 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-22 05:54:56,307 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-22 05:54:56,308 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-22 05:54:56,309 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-22 05:54:56,312 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-22 05:54:56,313 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-22 05:54:56,315 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-22 05:54:56,327 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-22 05:54:56,329 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-22 05:54:56,330 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-22 05:54:56,331 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-22 05:54:56,333 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-22 05:54:56,333 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-22 05:54:56,334 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-22 05:54:56,334 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-22 05:54:56,335 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-22 05:54:56,336 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-22 05:54:56,337 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-22 05:54:56,338 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-22 05:54:56,338 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-22 05:54:56,339 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-22 05:54:56,339 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-22 05:54:56,339 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-22 05:54:56,340 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-22 05:54:56,340 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-22 05:54:56,341 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 05:54:56,355 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-22 05:54:56,355 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-22 05:54:56,356 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-07-22 05:54:56,356 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-07-22 05:54:56,356 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-07-22 05:54:56,356 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-07-22 05:54:56,357 INFO L133 SettingsManager]: * Use SBE=true [2018-07-22 05:54:56,357 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-07-22 05:54:56,357 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-07-22 05:54:56,357 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-07-22 05:54:56,357 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-07-22 05:54:56,358 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-07-22 05:54:56,358 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-07-22 05:54:56,358 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-07-22 05:54:56,358 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-07-22 05:54:56,358 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-22 05:54:56,359 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-07-22 05:54:56,359 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-07-22 05:54:56,359 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-07-22 05:54:56,359 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-07-22 05:54:56,359 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-22 05:54:56,360 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-07-22 05:54:56,360 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-07-22 05:54:56,360 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-07-22 05:54:56,360 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-07-22 05:54:56,360 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-07-22 05:54:56,360 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-07-22 05:54:56,362 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-22 05:54:56,363 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-07-22 05:54:56,413 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-22 05:54:56,429 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-22 05:54:56,433 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-22 05:54:56,435 INFO L271 PluginConnector]: Initializing CDTParser... [2018-07-22 05:54:56,435 INFO L276 PluginConnector]: CDTParser initialized [2018-07-22 05:54:56,437 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label45_true-unreach-call_false-termination.c [2018-07-22 05:54:56,821 INFO L220 CDTParser]: Created temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/da57ef7d6/bae7789e9d60422fb1fc476f84e3db54/FLAGd29c7e4c5 [2018-07-22 05:54:57,123 INFO L276 CDTParser]: Found 1 translation units. [2018-07-22 05:54:57,128 INFO L158 CDTParser]: Scanning /storage/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label45_true-unreach-call_false-termination.c [2018-07-22 05:54:57,159 INFO L324 CDTParser]: About to delete temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/da57ef7d6/bae7789e9d60422fb1fc476f84e3db54/FLAGd29c7e4c5 [2018-07-22 05:54:57,444 INFO L332 CDTParser]: Successfully deleted /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/da57ef7d6/bae7789e9d60422fb1fc476f84e3db54 [2018-07-22 05:54:57,452 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-22 05:54:57,458 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-07-22 05:54:57,460 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-07-22 05:54:57,460 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-07-22 05:54:57,468 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-07-22 05:54:57,469 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 05:54:57" (1/1) ... [2018-07-22 05:54:57,471 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54cae29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 05:54:57, skipping insertion in model container [2018-07-22 05:54:57,471 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 05:54:57" (1/1) ... [2018-07-22 05:54:57,686 INFO L179 PRDispatcher]: Starting pre-run dispatcher in SV-COMP mode [2018-07-22 05:54:57,922 INFO L175 PostProcessor]: Settings: Checked method=main [2018-07-22 05:54:57,952 INFO L422 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-07-22 05:54:58,129 INFO L175 PostProcessor]: Settings: Checked method=main [2018-07-22 05:54:58,183 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 05:54:58 WrapperNode [2018-07-22 05:54:58,183 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-07-22 05:54:58,184 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-07-22 05:54:58,184 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-07-22 05:54:58,185 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-07-22 05:54:58,198 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 05:54:58" (1/1) ... [2018-07-22 05:54:58,230 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 05:54:58" (1/1) ... [2018-07-22 05:54:58,319 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-07-22 05:54:58,319 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-22 05:54:58,320 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-22 05:54:58,320 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-22 05:54:58,330 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 05:54:58" (1/1) ... [2018-07-22 05:54:58,330 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 05:54:58" (1/1) ... [2018-07-22 05:54:58,344 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 05:54:58" (1/1) ... [2018-07-22 05:54:58,344 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 05:54:58" (1/1) ... [2018-07-22 05:54:58,378 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 05:54:58" (1/1) ... [2018-07-22 05:54:58,399 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 05:54:58" (1/1) ... [2018-07-22 05:54:58,412 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 05:54:58" (1/1) ... [2018-07-22 05:54:58,420 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-22 05:54:58,421 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-22 05:54:58,421 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-22 05:54:58,421 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-22 05:54:58,422 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 05:54:58" (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 05:54:58,651 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-07-22 05:54:58,652 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-07-22 05:54:58,652 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-07-22 05:55:02,038 INFO L261 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-07-22 05:55:02,044 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 05:55:02 BoogieIcfgContainer [2018-07-22 05:55:02,045 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-22 05:55:02,046 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-22 05:55:02,046 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-22 05:55:02,050 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-22 05:55:02,050 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 05:54:57" (1/3) ... [2018-07-22 05:55:02,051 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58143d77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 05:55:02, skipping insertion in model container [2018-07-22 05:55:02,051 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 05:54:58" (2/3) ... [2018-07-22 05:55:02,052 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58143d77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 05:55:02, skipping insertion in model container [2018-07-22 05:55:02,052 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 05:55:02" (3/3) ... [2018-07-22 05:55:02,067 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label45_true-unreach-call_false-termination.c [2018-07-22 05:55:02,081 INFO L132 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-07-22 05:55:02,093 INFO L144 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-22 05:55:02,162 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-22 05:55:02,163 INFO L373 AbstractCegarLoop]: Interprodecural is true [2018-07-22 05:55:02,164 INFO L374 AbstractCegarLoop]: Hoare is true [2018-07-22 05:55:02,164 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-07-22 05:55:02,164 INFO L376 AbstractCegarLoop]: Backedges is TWOTRACK [2018-07-22 05:55:02,164 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-22 05:55:02,164 INFO L378 AbstractCegarLoop]: Difference is false [2018-07-22 05:55:02,165 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-22 05:55:02,165 INFO L384 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-22 05:55:02,188 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states. [2018-07-22 05:55:02,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-07-22 05:55:02,203 INFO L350 BasicCegarLoop]: Found error trace [2018-07-22 05:55:02,204 INFO L358 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:55:02,205 INFO L414 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-22 05:55:02,211 INFO L82 PathProgramCache]: Analyzing trace with hash -2041090969, now seen corresponding path program 1 times [2018-07-22 05:55:02,213 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-22 05:55:02,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-22 05:55:02,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 05:55:02,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-22 05:55:02,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 05:55:02,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-22 05:55:02,838 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 05:55:02,841 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-22 05:55:02,842 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-22 05:55:02,848 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-22 05:55:02,863 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-22 05:55:02,864 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-22 05:55:02,867 INFO L87 Difference]: Start difference. First operand 199 states. Second operand 3 states. [2018-07-22 05:55:04,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-22 05:55:04,206 INFO L93 Difference]: Finished difference Result 531 states and 918 transitions. [2018-07-22 05:55:04,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-22 05:55:04,207 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 118 [2018-07-22 05:55:04,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-22 05:55:04,226 INFO L225 Difference]: With dead ends: 531 [2018-07-22 05:55:04,226 INFO L226 Difference]: Without dead ends: 328 [2018-07-22 05:55:04,231 INFO L578 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-22 05:55:04,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2018-07-22 05:55:04,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 328. [2018-07-22 05:55:04,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2018-07-22 05:55:04,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 527 transitions. [2018-07-22 05:55:04,305 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 527 transitions. Word has length 118 [2018-07-22 05:55:04,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-22 05:55:04,306 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 527 transitions. [2018-07-22 05:55:04,306 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-22 05:55:04,306 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 527 transitions. [2018-07-22 05:55:04,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-07-22 05:55:04,310 INFO L350 BasicCegarLoop]: Found error trace [2018-07-22 05:55:04,310 INFO L358 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-22 05:55:04,311 INFO L414 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-22 05:55:04,311 INFO L82 PathProgramCache]: Analyzing trace with hash 11817407, now seen corresponding path program 1 times [2018-07-22 05:55:04,311 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-22 05:55:04,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-22 05:55:04,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 05:55:04,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-22 05:55:04,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 05:55:04,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-22 05:55:04,601 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-07-22 05:55:04,602 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-22 05:55:04,602 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-22 05:55:04,605 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-22 05:55:04,605 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-22 05:55:04,605 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-22 05:55:04,606 INFO L87 Difference]: Start difference. First operand 328 states and 527 transitions. Second operand 3 states. [2018-07-22 05:55:05,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-22 05:55:05,260 INFO L93 Difference]: Finished difference Result 918 states and 1516 transitions. [2018-07-22 05:55:05,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-22 05:55:05,262 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 123 [2018-07-22 05:55:05,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-22 05:55:05,269 INFO L225 Difference]: With dead ends: 918 [2018-07-22 05:55:05,269 INFO L226 Difference]: Without dead ends: 592 [2018-07-22 05:55:05,272 INFO L578 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-22 05:55:05,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2018-07-22 05:55:05,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 592. [2018-07-22 05:55:05,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2018-07-22 05:55:05,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 922 transitions. [2018-07-22 05:55:05,310 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 922 transitions. Word has length 123 [2018-07-22 05:55:05,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-22 05:55:05,311 INFO L471 AbstractCegarLoop]: Abstraction has 592 states and 922 transitions. [2018-07-22 05:55:05,311 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-22 05:55:05,311 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 922 transitions. [2018-07-22 05:55:05,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-07-22 05:55:05,316 INFO L350 BasicCegarLoop]: Found error trace [2018-07-22 05:55:05,316 INFO L358 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-22 05:55:05,317 INFO L414 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-22 05:55:05,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1899334816, now seen corresponding path program 1 times [2018-07-22 05:55:05,317 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-22 05:55:05,317 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-22 05:55:05,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 05:55:05,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-22 05:55:05,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 05:55:05,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-22 05:55:05,410 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-22 05:55:05,411 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-22 05:55:05,411 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-22 05:55:05,412 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-22 05:55:05,412 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-22 05:55:05,412 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-22 05:55:05,412 INFO L87 Difference]: Start difference. First operand 592 states and 922 transitions. Second operand 3 states. [2018-07-22 05:55:06,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-22 05:55:06,469 INFO L93 Difference]: Finished difference Result 1578 states and 2442 transitions. [2018-07-22 05:55:06,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-22 05:55:06,469 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 124 [2018-07-22 05:55:06,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-22 05:55:06,475 INFO L225 Difference]: With dead ends: 1578 [2018-07-22 05:55:06,476 INFO L226 Difference]: Without dead ends: 988 [2018-07-22 05:55:06,478 INFO L578 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-22 05:55:06,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 988 states. [2018-07-22 05:55:06,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 988 to 988. [2018-07-22 05:55:06,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 988 states. [2018-07-22 05:55:06,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 1450 transitions. [2018-07-22 05:55:06,524 INFO L78 Accepts]: Start accepts. Automaton has 988 states and 1450 transitions. Word has length 124 [2018-07-22 05:55:06,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-22 05:55:06,524 INFO L471 AbstractCegarLoop]: Abstraction has 988 states and 1450 transitions. [2018-07-22 05:55:06,524 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-22 05:55:06,525 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 1450 transitions. [2018-07-22 05:55:06,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-07-22 05:55:06,529 INFO L350 BasicCegarLoop]: Found error trace [2018-07-22 05:55:06,529 INFO L358 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-22 05:55:06,530 INFO L414 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-22 05:55:06,530 INFO L82 PathProgramCache]: Analyzing trace with hash 803936430, now seen corresponding path program 1 times [2018-07-22 05:55:06,530 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-22 05:55:06,530 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-22 05:55:06,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 05:55:06,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-22 05:55:06,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 05:55:06,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-22 05:55:06,714 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-22 05:55:06,714 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-22 05:55:06,715 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-22 05:55:06,715 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-22 05:55:06,715 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-22 05:55:06,715 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-22 05:55:06,716 INFO L87 Difference]: Start difference. First operand 988 states and 1450 transitions. Second operand 4 states. [2018-07-22 05:55:09,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-22 05:55:09,338 INFO L93 Difference]: Finished difference Result 3294 states and 4861 transitions. [2018-07-22 05:55:09,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-22 05:55:09,339 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2018-07-22 05:55:09,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-22 05:55:09,351 INFO L225 Difference]: With dead ends: 3294 [2018-07-22 05:55:09,352 INFO L226 Difference]: Without dead ends: 2308 [2018-07-22 05:55:09,354 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 05:55:09,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2308 states. [2018-07-22 05:55:09,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2308 to 2308. [2018-07-22 05:55:09,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2308 states. [2018-07-22 05:55:09,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2308 states to 2308 states and 3154 transitions. [2018-07-22 05:55:09,436 INFO L78 Accepts]: Start accepts. Automaton has 2308 states and 3154 transitions. Word has length 133 [2018-07-22 05:55:09,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-22 05:55:09,436 INFO L471 AbstractCegarLoop]: Abstraction has 2308 states and 3154 transitions. [2018-07-22 05:55:09,436 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-22 05:55:09,437 INFO L276 IsEmpty]: Start isEmpty. Operand 2308 states and 3154 transitions. [2018-07-22 05:55:09,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-07-22 05:55:09,445 INFO L350 BasicCegarLoop]: Found error trace [2018-07-22 05:55:09,445 INFO L358 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:55:09,446 INFO L414 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-22 05:55:09,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1220031998, now seen corresponding path program 1 times [2018-07-22 05:55:09,446 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-22 05:55:09,446 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-22 05:55:09,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 05:55:09,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-22 05:55:09,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 05:55:09,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-22 05:55:09,622 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-07-22 05:55:09,622 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-22 05:55:09,622 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-22 05:55:09,623 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-22 05:55:09,623 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-22 05:55:09,623 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-07-22 05:55:09,623 INFO L87 Difference]: Start difference. First operand 2308 states and 3154 transitions. Second operand 5 states. [2018-07-22 05:55:10,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-22 05:55:10,757 INFO L93 Difference]: Finished difference Result 7782 states and 10618 transitions. [2018-07-22 05:55:10,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-22 05:55:10,757 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 144 [2018-07-22 05:55:10,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-22 05:55:10,770 INFO L225 Difference]: With dead ends: 7782 [2018-07-22 05:55:10,771 INFO L226 Difference]: Without dead ends: 3064 [2018-07-22 05:55:10,777 INFO L578 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-07-22 05:55:10,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3064 states. [2018-07-22 05:55:10,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3064 to 3064. [2018-07-22 05:55:10,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3064 states. [2018-07-22 05:55:10,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3064 states to 3064 states and 3482 transitions. [2018-07-22 05:55:10,855 INFO L78 Accepts]: Start accepts. Automaton has 3064 states and 3482 transitions. Word has length 144 [2018-07-22 05:55:10,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-22 05:55:10,856 INFO L471 AbstractCegarLoop]: Abstraction has 3064 states and 3482 transitions. [2018-07-22 05:55:10,856 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-22 05:55:10,856 INFO L276 IsEmpty]: Start isEmpty. Operand 3064 states and 3482 transitions. [2018-07-22 05:55:10,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-07-22 05:55:10,862 INFO L350 BasicCegarLoop]: Found error trace [2018-07-22 05:55:10,862 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:55:10,862 INFO L414 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-22 05:55:10,863 INFO L82 PathProgramCache]: Analyzing trace with hash -27338524, now seen corresponding path program 1 times [2018-07-22 05:55:10,863 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-22 05:55:10,863 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-22 05:55:10,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 05:55:10,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-22 05:55:10,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 05:55:10,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-22 05:55:11,078 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-22 05:55:11,079 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-22 05:55:11,079 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-22 05:55:11,080 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-22 05:55:11,080 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-22 05:55:11,080 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-22 05:55:11,080 INFO L87 Difference]: Start difference. First operand 3064 states and 3482 transitions. Second operand 3 states. [2018-07-22 05:55:12,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-22 05:55:12,258 INFO L93 Difference]: Finished difference Result 6126 states and 6962 transitions. [2018-07-22 05:55:12,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-22 05:55:12,258 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 148 [2018-07-22 05:55:12,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-22 05:55:12,270 INFO L225 Difference]: With dead ends: 6126 [2018-07-22 05:55:12,270 INFO L226 Difference]: Without dead ends: 3064 [2018-07-22 05:55:12,274 INFO L578 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-22 05:55:12,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3064 states. [2018-07-22 05:55:12,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3064 to 3064. [2018-07-22 05:55:12,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3064 states. [2018-07-22 05:55:12,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3064 states to 3064 states and 3456 transitions. [2018-07-22 05:55:12,339 INFO L78 Accepts]: Start accepts. Automaton has 3064 states and 3456 transitions. Word has length 148 [2018-07-22 05:55:12,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-22 05:55:12,339 INFO L471 AbstractCegarLoop]: Abstraction has 3064 states and 3456 transitions. [2018-07-22 05:55:12,339 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-22 05:55:12,340 INFO L276 IsEmpty]: Start isEmpty. Operand 3064 states and 3456 transitions. [2018-07-22 05:55:12,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-07-22 05:55:12,347 INFO L350 BasicCegarLoop]: Found error trace [2018-07-22 05:55:12,347 INFO L358 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-22 05:55:12,347 INFO L414 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-22 05:55:12,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1524749372, now seen corresponding path program 1 times [2018-07-22 05:55:12,347 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-22 05:55:12,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-22 05:55:12,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 05:55:12,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-22 05:55:12,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 05:55:12,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-22 05:55:12,535 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-22 05:55:12,536 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-22 05:55:12,536 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-07-22 05:55:12,536 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-22 05:55:12,537 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-22 05:55:12,537 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-07-22 05:55:12,537 INFO L87 Difference]: Start difference. First operand 3064 states and 3456 transitions. Second operand 8 states. [2018-07-22 05:55:14,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-22 05:55:14,459 INFO L93 Difference]: Finished difference Result 6321 states and 7112 transitions. [2018-07-22 05:55:14,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-22 05:55:14,459 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 153 [2018-07-22 05:55:14,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-22 05:55:14,468 INFO L225 Difference]: With dead ends: 6321 [2018-07-22 05:55:14,468 INFO L226 Difference]: Without dead ends: 3259 [2018-07-22 05:55:14,471 INFO L578 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-07-22 05:55:14,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3259 states. [2018-07-22 05:55:14,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3259 to 3064. [2018-07-22 05:55:14,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3064 states. [2018-07-22 05:55:14,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3064 states to 3064 states and 3447 transitions. [2018-07-22 05:55:14,537 INFO L78 Accepts]: Start accepts. Automaton has 3064 states and 3447 transitions. Word has length 153 [2018-07-22 05:55:14,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-22 05:55:14,537 INFO L471 AbstractCegarLoop]: Abstraction has 3064 states and 3447 transitions. [2018-07-22 05:55:14,537 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-22 05:55:14,538 INFO L276 IsEmpty]: Start isEmpty. Operand 3064 states and 3447 transitions. [2018-07-22 05:55:14,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-07-22 05:55:14,547 INFO L350 BasicCegarLoop]: Found error trace [2018-07-22 05:55:14,547 INFO L358 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:55:14,548 INFO L414 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-22 05:55:14,555 INFO L82 PathProgramCache]: Analyzing trace with hash 792444734, now seen corresponding path program 1 times [2018-07-22 05:55:14,555 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-22 05:55:14,555 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-22 05:55:14,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 05:55:14,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-22 05:55:14,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 05:55:14,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-22 05:55:15,051 WARN L169 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 35 [2018-07-22 05:55:15,449 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-22 05:55:15,449 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-22 05:55:15,449 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-07-22 05:55:15,449 INFO L450 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-22 05:55:15,450 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-22 05:55:15,451 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=90, Unknown=0, NotChecked=0, Total=156 [2018-07-22 05:55:15,451 INFO L87 Difference]: Start difference. First operand 3064 states and 3447 transitions. Second operand 13 states. [2018-07-22 05:55:16,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-22 05:55:16,992 INFO L93 Difference]: Finished difference Result 6388 states and 7188 transitions. [2018-07-22 05:55:16,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-07-22 05:55:16,992 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 170 [2018-07-22 05:55:16,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-22 05:55:17,002 INFO L225 Difference]: With dead ends: 6388 [2018-07-22 05:55:17,002 INFO L226 Difference]: Without dead ends: 3326 [2018-07-22 05:55:17,004 INFO L578 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=149, Invalid=193, Unknown=0, NotChecked=0, Total=342 [2018-07-22 05:55:17,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3326 states. [2018-07-22 05:55:17,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3326 to 3257. [2018-07-22 05:55:17,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3257 states. [2018-07-22 05:55:17,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3257 states to 3257 states and 3611 transitions. [2018-07-22 05:55:17,076 INFO L78 Accepts]: Start accepts. Automaton has 3257 states and 3611 transitions. Word has length 170 [2018-07-22 05:55:17,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-22 05:55:17,076 INFO L471 AbstractCegarLoop]: Abstraction has 3257 states and 3611 transitions. [2018-07-22 05:55:17,077 INFO L472 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-22 05:55:17,077 INFO L276 IsEmpty]: Start isEmpty. Operand 3257 states and 3611 transitions. [2018-07-22 05:55:17,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2018-07-22 05:55:17,085 INFO L350 BasicCegarLoop]: Found error trace [2018-07-22 05:55:17,086 INFO L358 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-22 05:55:17,086 INFO L414 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-22 05:55:17,086 INFO L82 PathProgramCache]: Analyzing trace with hash -558054453, now seen corresponding path program 1 times [2018-07-22 05:55:17,086 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-22 05:55:17,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-22 05:55:17,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 05:55:17,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-22 05:55:17,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 05:55:17,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-22 05:55:17,560 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 6 proven. 114 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-07-22 05:55:17,561 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-22 05:55:17,561 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 05:55:17,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-22 05:55:17,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-22 05:55:17,704 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-22 05:55:17,998 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-07-22 05:55:18,034 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-07-22 05:55:18,034 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2018-07-22 05:55:18,035 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-22 05:55:18,035 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-22 05:55:18,036 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-07-22 05:55:18,036 INFO L87 Difference]: Start difference. First operand 3257 states and 3611 transitions. Second operand 9 states. [2018-07-22 05:55:21,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-22 05:55:21,067 INFO L93 Difference]: Finished difference Result 6749 states and 7475 transitions. [2018-07-22 05:55:21,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-22 05:55:21,067 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 225 [2018-07-22 05:55:21,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-22 05:55:21,079 INFO L225 Difference]: With dead ends: 6749 [2018-07-22 05:55:21,079 INFO L226 Difference]: Without dead ends: 3224 [2018-07-22 05:55:21,082 INFO L578 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 229 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2018-07-22 05:55:21,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3224 states. [2018-07-22 05:55:21,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3224 to 2960. [2018-07-22 05:55:21,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2960 states. [2018-07-22 05:55:21,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2960 states to 2960 states and 3180 transitions. [2018-07-22 05:55:21,161 INFO L78 Accepts]: Start accepts. Automaton has 2960 states and 3180 transitions. Word has length 225 [2018-07-22 05:55:21,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-22 05:55:21,161 INFO L471 AbstractCegarLoop]: Abstraction has 2960 states and 3180 transitions. [2018-07-22 05:55:21,161 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-22 05:55:21,161 INFO L276 IsEmpty]: Start isEmpty. Operand 2960 states and 3180 transitions. [2018-07-22 05:55:21,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-07-22 05:55:21,169 INFO L350 BasicCegarLoop]: Found error trace [2018-07-22 05:55:21,169 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:55:21,169 INFO L414 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-22 05:55:21,170 INFO L82 PathProgramCache]: Analyzing trace with hash 1466796070, now seen corresponding path program 1 times [2018-07-22 05:55:21,170 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-22 05:55:21,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-22 05:55:21,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 05:55:21,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-22 05:55:21,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 05:55:21,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-22 05:55:21,710 WARN L169 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-07-22 05:55:21,989 WARN L169 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 24 [2018-07-22 05:55:22,154 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 177 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-22 05:55:22,154 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-22 05:55:22,154 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 05:55:22,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-22 05:55:22,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-22 05:55:22,280 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-22 05:55:22,364 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2018-07-22 05:55:22,385 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-07-22 05:55:22,385 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2018-07-22 05:55:22,385 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-22 05:55:22,386 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-22 05:55:22,386 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-07-22 05:55:22,386 INFO L87 Difference]: Start difference. First operand 2960 states and 3180 transitions. Second operand 9 states. [2018-07-22 05:55:24,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-22 05:55:24,181 INFO L93 Difference]: Finished difference Result 6896 states and 7386 transitions. [2018-07-22 05:55:24,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-22 05:55:24,182 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 256 [2018-07-22 05:55:24,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-22 05:55:24,187 INFO L225 Difference]: With dead ends: 6896 [2018-07-22 05:55:24,187 INFO L226 Difference]: Without dead ends: 2098 [2018-07-22 05:55:24,189 INFO L578 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-07-22 05:55:24,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2098 states. [2018-07-22 05:55:24,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2098 to 1786. [2018-07-22 05:55:24,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1786 states. [2018-07-22 05:55:24,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1786 states to 1786 states and 1868 transitions. [2018-07-22 05:55:24,227 INFO L78 Accepts]: Start accepts. Automaton has 1786 states and 1868 transitions. Word has length 256 [2018-07-22 05:55:24,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-22 05:55:24,228 INFO L471 AbstractCegarLoop]: Abstraction has 1786 states and 1868 transitions. [2018-07-22 05:55:24,228 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-22 05:55:24,228 INFO L276 IsEmpty]: Start isEmpty. Operand 1786 states and 1868 transitions. [2018-07-22 05:55:24,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2018-07-22 05:55:24,235 INFO L350 BasicCegarLoop]: Found error trace [2018-07-22 05:55:24,236 INFO L358 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-22 05:55:24,236 INFO L414 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-22 05:55:24,236 INFO L82 PathProgramCache]: Analyzing trace with hash -1196757998, now seen corresponding path program 1 times [2018-07-22 05:55:24,236 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-22 05:55:24,236 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-22 05:55:24,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 05:55:24,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-22 05:55:24,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 05:55:24,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-22 05:55:24,512 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 249 proven. 0 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-07-22 05:55:24,512 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-22 05:55:24,512 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-07-22 05:55:24,513 INFO L450 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-22 05:55:24,513 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-22 05:55:24,513 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-07-22 05:55:24,513 INFO L87 Difference]: Start difference. First operand 1786 states and 1868 transitions. Second operand 6 states. [2018-07-22 05:55:25,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-22 05:55:25,182 INFO L93 Difference]: Finished difference Result 3668 states and 3840 transitions. [2018-07-22 05:55:25,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-22 05:55:25,182 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 293 [2018-07-22 05:55:25,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-22 05:55:25,187 INFO L225 Difference]: With dead ends: 3668 [2018-07-22 05:55:25,188 INFO L226 Difference]: Without dead ends: 2016 [2018-07-22 05:55:25,189 INFO L578 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-07-22 05:55:25,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2016 states. [2018-07-22 05:55:25,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2016 to 1654. [2018-07-22 05:55:25,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1654 states. [2018-07-22 05:55:25,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1654 states to 1654 states and 1723 transitions. [2018-07-22 05:55:25,227 INFO L78 Accepts]: Start accepts. Automaton has 1654 states and 1723 transitions. Word has length 293 [2018-07-22 05:55:25,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-22 05:55:25,228 INFO L471 AbstractCegarLoop]: Abstraction has 1654 states and 1723 transitions. [2018-07-22 05:55:25,228 INFO L472 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-22 05:55:25,228 INFO L276 IsEmpty]: Start isEmpty. Operand 1654 states and 1723 transitions. [2018-07-22 05:55:25,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2018-07-22 05:55:25,235 INFO L350 BasicCegarLoop]: Found error trace [2018-07-22 05:55:25,235 INFO L358 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-22 05:55:25,235 INFO L414 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-22 05:55:25,235 INFO L82 PathProgramCache]: Analyzing trace with hash 824141385, now seen corresponding path program 1 times [2018-07-22 05:55:25,236 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-22 05:55:25,236 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-22 05:55:25,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 05:55:25,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-22 05:55:25,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 05:55:25,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-22 05:55:25,748 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 196 proven. 0 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2018-07-22 05:55:25,748 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-22 05:55:25,748 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-22 05:55:25,749 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-22 05:55:25,749 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-22 05:55:25,749 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-22 05:55:25,749 INFO L87 Difference]: Start difference. First operand 1654 states and 1723 transitions. Second operand 4 states. [2018-07-22 05:55:26,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-22 05:55:26,142 INFO L93 Difference]: Finished difference Result 1654 states and 1723 transitions. [2018-07-22 05:55:26,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-22 05:55:26,142 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 315 [2018-07-22 05:55:26,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-22 05:55:26,143 INFO L225 Difference]: With dead ends: 1654 [2018-07-22 05:55:26,143 INFO L226 Difference]: Without dead ends: 0 [2018-07-22 05:55:26,144 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 05:55:26,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-07-22 05:55:26,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-07-22 05:55:26,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-07-22 05:55:26,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-07-22 05:55:26,145 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 315 [2018-07-22 05:55:26,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-22 05:55:26,146 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-07-22 05:55:26,146 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-22 05:55:26,146 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-07-22 05:55:26,146 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-07-22 05:55:26,151 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-07-22 05:55:26,278 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 05:55:26,290 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 05:55:26,299 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 05:55:26,314 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 05:55:26,322 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 05:55:26,329 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 05:55:26,339 WARN L169 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 220 DAG size of output: 95 [2018-07-22 05:55:26,454 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 05:55:26,464 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 05:55:26,474 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 05:55:26,487 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 05:55:26,489 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 05:55:26,499 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 05:55:26,506 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 05:55:26,516 WARN L169 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 223 DAG size of output: 95 [2018-07-22 05:55:28,469 WARN L169 SmtUtils]: Spent 1.95 s on a formula simplification. DAG size of input: 84 DAG size of output: 62 [2018-07-22 05:55:29,061 WARN L169 SmtUtils]: Spent 590.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 62 [2018-07-22 05:55:29,080 INFO L421 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2018-07-22 05:55:29,080 INFO L421 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2018-07-22 05:55:29,081 INFO L421 ceAbstractionStarter]: For program point L526'(lines 30 575) no Hoare annotation was computed. [2018-07-22 05:55:29,081 INFO L421 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2018-07-22 05:55:29,081 INFO L421 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2018-07-22 05:55:29,081 INFO L421 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2018-07-22 05:55:29,081 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-07-22 05:55:29,081 INFO L421 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2018-07-22 05:55:29,081 INFO L421 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2018-07-22 05:55:29,081 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-07-22 05:55:29,082 INFO L421 ceAbstractionStarter]: For program point L502(lines 30 575) no Hoare annotation was computed. [2018-07-22 05:55:29,082 INFO L421 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2018-07-22 05:55:29,082 INFO L421 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2018-07-22 05:55:29,082 INFO L421 ceAbstractionStarter]: For program point L505(lines 30 575) no Hoare annotation was computed. [2018-07-22 05:55:29,082 INFO L421 ceAbstractionStarter]: For program point L391'(lines 30 575) no Hoare annotation was computed. [2018-07-22 05:55:29,082 INFO L421 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2018-07-22 05:55:29,082 INFO L421 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2018-07-22 05:55:29,082 INFO L421 ceAbstractionStarter]: For program point L508(lines 30 575) no Hoare annotation was computed. [2018-07-22 05:55:29,082 INFO L421 ceAbstractionStarter]: For program point L520(lines 30 575) no Hoare annotation was computed. [2018-07-22 05:55:29,083 INFO L421 ceAbstractionStarter]: For program point L403(lines 30 575) no Hoare annotation was computed. [2018-07-22 05:55:29,083 INFO L421 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2018-07-22 05:55:29,083 INFO L421 ceAbstractionStarter]: For program point L523(lines 30 575) no Hoare annotation was computed. [2018-07-22 05:55:29,083 INFO L421 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2018-07-22 05:55:29,084 INFO L421 ceAbstractionStarter]: For program point L400(lines 30 575) no Hoare annotation was computed. [2018-07-22 05:55:29,084 INFO L421 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2018-07-22 05:55:29,084 INFO L421 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2018-07-22 05:55:29,084 INFO L421 ceAbstractionStarter]: For program point L406(lines 30 575) no Hoare annotation was computed. [2018-07-22 05:55:29,084 INFO L421 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2018-07-22 05:55:29,084 INFO L421 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2018-07-22 05:55:29,084 INFO L421 ceAbstractionStarter]: For program point L409(lines 30 575) no Hoare annotation was computed. [2018-07-22 05:55:29,084 INFO L421 ceAbstractionStarter]: For program point L529(lines 30 575) no Hoare annotation was computed. [2018-07-22 05:55:29,085 INFO L421 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2018-07-22 05:55:29,085 INFO L421 ceAbstractionStarter]: For program point L511(lines 30 575) no Hoare annotation was computed. [2018-07-22 05:55:29,085 INFO L421 ceAbstractionStarter]: For program point L517(lines 30 575) no Hoare annotation was computed. [2018-07-22 05:55:29,085 INFO L421 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2018-07-22 05:55:29,085 INFO L421 ceAbstractionStarter]: For program point L514(lines 30 575) no Hoare annotation was computed. [2018-07-22 05:55:29,085 INFO L421 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2018-07-22 05:55:29,085 INFO L421 ceAbstractionStarter]: For program point L421(lines 30 575) no Hoare annotation was computed. [2018-07-22 05:55:29,085 INFO L421 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-07-22 05:55:29,085 INFO L421 ceAbstractionStarter]: For program point L541(lines 30 575) no Hoare annotation was computed. [2018-07-22 05:55:29,085 INFO L421 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2018-07-22 05:55:29,086 INFO L421 ceAbstractionStarter]: For program point L424(lines 30 575) no Hoare annotation was computed. [2018-07-22 05:55:29,086 INFO L421 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-07-22 05:55:29,086 INFO L421 ceAbstractionStarter]: For program point L544(lines 30 575) no Hoare annotation was computed. [2018-07-22 05:55:29,086 INFO L421 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2018-07-22 05:55:29,086 INFO L421 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2018-07-22 05:55:29,086 INFO L421 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2018-07-22 05:55:29,086 INFO L421 ceAbstractionStarter]: For program point L427(lines 30 575) no Hoare annotation was computed. [2018-07-22 05:55:29,086 INFO L421 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-07-22 05:55:29,086 INFO L421 ceAbstractionStarter]: For program point L547(lines 30 575) no Hoare annotation was computed. [2018-07-22 05:55:29,086 INFO L421 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2018-07-22 05:55:29,087 INFO L421 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2018-07-22 05:55:29,087 INFO L421 ceAbstractionStarter]: For program point L535(lines 30 575) no Hoare annotation was computed. [2018-07-22 05:55:29,087 INFO L421 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2018-07-22 05:55:29,087 INFO L421 ceAbstractionStarter]: For program point L412(lines 30 575) no Hoare annotation was computed. [2018-07-22 05:55:29,087 INFO L421 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2018-07-22 05:55:29,087 INFO L421 ceAbstractionStarter]: For program point L532(lines 30 575) no Hoare annotation was computed. [2018-07-22 05:55:29,087 INFO L421 ceAbstractionStarter]: For program point L418(lines 30 575) no Hoare annotation was computed. [2018-07-22 05:55:29,087 INFO L421 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2018-07-22 05:55:29,087 INFO L421 ceAbstractionStarter]: For program point L538(lines 30 575) no Hoare annotation was computed. [2018-07-22 05:55:29,087 INFO L421 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2018-07-22 05:55:29,088 INFO L421 ceAbstractionStarter]: For program point L415(lines 30 575) no Hoare annotation was computed. [2018-07-22 05:55:29,088 INFO L421 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2018-07-22 05:55:29,088 INFO L421 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2018-07-22 05:55:29,088 INFO L421 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-07-22 05:55:29,088 INFO L421 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2018-07-22 05:55:29,088 INFO L421 ceAbstractionStarter]: For program point L442(lines 30 575) no Hoare annotation was computed. [2018-07-22 05:55:29,088 INFO L421 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2018-07-22 05:55:29,088 INFO L421 ceAbstractionStarter]: For program point L562(lines 30 575) no Hoare annotation was computed. [2018-07-22 05:55:29,088 INFO L421 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2018-07-22 05:55:29,088 INFO L421 ceAbstractionStarter]: For program point L568(lines 30 575) no Hoare annotation was computed. [2018-07-22 05:55:29,089 INFO L421 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2018-07-22 05:55:29,089 INFO L421 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2018-07-22 05:55:29,089 INFO L421 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2018-07-22 05:55:29,089 INFO L421 ceAbstractionStarter]: For program point L445(lines 30 575) no Hoare annotation was computed. [2018-07-22 05:55:29,089 INFO L421 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2018-07-22 05:55:29,089 INFO L421 ceAbstractionStarter]: For program point L565(lines 30 575) no Hoare annotation was computed. [2018-07-22 05:55:29,089 INFO L421 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2018-07-22 05:55:29,089 INFO L421 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2018-07-22 05:55:29,089 INFO L421 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2018-07-22 05:55:29,089 INFO L421 ceAbstractionStarter]: For program point L448(lines 30 575) no Hoare annotation was computed. [2018-07-22 05:55:29,090 INFO L421 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-07-22 05:55:29,090 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-07-22 05:55:29,090 INFO L421 ceAbstractionStarter]: For program point L553(lines 30 575) no Hoare annotation was computed. [2018-07-22 05:55:29,090 INFO L421 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2018-07-22 05:55:29,090 INFO L421 ceAbstractionStarter]: For program point L430(lines 30 575) no Hoare annotation was computed. [2018-07-22 05:55:29,090 INFO L421 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-07-22 05:55:29,090 INFO L421 ceAbstractionStarter]: For program point L550(lines 30 575) no Hoare annotation was computed. [2018-07-22 05:55:29,090 INFO L421 ceAbstractionStarter]: For program point L436(lines 30 575) no Hoare annotation was computed. [2018-07-22 05:55:29,090 INFO L421 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-07-22 05:55:29,091 INFO L421 ceAbstractionStarter]: For program point L556(lines 30 575) no Hoare annotation was computed. [2018-07-22 05:55:29,091 INFO L421 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2018-07-22 05:55:29,091 INFO L421 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2018-07-22 05:55:29,091 INFO L421 ceAbstractionStarter]: For program point L433(lines 30 575) no Hoare annotation was computed. [2018-07-22 05:55:29,091 INFO L421 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-07-22 05:55:29,091 INFO L421 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2018-07-22 05:55:29,091 INFO L421 ceAbstractionStarter]: For program point L439(lines 30 575) no Hoare annotation was computed. [2018-07-22 05:55:29,091 INFO L421 ceAbstractionStarter]: For program point L559(lines 30 575) no Hoare annotation was computed. [2018-07-22 05:55:29,091 INFO L421 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2018-07-22 05:55:29,091 INFO L421 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2018-07-22 05:55:29,092 INFO L421 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2018-07-22 05:55:29,092 INFO L421 ceAbstractionStarter]: For program point L460(lines 30 575) no Hoare annotation was computed. [2018-07-22 05:55:29,092 INFO L421 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2018-07-22 05:55:29,092 INFO L421 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2018-07-22 05:55:29,092 INFO L421 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2018-07-22 05:55:29,092 INFO L421 ceAbstractionStarter]: For program point L463(lines 30 575) no Hoare annotation was computed. [2018-07-22 05:55:29,092 INFO L421 ceAbstractionStarter]: For program point L583(lines 583 593) no Hoare annotation was computed. [2018-07-22 05:55:29,092 INFO L421 ceAbstractionStarter]: For program point L469(lines 30 575) no Hoare annotation was computed. [2018-07-22 05:55:29,092 INFO L421 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2018-07-22 05:55:29,092 INFO L421 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2018-07-22 05:55:29,092 INFO L421 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2018-07-22 05:55:29,092 INFO L421 ceAbstractionStarter]: For program point L466(lines 30 575) no Hoare annotation was computed. [2018-07-22 05:55:29,092 INFO L421 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2018-07-22 05:55:29,092 INFO L421 ceAbstractionStarter]: For program point L571(lines 571 573) no Hoare annotation was computed. [2018-07-22 05:55:29,092 INFO L421 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2018-07-22 05:55:29,092 INFO L421 ceAbstractionStarter]: For program point L454(lines 30 575) no Hoare annotation was computed. [2018-07-22 05:55:29,093 INFO L417 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse0 (= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7~0 1))) (let ((.cse11 (not .cse0)) (.cse1 (= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0 8)) (.cse8 (= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0 1)) (.cse3 (= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 1)) (.cse6 (= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20~0 1)) (.cse9 (= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8~0 15))) (let ((.cse4 (<= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0 0)) (.cse7 (not .cse9)) (.cse5 (= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0 4)) (.cse2 (= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0 5)) (.cse10 (or (and .cse11 .cse1 .cse8 .cse9 .cse3) .cse6))) (or (and .cse0 .cse1 .cse2 .cse3) (and (not (= ULTIMATE.start___U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_output_~input 5)) .cse4 (<= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20~0 0) .cse1 .cse5 .cse3) (and .cse0 .cse6 (not (= 5 ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0))) (and .cse0 .cse1 .cse5 .cse3) (and .cse7 .cse6 .cse3) (and .cse7 .cse8 .cse3) (and .cse0 .cse8 .cse5) (and .cse1 .cse8 .cse5 .cse3) (and .cse6 .cse1 .cse5 .cse3) (and .cse7 .cse0 .cse2 .cse3) (and .cse1 .cse2 (or (and .cse4 (or (= ULTIMATE.start___U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_output_~input 6) (= ULTIMATE.start___U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_output_~input 3) (= ULTIMATE.start___U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_output_~input 2))) (= ULTIMATE.start___U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_output_~input 1)) .cse9 .cse3) (and (= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8~0 14) .cse2 .cse3) (and .cse7 .cse3 .cse5) (and .cse1 .cse2 .cse10 .cse3) (and .cse11 .cse1 .cse9 (= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0 6) .cse3) (and .cse0 .cse8 .cse10))))) [2018-07-22 05:55:29,093 INFO L421 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2018-07-22 05:55:29,093 INFO L421 ceAbstractionStarter]: For program point L451(lines 30 575) no Hoare annotation was computed. [2018-07-22 05:55:29,093 INFO L421 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2018-07-22 05:55:29,094 INFO L421 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2018-07-22 05:55:29,094 INFO L421 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2018-07-22 05:55:29,094 INFO L421 ceAbstractionStarter]: For program point L457(lines 30 575) no Hoare annotation was computed. [2018-07-22 05:55:29,094 INFO L421 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2018-07-22 05:55:29,094 INFO L424 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2018-07-22 05:55:29,094 INFO L421 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2018-07-22 05:55:29,094 INFO L421 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2018-07-22 05:55:29,094 INFO L421 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2018-07-22 05:55:29,094 INFO L421 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2018-07-22 05:55:29,094 INFO L421 ceAbstractionStarter]: For program point L481(lines 30 575) no Hoare annotation was computed. [2018-07-22 05:55:29,094 INFO L421 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2018-07-22 05:55:29,094 INFO L421 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2018-07-22 05:55:29,095 INFO L421 ceAbstractionStarter]: For program point L487(lines 30 575) no Hoare annotation was computed. [2018-07-22 05:55:29,095 INFO L421 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2018-07-22 05:55:29,095 INFO L421 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2018-07-22 05:55:29,095 INFO L421 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2018-07-22 05:55:29,095 INFO L421 ceAbstractionStarter]: For program point L484(lines 30 575) no Hoare annotation was computed. [2018-07-22 05:55:29,095 INFO L421 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2018-07-22 05:55:29,095 INFO L421 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2018-07-22 05:55:29,095 INFO L421 ceAbstractionStarter]: For program point L490(lines 30 575) no Hoare annotation was computed. [2018-07-22 05:55:29,095 INFO L421 ceAbstractionStarter]: For program point L472(lines 30 575) no Hoare annotation was computed. [2018-07-22 05:55:29,095 INFO L421 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2018-07-22 05:55:29,096 INFO L421 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2018-07-22 05:55:29,096 INFO L421 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2018-07-22 05:55:29,096 INFO L421 ceAbstractionStarter]: For program point L475(lines 30 575) no Hoare annotation was computed. [2018-07-22 05:55:29,096 INFO L421 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2018-07-22 05:55:29,097 INFO L421 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2018-07-22 05:55:29,097 INFO L421 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2018-07-22 05:55:29,097 INFO L421 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2018-07-22 05:55:29,097 INFO L421 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2018-07-22 05:55:29,097 INFO L421 ceAbstractionStarter]: For program point L478(lines 30 575) no Hoare annotation was computed. [2018-07-22 05:55:29,097 INFO L421 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2018-07-22 05:55:29,097 INFO L421 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2018-07-22 05:55:29,097 INFO L421 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2018-07-22 05:55:29,097 INFO L421 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2018-07-22 05:55:29,097 INFO L421 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2018-07-22 05:55:29,097 INFO L421 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2018-07-22 05:55:29,097 INFO L421 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2018-07-22 05:55:29,097 INFO L421 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2018-07-22 05:55:29,097 INFO L421 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2018-07-22 05:55:29,097 INFO L421 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2018-07-22 05:55:29,098 INFO L421 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2018-07-22 05:55:29,098 INFO L421 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2018-07-22 05:55:29,098 INFO L421 ceAbstractionStarter]: For program point L493(lines 30 575) no Hoare annotation was computed. [2018-07-22 05:55:29,098 INFO L421 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2018-07-22 05:55:29,098 INFO L421 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2018-07-22 05:55:29,098 INFO L421 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2018-07-22 05:55:29,098 INFO L421 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2018-07-22 05:55:29,098 INFO L421 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2018-07-22 05:55:29,098 INFO L421 ceAbstractionStarter]: For program point L496(lines 30 575) no Hoare annotation was computed. [2018-07-22 05:55:29,098 INFO L421 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2018-07-22 05:55:29,098 INFO L421 ceAbstractionStarter]: For program point L499(lines 30 575) no Hoare annotation was computed. [2018-07-22 05:55:29,098 INFO L417 ceAbstractionStarter]: At program point L583''(lines 583 593) the Hoare annotation is: (let ((.cse0 (= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7~0 1))) (let ((.cse11 (not .cse0)) (.cse1 (= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0 8)) (.cse8 (= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0 1)) (.cse3 (= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 1)) (.cse6 (= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20~0 1)) (.cse9 (= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8~0 15))) (let ((.cse4 (<= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0 0)) (.cse7 (not .cse9)) (.cse5 (= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0 4)) (.cse2 (= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0 5)) (.cse10 (or (and .cse11 .cse1 .cse8 .cse9 .cse3) .cse6))) (or (and .cse0 .cse1 .cse2 .cse3) (and (not (= ULTIMATE.start___U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_output_~input 5)) .cse4 (<= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20~0 0) .cse1 .cse5 .cse3) (and .cse0 .cse6 (not (= 5 ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0))) (and .cse0 .cse1 .cse5 .cse3) (and .cse7 .cse6 .cse3) (and .cse7 .cse8 .cse3) (and .cse0 .cse8 .cse5) (and .cse1 .cse8 .cse5 .cse3) (and .cse6 .cse1 .cse5 .cse3) (and .cse7 .cse0 .cse2 .cse3) (and .cse1 .cse2 (or (and .cse4 (or (= ULTIMATE.start___U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_output_~input 6) (= ULTIMATE.start___U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_output_~input 3) (= ULTIMATE.start___U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_output_~input 2))) (= ULTIMATE.start___U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_output_~input 1)) .cse9 .cse3) (and (= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8~0 14) .cse2 .cse3) (and .cse7 .cse3 .cse5) (and .cse1 .cse2 .cse10 .cse3) (and .cse11 .cse1 .cse9 (= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0 6) .cse3) (and .cse0 .cse8 .cse10))))) [2018-07-22 05:55:29,098 INFO L421 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2018-07-22 05:55:29,099 INFO L421 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2018-07-22 05:55:29,099 INFO L421 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2018-07-22 05:55:29,099 INFO L421 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2018-07-22 05:55:29,099 INFO L421 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2018-07-22 05:55:29,099 INFO L421 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2018-07-22 05:55:29,099 INFO L421 ceAbstractionStarter]: For program point L394(lines 30 575) no Hoare annotation was computed. [2018-07-22 05:55:29,099 INFO L421 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2018-07-22 05:55:29,099 INFO L421 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2018-07-22 05:55:29,099 INFO L421 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2018-07-22 05:55:29,099 INFO L421 ceAbstractionStarter]: For program point L397(lines 30 575) no Hoare annotation was computed. [2018-07-22 05:55:29,099 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startErr0AssertViolationERROR_FUNCTION(line 527) no Hoare annotation was computed. [2018-07-22 05:55:29,099 INFO L421 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-07-22 05:55:29,099 INFO L421 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2018-07-22 05:55:29,100 INFO L421 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2018-07-22 05:55:29,100 INFO L421 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2018-07-22 05:55:29,100 INFO L421 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2018-07-22 05:55:29,100 INFO L421 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2018-07-22 05:55:29,100 INFO L421 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2018-07-22 05:55:29,100 INFO L421 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2018-07-22 05:55:29,100 INFO L421 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2018-07-22 05:55:29,100 INFO L421 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2018-07-22 05:55:29,100 INFO L421 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2018-07-22 05:55:29,100 INFO L421 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2018-07-22 05:55:29,100 INFO L421 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2018-07-22 05:55:29,100 INFO L421 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2018-07-22 05:55:29,145 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.07 05:55:29 BoogieIcfgContainer [2018-07-22 05:55:29,145 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-22 05:55:29,146 INFO L168 Benchmark]: Toolchain (without parser) took 31693.41 ms. Allocated memory was 297.8 MB in the beginning and 829.4 MB in the end (delta: 531.6 MB). Free memory was 240.2 MB in the beginning and 322.7 MB in the end (delta: -82.5 MB). Peak memory consumption was 449.1 MB. Max. memory is 5.3 GB. [2018-07-22 05:55:29,147 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 297.8 MB. Free memory is still 260.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-07-22 05:55:29,148 INFO L168 Benchmark]: CACSL2BoogieTranslator took 723.75 ms. Allocated memory is still 297.8 MB. Free memory was 240.2 MB in the beginning and 206.1 MB in the end (delta: 34.1 MB). Peak memory consumption was 34.1 MB. Max. memory is 5.3 GB. [2018-07-22 05:55:29,149 INFO L168 Benchmark]: Boogie Procedure Inliner took 134.95 ms. Allocated memory is still 297.8 MB. Free memory was 206.1 MB in the beginning and 200.2 MB in the end (delta: 6.0 MB). Peak memory consumption was 6.0 MB. Max. memory is 5.3 GB. [2018-07-22 05:55:29,150 INFO L168 Benchmark]: Boogie Preprocessor took 100.86 ms. Allocated memory is still 297.8 MB. Free memory was 200.2 MB in the beginning and 196.2 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 5.3 GB. [2018-07-22 05:55:29,150 INFO L168 Benchmark]: RCFGBuilder took 3624.07 ms. Allocated memory was 297.8 MB in the beginning and 459.3 MB in the end (delta: 161.5 MB). Free memory was 196.2 MB in the beginning and 314.9 MB in the end (delta: -118.8 MB). Peak memory consumption was 59.0 MB. Max. memory is 5.3 GB. [2018-07-22 05:55:29,151 INFO L168 Benchmark]: TraceAbstraction took 27099.27 ms. Allocated memory was 459.3 MB in the beginning and 829.4 MB in the end (delta: 370.1 MB). Free memory was 314.9 MB in the beginning and 322.7 MB in the end (delta: -7.8 MB). Peak memory consumption was 362.4 MB. Max. memory is 5.3 GB. [2018-07-22 05:55:29,155 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.21 ms. Allocated memory is still 297.8 MB. Free memory is still 260.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 723.75 ms. Allocated memory is still 297.8 MB. Free memory was 240.2 MB in the beginning and 206.1 MB in the end (delta: 34.1 MB). Peak memory consumption was 34.1 MB. Max. memory is 5.3 GB. * Boogie Procedure Inliner took 134.95 ms. Allocated memory is still 297.8 MB. Free memory was 206.1 MB in the beginning and 200.2 MB in the end (delta: 6.0 MB). Peak memory consumption was 6.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 100.86 ms. Allocated memory is still 297.8 MB. Free memory was 200.2 MB in the beginning and 196.2 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 3624.07 ms. Allocated memory was 297.8 MB in the beginning and 459.3 MB in the end (delta: 161.5 MB). Free memory was 196.2 MB in the beginning and 314.9 MB in the end (delta: -118.8 MB). Peak memory consumption was 59.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 27099.27 ms. Allocated memory was 459.3 MB in the beginning and 829.4 MB in the end (delta: 370.1 MB). Free memory was 314.9 MB in the beginning and 322.7 MB in the end (delta: -7.8 MB). Peak memory consumption was 362.4 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 527]: 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: 30]: Loop Invariant Derived loop invariant: (((((((((((((((((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7 == 1 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 == 8) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16 == 5) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1) || (((((!(input == 5) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 <= 0) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20 <= 0) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 == 8) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16 == 4) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1)) || ((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7 == 1 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20 == 1) && !(5 == __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16))) || (((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7 == 1 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 == 8) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16 == 4) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1)) || ((!(__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8 == 15) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20 == 1) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1)) || ((!(__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8 == 15) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == 1) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1)) || ((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7 == 1 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == 1) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16 == 4)) || (((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 == 8 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == 1) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16 == 4) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1)) || (((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20 == 1 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 == 8) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16 == 4) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1)) || (((!(__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8 == 15) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7 == 1) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16 == 5) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1)) || ((((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 == 8 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16 == 5) && ((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 <= 0 && ((input == 6 || input == 3) || input == 2)) || input == 1)) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8 == 15) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1)) || ((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8 == 14 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16 == 5) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1)) || ((!(__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8 == 15) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16 == 4)) || (((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 == 8 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16 == 5) && (((((!(__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7 == 1) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 == 8) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == 1) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8 == 15) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1) || __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20 == 1)) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1)) || ((((!(__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7 == 1) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 == 8) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8 == 15) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16 == 6) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1)) || ((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7 == 1 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == 1) && (((((!(__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7 == 1) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 == 8) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == 1) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8 == 15) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1) || __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20 == 1)) - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: (((((((((((((((((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7 == 1 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 == 8) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16 == 5) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1) || (((((!(input == 5) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 <= 0) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20 <= 0) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 == 8) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16 == 4) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1)) || ((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7 == 1 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20 == 1) && !(5 == __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16))) || (((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7 == 1 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 == 8) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16 == 4) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1)) || ((!(__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8 == 15) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20 == 1) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1)) || ((!(__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8 == 15) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == 1) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1)) || ((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7 == 1 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == 1) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16 == 4)) || (((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 == 8 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == 1) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16 == 4) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1)) || (((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20 == 1 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 == 8) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16 == 4) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1)) || (((!(__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8 == 15) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7 == 1) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16 == 5) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1)) || ((((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 == 8 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16 == 5) && ((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 <= 0 && ((input == 6 || input == 3) || input == 2)) || input == 1)) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8 == 15) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1)) || ((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8 == 14 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16 == 5) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1)) || ((!(__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8 == 15) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16 == 4)) || (((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 == 8 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16 == 5) && (((((!(__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7 == 1) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 == 8) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == 1) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8 == 15) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1) || __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20 == 1)) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1)) || ((((!(__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7 == 1) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 == 8) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8 == 15) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16 == 6) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1)) || ((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7 == 1 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == 1) && (((((!(__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7 == 1) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 == 8) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == 1) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8 == 15) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1) || __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20 == 1)) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 199 locations, 1 error locations. SAFE Result, 26.9s OverallTime, 12 OverallIterations, 6 TraceHistogramMax, 17.5s AutomataDifference, 0.0s DeadEndRemovalTime, 2.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 1051 SDtfs, 5613 SDslu, 705 SDs, 0 SdLazy, 12080 SolverSat, 1617 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 572 GetRequests, 502 SyntacticMatches, 9 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3257occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 12 MinimizatonAttempts, 1202 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 103 NumberOfFragments, 517 HoareAnnotationTreeSize, 3 FomulaSimplifications, 7350 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 3 FomulaSimplificationsInter, 522 FormulaSimplificationTreeSizeReductionInter, 2.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 2683 NumberOfCodeBlocks, 2683 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 2669 ConstructedInterpolants, 0 QuantifiedInterpolants, 2205003 SizeOfPredicates, 1 NumberOfNonLiveVariables, 763 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 14 InterpolantComputations, 12 PerfectInterpolantSequences, 1604/1774 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/Problem01_label45_true-unreach-call_false-termination.c_svcomp-Reach-64bit-Automizer_Default.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-07-22_05-55-29-187.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/Problem01_label45_true-unreach-call_false-termination.c_svcomp-Reach-64bit-Automizer_Default.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-22_05-55-29-187.csv Received shutdown request...