java -Xmx8000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --generate-csv --csv-dir csv -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem01_label28_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-dd2f093 [2018-07-24 01:20:07,264 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-24 01:20:07,266 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-24 01:20:07,278 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-24 01:20:07,278 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-24 01:20:07,279 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-24 01:20:07,281 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-24 01:20:07,282 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-24 01:20:07,284 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-24 01:20:07,285 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-24 01:20:07,286 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-24 01:20:07,286 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-24 01:20:07,287 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-24 01:20:07,288 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-24 01:20:07,289 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-24 01:20:07,290 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-24 01:20:07,291 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-24 01:20:07,293 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-24 01:20:07,295 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-24 01:20:07,296 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-24 01:20:07,298 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-24 01:20:07,299 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-24 01:20:07,301 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-24 01:20:07,301 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-24 01:20:07,302 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-24 01:20:07,302 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-24 01:20:07,303 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-24 01:20:07,304 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-24 01:20:07,305 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-24 01:20:07,306 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-24 01:20:07,307 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-24 01:20:07,307 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-24 01:20:07,308 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-24 01:20:07,308 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-24 01:20:07,309 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-24 01:20:07,310 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-24 01:20:07,310 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-07-24 01:20:07,336 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-24 01:20:07,336 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-24 01:20:07,337 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-07-24 01:20:07,338 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-07-24 01:20:07,338 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-07-24 01:20:07,339 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-07-24 01:20:07,339 INFO L133 SettingsManager]: * Use SBE=true [2018-07-24 01:20:07,340 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-07-24 01:20:07,340 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-07-24 01:20:07,340 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-07-24 01:20:07,340 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-07-24 01:20:07,341 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-07-24 01:20:07,341 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-07-24 01:20:07,341 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-07-24 01:20:07,341 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-07-24 01:20:07,341 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-24 01:20:07,342 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-07-24 01:20:07,342 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-07-24 01:20:07,342 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-07-24 01:20:07,342 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-07-24 01:20:07,342 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-24 01:20:07,342 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-07-24 01:20:07,343 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-07-24 01:20:07,343 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-07-24 01:20:07,343 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-07-24 01:20:07,344 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-07-24 01:20:07,345 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-24 01:20:07,345 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-07-24 01:20:07,407 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-24 01:20:07,419 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-24 01:20:07,423 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-24 01:20:07,425 INFO L271 PluginConnector]: Initializing CDTParser... [2018-07-24 01:20:07,425 INFO L276 PluginConnector]: CDTParser initialized [2018-07-24 01:20:07,426 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label28_true-unreach-call_false-termination.c [2018-07-24 01:20:07,774 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5168b8cf9/3ff2bfe6d4f04e59a10c99acd64263b7/FLAG06be06a50 [2018-07-24 01:20:08,023 INFO L276 CDTParser]: Found 1 translation units. [2018-07-24 01:20:08,024 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label28_true-unreach-call_false-termination.c [2018-07-24 01:20:08,051 INFO L324 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5168b8cf9/3ff2bfe6d4f04e59a10c99acd64263b7/FLAG06be06a50 [2018-07-24 01:20:08,067 INFO L332 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5168b8cf9/3ff2bfe6d4f04e59a10c99acd64263b7 [2018-07-24 01:20:08,076 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-24 01:20:08,077 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-07-24 01:20:08,078 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-07-24 01:20:08,079 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-07-24 01:20:08,086 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-07-24 01:20:08,087 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.07 01:20:08" (1/1) ... [2018-07-24 01:20:08,090 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53ac8a7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:20:08, skipping insertion in model container [2018-07-24 01:20:08,090 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.07 01:20:08" (1/1) ... [2018-07-24 01:20:08,351 INFO L179 PRDispatcher]: Starting pre-run dispatcher in SV-COMP mode [2018-07-24 01:20:08,626 INFO L175 PostProcessor]: Settings: Checked method=main [2018-07-24 01:20:08,645 INFO L422 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-07-24 01:20:08,808 INFO L175 PostProcessor]: Settings: Checked method=main [2018-07-24 01:20:08,844 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:20:08 WrapperNode [2018-07-24 01:20:08,844 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-07-24 01:20:08,845 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-07-24 01:20:08,845 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-07-24 01:20:08,845 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-07-24 01:20:08,855 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:20:08" (1/1) ... [2018-07-24 01:20:08,875 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:20:08" (1/1) ... [2018-07-24 01:20:08,953 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-07-24 01:20:08,953 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-24 01:20:08,954 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-24 01:20:08,954 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-24 01:20:08,969 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:20:08" (1/1) ... [2018-07-24 01:20:08,969 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:20:08" (1/1) ... [2018-07-24 01:20:08,981 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:20:08" (1/1) ... [2018-07-24 01:20:08,985 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:20:08" (1/1) ... [2018-07-24 01:20:09,023 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:20:08" (1/1) ... [2018-07-24 01:20:09,055 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:20:08" (1/1) ... [2018-07-24 01:20:09,059 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:20:08" (1/1) ... [2018-07-24 01:20:09,069 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-24 01:20:09,070 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-24 01:20:09,070 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-24 01:20:09,070 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-24 01:20:09,071 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:20:08" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-07-24 01:20:09,284 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-07-24 01:20:09,284 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-07-24 01:20:09,284 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-07-24 01:20:12,536 INFO L261 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-07-24 01:20:12,537 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.07 01:20:12 BoogieIcfgContainer [2018-07-24 01:20:12,537 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-24 01:20:12,539 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-24 01:20:12,539 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-24 01:20:12,541 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-24 01:20:12,542 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.07 01:20:08" (1/3) ... [2018-07-24 01:20:12,542 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39b9c46e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.07 01:20:12, skipping insertion in model container [2018-07-24 01:20:12,543 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:20:08" (2/3) ... [2018-07-24 01:20:12,543 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39b9c46e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.07 01:20:12, skipping insertion in model container [2018-07-24 01:20:12,543 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.07 01:20:12" (3/3) ... [2018-07-24 01:20:12,545 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label28_true-unreach-call_false-termination.c [2018-07-24 01:20:12,553 INFO L132 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-07-24 01:20:12,561 INFO L144 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-24 01:20:12,610 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-24 01:20:12,611 INFO L373 AbstractCegarLoop]: Interprodecural is true [2018-07-24 01:20:12,611 INFO L374 AbstractCegarLoop]: Hoare is true [2018-07-24 01:20:12,611 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-07-24 01:20:12,612 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-07-24 01:20:12,612 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-24 01:20:12,612 INFO L378 AbstractCegarLoop]: Difference is false [2018-07-24 01:20:12,612 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-24 01:20:12,612 INFO L384 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-24 01:20:12,635 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states. [2018-07-24 01:20:12,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-07-24 01:20:12,646 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:20:12,647 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 01:20:12,648 INFO L414 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:20:12,652 INFO L82 PathProgramCache]: Analyzing trace with hash -1630454777, now seen corresponding path program 1 times [2018-07-24 01:20:12,654 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:20:12,655 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:20:12,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:20:12,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:20:12,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:20:12,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:20:13,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 01:20:13,324 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:20:13,325 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-24 01:20:13,330 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-24 01:20:13,349 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-24 01:20:13,350 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 01:20:13,353 INFO L87 Difference]: Start difference. First operand 199 states. Second operand 4 states. [2018-07-24 01:20:15,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:20:15,656 INFO L93 Difference]: Finished difference Result 666 states and 1182 transitions. [2018-07-24 01:20:15,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-24 01:20:15,659 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2018-07-24 01:20:15,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:20:15,680 INFO L225 Difference]: With dead ends: 666 [2018-07-24 01:20:15,680 INFO L226 Difference]: Without dead ends: 460 [2018-07-24 01:20:15,685 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 01:20:15,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2018-07-24 01:20:15,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 460. [2018-07-24 01:20:15,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2018-07-24 01:20:15,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 743 transitions. [2018-07-24 01:20:15,758 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 743 transitions. Word has length 94 [2018-07-24 01:20:15,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:20:15,759 INFO L471 AbstractCegarLoop]: Abstraction has 460 states and 743 transitions. [2018-07-24 01:20:15,759 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-24 01:20:15,759 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 743 transitions. [2018-07-24 01:20:15,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-07-24 01:20:15,765 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:20:15,765 INFO L353 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] [2018-07-24 01:20:15,765 INFO L414 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:20:15,766 INFO L82 PathProgramCache]: Analyzing trace with hash -2039531712, now seen corresponding path program 1 times [2018-07-24 01:20:15,766 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:20:15,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:20:15,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:20:15,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:20:15,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:20:15,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:20:15,878 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-24 01:20:15,878 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:20:15,878 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-24 01:20:15,881 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-24 01:20:15,882 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-24 01:20:15,882 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 01:20:15,882 INFO L87 Difference]: Start difference. First operand 460 states and 743 transitions. Second operand 3 states. [2018-07-24 01:20:17,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:20:17,211 INFO L93 Difference]: Finished difference Result 1314 states and 2164 transitions. [2018-07-24 01:20:17,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-24 01:20:17,212 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2018-07-24 01:20:17,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:20:17,219 INFO L225 Difference]: With dead ends: 1314 [2018-07-24 01:20:17,219 INFO L226 Difference]: Without dead ends: 856 [2018-07-24 01:20:17,222 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 01:20:17,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2018-07-24 01:20:17,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 856. [2018-07-24 01:20:17,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 856 states. [2018-07-24 01:20:17,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1375 transitions. [2018-07-24 01:20:17,291 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1375 transitions. Word has length 100 [2018-07-24 01:20:17,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:20:17,292 INFO L471 AbstractCegarLoop]: Abstraction has 856 states and 1375 transitions. [2018-07-24 01:20:17,292 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-24 01:20:17,292 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1375 transitions. [2018-07-24 01:20:17,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-07-24 01:20:17,298 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:20:17,298 INFO L353 BasicCegarLoop]: trace histogram [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] [2018-07-24 01:20:17,298 INFO L414 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:20:17,299 INFO L82 PathProgramCache]: Analyzing trace with hash 2057736711, now seen corresponding path program 1 times [2018-07-24 01:20:17,299 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:20:17,299 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:20:17,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:20:17,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:20:17,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:20:17,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:20:17,472 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 01:20:17,472 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:20:17,473 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-24 01:20:17,473 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-24 01:20:17,474 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-24 01:20:17,474 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-24 01:20:17,474 INFO L87 Difference]: Start difference. First operand 856 states and 1375 transitions. Second operand 4 states. [2018-07-24 01:20:19,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:20:19,911 INFO L93 Difference]: Finished difference Result 2009 states and 3174 transitions. [2018-07-24 01:20:19,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-24 01:20:19,914 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2018-07-24 01:20:19,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:20:19,920 INFO L225 Difference]: With dead ends: 2009 [2018-07-24 01:20:19,920 INFO L226 Difference]: Without dead ends: 1155 [2018-07-24 01:20:19,922 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-07-24 01:20:19,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1155 states. [2018-07-24 01:20:19,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1155 to 1125. [2018-07-24 01:20:19,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1125 states. [2018-07-24 01:20:19,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 1125 states and 1686 transitions. [2018-07-24 01:20:19,955 INFO L78 Accepts]: Start accepts. Automaton has 1125 states and 1686 transitions. Word has length 110 [2018-07-24 01:20:19,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:20:19,956 INFO L471 AbstractCegarLoop]: Abstraction has 1125 states and 1686 transitions. [2018-07-24 01:20:19,956 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-24 01:20:19,956 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 1686 transitions. [2018-07-24 01:20:19,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-07-24 01:20:19,960 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:20:19,960 INFO L353 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2018-07-24 01:20:19,961 INFO L414 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:20:19,961 INFO L82 PathProgramCache]: Analyzing trace with hash 176836447, now seen corresponding path program 1 times [2018-07-24 01:20:19,961 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:20:19,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:20:19,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:20:19,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:20:19,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:20:19,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:20:20,303 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 01:20:20,304 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:20:20,304 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-24 01:20:20,305 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-24 01:20:20,305 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-24 01:20:20,305 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-07-24 01:20:20,305 INFO L87 Difference]: Start difference. First operand 1125 states and 1686 transitions. Second operand 5 states. [2018-07-24 01:20:22,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:20:22,667 INFO L93 Difference]: Finished difference Result 2879 states and 4366 transitions. [2018-07-24 01:20:22,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-24 01:20:22,669 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 115 [2018-07-24 01:20:22,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:20:22,680 INFO L225 Difference]: With dead ends: 2879 [2018-07-24 01:20:22,680 INFO L226 Difference]: Without dead ends: 1756 [2018-07-24 01:20:22,683 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-07-24 01:20:22,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1756 states. [2018-07-24 01:20:22,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1756 to 1738. [2018-07-24 01:20:22,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1738 states. [2018-07-24 01:20:22,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2454 transitions. [2018-07-24 01:20:22,725 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2454 transitions. Word has length 115 [2018-07-24 01:20:22,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:20:22,725 INFO L471 AbstractCegarLoop]: Abstraction has 1738 states and 2454 transitions. [2018-07-24 01:20:22,725 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-24 01:20:22,725 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2454 transitions. [2018-07-24 01:20:22,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-07-24 01:20:22,729 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:20:22,730 INFO L353 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2018-07-24 01:20:22,730 INFO L414 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:20:22,730 INFO L82 PathProgramCache]: Analyzing trace with hash 1844441755, now seen corresponding path program 1 times [2018-07-24 01:20:22,730 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:20:22,730 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:20:22,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:20:22,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:20:22,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:20:22,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:20:22,850 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 01:20:22,850 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:20:22,851 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-24 01:20:22,851 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-24 01:20:22,852 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-24 01:20:22,853 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 01:20:22,853 INFO L87 Difference]: Start difference. First operand 1738 states and 2454 transitions. Second operand 3 states. [2018-07-24 01:20:23,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:20:23,918 INFO L93 Difference]: Finished difference Result 4389 states and 6168 transitions. [2018-07-24 01:20:23,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-24 01:20:23,918 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 118 [2018-07-24 01:20:23,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:20:23,929 INFO L225 Difference]: With dead ends: 4389 [2018-07-24 01:20:23,929 INFO L226 Difference]: Without dead ends: 2002 [2018-07-24 01:20:23,933 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 01:20:23,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2002 states. [2018-07-24 01:20:23,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2002 to 1972. [2018-07-24 01:20:23,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1972 states. [2018-07-24 01:20:23,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1972 states to 1972 states and 2407 transitions. [2018-07-24 01:20:23,972 INFO L78 Accepts]: Start accepts. Automaton has 1972 states and 2407 transitions. Word has length 118 [2018-07-24 01:20:23,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:20:23,972 INFO L471 AbstractCegarLoop]: Abstraction has 1972 states and 2407 transitions. [2018-07-24 01:20:23,972 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-24 01:20:23,972 INFO L276 IsEmpty]: Start isEmpty. Operand 1972 states and 2407 transitions. [2018-07-24 01:20:23,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-07-24 01:20:23,976 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:20:23,976 INFO L353 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 01:20:23,977 INFO L414 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:20:23,977 INFO L82 PathProgramCache]: Analyzing trace with hash 1325271489, now seen corresponding path program 1 times [2018-07-24 01:20:23,977 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:20:23,977 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:20:23,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:20:23,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:20:23,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:20:23,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:20:24,196 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-07-24 01:20:24,196 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:20:24,197 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-24 01:20:24,197 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-24 01:20:24,198 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-24 01:20:24,199 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 01:20:24,199 INFO L87 Difference]: Start difference. First operand 1972 states and 2407 transitions. Second operand 4 states. [2018-07-24 01:20:25,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:20:25,416 INFO L93 Difference]: Finished difference Result 3810 states and 4674 transitions. [2018-07-24 01:20:25,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-24 01:20:25,416 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 127 [2018-07-24 01:20:25,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:20:25,424 INFO L225 Difference]: With dead ends: 3810 [2018-07-24 01:20:25,424 INFO L226 Difference]: Without dead ends: 1649 [2018-07-24 01:20:25,428 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 01:20:25,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1649 states. [2018-07-24 01:20:25,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1649 to 1517. [2018-07-24 01:20:25,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1517 states. [2018-07-24 01:20:25,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1517 states to 1517 states and 1748 transitions. [2018-07-24 01:20:25,459 INFO L78 Accepts]: Start accepts. Automaton has 1517 states and 1748 transitions. Word has length 127 [2018-07-24 01:20:25,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:20:25,459 INFO L471 AbstractCegarLoop]: Abstraction has 1517 states and 1748 transitions. [2018-07-24 01:20:25,459 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-24 01:20:25,459 INFO L276 IsEmpty]: Start isEmpty. Operand 1517 states and 1748 transitions. [2018-07-24 01:20:25,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-07-24 01:20:25,462 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:20:25,463 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 01:20:25,463 INFO L414 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:20:25,463 INFO L82 PathProgramCache]: Analyzing trace with hash -1421267728, now seen corresponding path program 1 times [2018-07-24 01:20:25,463 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:20:25,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:20:25,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:20:25,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:20:25,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:20:25,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:20:25,757 WARN L169 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-07-24 01:20:25,984 WARN L169 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-07-24 01:20:26,702 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 01:20:26,702 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:20:26,702 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-07-24 01:20:26,703 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-24 01:20:26,703 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-24 01:20:26,703 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=77, Unknown=0, NotChecked=0, Total=132 [2018-07-24 01:20:26,704 INFO L87 Difference]: Start difference. First operand 1517 states and 1748 transitions. Second operand 12 states. [2018-07-24 01:20:30,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:20:30,977 INFO L93 Difference]: Finished difference Result 3410 states and 3997 transitions. [2018-07-24 01:20:30,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-07-24 01:20:30,977 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 132 [2018-07-24 01:20:30,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:20:30,986 INFO L225 Difference]: With dead ends: 3410 [2018-07-24 01:20:30,987 INFO L226 Difference]: Without dead ends: 1993 [2018-07-24 01:20:30,989 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=115, Invalid=157, Unknown=0, NotChecked=0, Total=272 [2018-07-24 01:20:30,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1993 states. [2018-07-24 01:20:31,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1993 to 1949. [2018-07-24 01:20:31,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1949 states. [2018-07-24 01:20:31,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1949 states to 1949 states and 2207 transitions. [2018-07-24 01:20:31,027 INFO L78 Accepts]: Start accepts. Automaton has 1949 states and 2207 transitions. Word has length 132 [2018-07-24 01:20:31,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:20:31,027 INFO L471 AbstractCegarLoop]: Abstraction has 1949 states and 2207 transitions. [2018-07-24 01:20:31,027 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-24 01:20:31,027 INFO L276 IsEmpty]: Start isEmpty. Operand 1949 states and 2207 transitions. [2018-07-24 01:20:31,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-07-24 01:20:31,032 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:20:31,032 INFO L353 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2018-07-24 01:20:31,033 INFO L414 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:20:31,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1664526263, now seen corresponding path program 1 times [2018-07-24 01:20:31,033 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:20:31,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:20:31,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:20:31,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:20:31,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:20:31,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:20:31,538 WARN L169 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 8 [2018-07-24 01:20:31,565 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 182 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-07-24 01:20:31,565 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:20:31,565 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-24 01:20:31,566 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-24 01:20:31,566 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-24 01:20:31,566 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 01:20:31,567 INFO L87 Difference]: Start difference. First operand 1949 states and 2207 transitions. Second operand 4 states. [2018-07-24 01:20:33,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:20:33,309 INFO L93 Difference]: Finished difference Result 4032 states and 4606 transitions. [2018-07-24 01:20:33,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-24 01:20:33,309 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 206 [2018-07-24 01:20:33,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:20:33,317 INFO L225 Difference]: With dead ends: 4032 [2018-07-24 01:20:33,318 INFO L226 Difference]: Without dead ends: 2217 [2018-07-24 01:20:33,320 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 01:20:33,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2217 states. [2018-07-24 01:20:33,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2217 to 2081. [2018-07-24 01:20:33,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2081 states. [2018-07-24 01:20:33,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2081 states to 2081 states and 2303 transitions. [2018-07-24 01:20:33,359 INFO L78 Accepts]: Start accepts. Automaton has 2081 states and 2303 transitions. Word has length 206 [2018-07-24 01:20:33,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:20:33,359 INFO L471 AbstractCegarLoop]: Abstraction has 2081 states and 2303 transitions. [2018-07-24 01:20:33,359 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-24 01:20:33,359 INFO L276 IsEmpty]: Start isEmpty. Operand 2081 states and 2303 transitions. [2018-07-24 01:20:33,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-07-24 01:20:33,366 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:20:33,366 INFO L353 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 01:20:33,367 INFO L414 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:20:33,367 INFO L82 PathProgramCache]: Analyzing trace with hash -1665803384, now seen corresponding path program 1 times [2018-07-24 01:20:33,367 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:20:33,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:20:33,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:20:33,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:20:33,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:20:33,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:20:33,590 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2018-07-24 01:20:33,590 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:20:33,590 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-24 01:20:33,591 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-24 01:20:33,591 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-24 01:20:33,591 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 01:20:33,591 INFO L87 Difference]: Start difference. First operand 2081 states and 2303 transitions. Second operand 4 states. [2018-07-24 01:20:34,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:20:34,815 INFO L93 Difference]: Finished difference Result 4958 states and 5520 transitions. [2018-07-24 01:20:34,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-24 01:20:34,816 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 212 [2018-07-24 01:20:34,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:20:34,826 INFO L225 Difference]: With dead ends: 4958 [2018-07-24 01:20:34,826 INFO L226 Difference]: Without dead ends: 3011 [2018-07-24 01:20:34,828 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 01:20:34,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3011 states. [2018-07-24 01:20:34,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3011 to 2609. [2018-07-24 01:20:34,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2609 states. [2018-07-24 01:20:34,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2609 states to 2609 states and 2863 transitions. [2018-07-24 01:20:34,873 INFO L78 Accepts]: Start accepts. Automaton has 2609 states and 2863 transitions. Word has length 212 [2018-07-24 01:20:34,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:20:34,873 INFO L471 AbstractCegarLoop]: Abstraction has 2609 states and 2863 transitions. [2018-07-24 01:20:34,873 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-24 01:20:34,873 INFO L276 IsEmpty]: Start isEmpty. Operand 2609 states and 2863 transitions. [2018-07-24 01:20:34,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-07-24 01:20:34,878 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:20:34,879 INFO L353 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 01:20:34,879 INFO L414 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:20:34,879 INFO L82 PathProgramCache]: Analyzing trace with hash 768711416, now seen corresponding path program 1 times [2018-07-24 01:20:34,879 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:20:34,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:20:34,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:20:34,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:20:34,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:20:34,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:20:35,136 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 126 proven. 5 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-07-24 01:20:35,137 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 01:20:35,137 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-24 01:20:35,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:20:35,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:20:35,287 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 01:20:35,467 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2018-07-24 01:20:35,501 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-07-24 01:20:35,501 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2018-07-24 01:20:35,502 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-24 01:20:35,502 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-24 01:20:35,502 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-07-24 01:20:35,502 INFO L87 Difference]: Start difference. First operand 2609 states and 2863 transitions. Second operand 5 states. [2018-07-24 01:20:39,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:20:39,247 INFO L93 Difference]: Finished difference Result 6148 states and 6785 transitions. [2018-07-24 01:20:39,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-24 01:20:39,248 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 212 [2018-07-24 01:20:39,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:20:39,263 INFO L225 Difference]: With dead ends: 6148 [2018-07-24 01:20:39,263 INFO L226 Difference]: Without dead ends: 3538 [2018-07-24 01:20:39,267 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-07-24 01:20:39,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3538 states. [2018-07-24 01:20:39,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3538 to 2703. [2018-07-24 01:20:39,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2703 states. [2018-07-24 01:20:39,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2703 states to 2703 states and 2927 transitions. [2018-07-24 01:20:39,319 INFO L78 Accepts]: Start accepts. Automaton has 2703 states and 2927 transitions. Word has length 212 [2018-07-24 01:20:39,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:20:39,319 INFO L471 AbstractCegarLoop]: Abstraction has 2703 states and 2927 transitions. [2018-07-24 01:20:39,319 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-24 01:20:39,319 INFO L276 IsEmpty]: Start isEmpty. Operand 2703 states and 2927 transitions. [2018-07-24 01:20:39,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2018-07-24 01:20:39,326 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:20:39,327 INFO L353 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2018-07-24 01:20:39,327 INFO L414 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:20:39,327 INFO L82 PathProgramCache]: Analyzing trace with hash -1298101107, now seen corresponding path program 1 times [2018-07-24 01:20:39,327 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:20:39,328 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:20:39,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:20:39,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:20:39,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:20:39,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:20:39,836 WARN L169 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-07-24 01:20:40,486 WARN L169 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 29 [2018-07-24 01:20:40,814 INFO L134 CoverageAnalysis]: Checked inductivity of 488 backedges. 364 proven. 10 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2018-07-24 01:20:40,814 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 01:20:40,814 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-24 01:20:40,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:20:40,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:20:40,960 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 01:20:41,047 INFO L134 CoverageAnalysis]: Checked inductivity of 488 backedges. 303 proven. 0 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2018-07-24 01:20:41,069 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-07-24 01:20:41,069 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 14 [2018-07-24 01:20:41,070 INFO L450 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-24 01:20:41,071 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-24 01:20:41,071 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2018-07-24 01:20:41,071 INFO L87 Difference]: Start difference. First operand 2703 states and 2927 transitions. Second operand 14 states. [2018-07-24 01:20:43,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:20:43,212 INFO L93 Difference]: Finished difference Result 5053 states and 5488 transitions. [2018-07-24 01:20:43,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-24 01:20:43,213 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 290 [2018-07-24 01:20:43,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:20:43,242 INFO L225 Difference]: With dead ends: 5053 [2018-07-24 01:20:43,242 INFO L226 Difference]: Without dead ends: 0 [2018-07-24 01:20:43,245 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 290 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=146, Invalid=234, Unknown=0, NotChecked=0, Total=380 [2018-07-24 01:20:43,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-07-24 01:20:43,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-07-24 01:20:43,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-07-24 01:20:43,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-07-24 01:20:43,246 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 290 [2018-07-24 01:20:43,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:20:43,246 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-07-24 01:20:43,246 INFO L472 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-24 01:20:43,246 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-07-24 01:20:43,247 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-07-24 01:20:43,251 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-07-24 01:20:43,306 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 01:20:43,320 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 01:20:43,339 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 01:20:43,381 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 01:20:43,394 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 01:20:43,407 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 01:20:44,486 WARN L169 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 74 DAG size of output: 55 [2018-07-24 01:20:45,068 WARN L169 SmtUtils]: Spent 579.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 55 [2018-07-24 01:20:45,073 INFO L421 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2018-07-24 01:20:45,073 INFO L421 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2018-07-24 01:20:45,073 INFO L421 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2018-07-24 01:20:45,073 INFO L421 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2018-07-24 01:20:45,073 INFO L421 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2018-07-24 01:20:45,073 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-07-24 01:20:45,073 INFO L421 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2018-07-24 01:20:45,073 INFO L421 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2018-07-24 01:20:45,073 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-07-24 01:20:45,074 INFO L421 ceAbstractionStarter]: For program point L502(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:45,074 INFO L421 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2018-07-24 01:20:45,074 INFO L421 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2018-07-24 01:20:45,074 INFO L421 ceAbstractionStarter]: For program point L505(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:45,074 INFO L421 ceAbstractionStarter]: For program point L391'(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:45,074 INFO L421 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2018-07-24 01:20:45,074 INFO L421 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2018-07-24 01:20:45,074 INFO L421 ceAbstractionStarter]: For program point L508(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:45,074 INFO L421 ceAbstractionStarter]: For program point L520(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:45,074 INFO L421 ceAbstractionStarter]: For program point L403(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:45,074 INFO L421 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2018-07-24 01:20:45,074 INFO L421 ceAbstractionStarter]: For program point L523(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:45,074 INFO L421 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2018-07-24 01:20:45,075 INFO L421 ceAbstractionStarter]: For program point L400(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:45,075 INFO L421 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2018-07-24 01:20:45,075 INFO L421 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2018-07-24 01:20:45,075 INFO L421 ceAbstractionStarter]: For program point L406(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:45,075 INFO L421 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2018-07-24 01:20:45,075 INFO L421 ceAbstractionStarter]: For program point L526(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:45,075 INFO L421 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2018-07-24 01:20:45,075 INFO L421 ceAbstractionStarter]: For program point L409(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:45,076 INFO L421 ceAbstractionStarter]: For program point L529(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:45,076 INFO L421 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2018-07-24 01:20:45,076 INFO L421 ceAbstractionStarter]: For program point L511(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:45,076 INFO L421 ceAbstractionStarter]: For program point L517(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:45,076 INFO L421 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2018-07-24 01:20:45,077 INFO L421 ceAbstractionStarter]: For program point L514(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:45,077 INFO L421 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2018-07-24 01:20:45,077 INFO L421 ceAbstractionStarter]: For program point L421(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:45,077 INFO L421 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-07-24 01:20:45,077 INFO L421 ceAbstractionStarter]: For program point L541(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:45,077 INFO L421 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2018-07-24 01:20:45,077 INFO L421 ceAbstractionStarter]: For program point L424(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:45,077 INFO L421 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-07-24 01:20:45,078 INFO L421 ceAbstractionStarter]: For program point L544(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:45,078 INFO L421 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2018-07-24 01:20:45,078 INFO L421 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2018-07-24 01:20:45,078 INFO L421 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2018-07-24 01:20:45,078 INFO L421 ceAbstractionStarter]: For program point L427(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:45,078 INFO L421 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-07-24 01:20:45,078 INFO L421 ceAbstractionStarter]: For program point L547(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:45,078 INFO L421 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2018-07-24 01:20:45,079 INFO L421 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2018-07-24 01:20:45,079 INFO L421 ceAbstractionStarter]: For program point L535(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:45,079 INFO L421 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2018-07-24 01:20:45,079 INFO L421 ceAbstractionStarter]: For program point L412(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:45,079 INFO L421 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2018-07-24 01:20:45,079 INFO L421 ceAbstractionStarter]: For program point L532(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:45,079 INFO L421 ceAbstractionStarter]: For program point L418(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:45,079 INFO L421 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2018-07-24 01:20:45,079 INFO L421 ceAbstractionStarter]: For program point L538(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:45,080 INFO L421 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2018-07-24 01:20:45,080 INFO L421 ceAbstractionStarter]: For program point L415(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:45,080 INFO L421 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2018-07-24 01:20:45,080 INFO L421 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2018-07-24 01:20:45,080 INFO L421 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-07-24 01:20:45,080 INFO L421 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2018-07-24 01:20:45,080 INFO L421 ceAbstractionStarter]: For program point L442(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:45,080 INFO L421 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2018-07-24 01:20:45,081 INFO L421 ceAbstractionStarter]: For program point L562(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:45,081 INFO L421 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2018-07-24 01:20:45,081 INFO L421 ceAbstractionStarter]: For program point L568(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:45,081 INFO L421 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2018-07-24 01:20:45,081 INFO L421 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2018-07-24 01:20:45,081 INFO L421 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2018-07-24 01:20:45,081 INFO L421 ceAbstractionStarter]: For program point L445(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:45,081 INFO L421 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2018-07-24 01:20:45,082 INFO L421 ceAbstractionStarter]: For program point L565(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:45,082 INFO L421 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2018-07-24 01:20:45,082 INFO L421 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2018-07-24 01:20:45,082 INFO L421 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2018-07-24 01:20:45,082 INFO L421 ceAbstractionStarter]: For program point L448(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:45,082 INFO L421 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-07-24 01:20:45,082 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-07-24 01:20:45,082 INFO L421 ceAbstractionStarter]: For program point L553(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:45,082 INFO L421 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2018-07-24 01:20:45,083 INFO L421 ceAbstractionStarter]: For program point L430(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:45,083 INFO L421 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-07-24 01:20:45,083 INFO L421 ceAbstractionStarter]: For program point L550(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:45,083 INFO L421 ceAbstractionStarter]: For program point L436(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:45,083 INFO L421 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-07-24 01:20:45,083 INFO L421 ceAbstractionStarter]: For program point L556(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:45,083 INFO L421 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2018-07-24 01:20:45,083 INFO L421 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2018-07-24 01:20:45,083 INFO L421 ceAbstractionStarter]: For program point L433(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:45,083 INFO L421 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-07-24 01:20:45,083 INFO L421 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2018-07-24 01:20:45,084 INFO L421 ceAbstractionStarter]: For program point L439(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:45,084 INFO L421 ceAbstractionStarter]: For program point L559(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:45,084 INFO L421 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2018-07-24 01:20:45,084 INFO L421 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2018-07-24 01:20:45,084 INFO L421 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2018-07-24 01:20:45,084 INFO L421 ceAbstractionStarter]: For program point L460(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:45,084 INFO L421 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2018-07-24 01:20:45,084 INFO L421 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2018-07-24 01:20:45,085 INFO L421 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2018-07-24 01:20:45,085 INFO L421 ceAbstractionStarter]: For program point L463(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:45,085 INFO L421 ceAbstractionStarter]: For program point L583(lines 583 593) no Hoare annotation was computed. [2018-07-24 01:20:45,085 INFO L421 ceAbstractionStarter]: For program point L469(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:45,085 INFO L421 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2018-07-24 01:20:45,085 INFO L421 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2018-07-24 01:20:45,085 INFO L421 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2018-07-24 01:20:45,085 INFO L421 ceAbstractionStarter]: For program point L466(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:45,086 INFO L421 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2018-07-24 01:20:45,086 INFO L421 ceAbstractionStarter]: For program point L571(lines 571 573) no Hoare annotation was computed. [2018-07-24 01:20:45,086 INFO L421 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2018-07-24 01:20:45,086 INFO L417 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse7 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0 6)) (.cse14 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20~0 1))) (let ((.cse3 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8~0 15)) (.cse8 (= ULTIMATE.start___U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_output_~input 6)) (.cse9 (= 1 ULTIMATE.start___U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_output_~input)) (.cse10 (= 5 ULTIMATE.start___U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_output_~input)) (.cse11 (= ULTIMATE.start___U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_output_~input 2)) (.cse12 (= ULTIMATE.start___U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_output_~input 4)) (.cse1 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7~0 0)) (.cse6 (not .cse14)) (.cse13 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0 1)) (.cse2 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 1)) (.cse0 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0 8)) (.cse4 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7~0 1)) (.cse15 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 0)) (.cse5 (not .cse7)) (.cse16 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8~0 13))) (or (and .cse0 .cse1 (and (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0 4) .cse2)) (and .cse3 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0 5) .cse0 .cse1 .cse2) (and .cse4 .cse5 .cse2) (and .cse4 .cse6 .cse2) (and .cse1 (and .cse3 .cse7 .cse0 (or (= 3 ULTIMATE.start___U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_output_~input) .cse8 .cse9 .cse10 .cse11 .cse12) .cse2)) (and .cse0 .cse1 .cse13 .cse2) (and (or .cse8 .cse9 .cse10 .cse11 .cse12) .cse14 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0 0) .cse4 .cse0 .cse15 .cse16) (and .cse0 (and .cse1 .cse6 .cse2)) (and .cse4 .cse13 .cse2) (and .cse0 .cse4 .cse15 .cse5 .cse16)))) [2018-07-24 01:20:45,086 INFO L421 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2018-07-24 01:20:45,087 INFO L421 ceAbstractionStarter]: For program point L451(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:45,087 INFO L421 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2018-07-24 01:20:45,087 INFO L421 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2018-07-24 01:20:45,087 INFO L421 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2018-07-24 01:20:45,087 INFO L421 ceAbstractionStarter]: For program point L457(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:45,087 INFO L421 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2018-07-24 01:20:45,087 INFO L424 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2018-07-24 01:20:45,087 INFO L421 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2018-07-24 01:20:45,088 INFO L421 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2018-07-24 01:20:45,088 INFO L421 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2018-07-24 01:20:45,088 INFO L421 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2018-07-24 01:20:45,088 INFO L421 ceAbstractionStarter]: For program point L481(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:45,088 INFO L421 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2018-07-24 01:20:45,088 INFO L421 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2018-07-24 01:20:45,088 INFO L421 ceAbstractionStarter]: For program point L487(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:45,088 INFO L421 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2018-07-24 01:20:45,088 INFO L421 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2018-07-24 01:20:45,088 INFO L421 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2018-07-24 01:20:45,088 INFO L421 ceAbstractionStarter]: For program point L484(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:45,089 INFO L421 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2018-07-24 01:20:45,089 INFO L421 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2018-07-24 01:20:45,089 INFO L421 ceAbstractionStarter]: For program point L490(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:45,089 INFO L421 ceAbstractionStarter]: For program point L472(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:45,089 INFO L421 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2018-07-24 01:20:45,089 INFO L421 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2018-07-24 01:20:45,089 INFO L421 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2018-07-24 01:20:45,089 INFO L421 ceAbstractionStarter]: For program point L475(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:45,089 INFO L421 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2018-07-24 01:20:45,089 INFO L421 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2018-07-24 01:20:45,089 INFO L421 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2018-07-24 01:20:45,089 INFO L421 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2018-07-24 01:20:45,089 INFO L421 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2018-07-24 01:20:45,089 INFO L421 ceAbstractionStarter]: For program point L478(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:45,090 INFO L421 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2018-07-24 01:20:45,090 INFO L421 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2018-07-24 01:20:45,090 INFO L421 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2018-07-24 01:20:45,090 INFO L421 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2018-07-24 01:20:45,090 INFO L421 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2018-07-24 01:20:45,090 INFO L421 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2018-07-24 01:20:45,090 INFO L421 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2018-07-24 01:20:45,090 INFO L421 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2018-07-24 01:20:45,090 INFO L421 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2018-07-24 01:20:45,090 INFO L421 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2018-07-24 01:20:45,090 INFO L421 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2018-07-24 01:20:45,090 INFO L421 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2018-07-24 01:20:45,090 INFO L421 ceAbstractionStarter]: For program point L493(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:45,090 INFO L421 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2018-07-24 01:20:45,091 INFO L421 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2018-07-24 01:20:45,091 INFO L421 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2018-07-24 01:20:45,091 INFO L421 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2018-07-24 01:20:45,091 INFO L421 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2018-07-24 01:20:45,091 INFO L421 ceAbstractionStarter]: For program point L496(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:45,091 INFO L421 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2018-07-24 01:20:45,091 INFO L421 ceAbstractionStarter]: For program point L499(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:45,091 INFO L417 ceAbstractionStarter]: At program point L583''(lines 583 593) the Hoare annotation is: (let ((.cse7 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0 6)) (.cse14 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20~0 1))) (let ((.cse3 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8~0 15)) (.cse8 (= ULTIMATE.start___U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_output_~input 6)) (.cse9 (= 1 ULTIMATE.start___U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_output_~input)) (.cse10 (= 5 ULTIMATE.start___U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_output_~input)) (.cse11 (= ULTIMATE.start___U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_output_~input 2)) (.cse12 (= ULTIMATE.start___U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_output_~input 4)) (.cse1 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7~0 0)) (.cse6 (not .cse14)) (.cse13 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0 1)) (.cse2 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 1)) (.cse0 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0 8)) (.cse4 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7~0 1)) (.cse15 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 0)) (.cse5 (not .cse7)) (.cse16 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8~0 13))) (or (and .cse0 .cse1 (and (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0 4) .cse2)) (and .cse3 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0 5) .cse0 .cse1 .cse2) (and .cse4 .cse5 .cse2) (and .cse4 .cse6 .cse2) (and .cse1 (and .cse3 .cse7 .cse0 (or (= 3 ULTIMATE.start___U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_output_~input) .cse8 .cse9 .cse10 .cse11 .cse12) .cse2)) (and .cse0 .cse1 .cse13 .cse2) (and (or .cse8 .cse9 .cse10 .cse11 .cse12) .cse14 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0 0) .cse4 .cse0 .cse15 .cse16) (and .cse0 (and .cse1 .cse6 .cse2)) (and .cse4 .cse13 .cse2) (and .cse0 .cse4 .cse15 .cse5 .cse16)))) [2018-07-24 01:20:45,091 INFO L421 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2018-07-24 01:20:45,091 INFO L421 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2018-07-24 01:20:45,091 INFO L421 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2018-07-24 01:20:45,092 INFO L421 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2018-07-24 01:20:45,092 INFO L421 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2018-07-24 01:20:45,092 INFO L421 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2018-07-24 01:20:45,092 INFO L421 ceAbstractionStarter]: For program point L394(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:45,092 INFO L421 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2018-07-24 01:20:45,092 INFO L421 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2018-07-24 01:20:45,092 INFO L421 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2018-07-24 01:20:45,092 INFO L421 ceAbstractionStarter]: For program point L397(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:45,092 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startErr0AssertViolationERROR_FUNCTION(line 455) no Hoare annotation was computed. [2018-07-24 01:20:45,092 INFO L421 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-07-24 01:20:45,092 INFO L421 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2018-07-24 01:20:45,092 INFO L421 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2018-07-24 01:20:45,092 INFO L421 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2018-07-24 01:20:45,092 INFO L421 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2018-07-24 01:20:45,093 INFO L421 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2018-07-24 01:20:45,093 INFO L421 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2018-07-24 01:20:45,093 INFO L421 ceAbstractionStarter]: For program point L454'(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:45,093 INFO L421 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2018-07-24 01:20:45,093 INFO L421 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2018-07-24 01:20:45,093 INFO L421 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2018-07-24 01:20:45,093 INFO L421 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2018-07-24 01:20:45,093 INFO L421 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2018-07-24 01:20:45,093 INFO L421 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2018-07-24 01:20:45,093 INFO L421 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2018-07-24 01:20:45,129 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.07 01:20:45 BoogieIcfgContainer [2018-07-24 01:20:45,130 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-24 01:20:45,131 INFO L168 Benchmark]: Toolchain (without parser) took 37054.27 ms. Allocated memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: 1.2 GB). Free memory was 1.4 GB in the beginning and 2.5 GB in the end (delta: -1.1 GB). Peak memory consumption was 106.8 MB. Max. memory is 7.1 GB. [2018-07-24 01:20:45,138 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-24 01:20:45,139 INFO L168 Benchmark]: CACSL2BoogieTranslator took 766.12 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-07-24 01:20:45,145 INFO L168 Benchmark]: Boogie Procedure Inliner took 107.97 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-07-24 01:20:45,145 INFO L168 Benchmark]: Boogie Preprocessor took 115.84 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-24 01:20:45,146 INFO L168 Benchmark]: RCFGBuilder took 3468.02 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 767.0 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -753.2 MB). Peak memory consumption was 32.4 MB. Max. memory is 7.1 GB. [2018-07-24 01:20:45,147 INFO L168 Benchmark]: TraceAbstraction took 32591.19 ms. Allocated memory was 2.3 GB in the beginning and 2.7 GB in the end (delta: 402.1 MB). Free memory was 2.1 GB in the beginning and 2.5 GB in the end (delta: -362.0 MB). Peak memory consumption was 40.1 MB. Max. memory is 7.1 GB. [2018-07-24 01:20:45,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.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 766.12 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 107.97 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 115.84 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 3468.02 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 767.0 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -753.2 MB). Peak memory consumption was 32.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 32591.19 ms. Allocated memory was 2.3 GB in the beginning and 2.7 GB in the end (delta: 402.1 MB). Free memory was 2.1 GB in the beginning and 2.5 GB in the end (delta: -362.0 MB). Peak memory consumption was 40.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 455]: 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_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 == 8 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7 <= 0) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16 == 4 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1) || ((((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8 == 15 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16 == 5) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 == 8) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7 <= 0) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1)) || ((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7 == 1 && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16 == 6)) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1)) || ((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7 == 1 && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20 == 1)) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1)) || (__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7 <= 0 && (((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8 == 15 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16 == 6) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 == 8) && (((((3 == input || input == 6) || 1 == input) || 5 == input) || input == 2) || input == 4)) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1)) || (((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 == 8 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7 <= 0) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == 1) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1)) || ((((((((((input == 6 || 1 == input) || 5 == input) || input == 2) || input == 4) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20 == 1) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 <= 0) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7 == 1) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 == 8) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 <= 0) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8 == 13)) || (__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 == 8 && (__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7 <= 0 && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20 == 1)) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1)) || ((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7 == 1 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == 1) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1)) || ((((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 == 8 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7 == 1) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 <= 0) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16 == 6)) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8 == 13) - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: ((((((((((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 == 8 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7 <= 0) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16 == 4 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1) || ((((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8 == 15 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16 == 5) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 == 8) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7 <= 0) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1)) || ((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7 == 1 && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16 == 6)) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1)) || ((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7 == 1 && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20 == 1)) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1)) || (__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7 <= 0 && (((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8 == 15 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16 == 6) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 == 8) && (((((3 == input || input == 6) || 1 == input) || 5 == input) || input == 2) || input == 4)) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1)) || (((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 == 8 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7 <= 0) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == 1) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1)) || ((((((((((input == 6 || 1 == input) || 5 == input) || input == 2) || input == 4) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20 == 1) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 <= 0) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7 == 1) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 == 8) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 <= 0) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8 == 13)) || (__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 == 8 && (__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7 <= 0 && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20 == 1)) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1)) || ((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7 == 1 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == 1) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1)) || ((((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 == 8 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7 == 1) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 <= 0) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16 == 6)) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8 == 13) - 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, 32.4s OverallTime, 11 OverallIterations, 7 TraceHistogramMax, 24.0s AutomataDifference, 0.0s DeadEndRemovalTime, 1.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 1578 SDtfs, 4122 SDslu, 799 SDs, 0 SdLazy, 8828 SolverSat, 1279 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 19.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 579 GetRequests, 517 SyntacticMatches, 8 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 4.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2703occurred in iteration=10, 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.4s AutomataMinimizationTime, 11 MinimizatonAttempts, 1627 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 60 NumberOfFragments, 359 HoareAnnotationTreeSize, 3 FomulaSimplifications, 4008 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 378 FormulaSimplificationTreeSizeReductionInter, 1.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 2218 NumberOfCodeBlocks, 2218 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2205 ConstructedInterpolants, 0 QuantifiedInterpolants, 1906701 SizeOfPredicates, 2 NumberOfNonLiveVariables, 879 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 13 InterpolantComputations, 11 PerfectInterpolantSequences, 2003/2018 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem01_label28_true-unreach-call_false-termination.c_svcomp-Reach-64bit-Automizer_Default.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-07-24_01-20-45-177.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem01_label28_true-unreach-call_false-termination.c_svcomp-Reach-64bit-Automizer_Default.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-24_01-20-45-177.csv Received shutdown request...