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/Problem12_label25_false-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 14:01:51,318 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 14:01:51,320 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 14:01:51,332 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 14:01:51,333 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 14:01:51,334 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 14:01:51,335 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 14:01:51,337 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 14:01:51,338 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 14:01:51,339 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 14:01:51,340 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 14:01:51,340 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 14:01:51,341 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 14:01:51,342 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 14:01:51,343 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 14:01:51,344 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 14:01:51,345 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 14:01:51,347 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 14:01:51,349 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 14:01:51,350 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 14:01:51,351 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 14:01:51,353 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 14:01:51,355 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 14:01:51,355 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 14:01:51,356 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 14:01:51,356 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 14:01:51,357 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 14:01:51,358 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 14:01:51,359 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 14:01:51,360 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 14:01:51,360 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 14:01:51,361 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 14:01:51,361 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 14:01:51,362 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 14:01:51,363 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 14:01:51,363 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 14:01:51,364 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 14:01:51,382 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 14:01:51,383 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 14:01:51,384 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 14:01:51,384 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-24 14:01:51,385 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-24 14:01:51,385 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-24 14:01:51,385 INFO L133 SettingsManager]: * Use SBE=true [2018-10-24 14:01:51,385 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 14:01:51,386 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 14:01:51,389 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 14:01:51,389 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 14:01:51,389 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 14:01:51,389 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 14:01:51,390 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 14:01:51,390 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 14:01:51,390 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 14:01:51,390 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 14:01:51,390 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 14:01:51,391 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 14:01:51,391 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 14:01:51,391 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 14:01:51,391 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 14:01:51,391 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 14:01:51,392 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-24 14:01:51,392 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 14:01:51,392 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 14:01:51,392 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 14:01:51,392 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 14:01:51,441 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 14:01:51,454 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 14:01:51,458 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 14:01:51,459 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 14:01:51,460 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 14:01:51,461 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem12_label25_false-unreach-call.c [2018-10-24 14:01:51,523 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/88d39a919/2b600c8ff607445da6fd060bfb086741/FLAG7cd0cca3d [2018-10-24 14:01:52,303 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 14:01:52,304 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem12_label25_false-unreach-call.c [2018-10-24 14:01:52,336 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/88d39a919/2b600c8ff607445da6fd060bfb086741/FLAG7cd0cca3d [2018-10-24 14:01:52,358 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/88d39a919/2b600c8ff607445da6fd060bfb086741 [2018-10-24 14:01:52,371 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 14:01:52,373 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 14:01:52,374 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 14:01:52,374 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 14:01:52,380 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 14:01:52,381 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:01:52" (1/1) ... [2018-10-24 14:01:52,384 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31151419 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:01:52, skipping insertion in model container [2018-10-24 14:01:52,384 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:01:52" (1/1) ... [2018-10-24 14:01:52,395 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 14:01:52,547 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 14:01:53,820 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 14:01:53,825 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 14:01:54,444 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 14:01:54,480 INFO L193 MainTranslator]: Completed translation [2018-10-24 14:01:54,481 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:01:54 WrapperNode [2018-10-24 14:01:54,482 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 14:01:54,485 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 14:01:54,486 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 14:01:54,486 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 14:01:54,496 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:01:54" (1/1) ... [2018-10-24 14:01:54,576 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:01:54" (1/1) ... [2018-10-24 14:01:55,152 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 14:01:55,152 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 14:01:55,153 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 14:01:55,153 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 14:01:55,164 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:01:54" (1/1) ... [2018-10-24 14:01:55,165 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:01:54" (1/1) ... [2018-10-24 14:01:55,211 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:01:54" (1/1) ... [2018-10-24 14:01:55,212 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:01:54" (1/1) ... [2018-10-24 14:01:55,365 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:01:54" (1/1) ... [2018-10-24 14:01:55,395 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:01:54" (1/1) ... [2018-10-24 14:01:55,439 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:01:54" (1/1) ... [2018-10-24 14:01:55,505 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 14:01:55,506 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 14:01:55,506 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 14:01:55,506 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 14:01:55,507 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:01:54" (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 14:01:55,574 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-24 14:01:55,574 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 14:01:55,574 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 14:02:04,123 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 14:02:04,123 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:02:04 BoogieIcfgContainer [2018-10-24 14:02:04,124 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 14:02:04,125 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 14:02:04,125 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 14:02:04,128 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 14:02:04,128 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 02:01:52" (1/3) ... [2018-10-24 14:02:04,129 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@129d6f54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:02:04, skipping insertion in model container [2018-10-24 14:02:04,129 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:01:54" (2/3) ... [2018-10-24 14:02:04,130 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@129d6f54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:02:04, skipping insertion in model container [2018-10-24 14:02:04,130 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:02:04" (3/3) ... [2018-10-24 14:02:04,132 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem12_label25_false-unreach-call.c [2018-10-24 14:02:04,142 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 14:02:04,150 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 14:02:04,168 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 14:02:04,212 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-24 14:02:04,213 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 14:02:04,213 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 14:02:04,213 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 14:02:04,213 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 14:02:04,213 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 14:02:04,213 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 14:02:04,214 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 14:02:04,214 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 14:02:04,246 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states. [2018-10-24 14:02:04,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-24 14:02:04,254 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:02:04,255 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:02:04,257 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:02:04,263 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:02:04,264 INFO L82 PathProgramCache]: Analyzing trace with hash 670581594, now seen corresponding path program 1 times [2018-10-24 14:02:04,266 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:02:04,266 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:02:04,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:02:04,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:02:04,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:02:04,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:02:04,585 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 14:02:04,589 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:02:04,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:02:04,594 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:02:04,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:02:04,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:02:04,614 INFO L87 Difference]: Start difference. First operand 819 states. Second operand 4 states. [2018-10-24 14:02:17,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:02:17,486 INFO L93 Difference]: Finished difference Result 3146 states and 6134 transitions. [2018-10-24 14:02:17,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:02:17,488 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-10-24 14:02:17,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:02:17,534 INFO L225 Difference]: With dead ends: 3146 [2018-10-24 14:02:17,534 INFO L226 Difference]: Without dead ends: 2320 [2018-10-24 14:02:17,542 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 14:02:17,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2320 states. [2018-10-24 14:02:17,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2320 to 2320. [2018-10-24 14:02:17,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2320 states. [2018-10-24 14:02:17,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2320 states to 2320 states and 4229 transitions. [2018-10-24 14:02:17,704 INFO L78 Accepts]: Start accepts. Automaton has 2320 states and 4229 transitions. Word has length 18 [2018-10-24 14:02:17,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:02:17,705 INFO L481 AbstractCegarLoop]: Abstraction has 2320 states and 4229 transitions. [2018-10-24 14:02:17,705 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:02:17,705 INFO L276 IsEmpty]: Start isEmpty. Operand 2320 states and 4229 transitions. [2018-10-24 14:02:17,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-10-24 14:02:17,709 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:02:17,710 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:02:17,710 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:02:17,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:02:17,711 INFO L82 PathProgramCache]: Analyzing trace with hash 446746015, now seen corresponding path program 1 times [2018-10-24 14:02:17,711 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:02:17,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:02:17,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:02:17,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:02:17,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:02:17,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:02:18,033 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:02:18,034 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:02:18,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:02:18,037 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:02:18,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:02:18,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:02:18,038 INFO L87 Difference]: Start difference. First operand 2320 states and 4229 transitions. Second operand 4 states. [2018-10-24 14:02:28,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:02:28,024 INFO L93 Difference]: Finished difference Result 9150 states and 16788 transitions. [2018-10-24 14:02:28,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:02:28,025 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2018-10-24 14:02:28,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:02:28,061 INFO L225 Difference]: With dead ends: 9150 [2018-10-24 14:02:28,062 INFO L226 Difference]: Without dead ends: 6832 [2018-10-24 14:02:28,066 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 14:02:28,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6832 states. [2018-10-24 14:02:28,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6832 to 6832. [2018-10-24 14:02:28,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6832 states. [2018-10-24 14:02:28,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6832 states to 6832 states and 10629 transitions. [2018-10-24 14:02:28,197 INFO L78 Accepts]: Start accepts. Automaton has 6832 states and 10629 transitions. Word has length 94 [2018-10-24 14:02:28,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:02:28,198 INFO L481 AbstractCegarLoop]: Abstraction has 6832 states and 10629 transitions. [2018-10-24 14:02:28,198 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:02:28,199 INFO L276 IsEmpty]: Start isEmpty. Operand 6832 states and 10629 transitions. [2018-10-24 14:02:28,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-10-24 14:02:28,203 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:02:28,203 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:02:28,204 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:02:28,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:02:28,204 INFO L82 PathProgramCache]: Analyzing trace with hash 343230256, now seen corresponding path program 1 times [2018-10-24 14:02:28,204 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:02:28,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:02:28,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:02:28,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:02:28,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:02:28,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:02:28,482 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 6 DAG size of output: 3 [2018-10-24 14:02:28,504 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:02:28,505 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:02:28,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:02:28,505 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:02:28,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:02:28,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:02:28,506 INFO L87 Difference]: Start difference. First operand 6832 states and 10629 transitions. Second operand 4 states. [2018-10-24 14:02:37,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:02:37,033 INFO L93 Difference]: Finished difference Result 27260 states and 42449 transitions. [2018-10-24 14:02:37,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:02:37,033 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2018-10-24 14:02:37,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:02:37,111 INFO L225 Difference]: With dead ends: 27260 [2018-10-24 14:02:37,112 INFO L226 Difference]: Without dead ends: 20430 [2018-10-24 14:02:37,124 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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 14:02:37,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20430 states. [2018-10-24 14:02:37,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20430 to 13600. [2018-10-24 14:02:37,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13600 states. [2018-10-24 14:02:37,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13600 states to 13600 states and 19341 transitions. [2018-10-24 14:02:37,419 INFO L78 Accepts]: Start accepts. Automaton has 13600 states and 19341 transitions. Word has length 100 [2018-10-24 14:02:37,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:02:37,420 INFO L481 AbstractCegarLoop]: Abstraction has 13600 states and 19341 transitions. [2018-10-24 14:02:37,420 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:02:37,422 INFO L276 IsEmpty]: Start isEmpty. Operand 13600 states and 19341 transitions. [2018-10-24 14:02:37,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-10-24 14:02:37,428 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:02:37,428 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:02:37,432 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:02:37,432 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:02:37,432 INFO L82 PathProgramCache]: Analyzing trace with hash -544105501, now seen corresponding path program 1 times [2018-10-24 14:02:37,433 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:02:37,433 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:02:37,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:02:37,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:02:37,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:02:37,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:02:37,658 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:02:37,658 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:02:37,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:02:37,659 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:02:37,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:02:37,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:02:37,660 INFO L87 Difference]: Start difference. First operand 13600 states and 19341 transitions. Second operand 4 states. [2018-10-24 14:02:46,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:02:46,386 INFO L93 Difference]: Finished difference Result 52783 states and 74748 transitions. [2018-10-24 14:02:46,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:02:46,386 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 118 [2018-10-24 14:02:46,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:02:46,461 INFO L225 Difference]: With dead ends: 52783 [2018-10-24 14:02:46,461 INFO L226 Difference]: Without dead ends: 39185 [2018-10-24 14:02:46,482 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:02:46,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39185 states. [2018-10-24 14:02:46,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39185 to 26384. [2018-10-24 14:02:46,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26384 states. [2018-10-24 14:02:46,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26384 states to 26384 states and 33902 transitions. [2018-10-24 14:02:46,915 INFO L78 Accepts]: Start accepts. Automaton has 26384 states and 33902 transitions. Word has length 118 [2018-10-24 14:02:46,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:02:46,916 INFO L481 AbstractCegarLoop]: Abstraction has 26384 states and 33902 transitions. [2018-10-24 14:02:46,916 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:02:46,916 INFO L276 IsEmpty]: Start isEmpty. Operand 26384 states and 33902 transitions. [2018-10-24 14:02:46,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2018-10-24 14:02:46,921 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:02:46,922 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:02:46,922 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:02:46,922 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:02:46,922 INFO L82 PathProgramCache]: Analyzing trace with hash -1050401920, now seen corresponding path program 1 times [2018-10-24 14:02:46,923 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:02:46,923 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:02:46,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:02:46,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:02:46,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:02:46,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:02:47,377 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:02:47,377 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:02:47,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 14:02:47,378 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:02:47,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:02:47,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:02:47,379 INFO L87 Difference]: Start difference. First operand 26384 states and 33902 transitions. Second operand 4 states. [2018-10-24 14:02:57,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:02:57,668 INFO L93 Difference]: Finished difference Result 52766 states and 67802 transitions. [2018-10-24 14:02:57,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:02:57,676 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 247 [2018-10-24 14:02:57,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:02:57,721 INFO L225 Difference]: With dead ends: 52766 [2018-10-24 14:02:57,722 INFO L226 Difference]: Without dead ends: 26384 [2018-10-24 14:02:57,745 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:02:57,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26384 states. [2018-10-24 14:02:58,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26384 to 26384. [2018-10-24 14:02:58,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26384 states. [2018-10-24 14:02:58,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26384 states to 26384 states and 32888 transitions. [2018-10-24 14:02:58,042 INFO L78 Accepts]: Start accepts. Automaton has 26384 states and 32888 transitions. Word has length 247 [2018-10-24 14:02:58,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:02:58,043 INFO L481 AbstractCegarLoop]: Abstraction has 26384 states and 32888 transitions. [2018-10-24 14:02:58,043 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:02:58,044 INFO L276 IsEmpty]: Start isEmpty. Operand 26384 states and 32888 transitions. [2018-10-24 14:02:58,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2018-10-24 14:02:58,048 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:02:58,049 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:02:58,049 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:02:58,049 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:02:58,049 INFO L82 PathProgramCache]: Analyzing trace with hash -827461878, now seen corresponding path program 1 times [2018-10-24 14:02:58,050 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:02:58,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:02:58,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:02:58,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:02:58,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:02:58,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:02:58,450 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-10-24 14:02:58,450 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:02:58,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-24 14:02:58,451 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 14:02:58,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 14:02:58,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 14:02:58,452 INFO L87 Difference]: Start difference. First operand 26384 states and 32888 transitions. Second operand 5 states. [2018-10-24 14:03:07,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:03:07,183 INFO L93 Difference]: Finished difference Result 98638 states and 123348 transitions. [2018-10-24 14:03:07,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:03:07,184 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 251 [2018-10-24 14:03:07,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:03:07,279 INFO L225 Difference]: With dead ends: 98638 [2018-10-24 14:03:07,280 INFO L226 Difference]: Without dead ends: 72256 [2018-10-24 14:03:07,310 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 14:03:07,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72256 states. [2018-10-24 14:03:07,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72256 to 72256. [2018-10-24 14:03:07,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72256 states. [2018-10-24 14:03:08,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72256 states to 72256 states and 84563 transitions. [2018-10-24 14:03:08,097 INFO L78 Accepts]: Start accepts. Automaton has 72256 states and 84563 transitions. Word has length 251 [2018-10-24 14:03:08,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:03:08,098 INFO L481 AbstractCegarLoop]: Abstraction has 72256 states and 84563 transitions. [2018-10-24 14:03:08,098 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 14:03:08,098 INFO L276 IsEmpty]: Start isEmpty. Operand 72256 states and 84563 transitions. [2018-10-24 14:03:08,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2018-10-24 14:03:08,110 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:03:08,111 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:03:08,111 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:03:08,111 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:03:08,111 INFO L82 PathProgramCache]: Analyzing trace with hash 891280383, now seen corresponding path program 1 times [2018-10-24 14:03:08,111 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:03:08,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:03:08,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:03:08,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:03:08,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:03:08,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:03:08,661 WARN L179 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 9 [2018-10-24 14:03:08,982 WARN L179 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 9 [2018-10-24 14:03:09,172 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 19 [2018-10-24 14:03:09,259 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 203 proven. 5 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-10-24 14:03:09,259 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 14:03:09,259 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 14:03:09,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:03:09,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:03:09,386 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 14:03:09,632 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 208 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-10-24 14:03:09,657 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 14:03:09,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2018-10-24 14:03:09,658 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 14:03:09,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 14:03:09,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-10-24 14:03:09,659 INFO L87 Difference]: Start difference. First operand 72256 states and 84563 transitions. Second operand 6 states. [2018-10-24 14:03:28,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:03:28,881 INFO L93 Difference]: Finished difference Result 176128 states and 202657 transitions. [2018-10-24 14:03:28,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-24 14:03:28,882 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 275 [2018-10-24 14:03:28,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:03:29,190 INFO L225 Difference]: With dead ends: 176128 [2018-10-24 14:03:29,190 INFO L226 Difference]: Without dead ends: 102367 [2018-10-24 14:03:29,227 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 276 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-10-24 14:03:29,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102367 states. [2018-10-24 14:03:30,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102367 to 73759. [2018-10-24 14:03:30,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73759 states. [2018-10-24 14:03:30,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73759 states to 73759 states and 84004 transitions. [2018-10-24 14:03:30,466 INFO L78 Accepts]: Start accepts. Automaton has 73759 states and 84004 transitions. Word has length 275 [2018-10-24 14:03:30,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:03:30,467 INFO L481 AbstractCegarLoop]: Abstraction has 73759 states and 84004 transitions. [2018-10-24 14:03:30,467 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 14:03:30,467 INFO L276 IsEmpty]: Start isEmpty. Operand 73759 states and 84004 transitions. [2018-10-24 14:03:30,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2018-10-24 14:03:30,476 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:03:30,477 INFO L375 BasicCegarLoop]: trace histogram [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, 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] [2018-10-24 14:03:30,477 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:03:30,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:03:30,477 INFO L82 PathProgramCache]: Analyzing trace with hash 28154518, now seen corresponding path program 1 times [2018-10-24 14:03:30,477 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:03:30,478 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:03:30,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:03:30,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:03:30,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:03:30,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:03:30,861 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2018-10-24 14:03:30,861 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:03:30,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:03:30,862 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:03:30,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:03:30,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:03:30,863 INFO L87 Difference]: Start difference. First operand 73759 states and 84004 transitions. Second operand 3 states. [2018-10-24 14:03:37,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:03:37,338 INFO L93 Difference]: Finished difference Result 162556 states and 184984 transitions. [2018-10-24 14:03:37,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:03:37,341 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 278 [2018-10-24 14:03:37,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:03:37,436 INFO L225 Difference]: With dead ends: 162556 [2018-10-24 14:03:37,437 INFO L226 Difference]: Without dead ends: 89551 [2018-10-24 14:03:37,489 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:03:37,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89551 states. [2018-10-24 14:03:39,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89551 to 89551. [2018-10-24 14:03:39,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89551 states. [2018-10-24 14:03:39,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89551 states to 89551 states and 100849 transitions. [2018-10-24 14:03:39,179 INFO L78 Accepts]: Start accepts. Automaton has 89551 states and 100849 transitions. Word has length 278 [2018-10-24 14:03:39,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:03:39,180 INFO L481 AbstractCegarLoop]: Abstraction has 89551 states and 100849 transitions. [2018-10-24 14:03:39,180 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:03:39,180 INFO L276 IsEmpty]: Start isEmpty. Operand 89551 states and 100849 transitions. [2018-10-24 14:03:39,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2018-10-24 14:03:39,212 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:03:39,212 INFO L375 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:03:39,212 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:03:39,213 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:03:39,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1666325953, now seen corresponding path program 1 times [2018-10-24 14:03:39,213 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:03:39,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:03:39,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:03:39,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:03:39,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:03:39,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:03:39,600 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-24 14:03:40,173 WARN L179 SmtUtils]: Spent 524.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 23 [2018-10-24 14:03:40,468 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 226 proven. 0 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2018-10-24 14:03:40,468 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:03:40,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-24 14:03:40,469 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 14:03:40,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 14:03:40,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-10-24 14:03:40,469 INFO L87 Difference]: Start difference. First operand 89551 states and 100849 transitions. Second operand 6 states. [2018-10-24 14:03:50,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:03:50,851 INFO L93 Difference]: Finished difference Result 207677 states and 235838 transitions. [2018-10-24 14:03:50,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 14:03:50,852 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 377 [2018-10-24 14:03:50,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:03:50,986 INFO L225 Difference]: With dead ends: 207677 [2018-10-24 14:03:50,986 INFO L226 Difference]: Without dead ends: 112101 [2018-10-24 14:03:51,054 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-10-24 14:03:51,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112101 states. [2018-10-24 14:03:52,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112101 to 110597. [2018-10-24 14:03:52,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110597 states. [2018-10-24 14:03:52,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110597 states to 110597 states and 122825 transitions. [2018-10-24 14:03:52,955 INFO L78 Accepts]: Start accepts. Automaton has 110597 states and 122825 transitions. Word has length 377 [2018-10-24 14:03:52,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:03:52,955 INFO L481 AbstractCegarLoop]: Abstraction has 110597 states and 122825 transitions. [2018-10-24 14:03:52,955 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 14:03:52,955 INFO L276 IsEmpty]: Start isEmpty. Operand 110597 states and 122825 transitions. [2018-10-24 14:03:52,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2018-10-24 14:03:52,982 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:03:52,983 INFO L375 BasicCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:03:52,983 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:03:52,983 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:03:52,984 INFO L82 PathProgramCache]: Analyzing trace with hash 1258323644, now seen corresponding path program 1 times [2018-10-24 14:03:52,984 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:03:52,984 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:03:52,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:03:52,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:03:52,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:03:53,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:03:53,289 INFO L134 CoverageAnalysis]: Checked inductivity of 614 backedges. 485 proven. 0 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2018-10-24 14:03:53,290 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:03:53,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:03:53,291 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:03:53,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:03:53,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:03:53,291 INFO L87 Difference]: Start difference. First operand 110597 states and 122825 transitions. Second operand 3 states. [2018-10-24 14:03:59,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:03:59,190 INFO L93 Difference]: Finished difference Result 241496 states and 268474 transitions. [2018-10-24 14:03:59,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:03:59,191 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 459 [2018-10-24 14:03:59,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:03:59,443 INFO L225 Difference]: With dead ends: 241496 [2018-10-24 14:03:59,443 INFO L226 Difference]: Without dead ends: 131653 [2018-10-24 14:03:59,527 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:03:59,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131653 states. [2018-10-24 14:04:02,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131653 to 130901. [2018-10-24 14:04:02,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130901 states. [2018-10-24 14:04:02,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130901 states to 130901 states and 142197 transitions. [2018-10-24 14:04:02,402 INFO L78 Accepts]: Start accepts. Automaton has 130901 states and 142197 transitions. Word has length 459 [2018-10-24 14:04:02,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:04:02,403 INFO L481 AbstractCegarLoop]: Abstraction has 130901 states and 142197 transitions. [2018-10-24 14:04:02,403 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:04:02,403 INFO L276 IsEmpty]: Start isEmpty. Operand 130901 states and 142197 transitions. [2018-10-24 14:04:02,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 498 [2018-10-24 14:04:02,429 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:04:02,429 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:04:02,430 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:04:02,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:04:02,431 INFO L82 PathProgramCache]: Analyzing trace with hash 1041678296, now seen corresponding path program 1 times [2018-10-24 14:04:02,431 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:04:02,432 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:04:02,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:04:02,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:04:02,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:04:02,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:04:03,183 INFO L134 CoverageAnalysis]: Checked inductivity of 838 backedges. 585 proven. 8 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2018-10-24 14:04:03,183 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 14:04:03,183 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) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 14:04:03,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:04:03,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:04:03,328 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 14:04:03,481 INFO L134 CoverageAnalysis]: Checked inductivity of 838 backedges. 359 proven. 0 refuted. 0 times theorem prover too weak. 479 trivial. 0 not checked. [2018-10-24 14:04:03,502 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 14:04:03,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2018-10-24 14:04:03,503 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-24 14:04:03,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-24 14:04:03,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-10-24 14:04:03,504 INFO L87 Difference]: Start difference. First operand 130901 states and 142197 transitions. Second operand 7 states. [2018-10-24 14:04:19,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:04:19,730 INFO L93 Difference]: Finished difference Result 258787 states and 281383 transitions. [2018-10-24 14:04:19,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-24 14:04:19,738 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 497 [2018-10-24 14:04:19,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:04:19,930 INFO L225 Difference]: With dead ends: 258787 [2018-10-24 14:04:19,930 INFO L226 Difference]: Without dead ends: 128640 [2018-10-24 14:04:20,020 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 508 GetRequests, 499 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-10-24 14:04:20,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128640 states. [2018-10-24 14:04:22,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128640 to 125632. [2018-10-24 14:04:22,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125632 states. [2018-10-24 14:04:22,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125632 states to 125632 states and 132732 transitions. [2018-10-24 14:04:22,334 INFO L78 Accepts]: Start accepts. Automaton has 125632 states and 132732 transitions. Word has length 497 [2018-10-24 14:04:22,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:04:22,334 INFO L481 AbstractCegarLoop]: Abstraction has 125632 states and 132732 transitions. [2018-10-24 14:04:22,334 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-24 14:04:22,334 INFO L276 IsEmpty]: Start isEmpty. Operand 125632 states and 132732 transitions. [2018-10-24 14:04:22,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 699 [2018-10-24 14:04:22,374 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:04:22,375 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:04:22,375 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:04:22,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:04:22,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1463867924, now seen corresponding path program 1 times [2018-10-24 14:04:22,376 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:04:22,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:04:22,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:04:22,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:04:22,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:04:22,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:04:24,357 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 310 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2018-10-24 14:04:24,357 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:04:24,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 14:04:24,358 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:04:24,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:04:24,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:04:24,358 INFO L87 Difference]: Start difference. First operand 125632 states and 132732 transitions. Second operand 4 states. [2018-10-24 14:04:31,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:04:31,664 INFO L93 Difference]: Finished difference Result 261790 states and 276791 transitions. [2018-10-24 14:04:31,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:04:31,665 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 698 [2018-10-24 14:04:31,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:04:31,832 INFO L225 Difference]: With dead ends: 261790 [2018-10-24 14:04:31,832 INFO L226 Difference]: Without dead ends: 136912 [2018-10-24 14:04:31,910 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 14:04:32,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136912 states. [2018-10-24 14:04:34,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136912 to 133904. [2018-10-24 14:04:34,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133904 states. [2018-10-24 14:04:34,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133904 states to 133904 states and 140186 transitions. [2018-10-24 14:04:34,287 INFO L78 Accepts]: Start accepts. Automaton has 133904 states and 140186 transitions. Word has length 698 [2018-10-24 14:04:34,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:04:34,288 INFO L481 AbstractCegarLoop]: Abstraction has 133904 states and 140186 transitions. [2018-10-24 14:04:34,288 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:04:34,288 INFO L276 IsEmpty]: Start isEmpty. Operand 133904 states and 140186 transitions. [2018-10-24 14:04:34,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 906 [2018-10-24 14:04:34,354 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:04:34,355 INFO L375 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:04:34,355 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:04:34,355 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:04:34,356 INFO L82 PathProgramCache]: Analyzing trace with hash -28131880, now seen corresponding path program 1 times [2018-10-24 14:04:34,356 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:04:34,356 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:04:34,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:04:34,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:04:34,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:04:34,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:04:36,198 INFO L134 CoverageAnalysis]: Checked inductivity of 833 backedges. 738 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2018-10-24 14:04:36,198 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:04:36,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 14:04:36,199 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:04:36,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:04:36,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:04:36,200 INFO L87 Difference]: Start difference. First operand 133904 states and 140186 transitions. Second operand 4 states. [2018-10-24 14:04:45,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:04:45,489 INFO L93 Difference]: Finished difference Result 267054 states and 279613 transitions. [2018-10-24 14:04:45,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:04:45,489 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 905 [2018-10-24 14:04:45,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:04:45,609 INFO L225 Difference]: With dead ends: 267054 [2018-10-24 14:04:45,609 INFO L226 Difference]: Without dead ends: 129383 [2018-10-24 14:04:45,644 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 5 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 14:04:45,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129383 states. [2018-10-24 14:04:46,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129383 to 124871. [2018-10-24 14:04:46,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124871 states. [2018-10-24 14:04:46,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124871 states to 124871 states and 128727 transitions. [2018-10-24 14:04:46,700 INFO L78 Accepts]: Start accepts. Automaton has 124871 states and 128727 transitions. Word has length 905 [2018-10-24 14:04:46,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:04:46,701 INFO L481 AbstractCegarLoop]: Abstraction has 124871 states and 128727 transitions. [2018-10-24 14:04:46,701 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:04:46,701 INFO L276 IsEmpty]: Start isEmpty. Operand 124871 states and 128727 transitions. [2018-10-24 14:04:46,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 994 [2018-10-24 14:04:46,769 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:04:46,769 INFO L375 BasicCegarLoop]: trace histogram [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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:04:46,770 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:04:46,770 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:04:46,770 INFO L82 PathProgramCache]: Analyzing trace with hash 760328512, now seen corresponding path program 1 times [2018-10-24 14:04:46,771 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:04:46,771 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:04:46,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:04:46,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:04:46,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:04:46,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:04:47,994 WARN L179 SmtUtils]: Spent 840.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 8 [2018-10-24 14:04:48,955 INFO L134 CoverageAnalysis]: Checked inductivity of 1554 backedges. 1123 proven. 0 refuted. 0 times theorem prover too weak. 431 trivial. 0 not checked. [2018-10-24 14:04:48,955 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:04:48,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 14:04:48,957 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:04:48,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:04:48,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:04:48,958 INFO L87 Difference]: Start difference. First operand 124871 states and 128727 transitions. Second operand 4 states. [2018-10-24 14:04:55,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:04:55,435 INFO L93 Difference]: Finished difference Result 249740 states and 257451 transitions. [2018-10-24 14:04:55,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:04:55,436 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 993 [2018-10-24 14:04:55,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:04:55,558 INFO L225 Difference]: With dead ends: 249740 [2018-10-24 14:04:55,559 INFO L226 Difference]: Without dead ends: 120353 [2018-10-24 14:04:55,623 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:04:55,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120353 states. [2018-10-24 14:04:56,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120353 to 118849. [2018-10-24 14:04:56,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118849 states. [2018-10-24 14:04:56,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118849 states to 118849 states and 122482 transitions. [2018-10-24 14:04:56,886 INFO L78 Accepts]: Start accepts. Automaton has 118849 states and 122482 transitions. Word has length 993 [2018-10-24 14:04:56,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:04:56,887 INFO L481 AbstractCegarLoop]: Abstraction has 118849 states and 122482 transitions. [2018-10-24 14:04:56,887 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:04:56,887 INFO L276 IsEmpty]: Start isEmpty. Operand 118849 states and 122482 transitions. [2018-10-24 14:04:56,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1077 [2018-10-24 14:04:56,941 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:04:56,942 INFO L375 BasicCegarLoop]: trace histogram [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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:04:56,942 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:04:56,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:04:56,943 INFO L82 PathProgramCache]: Analyzing trace with hash 1341308809, now seen corresponding path program 1 times [2018-10-24 14:04:56,943 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:04:56,943 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:04:56,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:04:56,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:04:56,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:04:57,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:04:57,679 WARN L179 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2018-10-24 14:04:58,074 WARN L179 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 13 [2018-10-24 14:05:00,243 INFO L134 CoverageAnalysis]: Checked inductivity of 1725 backedges. 1014 proven. 461 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2018-10-24 14:05:00,244 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 14:05:00,244 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 14:05:00,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:05:00,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:05:00,513 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 14:05:01,169 INFO L134 CoverageAnalysis]: Checked inductivity of 1725 backedges. 1250 proven. 0 refuted. 0 times theorem prover too weak. 475 trivial. 0 not checked. [2018-10-24 14:05:01,190 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 14:05:01,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 11 [2018-10-24 14:05:01,194 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-24 14:05:01,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-24 14:05:01,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-10-24 14:05:01,194 INFO L87 Difference]: Start difference. First operand 118849 states and 122482 transitions. Second operand 11 states. Received shutdown request... [2018-10-24 14:05:40,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-24 14:05:40,531 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-24 14:05:40,539 WARN L205 ceAbstractionStarter]: Timeout [2018-10-24 14:05:40,539 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 02:05:40 BoogieIcfgContainer [2018-10-24 14:05:40,539 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-24 14:05:40,540 INFO L168 Benchmark]: Toolchain (without parser) took 228168.83 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 2.8 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2018-10-24 14:05:40,541 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 14:05:40,542 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2108.00 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 200.8 MB). Peak memory consumption was 200.8 MB. Max. memory is 7.1 GB. [2018-10-24 14:05:40,542 INFO L168 Benchmark]: Boogie Procedure Inliner took 666.78 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 795.3 MB). Free memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: -977.8 MB). Peak memory consumption was 58.1 MB. Max. memory is 7.1 GB. [2018-10-24 14:05:40,543 INFO L168 Benchmark]: Boogie Preprocessor took 353.12 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: 49.7 MB). Peak memory consumption was 49.7 MB. Max. memory is 7.1 GB. [2018-10-24 14:05:40,544 INFO L168 Benchmark]: RCFGBuilder took 8617.86 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 235.9 MB). Free memory was 2.1 GB in the beginning and 2.4 GB in the end (delta: -212.3 MB). Peak memory consumption was 632.9 MB. Max. memory is 7.1 GB. [2018-10-24 14:05:40,545 INFO L168 Benchmark]: TraceAbstraction took 216414.62 ms. Allocated memory was 2.6 GB in the beginning and 4.2 GB in the end (delta: 1.6 GB). Free memory was 2.4 GB in the beginning and 2.8 GB in the end (delta: -447.0 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2018-10-24 14:05:40,550 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 2108.00 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 200.8 MB). Peak memory consumption was 200.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 666.78 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 795.3 MB). Free memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: -977.8 MB). Peak memory consumption was 58.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 353.12 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: 49.7 MB). Peak memory consumption was 49.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 8617.86 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 235.9 MB). Free memory was 2.1 GB in the beginning and 2.4 GB in the end (delta: -212.3 MB). Peak memory consumption was 632.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 216414.62 ms. Allocated memory was 2.6 GB in the beginning and 4.2 GB in the end (delta: 1.6 GB). Free memory was 2.4 GB in the beginning and 2.8 GB in the end (delta: -447.0 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 63]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 63). Cancelled while BasicCegarLoop was constructing difference of abstraction (118849states) and FLOYD_HOARE automaton (currently 18 states, 11 states before enhancement),while ReachableStatesComputation was computing reachable states (165447 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 819 locations, 1 error locations. TIMEOUT Result, 216.3s OverallTime, 15 OverallIterations, 7 TraceHistogramMax, 182.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8328 SDtfs, 36547 SDslu, 1924 SDs, 0 SdLazy, 112639 SolverSat, 14889 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 142.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1956 GetRequests, 1879 SyntacticMatches, 22 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 6.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=133904occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 16.8s AutomataMinimizationTime, 14 MinimizatonAttempts, 62527 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 9.4s InterpolantComputationTime, 8234 NumberOfCodeBlocks, 8234 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 8216 ConstructedInterpolants, 0 QuantifiedInterpolants, 13098182 SizeOfPredicates, 6 NumberOfNonLiveVariables, 2345 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 18 InterpolantComputations, 15 PerfectInterpolantSequences, 9505/9979 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown