java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem10_label56_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 16:03:00,403 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 16:03:00,409 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 16:03:00,421 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 16:03:00,421 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 16:03:00,422 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 16:03:00,423 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 16:03:00,425 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 16:03:00,427 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 16:03:00,428 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 16:03:00,429 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 16:03:00,431 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 16:03:00,432 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 16:03:00,434 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 16:03:00,438 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 16:03:00,439 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 16:03:00,440 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 16:03:00,445 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 16:03:00,446 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 16:03:00,448 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 16:03:00,449 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 16:03:00,450 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 16:03:00,452 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 16:03:00,452 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 16:03:00,452 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 16:03:00,453 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 16:03:00,454 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 16:03:00,455 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 16:03:00,456 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 16:03:00,457 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 16:03:00,457 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 16:03:00,458 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 16:03:00,458 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 16:03:00,458 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 16:03:00,459 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 16:03:00,459 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 16:03:00,460 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-10-24 16:03:00,480 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 16:03:00,480 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 16:03:00,481 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 16:03:00,481 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-24 16:03:00,481 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-24 16:03:00,482 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-24 16:03:00,482 INFO L133 SettingsManager]: * Use SBE=true [2018-10-24 16:03:00,482 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 16:03:00,482 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 16:03:00,482 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 16:03:00,483 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 16:03:00,483 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 16:03:00,483 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 16:03:00,483 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 16:03:00,483 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 16:03:00,484 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 16:03:00,484 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 16:03:00,484 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 16:03:00,484 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 16:03:00,484 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 16:03:00,485 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 16:03:00,485 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 16:03:00,485 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 16:03:00,485 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-24 16:03:00,485 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 16:03:00,486 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 16:03:00,486 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 16:03:00,486 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 16:03:00,528 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 16:03:00,540 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 16:03:00,544 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 16:03:00,546 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 16:03:00,546 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 16:03:00,547 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label56_true-unreach-call.c [2018-10-24 16:03:00,608 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/46b2a7f43/8d5b592de59d4d74a9f2fa2d8545faeb/FLAGda32c488d [2018-10-24 16:03:01,132 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 16:03:01,137 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem10_label56_true-unreach-call.c [2018-10-24 16:03:01,156 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/46b2a7f43/8d5b592de59d4d74a9f2fa2d8545faeb/FLAGda32c488d [2018-10-24 16:03:01,175 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/46b2a7f43/8d5b592de59d4d74a9f2fa2d8545faeb [2018-10-24 16:03:01,185 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 16:03:01,187 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 16:03:01,188 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 16:03:01,188 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 16:03:01,194 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 16:03:01,195 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 04:03:01" (1/1) ... [2018-10-24 16:03:01,197 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27751410 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:03:01, skipping insertion in model container [2018-10-24 16:03:01,197 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 04:03:01" (1/1) ... [2018-10-24 16:03:01,206 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 16:03:01,280 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 16:03:01,719 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 16:03:01,723 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 16:03:01,881 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 16:03:01,899 INFO L193 MainTranslator]: Completed translation [2018-10-24 16:03:01,899 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:03:01 WrapperNode [2018-10-24 16:03:01,900 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 16:03:01,901 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 16:03:01,901 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 16:03:01,901 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 16:03:01,910 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:03:01" (1/1) ... [2018-10-24 16:03:01,929 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:03:01" (1/1) ... [2018-10-24 16:03:02,007 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 16:03:02,009 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 16:03:02,009 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 16:03:02,009 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 16:03:02,153 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:03:01" (1/1) ... [2018-10-24 16:03:02,153 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:03:01" (1/1) ... [2018-10-24 16:03:02,158 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:03:01" (1/1) ... [2018-10-24 16:03:02,158 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:03:01" (1/1) ... [2018-10-24 16:03:02,179 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:03:01" (1/1) ... [2018-10-24 16:03:02,189 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:03:01" (1/1) ... [2018-10-24 16:03:02,197 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:03:01" (1/1) ... [2018-10-24 16:03:02,208 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 16:03:02,208 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 16:03:02,208 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 16:03:02,209 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 16:03:02,212 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:03:01" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-24 16:03:02,272 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-24 16:03:02,272 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 16:03:02,272 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 16:03:05,226 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 16:03:05,227 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 04:03:05 BoogieIcfgContainer [2018-10-24 16:03:05,227 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 16:03:05,228 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 16:03:05,228 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 16:03:05,232 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 16:03:05,232 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 04:03:01" (1/3) ... [2018-10-24 16:03:05,233 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2db1e4c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 04:03:05, skipping insertion in model container [2018-10-24 16:03:05,233 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:03:01" (2/3) ... [2018-10-24 16:03:05,233 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2db1e4c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 04:03:05, skipping insertion in model container [2018-10-24 16:03:05,234 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 04:03:05" (3/3) ... [2018-10-24 16:03:05,236 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label56_true-unreach-call.c [2018-10-24 16:03:05,246 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 16:03:05,254 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 16:03:05,272 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 16:03:05,307 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-24 16:03:05,308 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 16:03:05,308 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 16:03:05,308 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 16:03:05,308 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 16:03:05,309 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 16:03:05,309 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 16:03:05,309 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 16:03:05,309 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 16:03:05,332 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states. [2018-10-24 16:03:05,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-24 16:03:05,340 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:03:05,341 INFO L375 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] [2018-10-24 16:03:05,343 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:03:05,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:03:05,348 INFO L82 PathProgramCache]: Analyzing trace with hash -1155896462, now seen corresponding path program 1 times [2018-10-24 16:03:05,350 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:03:05,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:03:05,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:03:05,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:03:05,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:03:05,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:03:05,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 16:03:05,720 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:03:05,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 16:03:05,726 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 16:03:05,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 16:03:05,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:03:05,746 INFO L87 Difference]: Start difference. First operand 207 states. Second operand 4 states. [2018-10-24 16:03:08,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:03:08,495 INFO L93 Difference]: Finished difference Result 698 states and 1250 transitions. [2018-10-24 16:03:08,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 16:03:08,501 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2018-10-24 16:03:08,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:03:08,522 INFO L225 Difference]: With dead ends: 698 [2018-10-24 16:03:08,522 INFO L226 Difference]: Without dead ends: 484 [2018-10-24 16:03:08,526 INFO L605 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-10-24 16:03:08,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2018-10-24 16:03:08,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 484. [2018-10-24 16:03:08,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484 states. [2018-10-24 16:03:08,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 811 transitions. [2018-10-24 16:03:08,611 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 811 transitions. Word has length 24 [2018-10-24 16:03:08,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:03:08,611 INFO L481 AbstractCegarLoop]: Abstraction has 484 states and 811 transitions. [2018-10-24 16:03:08,612 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 16:03:08,613 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 811 transitions. [2018-10-24 16:03:08,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-10-24 16:03:08,617 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:03:08,618 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-24 16:03:08,618 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:03:08,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:03:08,621 INFO L82 PathProgramCache]: Analyzing trace with hash -47374565, now seen corresponding path program 1 times [2018-10-24 16:03:08,621 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:03:08,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:03:08,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:03:08,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:03:08,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:03:08,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:03:08,958 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 16:03:08,958 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:03:08,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 16:03:08,960 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 16:03:08,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 16:03:08,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:03:08,961 INFO L87 Difference]: Start difference. First operand 484 states and 811 transitions. Second operand 4 states. [2018-10-24 16:03:12,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:03:12,752 INFO L93 Difference]: Finished difference Result 1106 states and 1836 transitions. [2018-10-24 16:03:12,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 16:03:12,753 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2018-10-24 16:03:12,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:03:12,759 INFO L225 Difference]: With dead ends: 1106 [2018-10-24 16:03:12,759 INFO L226 Difference]: Without dead ends: 624 [2018-10-24 16:03:12,762 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:03:12,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2018-10-24 16:03:12,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 624. [2018-10-24 16:03:12,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 624 states. [2018-10-24 16:03:12,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 952 transitions. [2018-10-24 16:03:12,821 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 952 transitions. Word has length 94 [2018-10-24 16:03:12,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:03:12,822 INFO L481 AbstractCegarLoop]: Abstraction has 624 states and 952 transitions. [2018-10-24 16:03:12,822 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 16:03:12,823 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 952 transitions. [2018-10-24 16:03:12,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-10-24 16:03:12,828 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:03:12,828 INFO L375 BasicCegarLoop]: trace histogram [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-10-24 16:03:12,829 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:03:12,829 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:03:12,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1289860076, now seen corresponding path program 1 times [2018-10-24 16:03:12,829 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:03:12,830 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:03:12,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:03:12,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:03:12,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:03:12,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:03:13,067 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 16:03:13,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:03:13,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 16:03:13,068 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 16:03:13,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 16:03:13,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:03:13,069 INFO L87 Difference]: Start difference. First operand 624 states and 952 transitions. Second operand 4 states. [2018-10-24 16:03:20,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:03:20,861 INFO L93 Difference]: Finished difference Result 2366 states and 3680 transitions. [2018-10-24 16:03:20,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 16:03:20,861 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2018-10-24 16:03:20,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:03:20,872 INFO L225 Difference]: With dead ends: 2366 [2018-10-24 16:03:20,872 INFO L226 Difference]: Without dead ends: 1744 [2018-10-24 16:03:20,874 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:03:20,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1744 states. [2018-10-24 16:03:20,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1744 to 1744. [2018-10-24 16:03:20,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1744 states. [2018-10-24 16:03:20,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1744 states to 1744 states and 2441 transitions. [2018-10-24 16:03:20,919 INFO L78 Accepts]: Start accepts. Automaton has 1744 states and 2441 transitions. Word has length 100 [2018-10-24 16:03:20,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:03:20,919 INFO L481 AbstractCegarLoop]: Abstraction has 1744 states and 2441 transitions. [2018-10-24 16:03:20,920 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 16:03:20,920 INFO L276 IsEmpty]: Start isEmpty. Operand 1744 states and 2441 transitions. [2018-10-24 16:03:20,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-10-24 16:03:20,926 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:03:20,927 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 16:03:20,927 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:03:20,927 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:03:20,928 INFO L82 PathProgramCache]: Analyzing trace with hash -525084239, now seen corresponding path program 1 times [2018-10-24 16:03:20,928 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:03:20,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:03:20,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:03:20,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:03:20,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:03:20,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:03:21,263 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-10-24 16:03:21,371 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 16:03:21,371 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:03:21,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 16:03:21,373 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 16:03:21,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 16:03:21,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:03:21,376 INFO L87 Difference]: Start difference. First operand 1744 states and 2441 transitions. Second operand 4 states. [2018-10-24 16:03:22,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:03:22,907 INFO L93 Difference]: Finished difference Result 3906 states and 5503 transitions. [2018-10-24 16:03:22,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 16:03:22,908 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 162 [2018-10-24 16:03:22,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:03:22,919 INFO L225 Difference]: With dead ends: 3906 [2018-10-24 16:03:22,919 INFO L226 Difference]: Without dead ends: 2164 [2018-10-24 16:03:22,922 INFO L605 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-10-24 16:03:22,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2164 states. [2018-10-24 16:03:22,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2164 to 2164. [2018-10-24 16:03:22,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2164 states. [2018-10-24 16:03:22,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2164 states to 2164 states and 2744 transitions. [2018-10-24 16:03:22,964 INFO L78 Accepts]: Start accepts. Automaton has 2164 states and 2744 transitions. Word has length 162 [2018-10-24 16:03:22,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:03:22,965 INFO L481 AbstractCegarLoop]: Abstraction has 2164 states and 2744 transitions. [2018-10-24 16:03:22,965 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 16:03:22,965 INFO L276 IsEmpty]: Start isEmpty. Operand 2164 states and 2744 transitions. [2018-10-24 16:03:22,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-10-24 16:03:22,969 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:03:22,970 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 16:03:22,970 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:03:22,970 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:03:22,971 INFO L82 PathProgramCache]: Analyzing trace with hash 642992039, now seen corresponding path program 1 times [2018-10-24 16:03:22,971 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:03:22,971 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:03:22,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:03:22,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:03:22,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:03:22,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:03:23,341 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 6 [2018-10-24 16:03:23,406 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-10-24 16:03:23,406 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:03:23,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 16:03:23,407 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 16:03:23,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 16:03:23,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 16:03:23,408 INFO L87 Difference]: Start difference. First operand 2164 states and 2744 transitions. Second operand 5 states. [2018-10-24 16:03:27,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:03:27,529 INFO L93 Difference]: Finished difference Result 7702 states and 9785 transitions. [2018-10-24 16:03:27,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 16:03:27,529 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 195 [2018-10-24 16:03:27,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:03:27,554 INFO L225 Difference]: With dead ends: 7702 [2018-10-24 16:03:27,555 INFO L226 Difference]: Without dead ends: 5540 [2018-10-24 16:03:27,559 INFO L605 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-10-24 16:03:27,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5540 states. [2018-10-24 16:03:27,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5540 to 4124. [2018-10-24 16:03:27,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4124 states. [2018-10-24 16:03:27,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4124 states to 4124 states and 4994 transitions. [2018-10-24 16:03:27,639 INFO L78 Accepts]: Start accepts. Automaton has 4124 states and 4994 transitions. Word has length 195 [2018-10-24 16:03:27,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:03:27,640 INFO L481 AbstractCegarLoop]: Abstraction has 4124 states and 4994 transitions. [2018-10-24 16:03:27,640 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 16:03:27,640 INFO L276 IsEmpty]: Start isEmpty. Operand 4124 states and 4994 transitions. [2018-10-24 16:03:27,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2018-10-24 16:03:27,647 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:03:27,649 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 16:03:27,649 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:03:27,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:03:27,650 INFO L82 PathProgramCache]: Analyzing trace with hash -150687317, now seen corresponding path program 1 times [2018-10-24 16:03:27,650 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:03:27,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:03:27,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:03:27,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:03:27,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:03:27,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:03:28,123 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 16:03:28,124 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:03:28,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-24 16:03:28,124 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 16:03:28,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 16:03:28,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 16:03:28,125 INFO L87 Difference]: Start difference. First operand 4124 states and 4994 transitions. Second operand 5 states. [2018-10-24 16:03:29,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:03:29,706 INFO L93 Difference]: Finished difference Result 8106 states and 9841 transitions. [2018-10-24 16:03:29,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 16:03:29,706 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 238 [2018-10-24 16:03:29,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:03:29,715 INFO L225 Difference]: With dead ends: 8106 [2018-10-24 16:03:29,715 INFO L226 Difference]: Without dead ends: 2108 [2018-10-24 16:03:29,721 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 16:03:29,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2108 states. [2018-10-24 16:03:29,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2108 to 1968. [2018-10-24 16:03:29,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1968 states. [2018-10-24 16:03:29,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1968 states to 1968 states and 2178 transitions. [2018-10-24 16:03:29,752 INFO L78 Accepts]: Start accepts. Automaton has 1968 states and 2178 transitions. Word has length 238 [2018-10-24 16:03:29,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:03:29,753 INFO L481 AbstractCegarLoop]: Abstraction has 1968 states and 2178 transitions. [2018-10-24 16:03:29,753 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 16:03:29,753 INFO L276 IsEmpty]: Start isEmpty. Operand 1968 states and 2178 transitions. [2018-10-24 16:03:29,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2018-10-24 16:03:29,758 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:03:29,759 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-24 16:03:29,759 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:03:29,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:03:29,760 INFO L82 PathProgramCache]: Analyzing trace with hash -110008198, now seen corresponding path program 1 times [2018-10-24 16:03:29,760 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:03:29,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:03:29,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:03:29,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:03:29,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:03:29,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:03:30,367 WARN L179 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-24 16:03:30,550 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 215 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-10-24 16:03:30,551 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:03:30,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 16:03:30,551 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 16:03:30,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 16:03:30,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 16:03:30,552 INFO L87 Difference]: Start difference. First operand 1968 states and 2178 transitions. Second operand 5 states. [2018-10-24 16:03:31,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:03:31,775 INFO L93 Difference]: Finished difference Result 3934 states and 4354 transitions. [2018-10-24 16:03:31,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 16:03:31,781 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 262 [2018-10-24 16:03:31,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:03:31,789 INFO L225 Difference]: With dead ends: 3934 [2018-10-24 16:03:31,789 INFO L226 Difference]: Without dead ends: 1967 [2018-10-24 16:03:31,792 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 16:03:31,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1967 states. [2018-10-24 16:03:31,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1967 to 1827. [2018-10-24 16:03:31,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1827 states. [2018-10-24 16:03:31,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1827 states to 1827 states and 1954 transitions. [2018-10-24 16:03:31,821 INFO L78 Accepts]: Start accepts. Automaton has 1827 states and 1954 transitions. Word has length 262 [2018-10-24 16:03:31,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:03:31,821 INFO L481 AbstractCegarLoop]: Abstraction has 1827 states and 1954 transitions. [2018-10-24 16:03:31,821 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 16:03:31,821 INFO L276 IsEmpty]: Start isEmpty. Operand 1827 states and 1954 transitions. [2018-10-24 16:03:31,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2018-10-24 16:03:31,827 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:03:31,827 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 16:03:31,827 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:03:31,827 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:03:31,828 INFO L82 PathProgramCache]: Analyzing trace with hash 1440191249, now seen corresponding path program 1 times [2018-10-24 16:03:31,828 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:03:31,828 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:03:31,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:03:31,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:03:31,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:03:31,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:03:32,434 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 22 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 16:03:32,435 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 16:03:32,435 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-24 16:03:32,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:03:32,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:03:32,586 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 16:03:33,299 WARN L179 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 17 [2018-10-24 16:03:33,550 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 22 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 16:03:33,585 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 16:03:33,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 6 [2018-10-24 16:03:33,587 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-24 16:03:33,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-24 16:03:33,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-24 16:03:33,587 INFO L87 Difference]: Start difference. First operand 1827 states and 1954 transitions. Second operand 7 states. [2018-10-24 16:03:38,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:03:38,116 INFO L93 Difference]: Finished difference Result 5894 states and 6367 transitions. [2018-10-24 16:03:38,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-24 16:03:38,117 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 274 [2018-10-24 16:03:38,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:03:38,134 INFO L225 Difference]: With dead ends: 5894 [2018-10-24 16:03:38,134 INFO L226 Difference]: Without dead ends: 3927 [2018-10-24 16:03:38,137 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 271 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-24 16:03:38,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3927 states. [2018-10-24 16:03:38,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3927 to 2946. [2018-10-24 16:03:38,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2946 states. [2018-10-24 16:03:38,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2946 states to 2946 states and 3170 transitions. [2018-10-24 16:03:38,195 INFO L78 Accepts]: Start accepts. Automaton has 2946 states and 3170 transitions. Word has length 274 [2018-10-24 16:03:38,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:03:38,196 INFO L481 AbstractCegarLoop]: Abstraction has 2946 states and 3170 transitions. [2018-10-24 16:03:38,196 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-24 16:03:38,196 INFO L276 IsEmpty]: Start isEmpty. Operand 2946 states and 3170 transitions. [2018-10-24 16:03:38,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2018-10-24 16:03:38,205 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:03:38,205 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 16:03:38,205 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:03:38,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:03:38,206 INFO L82 PathProgramCache]: Analyzing trace with hash 856611996, now seen corresponding path program 1 times [2018-10-24 16:03:38,206 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:03:38,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:03:38,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:03:38,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:03:38,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:03:38,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:03:38,778 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 223 proven. 22 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-10-24 16:03:38,778 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 16:03:38,779 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-10-24 16:03:38,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 16:03:38,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:03:38,885 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 16:03:39,045 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 223 proven. 22 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-10-24 16:03:39,066 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 16:03:39,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 5 [2018-10-24 16:03:39,067 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 16:03:39,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 16:03:39,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 16:03:39,067 INFO L87 Difference]: Start difference. First operand 2946 states and 3170 transitions. Second operand 5 states. [2018-10-24 16:03:41,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:03:41,767 INFO L93 Difference]: Finished difference Result 7011 states and 7544 transitions. [2018-10-24 16:03:41,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 16:03:41,768 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 329 [2018-10-24 16:03:41,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:03:41,781 INFO L225 Difference]: With dead ends: 7011 [2018-10-24 16:03:41,781 INFO L226 Difference]: Without dead ends: 3925 [2018-10-24 16:03:41,785 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 329 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 16:03:41,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3925 states. [2018-10-24 16:03:41,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3925 to 3505. [2018-10-24 16:03:41,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3505 states. [2018-10-24 16:03:41,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3505 states to 3505 states and 3716 transitions. [2018-10-24 16:03:41,845 INFO L78 Accepts]: Start accepts. Automaton has 3505 states and 3716 transitions. Word has length 329 [2018-10-24 16:03:41,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:03:41,846 INFO L481 AbstractCegarLoop]: Abstraction has 3505 states and 3716 transitions. [2018-10-24 16:03:41,846 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 16:03:41,846 INFO L276 IsEmpty]: Start isEmpty. Operand 3505 states and 3716 transitions. [2018-10-24 16:03:41,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 416 [2018-10-24 16:03:41,858 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:03:41,858 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 16:03:41,858 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:03:41,859 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:03:41,859 INFO L82 PathProgramCache]: Analyzing trace with hash 1964512189, now seen corresponding path program 1 times [2018-10-24 16:03:41,859 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:03:41,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:03:41,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:03:41,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:03:41,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:03:41,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:03:42,259 INFO L134 CoverageAnalysis]: Checked inductivity of 545 backedges. 457 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2018-10-24 16:03:42,260 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:03:42,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 16:03:42,261 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 16:03:42,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 16:03:42,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:03:42,262 INFO L87 Difference]: Start difference. First operand 3505 states and 3716 transitions. Second operand 4 states. [2018-10-24 16:03:44,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:03:44,012 INFO L93 Difference]: Finished difference Result 7428 states and 7898 transitions. [2018-10-24 16:03:44,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 16:03:44,013 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 415 [2018-10-24 16:03:44,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:03:44,025 INFO L225 Difference]: With dead ends: 7428 [2018-10-24 16:03:44,025 INFO L226 Difference]: Without dead ends: 4065 [2018-10-24 16:03:44,028 INFO L605 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-10-24 16:03:44,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4065 states. [2018-10-24 16:03:44,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4065 to 3925. [2018-10-24 16:03:44,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3925 states. [2018-10-24 16:03:44,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3925 states to 3925 states and 4154 transitions. [2018-10-24 16:03:44,087 INFO L78 Accepts]: Start accepts. Automaton has 3925 states and 4154 transitions. Word has length 415 [2018-10-24 16:03:44,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:03:44,087 INFO L481 AbstractCegarLoop]: Abstraction has 3925 states and 4154 transitions. [2018-10-24 16:03:44,088 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 16:03:44,088 INFO L276 IsEmpty]: Start isEmpty. Operand 3925 states and 4154 transitions. [2018-10-24 16:03:44,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 425 [2018-10-24 16:03:44,101 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:03:44,101 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 16:03:44,101 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:03:44,102 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:03:44,102 INFO L82 PathProgramCache]: Analyzing trace with hash -831427639, now seen corresponding path program 1 times [2018-10-24 16:03:44,102 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:03:44,102 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:03:44,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:03:44,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:03:44,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:03:44,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:03:44,887 INFO L134 CoverageAnalysis]: Checked inductivity of 563 backedges. 48 proven. 449 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-10-24 16:03:44,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 16:03:44,888 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 16:03:44,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:03:44,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:03:44,995 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 16:03:45,374 WARN L179 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 17 [2018-10-24 16:03:47,008 WARN L179 SmtUtils]: Spent 1.42 s on a formula simplification. DAG size of input: 70 DAG size of output: 27 [2018-10-24 16:03:47,858 INFO L134 CoverageAnalysis]: Checked inductivity of 563 backedges. 171 proven. 326 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-10-24 16:03:47,878 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 16:03:47,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 12 [2018-10-24 16:03:47,879 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-24 16:03:47,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-24 16:03:47,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2018-10-24 16:03:47,880 INFO L87 Difference]: Start difference. First operand 3925 states and 4154 transitions. Second operand 13 states. [2018-10-24 16:05:13,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:05:13,587 INFO L93 Difference]: Finished difference Result 10412 states and 11026 transitions. [2018-10-24 16:05:13,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-24 16:05:13,587 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 424 [2018-10-24 16:05:13,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:05:13,610 INFO L225 Difference]: With dead ends: 10412 [2018-10-24 16:05:13,610 INFO L226 Difference]: Without dead ends: 6348 [2018-10-24 16:05:13,615 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 420 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=230, Invalid=472, Unknown=0, NotChecked=0, Total=702 [2018-10-24 16:05:13,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6348 states. [2018-10-24 16:05:13,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6348 to 3784. [2018-10-24 16:05:13,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3784 states. [2018-10-24 16:05:13,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3784 states to 3784 states and 4007 transitions. [2018-10-24 16:05:13,688 INFO L78 Accepts]: Start accepts. Automaton has 3784 states and 4007 transitions. Word has length 424 [2018-10-24 16:05:13,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:05:13,689 INFO L481 AbstractCegarLoop]: Abstraction has 3784 states and 4007 transitions. [2018-10-24 16:05:13,689 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-24 16:05:13,689 INFO L276 IsEmpty]: Start isEmpty. Operand 3784 states and 4007 transitions. [2018-10-24 16:05:13,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 539 [2018-10-24 16:05:13,698 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:05:13,698 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 16:05:13,699 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:05:13,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:05:13,699 INFO L82 PathProgramCache]: Analyzing trace with hash -2104286675, now seen corresponding path program 1 times [2018-10-24 16:05:13,699 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:05:13,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:05:13,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:05:13,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:05:13,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:05:13,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:05:14,198 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 571 proven. 110 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2018-10-24 16:05:14,198 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 16:05:14,198 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 16:05:14,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:05:14,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:05:14,330 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 16:05:14,747 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 462 proven. 0 refuted. 0 times theorem prover too weak. 350 trivial. 0 not checked. [2018-10-24 16:05:14,768 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 16:05:14,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2018-10-24 16:05:14,770 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-24 16:05:14,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-24 16:05:14,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-10-24 16:05:14,770 INFO L87 Difference]: Start difference. First operand 3784 states and 4007 transitions. Second operand 8 states. [2018-10-24 16:05:17,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:05:17,561 INFO L93 Difference]: Finished difference Result 10226 states and 10829 transitions. [2018-10-24 16:05:17,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-24 16:05:17,562 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 538 [2018-10-24 16:05:17,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:05:17,574 INFO L225 Difference]: With dead ends: 10226 [2018-10-24 16:05:17,575 INFO L226 Difference]: Without dead ends: 6304 [2018-10-24 16:05:17,580 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 543 GetRequests, 537 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-10-24 16:05:17,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6304 states. [2018-10-24 16:05:17,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6304 to 3924. [2018-10-24 16:05:17,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3924 states. [2018-10-24 16:05:17,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3924 states to 3924 states and 4155 transitions. [2018-10-24 16:05:17,656 INFO L78 Accepts]: Start accepts. Automaton has 3924 states and 4155 transitions. Word has length 538 [2018-10-24 16:05:17,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:05:17,657 INFO L481 AbstractCegarLoop]: Abstraction has 3924 states and 4155 transitions. [2018-10-24 16:05:17,658 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-24 16:05:17,658 INFO L276 IsEmpty]: Start isEmpty. Operand 3924 states and 4155 transitions. [2018-10-24 16:05:17,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 569 [2018-10-24 16:05:17,667 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:05:17,668 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 16:05:17,668 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:05:17,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:05:17,668 INFO L82 PathProgramCache]: Analyzing trace with hash -1016352259, now seen corresponding path program 1 times [2018-10-24 16:05:17,668 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:05:17,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:05:17,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:05:17,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:05:17,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:05:17,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:05:18,992 INFO L134 CoverageAnalysis]: Checked inductivity of 1261 backedges. 697 proven. 228 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2018-10-24 16:05:18,992 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 16:05:18,992 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 16:05:19,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:05:19,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:05:19,131 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 16:05:19,327 INFO L134 CoverageAnalysis]: Checked inductivity of 1261 backedges. 711 proven. 0 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked. [2018-10-24 16:05:19,348 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 16:05:19,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 11 [2018-10-24 16:05:19,349 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-24 16:05:19,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-24 16:05:19,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-10-24 16:05:19,350 INFO L87 Difference]: Start difference. First operand 3924 states and 4155 transitions. Second operand 11 states. [2018-10-24 16:05:21,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:05:21,771 INFO L93 Difference]: Finished difference Result 6811 states and 7208 transitions. [2018-10-24 16:05:21,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-24 16:05:21,772 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 568 [2018-10-24 16:05:21,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:05:21,772 INFO L225 Difference]: With dead ends: 6811 [2018-10-24 16:05:21,772 INFO L226 Difference]: Without dead ends: 0 [2018-10-24 16:05:21,776 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 593 GetRequests, 575 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2018-10-24 16:05:21,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-24 16:05:21,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-24 16:05:21,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-24 16:05:21,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-24 16:05:21,777 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 568 [2018-10-24 16:05:21,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:05:21,777 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-24 16:05:21,777 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-24 16:05:21,777 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-24 16:05:21,778 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-24 16:05:21,783 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-24 16:05:21,899 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:05:21,911 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:05:21,982 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:05:21,982 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:05:21,994 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:05:22,009 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:05:22,014 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:05:22,122 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:05:22,128 WARN L179 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 351 DAG size of output: 271 [2018-10-24 16:05:22,253 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:05:22,265 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:05:22,345 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:05:22,346 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:05:22,360 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:05:22,376 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:05:22,382 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:05:22,490 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:05:22,495 WARN L179 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 350 DAG size of output: 271 [2018-10-24 16:05:26,380 WARN L179 SmtUtils]: Spent 3.88 s on a formula simplification. DAG size of input: 262 DAG size of output: 84 [2018-10-24 16:05:29,066 WARN L179 SmtUtils]: Spent 2.68 s on a formula simplification. DAG size of input: 262 DAG size of output: 84 [2018-10-24 16:05:29,070 INFO L425 ceAbstractionStarter]: For program point L465(lines 465 572) no Hoare annotation was computed. [2018-10-24 16:05:29,070 INFO L425 ceAbstractionStarter]: For program point L201(lines 20 574) no Hoare annotation was computed. [2018-10-24 16:05:29,070 INFO L425 ceAbstractionStarter]: For program point L168(lines 20 574) no Hoare annotation was computed. [2018-10-24 16:05:29,070 INFO L425 ceAbstractionStarter]: For program point L135(lines 20 574) no Hoare annotation was computed. [2018-10-24 16:05:29,070 INFO L425 ceAbstractionStarter]: For program point L102(lines 20 574) no Hoare annotation was computed. [2018-10-24 16:05:29,070 INFO L425 ceAbstractionStarter]: For program point L69(lines 20 574) no Hoare annotation was computed. [2018-10-24 16:05:29,070 INFO L425 ceAbstractionStarter]: For program point L36(lines 20 574) no Hoare annotation was computed. [2018-10-24 16:05:29,070 INFO L425 ceAbstractionStarter]: For program point L499(lines 499 572) no Hoare annotation was computed. [2018-10-24 16:05:29,071 INFO L425 ceAbstractionStarter]: For program point L301(lines 301 572) no Hoare annotation was computed. [2018-10-24 16:05:29,071 INFO L425 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2018-10-24 16:05:29,071 INFO L425 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2018-10-24 16:05:29,071 INFO L425 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2018-10-24 16:05:29,071 INFO L425 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2018-10-24 16:05:29,071 INFO L425 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2018-10-24 16:05:29,071 INFO L425 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2018-10-24 16:05:29,071 INFO L425 ceAbstractionStarter]: For program point L335(lines 335 572) no Hoare annotation was computed. [2018-10-24 16:05:29,071 INFO L425 ceAbstractionStarter]: For program point L236(lines 236 572) no Hoare annotation was computed. [2018-10-24 16:05:29,071 INFO L425 ceAbstractionStarter]: For program point L534(lines 534 572) no Hoare annotation was computed. [2018-10-24 16:05:29,072 INFO L425 ceAbstractionStarter]: For program point L171(lines 20 574) no Hoare annotation was computed. [2018-10-24 16:05:29,072 INFO L425 ceAbstractionStarter]: For program point L138(lines 20 574) no Hoare annotation was computed. [2018-10-24 16:05:29,072 INFO L425 ceAbstractionStarter]: For program point L105(lines 20 574) no Hoare annotation was computed. [2018-10-24 16:05:29,072 INFO L425 ceAbstractionStarter]: For program point L39(lines 20 574) no Hoare annotation was computed. [2018-10-24 16:05:29,072 INFO L425 ceAbstractionStarter]: For program point L72-1(lines 20 574) no Hoare annotation was computed. [2018-10-24 16:05:29,072 INFO L425 ceAbstractionStarter]: For program point L436(lines 436 572) no Hoare annotation was computed. [2018-10-24 16:05:29,072 INFO L425 ceAbstractionStarter]: For program point L403(lines 403 572) no Hoare annotation was computed. [2018-10-24 16:05:29,072 INFO L425 ceAbstractionStarter]: For program point L370(lines 370 572) no Hoare annotation was computed. [2018-10-24 16:05:29,073 INFO L425 ceAbstractionStarter]: For program point L271(lines 271 572) no Hoare annotation was computed. [2018-10-24 16:05:29,073 INFO L425 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2018-10-24 16:05:29,073 INFO L425 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2018-10-24 16:05:29,073 INFO L425 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2018-10-24 16:05:29,073 INFO L425 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2018-10-24 16:05:29,073 INFO L425 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2018-10-24 16:05:29,073 INFO L425 ceAbstractionStarter]: For program point L569(lines 569 572) no Hoare annotation was computed. [2018-10-24 16:05:29,073 INFO L425 ceAbstractionStarter]: For program point L239(lines 239 572) no Hoare annotation was computed. [2018-10-24 16:05:29,073 INFO L425 ceAbstractionStarter]: For program point L504(lines 504 572) no Hoare annotation was computed. [2018-10-24 16:05:29,074 INFO L425 ceAbstractionStarter]: For program point L471(lines 471 572) no Hoare annotation was computed. [2018-10-24 16:05:29,074 INFO L425 ceAbstractionStarter]: For program point L306(lines 306 572) no Hoare annotation was computed. [2018-10-24 16:05:29,074 INFO L425 ceAbstractionStarter]: For program point L174(lines 20 574) no Hoare annotation was computed. [2018-10-24 16:05:29,074 INFO L425 ceAbstractionStarter]: For program point L141(lines 20 574) no Hoare annotation was computed. [2018-10-24 16:05:29,074 INFO L425 ceAbstractionStarter]: For program point L108(lines 20 574) no Hoare annotation was computed. [2018-10-24 16:05:29,074 INFO L425 ceAbstractionStarter]: For program point L75(lines 20 574) no Hoare annotation was computed. [2018-10-24 16:05:29,074 INFO L425 ceAbstractionStarter]: For program point L42(lines 20 574) no Hoare annotation was computed. [2018-10-24 16:05:29,074 INFO L425 ceAbstractionStarter]: For program point L340(lines 340 572) no Hoare annotation was computed. [2018-10-24 16:05:29,074 INFO L425 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2018-10-24 16:05:29,075 INFO L425 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2018-10-24 16:05:29,076 INFO L425 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2018-10-24 16:05:29,076 INFO L425 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2018-10-24 16:05:29,076 INFO L425 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2018-10-24 16:05:29,076 INFO L421 ceAbstractionStarter]: At program point L573(lines 20 574) the Hoare annotation is: (let ((.cse17 (= ~a10~0 4)) (.cse6 (= ~a10~0 1)) (.cse19 (+ ~a1~0 13))) (let ((.cse2 (= ~a12~0 0)) (.cse7 (<= .cse19 0)) (.cse3 (= ~a4~0 14)) (.cse15 (<= ~a1~0 218)) (.cse11 (= ~a19~0 9)) (.cse18 (not .cse6)) (.cse16 (not .cse17))) (let ((.cse1 (< 38 ~a1~0)) (.cse0 (= ~a10~0 3)) (.cse13 (<= ~a1~0 12)) (.cse4 (and .cse15 .cse11 (< 0 .cse19) .cse18 .cse16)) (.cse12 (= ~a10~0 0)) (.cse8 (= ~a19~0 8)) (.cse9 (< 218 ~a1~0)) (.cse14 (= ~a10~0 2)) (.cse5 (and .cse11 .cse2 .cse18 .cse7 .cse3))) (or (and .cse0 (and .cse1 .cse2 .cse3 .cse4)) (and .cse0 .cse5) (and (and .cse6 .cse2 .cse7) .cse3) (and .cse1 .cse2 .cse8 .cse3) (and .cse9 (<= ~a1~0 589891) .cse6 .cse2 .cse3) (and .cse6 .cse2 (<= 56 ~a1~0) .cse3 (exists ((v_prenex_41 Int)) (let ((.cse10 (* 5 (div v_prenex_41 5)))) (and (<= v_prenex_41 218) (<= 0 .cse10) (<= ~a1~0 (+ (div .cse10 5) 505228)) (= 0 (mod v_prenex_41 5)))))) (and .cse11 .cse12 .cse2 .cse3) (and .cse0 .cse9 .cse11 .cse2 .cse3 (<= ~a1~0 589865)) (and .cse6 .cse2 .cse13 (not .cse11) .cse3) (and .cse0 .cse2 .cse13 .cse3 .cse4) (and (not .cse8) (<= ~a19~0 8)) (and .cse2 .cse8 .cse7 .cse3) (and .cse14 .cse2 .cse13 .cse3 .cse4) (and .cse15 (and .cse12 .cse2 .cse3)) (and .cse8 .cse16) (and .cse9 .cse14 .cse11 .cse2 .cse3) (and .cse14 .cse5) (and (<= ~a1~0 505232) .cse11 .cse17 .cse2 .cse3))))) [2018-10-24 16:05:29,076 INFO L425 ceAbstractionStarter]: For program point L540(lines 540 572) no Hoare annotation was computed. [2018-10-24 16:05:29,077 INFO L425 ceAbstractionStarter]: For program point L408(lines 408 572) no Hoare annotation was computed. [2018-10-24 16:05:29,077 INFO L425 ceAbstractionStarter]: For program point L375(lines 375 572) no Hoare annotation was computed. [2018-10-24 16:05:29,077 INFO L425 ceAbstractionStarter]: For program point L210(lines 210 572) no Hoare annotation was computed. [2018-10-24 16:05:29,077 INFO L425 ceAbstractionStarter]: For program point L177(lines 20 574) no Hoare annotation was computed. [2018-10-24 16:05:29,077 INFO L425 ceAbstractionStarter]: For program point L144(lines 20 574) no Hoare annotation was computed. [2018-10-24 16:05:29,077 INFO L425 ceAbstractionStarter]: For program point L111(lines 20 574) no Hoare annotation was computed. [2018-10-24 16:05:29,077 INFO L425 ceAbstractionStarter]: For program point L78(lines 20 574) no Hoare annotation was computed. [2018-10-24 16:05:29,077 INFO L425 ceAbstractionStarter]: For program point L45(lines 20 574) no Hoare annotation was computed. [2018-10-24 16:05:29,077 INFO L425 ceAbstractionStarter]: For program point L442(lines 442 572) no Hoare annotation was computed. [2018-10-24 16:05:29,077 INFO L425 ceAbstractionStarter]: For program point L277(lines 277 572) no Hoare annotation was computed. [2018-10-24 16:05:29,077 INFO L425 ceAbstractionStarter]: For program point L244(lines 244 572) no Hoare annotation was computed. [2018-10-24 16:05:29,077 INFO L425 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2018-10-24 16:05:29,077 INFO L425 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2018-10-24 16:05:29,077 INFO L425 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2018-10-24 16:05:29,078 INFO L425 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2018-10-24 16:05:29,078 INFO L425 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2018-10-24 16:05:29,078 INFO L425 ceAbstractionStarter]: For program point L509(lines 509 572) no Hoare annotation was computed. [2018-10-24 16:05:29,078 INFO L425 ceAbstractionStarter]: For program point L476(lines 476 572) no Hoare annotation was computed. [2018-10-24 16:05:29,078 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 73) no Hoare annotation was computed. [2018-10-24 16:05:29,078 INFO L428 ceAbstractionStarter]: At program point L576(lines 576 592) the Hoare annotation is: true [2018-10-24 16:05:29,078 INFO L425 ceAbstractionStarter]: For program point L378(lines 378 572) no Hoare annotation was computed. [2018-10-24 16:05:29,078 INFO L425 ceAbstractionStarter]: For program point L345(lines 345 572) no Hoare annotation was computed. [2018-10-24 16:05:29,078 INFO L425 ceAbstractionStarter]: For program point L312(lines 312 572) no Hoare annotation was computed. [2018-10-24 16:05:29,078 INFO L425 ceAbstractionStarter]: For program point L180(lines 20 574) no Hoare annotation was computed. [2018-10-24 16:05:29,079 INFO L425 ceAbstractionStarter]: For program point L147(lines 20 574) no Hoare annotation was computed. [2018-10-24 16:05:29,079 INFO L425 ceAbstractionStarter]: For program point L114(lines 20 574) no Hoare annotation was computed. [2018-10-24 16:05:29,079 INFO L425 ceAbstractionStarter]: For program point L81(lines 20 574) no Hoare annotation was computed. [2018-10-24 16:05:29,079 INFO L425 ceAbstractionStarter]: For program point L48(lines 20 574) no Hoare annotation was computed. [2018-10-24 16:05:29,079 INFO L425 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2018-10-24 16:05:29,079 INFO L425 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2018-10-24 16:05:29,079 INFO L425 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2018-10-24 16:05:29,079 INFO L425 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2018-10-24 16:05:29,079 INFO L425 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2018-10-24 16:05:29,079 INFO L425 ceAbstractionStarter]: For program point L545(lines 545 572) no Hoare annotation was computed. [2018-10-24 16:05:29,079 INFO L425 ceAbstractionStarter]: For program point L215(lines 215 572) no Hoare annotation was computed. [2018-10-24 16:05:29,079 INFO L425 ceAbstractionStarter]: For program point L414(lines 414 572) no Hoare annotation was computed. [2018-10-24 16:05:29,079 INFO L425 ceAbstractionStarter]: For program point L249(lines 249 572) no Hoare annotation was computed. [2018-10-24 16:05:29,079 INFO L425 ceAbstractionStarter]: For program point L183(lines 20 574) no Hoare annotation was computed. [2018-10-24 16:05:29,080 INFO L425 ceAbstractionStarter]: For program point L150(lines 20 574) no Hoare annotation was computed. [2018-10-24 16:05:29,080 INFO L425 ceAbstractionStarter]: For program point L117(lines 20 574) no Hoare annotation was computed. [2018-10-24 16:05:29,080 INFO L425 ceAbstractionStarter]: For program point L84(lines 20 574) no Hoare annotation was computed. [2018-10-24 16:05:29,080 INFO L425 ceAbstractionStarter]: For program point L51(lines 20 574) no Hoare annotation was computed. [2018-10-24 16:05:29,080 INFO L425 ceAbstractionStarter]: For program point L514(lines 514 572) no Hoare annotation was computed. [2018-10-24 16:05:29,080 INFO L425 ceAbstractionStarter]: For program point L481(lines 481 572) no Hoare annotation was computed. [2018-10-24 16:05:29,080 INFO L425 ceAbstractionStarter]: For program point L448(lines 448 572) no Hoare annotation was computed. [2018-10-24 16:05:29,080 INFO L425 ceAbstractionStarter]: For program point L283(lines 283 572) no Hoare annotation was computed. [2018-10-24 16:05:29,080 INFO L425 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2018-10-24 16:05:29,080 INFO L425 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2018-10-24 16:05:29,080 INFO L425 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2018-10-24 16:05:29,080 INFO L425 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2018-10-24 16:05:29,080 INFO L425 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2018-10-24 16:05:29,080 INFO L425 ceAbstractionStarter]: For program point L548(lines 548 572) no Hoare annotation was computed. [2018-10-24 16:05:29,081 INFO L425 ceAbstractionStarter]: For program point L383(lines 383 572) no Hoare annotation was computed. [2018-10-24 16:05:29,081 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-10-24 16:05:29,081 INFO L425 ceAbstractionStarter]: For program point L317(lines 317 572) no Hoare annotation was computed. [2018-10-24 16:05:29,081 INFO L425 ceAbstractionStarter]: For program point L582-1(lines 582 591) no Hoare annotation was computed. [2018-10-24 16:05:29,081 INFO L421 ceAbstractionStarter]: At program point L582-3(lines 582 591) the Hoare annotation is: (let ((.cse17 (= ~a10~0 4)) (.cse6 (= ~a10~0 1)) (.cse19 (+ ~a1~0 13))) (let ((.cse2 (= ~a12~0 0)) (.cse7 (<= .cse19 0)) (.cse3 (= ~a4~0 14)) (.cse15 (<= ~a1~0 218)) (.cse11 (= ~a19~0 9)) (.cse18 (not .cse6)) (.cse16 (not .cse17))) (let ((.cse1 (< 38 ~a1~0)) (.cse0 (= ~a10~0 3)) (.cse13 (<= ~a1~0 12)) (.cse4 (and .cse15 .cse11 (< 0 .cse19) .cse18 .cse16)) (.cse12 (= ~a10~0 0)) (.cse8 (= ~a19~0 8)) (.cse9 (< 218 ~a1~0)) (.cse14 (= ~a10~0 2)) (.cse5 (and .cse11 .cse2 .cse18 .cse7 .cse3))) (or (and .cse0 (and .cse1 .cse2 .cse3 .cse4)) (and .cse0 .cse5) (and (and .cse6 .cse2 .cse7) .cse3) (and .cse1 .cse2 .cse8 .cse3) (and .cse9 (<= ~a1~0 589891) .cse6 .cse2 .cse3) (and .cse6 .cse2 (<= 56 ~a1~0) .cse3 (exists ((v_prenex_41 Int)) (let ((.cse10 (* 5 (div v_prenex_41 5)))) (and (<= v_prenex_41 218) (<= 0 .cse10) (<= ~a1~0 (+ (div .cse10 5) 505228)) (= 0 (mod v_prenex_41 5)))))) (and .cse11 .cse12 .cse2 .cse3) (and .cse0 .cse9 .cse11 .cse2 .cse3 (<= ~a1~0 589865)) (and .cse6 .cse2 .cse13 (not .cse11) .cse3) (and .cse0 .cse2 .cse13 .cse3 .cse4) (and (not .cse8) (<= ~a19~0 8)) (and .cse2 .cse8 .cse7 .cse3) (and .cse14 .cse2 .cse13 .cse3 .cse4) (and .cse15 (and .cse12 .cse2 .cse3)) (and .cse8 .cse16) (and .cse9 .cse14 .cse11 .cse2 .cse3) (and .cse14 .cse5) (and (<= ~a1~0 505232) .cse11 .cse17 .cse2 .cse3))))) [2018-10-24 16:05:29,081 INFO L425 ceAbstractionStarter]: For program point L351(lines 351 572) no Hoare annotation was computed. [2018-10-24 16:05:29,081 INFO L425 ceAbstractionStarter]: For program point L186(lines 20 574) no Hoare annotation was computed. [2018-10-24 16:05:29,081 INFO L425 ceAbstractionStarter]: For program point L153(lines 20 574) no Hoare annotation was computed. [2018-10-24 16:05:29,081 INFO L425 ceAbstractionStarter]: For program point L120(lines 20 574) no Hoare annotation was computed. [2018-10-24 16:05:29,081 INFO L425 ceAbstractionStarter]: For program point L87(lines 20 574) no Hoare annotation was computed. [2018-10-24 16:05:29,081 INFO L425 ceAbstractionStarter]: For program point L54(lines 20 574) no Hoare annotation was computed. [2018-10-24 16:05:29,082 INFO L425 ceAbstractionStarter]: For program point L21(lines 21 23) no Hoare annotation was computed. [2018-10-24 16:05:29,082 INFO L425 ceAbstractionStarter]: For program point L21-1(lines 20 574) no Hoare annotation was computed. [2018-10-24 16:05:29,082 INFO L425 ceAbstractionStarter]: For program point L517(lines 517 572) no Hoare annotation was computed. [2018-10-24 16:05:29,082 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 572) no Hoare annotation was computed. [2018-10-24 16:05:29,082 INFO L425 ceAbstractionStarter]: For program point L220(lines 220 572) no Hoare annotation was computed. [2018-10-24 16:05:29,082 INFO L425 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2018-10-24 16:05:29,082 INFO L425 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2018-10-24 16:05:29,082 INFO L425 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2018-10-24 16:05:29,082 INFO L425 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2018-10-24 16:05:29,082 INFO L425 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2018-10-24 16:05:29,082 INFO L425 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2018-10-24 16:05:29,082 INFO L425 ceAbstractionStarter]: For program point L419(lines 419 572) no Hoare annotation was computed. [2018-10-24 16:05:29,082 INFO L425 ceAbstractionStarter]: For program point L320(lines 320 572) no Hoare annotation was computed. [2018-10-24 16:05:29,082 INFO L425 ceAbstractionStarter]: For program point L254(lines 254 572) no Hoare annotation was computed. [2018-10-24 16:05:29,083 INFO L425 ceAbstractionStarter]: For program point L354(lines 354 572) no Hoare annotation was computed. [2018-10-24 16:05:29,083 INFO L425 ceAbstractionStarter]: For program point L189(lines 20 574) no Hoare annotation was computed. [2018-10-24 16:05:29,083 INFO L425 ceAbstractionStarter]: For program point L156(lines 20 574) no Hoare annotation was computed. [2018-10-24 16:05:29,083 INFO L425 ceAbstractionStarter]: For program point L123(lines 20 574) no Hoare annotation was computed. [2018-10-24 16:05:29,083 INFO L425 ceAbstractionStarter]: For program point L90(lines 20 574) no Hoare annotation was computed. [2018-10-24 16:05:29,083 INFO L425 ceAbstractionStarter]: For program point L57(lines 20 574) no Hoare annotation was computed. [2018-10-24 16:05:29,083 INFO L425 ceAbstractionStarter]: For program point L24(lines 20 574) no Hoare annotation was computed. [2018-10-24 16:05:29,083 INFO L425 ceAbstractionStarter]: For program point L487(lines 487 572) no Hoare annotation was computed. [2018-10-24 16:05:29,083 INFO L425 ceAbstractionStarter]: For program point L454(lines 454 572) no Hoare annotation was computed. [2018-10-24 16:05:29,083 INFO L425 ceAbstractionStarter]: For program point L388(lines 388 572) no Hoare annotation was computed. [2018-10-24 16:05:29,084 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-24 16:05:29,084 INFO L425 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2018-10-24 16:05:29,084 INFO L425 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2018-10-24 16:05:29,084 INFO L425 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2018-10-24 16:05:29,084 INFO L425 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2018-10-24 16:05:29,084 INFO L425 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2018-10-24 16:05:29,084 INFO L425 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-10-24 16:05:29,084 INFO L425 ceAbstractionStarter]: For program point L587(line 587) no Hoare annotation was computed. [2018-10-24 16:05:29,085 INFO L425 ceAbstractionStarter]: For program point L554(lines 554 572) no Hoare annotation was computed. [2018-10-24 16:05:29,085 INFO L425 ceAbstractionStarter]: For program point L323(lines 323 572) no Hoare annotation was computed. [2018-10-24 16:05:29,085 INFO L425 ceAbstractionStarter]: For program point L357(lines 357 572) no Hoare annotation was computed. [2018-10-24 16:05:29,085 INFO L425 ceAbstractionStarter]: For program point L291(lines 291 572) no Hoare annotation was computed. [2018-10-24 16:05:29,085 INFO L425 ceAbstractionStarter]: For program point L225(lines 225 572) no Hoare annotation was computed. [2018-10-24 16:05:29,085 INFO L425 ceAbstractionStarter]: For program point L192(lines 20 574) no Hoare annotation was computed. [2018-10-24 16:05:29,085 INFO L425 ceAbstractionStarter]: For program point L159(lines 20 574) no Hoare annotation was computed. [2018-10-24 16:05:29,085 INFO L425 ceAbstractionStarter]: For program point L126(lines 20 574) no Hoare annotation was computed. [2018-10-24 16:05:29,085 INFO L425 ceAbstractionStarter]: For program point L93(lines 20 574) no Hoare annotation was computed. [2018-10-24 16:05:29,086 INFO L425 ceAbstractionStarter]: For program point L60(lines 20 574) no Hoare annotation was computed. [2018-10-24 16:05:29,086 INFO L425 ceAbstractionStarter]: For program point L27(lines 20 574) no Hoare annotation was computed. [2018-10-24 16:05:29,086 INFO L425 ceAbstractionStarter]: For program point L523(lines 523 572) no Hoare annotation was computed. [2018-10-24 16:05:29,086 INFO L425 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2018-10-24 16:05:29,086 INFO L425 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2018-10-24 16:05:29,086 INFO L425 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2018-10-24 16:05:29,086 INFO L425 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2018-10-24 16:05:29,086 INFO L425 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2018-10-24 16:05:29,086 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-24 16:05:29,087 INFO L425 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2018-10-24 16:05:29,087 INFO L425 ceAbstractionStarter]: For program point L557(lines 557 572) no Hoare annotation was computed. [2018-10-24 16:05:29,087 INFO L425 ceAbstractionStarter]: For program point L425(lines 425 572) no Hoare annotation was computed. [2018-10-24 16:05:29,087 INFO L425 ceAbstractionStarter]: For program point L326(lines 326 572) no Hoare annotation was computed. [2018-10-24 16:05:29,087 INFO L425 ceAbstractionStarter]: For program point L260(lines 260 572) no Hoare annotation was computed. [2018-10-24 16:05:29,087 INFO L425 ceAbstractionStarter]: For program point L393(lines 393 572) no Hoare annotation was computed. [2018-10-24 16:05:29,087 INFO L425 ceAbstractionStarter]: For program point L360(lines 360 572) no Hoare annotation was computed. [2018-10-24 16:05:29,087 INFO L425 ceAbstractionStarter]: For program point L195(lines 20 574) no Hoare annotation was computed. [2018-10-24 16:05:29,087 INFO L425 ceAbstractionStarter]: For program point L162(lines 20 574) no Hoare annotation was computed. [2018-10-24 16:05:29,088 INFO L425 ceAbstractionStarter]: For program point L129(lines 20 574) no Hoare annotation was computed. [2018-10-24 16:05:29,088 INFO L425 ceAbstractionStarter]: For program point L96(lines 20 574) no Hoare annotation was computed. [2018-10-24 16:05:29,088 INFO L425 ceAbstractionStarter]: For program point L63(lines 20 574) no Hoare annotation was computed. [2018-10-24 16:05:29,088 INFO L425 ceAbstractionStarter]: For program point L30(lines 20 574) no Hoare annotation was computed. [2018-10-24 16:05:29,088 INFO L425 ceAbstractionStarter]: For program point L526(lines 526 572) no Hoare annotation was computed. [2018-10-24 16:05:29,088 INFO L425 ceAbstractionStarter]: For program point L493(lines 493 572) no Hoare annotation was computed. [2018-10-24 16:05:29,088 INFO L425 ceAbstractionStarter]: For program point L460(lines 460 572) no Hoare annotation was computed. [2018-10-24 16:05:29,088 INFO L425 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2018-10-24 16:05:29,088 INFO L425 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2018-10-24 16:05:29,089 INFO L425 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2018-10-24 16:05:29,089 INFO L425 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2018-10-24 16:05:29,089 INFO L425 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2018-10-24 16:05:29,089 INFO L425 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2018-10-24 16:05:29,089 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 572) no Hoare annotation was computed. [2018-10-24 16:05:29,089 INFO L425 ceAbstractionStarter]: For program point L296(lines 296 572) no Hoare annotation was computed. [2018-10-24 16:05:29,089 INFO L425 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-10-24 16:05:29,089 INFO L425 ceAbstractionStarter]: For program point L231(lines 231 572) no Hoare annotation was computed. [2018-10-24 16:05:29,089 INFO L425 ceAbstractionStarter]: For program point L198(lines 20 574) no Hoare annotation was computed. [2018-10-24 16:05:29,089 INFO L425 ceAbstractionStarter]: For program point L165(lines 20 574) no Hoare annotation was computed. [2018-10-24 16:05:29,090 INFO L425 ceAbstractionStarter]: For program point L132(lines 20 574) no Hoare annotation was computed. [2018-10-24 16:05:29,090 INFO L425 ceAbstractionStarter]: For program point L99(lines 20 574) no Hoare annotation was computed. [2018-10-24 16:05:29,090 INFO L425 ceAbstractionStarter]: For program point L66(lines 20 574) no Hoare annotation was computed. [2018-10-24 16:05:29,090 INFO L425 ceAbstractionStarter]: For program point L33(lines 20 574) no Hoare annotation was computed. [2018-10-24 16:05:29,090 INFO L425 ceAbstractionStarter]: For program point L529(lines 529 572) no Hoare annotation was computed. [2018-10-24 16:05:29,090 INFO L425 ceAbstractionStarter]: For program point L430(lines 430 572) no Hoare annotation was computed. [2018-10-24 16:05:29,090 INFO L425 ceAbstractionStarter]: For program point L265(lines 265 572) no Hoare annotation was computed. [2018-10-24 16:05:29,090 INFO L425 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2018-10-24 16:05:29,090 INFO L425 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2018-10-24 16:05:29,090 INFO L425 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2018-10-24 16:05:29,091 INFO L425 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-10-24 16:05:29,091 INFO L425 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2018-10-24 16:05:29,091 INFO L425 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2018-10-24 16:05:29,091 INFO L425 ceAbstractionStarter]: For program point L563(lines 563 572) no Hoare annotation was computed. [2018-10-24 16:05:29,091 INFO L425 ceAbstractionStarter]: For program point L398(lines 398 572) no Hoare annotation was computed. [2018-10-24 16:05:29,091 INFO L425 ceAbstractionStarter]: For program point L365(lines 365 572) no Hoare annotation was computed. [2018-10-24 16:05:29,100 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-10-24 16:05:29,101 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-10-24 16:05:29,102 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-10-24 16:05:29,102 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-10-24 16:05:29,114 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-10-24 16:05:29,115 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-10-24 16:05:29,115 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-10-24 16:05:29,115 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-10-24 16:05:29,122 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-10-24 16:05:29,122 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-10-24 16:05:29,123 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-10-24 16:05:29,126 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-10-24 16:05:29,128 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-10-24 16:05:29,129 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-10-24 16:05:29,132 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-10-24 16:05:29,132 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-10-24 16:05:29,139 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 04:05:29 BoogieIcfgContainer [2018-10-24 16:05:29,139 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-24 16:05:29,140 INFO L168 Benchmark]: Toolchain (without parser) took 147954.38 ms. Allocated memory was 1.5 GB in the beginning and 2.9 GB in the end (delta: 1.4 GB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -477.9 MB). Peak memory consumption was 913.0 MB. Max. memory is 7.1 GB. [2018-10-24 16:05:29,146 INFO L168 Benchmark]: CDTParser took 0.25 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-10-24 16:05:29,146 INFO L168 Benchmark]: CACSL2BoogieTranslator took 712.14 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-10-24 16:05:29,147 INFO L168 Benchmark]: Boogie Procedure Inliner took 108.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: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-10-24 16:05:29,148 INFO L168 Benchmark]: Boogie Preprocessor took 199.05 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 750.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -829.0 MB). Peak memory consumption was 24.7 MB. Max. memory is 7.1 GB. [2018-10-24 16:05:29,149 INFO L168 Benchmark]: RCFGBuilder took 3019.02 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 111.1 MB). Peak memory consumption was 111.1 MB. Max. memory is 7.1 GB. [2018-10-24 16:05:29,150 INFO L168 Benchmark]: TraceAbstraction took 143911.30 ms. Allocated memory was 2.3 GB in the beginning and 2.9 GB in the end (delta: 640.2 MB). Free memory was 2.1 GB in the beginning and 1.9 GB in the end (delta: 197.7 MB). Peak memory consumption was 837.8 MB. Max. memory is 7.1 GB. [2018-10-24 16:05:29,155 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 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 712.14 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 108.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: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 199.05 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 750.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -829.0 MB). Peak memory consumption was 24.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3019.02 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 111.1 MB). Peak memory consumption was 111.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 143911.30 ms. Allocated memory was 2.3 GB in the beginning and 2.9 GB in the end (delta: 640.2 MB). Free memory was 2.1 GB in the beginning and 1.9 GB in the end (delta: 197.7 MB). Peak memory consumption was 837.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 73]: 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: 582]: Loop Invariant [2018-10-24 16:05:29,167 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-10-24 16:05:29,167 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-10-24 16:05:29,167 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-10-24 16:05:29,167 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-10-24 16:05:29,169 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-10-24 16:05:29,170 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-10-24 16:05:29,170 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-10-24 16:05:29,170 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] Derived loop invariant: (((((((((((((((((a10 == 3 && ((38 < a1 && a12 == 0) && a4 == 14) && (((a1 <= 218 && a19 == 9) && 0 < a1 + 13) && !(a10 == 1)) && !(a10 == 4)) || (a10 == 3 && (((a19 == 9 && a12 == 0) && !(a10 == 1)) && a1 + 13 <= 0) && a4 == 14)) || (((a10 == 1 && a12 == 0) && a1 + 13 <= 0) && a4 == 14)) || (((38 < a1 && a12 == 0) && a19 == 8) && a4 == 14)) || ((((218 < a1 && a1 <= 589891) && a10 == 1) && a12 == 0) && a4 == 14)) || ((((a10 == 1 && a12 == 0) && 56 <= a1) && a4 == 14) && (\exists v_prenex_41 : int :: ((v_prenex_41 <= 218 && 0 <= 5 * (v_prenex_41 / 5)) && a1 <= 5 * (v_prenex_41 / 5) / 5 + 505228) && 0 == v_prenex_41 % 5))) || (((a19 == 9 && a10 == 0) && a12 == 0) && a4 == 14)) || (((((a10 == 3 && 218 < a1) && a19 == 9) && a12 == 0) && a4 == 14) && a1 <= 589865)) || ((((a10 == 1 && a12 == 0) && a1 <= 12) && !(a19 == 9)) && a4 == 14)) || ((((a10 == 3 && a12 == 0) && a1 <= 12) && a4 == 14) && (((a1 <= 218 && a19 == 9) && 0 < a1 + 13) && !(a10 == 1)) && !(a10 == 4))) || (!(a19 == 8) && a19 <= 8)) || (((a12 == 0 && a19 == 8) && a1 + 13 <= 0) && a4 == 14)) || ((((a10 == 2 && a12 == 0) && a1 <= 12) && a4 == 14) && (((a1 <= 218 && a19 == 9) && 0 < a1 + 13) && !(a10 == 1)) && !(a10 == 4))) || (a1 <= 218 && (a10 == 0 && a12 == 0) && a4 == 14)) || (a19 == 8 && !(a10 == 4))) || ((((218 < a1 && a10 == 2) && a19 == 9) && a12 == 0) && a4 == 14)) || (a10 == 2 && (((a19 == 9 && a12 == 0) && !(a10 == 1)) && a1 + 13 <= 0) && a4 == 14)) || ((((a1 <= 505232 && a19 == 9) && a10 == 4) && a12 == 0) && a4 == 14) - InvariantResult [Line: 20]: Loop Invariant [2018-10-24 16:05:29,172 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-10-24 16:05:29,172 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-10-24 16:05:29,173 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-10-24 16:05:29,173 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-10-24 16:05:29,174 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-10-24 16:05:29,175 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-10-24 16:05:29,175 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-10-24 16:05:29,175 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] Derived loop invariant: (((((((((((((((((a10 == 3 && ((38 < a1 && a12 == 0) && a4 == 14) && (((a1 <= 218 && a19 == 9) && 0 < a1 + 13) && !(a10 == 1)) && !(a10 == 4)) || (a10 == 3 && (((a19 == 9 && a12 == 0) && !(a10 == 1)) && a1 + 13 <= 0) && a4 == 14)) || (((a10 == 1 && a12 == 0) && a1 + 13 <= 0) && a4 == 14)) || (((38 < a1 && a12 == 0) && a19 == 8) && a4 == 14)) || ((((218 < a1 && a1 <= 589891) && a10 == 1) && a12 == 0) && a4 == 14)) || ((((a10 == 1 && a12 == 0) && 56 <= a1) && a4 == 14) && (\exists v_prenex_41 : int :: ((v_prenex_41 <= 218 && 0 <= 5 * (v_prenex_41 / 5)) && a1 <= 5 * (v_prenex_41 / 5) / 5 + 505228) && 0 == v_prenex_41 % 5))) || (((a19 == 9 && a10 == 0) && a12 == 0) && a4 == 14)) || (((((a10 == 3 && 218 < a1) && a19 == 9) && a12 == 0) && a4 == 14) && a1 <= 589865)) || ((((a10 == 1 && a12 == 0) && a1 <= 12) && !(a19 == 9)) && a4 == 14)) || ((((a10 == 3 && a12 == 0) && a1 <= 12) && a4 == 14) && (((a1 <= 218 && a19 == 9) && 0 < a1 + 13) && !(a10 == 1)) && !(a10 == 4))) || (!(a19 == 8) && a19 <= 8)) || (((a12 == 0 && a19 == 8) && a1 + 13 <= 0) && a4 == 14)) || ((((a10 == 2 && a12 == 0) && a1 <= 12) && a4 == 14) && (((a1 <= 218 && a19 == 9) && 0 < a1 + 13) && !(a10 == 1)) && !(a10 == 4))) || (a1 <= 218 && (a10 == 0 && a12 == 0) && a4 == 14)) || (a19 == 8 && !(a10 == 4))) || ((((218 < a1 && a10 == 2) && a19 == 9) && a12 == 0) && a4 == 14)) || (a10 == 2 && (((a19 == 9 && a12 == 0) && !(a10 == 1)) && a1 + 13 <= 0) && a4 == 14)) || ((((a1 <= 505232 && a19 == 9) && a10 == 4) && a12 == 0) && a4 == 14) - InvariantResult [Line: 576]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 207 locations, 1 error locations. SAFE Result, 143.7s OverallTime, 13 OverallIterations, 7 TraceHistogramMax, 122.9s AutomataDifference, 0.0s DeadEndRemovalTime, 7.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 1313 SDtfs, 6775 SDslu, 795 SDs, 0 SdLazy, 15850 SolverSat, 2361 SolverUnsat, 43 SolverUnknown, 0 SolverNotchecked, 116.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2228 GetRequests, 2143 SyntacticMatches, 10 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 6.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4124occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 13 MinimizatonAttempts, 8181 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 137 NumberOfFragments, 719 HoareAnnotationTreeSize, 3 FomulaSimplifications, 33958 FormulaSimplificationTreeSizeReduction, 0.7s HoareSimplificationTime, 3 FomulaSimplificationsInter, 33770 FormulaSimplificationTreeSizeReductionInter, 6.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 9.4s InterpolantComputationTime, 5756 NumberOfCodeBlocks, 5756 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 5738 ConstructedInterpolants, 204 QuantifiedInterpolants, 11769952 SizeOfPredicates, 9 NumberOfNonLiveVariables, 2816 ConjunctsInSsa, 31 ConjunctsInUnsatCore, 18 InterpolantComputations, 10 PerfectInterpolantSequences, 5918/7339 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...