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_label23_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1dbac8b [2018-10-26 21:17:42,275 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 21:17:42,277 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 21:17:42,289 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 21:17:42,289 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 21:17:42,290 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 21:17:42,292 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 21:17:42,294 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 21:17:42,296 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 21:17:42,297 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 21:17:42,298 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 21:17:42,298 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 21:17:42,299 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 21:17:42,300 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 21:17:42,303 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 21:17:42,304 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 21:17:42,305 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 21:17:42,310 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 21:17:42,316 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 21:17:42,319 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 21:17:42,320 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 21:17:42,322 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 21:17:42,324 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 21:17:42,324 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 21:17:42,324 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 21:17:42,325 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 21:17:42,326 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 21:17:42,327 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 21:17:42,328 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 21:17:42,329 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 21:17:42,329 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 21:17:42,330 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 21:17:42,330 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 21:17:42,330 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 21:17:42,331 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 21:17:42,332 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 21:17:42,332 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-26 21:17:42,356 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 21:17:42,356 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 21:17:42,358 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 21:17:42,358 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-26 21:17:42,358 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-26 21:17:42,359 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-26 21:17:42,359 INFO L133 SettingsManager]: * Use SBE=true [2018-10-26 21:17:42,359 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 21:17:42,359 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 21:17:42,359 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 21:17:42,361 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 21:17:42,361 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 21:17:42,361 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 21:17:42,361 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 21:17:42,361 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 21:17:42,362 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 21:17:42,362 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 21:17:42,362 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 21:17:42,362 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 21:17:42,362 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 21:17:42,363 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 21:17:42,364 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 21:17:42,364 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 21:17:42,364 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-26 21:17:42,364 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 21:17:42,364 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 21:17:42,365 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-26 21:17:42,365 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-26 21:17:42,419 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 21:17:42,435 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 21:17:42,440 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 21:17:42,442 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 21:17:42,442 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 21:17:42,443 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem12_label23_true-unreach-call.c [2018-10-26 21:17:42,513 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/f0980ea2f/2975db37bf244cdcb5c75a781fb26c68/FLAGfa7bb71f1 [2018-10-26 21:17:43,296 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 21:17:43,297 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem12_label23_true-unreach-call.c [2018-10-26 21:17:43,326 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/f0980ea2f/2975db37bf244cdcb5c75a781fb26c68/FLAGfa7bb71f1 [2018-10-26 21:17:43,343 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/f0980ea2f/2975db37bf244cdcb5c75a781fb26c68 [2018-10-26 21:17:43,356 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 21:17:43,359 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-26 21:17:43,361 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 21:17:43,361 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 21:17:43,365 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 21:17:43,367 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 09:17:43" (1/1) ... [2018-10-26 21:17:43,370 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a79e33f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:17:43, skipping insertion in model container [2018-10-26 21:17:43,370 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 09:17:43" (1/1) ... [2018-10-26 21:17:43,382 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 21:17:43,557 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 21:17:44,802 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 21:17:44,807 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 21:17:45,578 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 21:17:45,617 INFO L193 MainTranslator]: Completed translation [2018-10-26 21:17:45,617 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:17:45 WrapperNode [2018-10-26 21:17:45,618 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 21:17:45,619 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 21:17:45,619 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 21:17:45,619 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 21:17:45,633 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:17:45" (1/1) ... [2018-10-26 21:17:45,700 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:17:45" (1/1) ... [2018-10-26 21:17:46,319 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 21:17:46,320 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 21:17:46,320 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 21:17:46,320 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 21:17:46,332 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:17:45" (1/1) ... [2018-10-26 21:17:46,332 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:17:45" (1/1) ... [2018-10-26 21:17:46,372 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:17:45" (1/1) ... [2018-10-26 21:17:46,372 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:17:45" (1/1) ... [2018-10-26 21:17:46,542 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:17:45" (1/1) ... [2018-10-26 21:17:46,599 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:17:45" (1/1) ... [2018-10-26 21:17:46,685 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:17:45" (1/1) ... [2018-10-26 21:17:46,798 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 21:17:46,799 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 21:17:46,799 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 21:17:46,799 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 21:17:46,800 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:17:45" (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-26 21:17:46,870 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-26 21:17:46,871 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 21:17:46,871 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 21:17:56,064 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 21:17:56,064 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 09:17:56 BoogieIcfgContainer [2018-10-26 21:17:56,065 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 21:17:56,066 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 21:17:56,066 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 21:17:56,070 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 21:17:56,070 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 09:17:43" (1/3) ... [2018-10-26 21:17:56,071 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54522f50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 09:17:56, skipping insertion in model container [2018-10-26 21:17:56,071 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:17:45" (2/3) ... [2018-10-26 21:17:56,072 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54522f50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 09:17:56, skipping insertion in model container [2018-10-26 21:17:56,073 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 09:17:56" (3/3) ... [2018-10-26 21:17:56,075 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem12_label23_true-unreach-call.c [2018-10-26 21:17:56,085 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 21:17:56,095 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-26 21:17:56,114 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-26 21:17:56,163 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-26 21:17:56,164 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 21:17:56,165 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 21:17:56,165 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 21:17:56,165 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 21:17:56,165 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 21:17:56,165 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 21:17:56,165 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 21:17:56,165 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 21:17:56,209 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states. [2018-10-26 21:17:56,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-26 21:17:56,218 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:17:56,219 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:17:56,222 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:17:56,228 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:17:56,229 INFO L82 PathProgramCache]: Analyzing trace with hash -1502078046, now seen corresponding path program 1 times [2018-10-26 21:17:56,231 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:17:56,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:17:56,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:17:56,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:17:56,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:17:56,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:17:56,721 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-26 21:17:56,724 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:17:56,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:17:56,729 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 21:17:56,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 21:17:56,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:17:56,750 INFO L87 Difference]: Start difference. First operand 819 states. Second operand 4 states. [2018-10-26 21:18:11,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:18:11,067 INFO L93 Difference]: Finished difference Result 3146 states and 6134 transitions. [2018-10-26 21:18:11,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 21:18:11,069 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2018-10-26 21:18:11,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:18:11,116 INFO L225 Difference]: With dead ends: 3146 [2018-10-26 21:18:11,116 INFO L226 Difference]: Without dead ends: 2320 [2018-10-26 21:18:11,124 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-26 21:18:11,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2320 states. [2018-10-26 21:18:11,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2320 to 2320. [2018-10-26 21:18:11,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2320 states. [2018-10-26 21:18:11,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2320 states to 2320 states and 3858 transitions. [2018-10-26 21:18:11,296 INFO L78 Accepts]: Start accepts. Automaton has 2320 states and 3858 transitions. Word has length 36 [2018-10-26 21:18:11,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:18:11,297 INFO L481 AbstractCegarLoop]: Abstraction has 2320 states and 3858 transitions. [2018-10-26 21:18:11,297 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 21:18:11,297 INFO L276 IsEmpty]: Start isEmpty. Operand 2320 states and 3858 transitions. [2018-10-26 21:18:11,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-10-26 21:18:11,302 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:18:11,302 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-26 21:18:11,303 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:18:11,303 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:18:11,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1839671471, now seen corresponding path program 1 times [2018-10-26 21:18:11,304 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:18:11,304 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:18:11,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:18:11,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:18:11,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:18:11,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:18:11,590 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:18:11,591 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:18:11,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 21:18:11,594 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 21:18:11,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 21:18:11,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:18:11,595 INFO L87 Difference]: Start difference. First operand 2320 states and 3858 transitions. Second operand 4 states. [2018-10-26 21:18:24,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:18:24,351 INFO L93 Difference]: Finished difference Result 9150 states and 15304 transitions. [2018-10-26 21:18:24,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 21:18:24,351 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2018-10-26 21:18:24,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:18:24,384 INFO L225 Difference]: With dead ends: 9150 [2018-10-26 21:18:24,385 INFO L226 Difference]: Without dead ends: 6832 [2018-10-26 21:18:24,390 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:18:24,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6832 states. [2018-10-26 21:18:24,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6832 to 6832. [2018-10-26 21:18:24,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6832 states. [2018-10-26 21:18:24,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6832 states to 6832 states and 9936 transitions. [2018-10-26 21:18:24,515 INFO L78 Accepts]: Start accepts. Automaton has 6832 states and 9936 transitions. Word has length 108 [2018-10-26 21:18:24,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:18:24,516 INFO L481 AbstractCegarLoop]: Abstraction has 6832 states and 9936 transitions. [2018-10-26 21:18:24,516 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 21:18:24,516 INFO L276 IsEmpty]: Start isEmpty. Operand 6832 states and 9936 transitions. [2018-10-26 21:18:24,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-10-26 21:18:24,523 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:18:24,523 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-26 21:18:24,524 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:18:24,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:18:24,524 INFO L82 PathProgramCache]: Analyzing trace with hash 926228130, now seen corresponding path program 1 times [2018-10-26 21:18:24,524 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:18:24,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:18:24,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:18:24,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:18:24,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:18:24,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:18:24,832 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-26 21:18:25,024 WARN L179 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 16 [2018-10-26 21:18:25,181 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:18:25,182 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:18:25,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-26 21:18:25,183 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-26 21:18:25,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-26 21:18:25,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-10-26 21:18:25,183 INFO L87 Difference]: Start difference. First operand 6832 states and 9936 transitions. Second operand 6 states. [2018-10-26 21:18:39,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:18:39,021 INFO L93 Difference]: Finished difference Result 21934 states and 31609 transitions. [2018-10-26 21:18:39,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 21:18:39,022 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 114 [2018-10-26 21:18:39,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:18:39,087 INFO L225 Difference]: With dead ends: 21934 [2018-10-26 21:18:39,087 INFO L226 Difference]: Without dead ends: 15104 [2018-10-26 21:18:39,098 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-10-26 21:18:39,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15104 states. [2018-10-26 21:18:39,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15104 to 15104. [2018-10-26 21:18:39,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15104 states. [2018-10-26 21:18:39,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15104 states to 15104 states and 21135 transitions. [2018-10-26 21:18:39,386 INFO L78 Accepts]: Start accepts. Automaton has 15104 states and 21135 transitions. Word has length 114 [2018-10-26 21:18:39,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:18:39,387 INFO L481 AbstractCegarLoop]: Abstraction has 15104 states and 21135 transitions. [2018-10-26 21:18:39,387 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-26 21:18:39,387 INFO L276 IsEmpty]: Start isEmpty. Operand 15104 states and 21135 transitions. [2018-10-26 21:18:39,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2018-10-26 21:18:39,403 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:18:39,407 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-26 21:18:39,408 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:18:39,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:18:39,408 INFO L82 PathProgramCache]: Analyzing trace with hash 1799018400, now seen corresponding path program 1 times [2018-10-26 21:18:39,408 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:18:39,409 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:18:39,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:18:39,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:18:39,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:18:39,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:18:40,236 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 239 proven. 5 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2018-10-26 21:18:40,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:18:40,236 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-26 21:18:40,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:18:40,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:18:40,365 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:18:40,571 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 244 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2018-10-26 21:18:40,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 21:18:40,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2018-10-26 21:18:40,594 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-26 21:18:40,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-26 21:18:40,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-10-26 21:18:40,594 INFO L87 Difference]: Start difference. First operand 15104 states and 21135 transitions. Second operand 6 states. [2018-10-26 21:18:59,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:18:59,687 INFO L93 Difference]: Finished difference Result 65578 states and 91813 transitions. [2018-10-26 21:18:59,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-26 21:18:59,690 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 324 [2018-10-26 21:18:59,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:18:59,812 INFO L225 Difference]: With dead ends: 65578 [2018-10-26 21:18:59,812 INFO L226 Difference]: Without dead ends: 48969 [2018-10-26 21:18:59,837 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 325 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-10-26 21:18:59,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48969 states. [2018-10-26 21:19:00,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48969 to 26383. [2018-10-26 21:19:00,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26383 states. [2018-10-26 21:19:00,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26383 states to 26383 states and 31913 transitions. [2018-10-26 21:19:00,540 INFO L78 Accepts]: Start accepts. Automaton has 26383 states and 31913 transitions. Word has length 324 [2018-10-26 21:19:00,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:19:00,541 INFO L481 AbstractCegarLoop]: Abstraction has 26383 states and 31913 transitions. [2018-10-26 21:19:00,541 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-26 21:19:00,541 INFO L276 IsEmpty]: Start isEmpty. Operand 26383 states and 31913 transitions. [2018-10-26 21:19:00,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 468 [2018-10-26 21:19:00,569 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:19:00,570 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 21:19:00,570 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:19:00,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:19:00,571 INFO L82 PathProgramCache]: Analyzing trace with hash 1446599930, now seen corresponding path program 1 times [2018-10-26 21:19:00,571 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:19:00,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:19:00,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:19:00,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:19:00,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:19:00,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:19:01,384 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 499 proven. 0 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2018-10-26 21:19:01,384 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:19:01,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 21:19:01,385 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 21:19:01,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 21:19:01,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:19:01,386 INFO L87 Difference]: Start difference. First operand 26383 states and 31913 transitions. Second operand 4 states. [2018-10-26 21:19:13,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:19:13,255 INFO L93 Difference]: Finished difference Result 64044 states and 77732 transitions. [2018-10-26 21:19:13,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 21:19:13,259 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 467 [2018-10-26 21:19:13,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:19:13,321 INFO L225 Difference]: With dead ends: 64044 [2018-10-26 21:19:13,322 INFO L226 Difference]: Without dead ends: 38415 [2018-10-26 21:19:13,351 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-26 21:19:13,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38415 states. [2018-10-26 21:19:13,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38415 to 38415. [2018-10-26 21:19:13,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38415 states. [2018-10-26 21:19:13,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38415 states to 38415 states and 45629 transitions. [2018-10-26 21:19:13,788 INFO L78 Accepts]: Start accepts. Automaton has 38415 states and 45629 transitions. Word has length 467 [2018-10-26 21:19:13,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:19:13,789 INFO L481 AbstractCegarLoop]: Abstraction has 38415 states and 45629 transitions. [2018-10-26 21:19:13,789 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 21:19:13,789 INFO L276 IsEmpty]: Start isEmpty. Operand 38415 states and 45629 transitions. [2018-10-26 21:19:13,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2018-10-26 21:19:13,822 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:19:13,823 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 21:19:13,823 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:19:13,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:19:13,824 INFO L82 PathProgramCache]: Analyzing trace with hash 277246579, now seen corresponding path program 1 times [2018-10-26 21:19:13,824 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:19:13,824 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:19:13,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:19:13,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:19:13,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:19:13,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:19:14,548 INFO L134 CoverageAnalysis]: Checked inductivity of 711 backedges. 592 proven. 0 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2018-10-26 21:19:14,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:19:14,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:19:14,549 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 21:19:14,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 21:19:14,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 21:19:14,550 INFO L87 Difference]: Start difference. First operand 38415 states and 45629 transitions. Second operand 3 states. [2018-10-26 21:19:24,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:19:24,027 INFO L93 Difference]: Finished difference Result 92620 states and 112241 transitions. [2018-10-26 21:19:24,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 21:19:24,028 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 484 [2018-10-26 21:19:24,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:19:24,145 INFO L225 Difference]: With dead ends: 92620 [2018-10-26 21:19:24,146 INFO L226 Difference]: Without dead ends: 54959 [2018-10-26 21:19:24,183 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-26 21:19:24,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54959 states. [2018-10-26 21:19:24,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54959 to 54959. [2018-10-26 21:19:24,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54959 states. [2018-10-26 21:19:24,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54959 states to 54959 states and 66627 transitions. [2018-10-26 21:19:24,749 INFO L78 Accepts]: Start accepts. Automaton has 54959 states and 66627 transitions. Word has length 484 [2018-10-26 21:19:24,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:19:24,750 INFO L481 AbstractCegarLoop]: Abstraction has 54959 states and 66627 transitions. [2018-10-26 21:19:24,750 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 21:19:24,750 INFO L276 IsEmpty]: Start isEmpty. Operand 54959 states and 66627 transitions. [2018-10-26 21:19:24,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 613 [2018-10-26 21:19:24,803 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:19:24,803 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 21:19:24,804 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:19:24,804 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:19:24,804 INFO L82 PathProgramCache]: Analyzing trace with hash 1215082638, now seen corresponding path program 1 times [2018-10-26 21:19:24,804 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:19:24,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:19:24,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:19:24,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:19:24,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:19:24,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:19:25,795 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 429 proven. 4 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked. [2018-10-26 21:19:25,795 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:19:25,795 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-26 21:19:25,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:19:25,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:19:25,993 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:19:26,248 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 510 proven. 0 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2018-10-26 21:19:26,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 21:19:26,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2018-10-26 21:19:26,284 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 21:19:26,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 21:19:26,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:19:26,288 INFO L87 Difference]: Start difference. First operand 54959 states and 66627 transitions. Second operand 4 states. [2018-10-26 21:19:38,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:19:38,586 INFO L93 Difference]: Finished difference Result 175394 states and 213428 transitions. [2018-10-26 21:19:38,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 21:19:38,588 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 612 [2018-10-26 21:19:38,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:19:38,841 INFO L225 Difference]: With dead ends: 175394 [2018-10-26 21:19:38,842 INFO L226 Difference]: Without dead ends: 121189 [2018-10-26 21:19:38,892 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 615 GetRequests, 612 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-26 21:19:38,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121189 states. [2018-10-26 21:19:39,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121189 to 81279. [2018-10-26 21:19:39,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81279 states. [2018-10-26 21:19:39,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81279 states to 81279 states and 96271 transitions. [2018-10-26 21:19:39,999 INFO L78 Accepts]: Start accepts. Automaton has 81279 states and 96271 transitions. Word has length 612 [2018-10-26 21:19:40,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:19:40,000 INFO L481 AbstractCegarLoop]: Abstraction has 81279 states and 96271 transitions. [2018-10-26 21:19:40,000 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 21:19:40,000 INFO L276 IsEmpty]: Start isEmpty. Operand 81279 states and 96271 transitions. [2018-10-26 21:19:40,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 621 [2018-10-26 21:19:40,053 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:19:40,053 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 21:19:40,054 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:19:40,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:19:40,054 INFO L82 PathProgramCache]: Analyzing trace with hash -335196038, now seen corresponding path program 1 times [2018-10-26 21:19:40,054 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:19:40,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:19:40,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:19:40,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:19:40,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:19:40,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:19:40,590 INFO L134 CoverageAnalysis]: Checked inductivity of 660 backedges. 541 proven. 0 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2018-10-26 21:19:40,591 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:19:40,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:19:40,592 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 21:19:40,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 21:19:40,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 21:19:40,592 INFO L87 Difference]: Start difference. First operand 81279 states and 96271 transitions. Second operand 3 states. [2018-10-26 21:19:46,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:19:46,249 INFO L93 Difference]: Finished difference Result 176844 states and 209208 transitions. [2018-10-26 21:19:46,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 21:19:46,250 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 620 [2018-10-26 21:19:46,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:19:46,357 INFO L225 Difference]: With dead ends: 176844 [2018-10-26 21:19:46,357 INFO L226 Difference]: Without dead ends: 96319 [2018-10-26 21:19:46,416 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 21:19:46,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96319 states. [2018-10-26 21:19:47,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96319 to 94815. [2018-10-26 21:19:47,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94815 states. [2018-10-26 21:19:47,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94815 states to 94815 states and 109062 transitions. [2018-10-26 21:19:47,974 INFO L78 Accepts]: Start accepts. Automaton has 94815 states and 109062 transitions. Word has length 620 [2018-10-26 21:19:47,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:19:47,975 INFO L481 AbstractCegarLoop]: Abstraction has 94815 states and 109062 transitions. [2018-10-26 21:19:47,975 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 21:19:47,975 INFO L276 IsEmpty]: Start isEmpty. Operand 94815 states and 109062 transitions. [2018-10-26 21:19:48,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 639 [2018-10-26 21:19:48,004 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:19:48,005 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 21:19:48,005 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:19:48,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:19:48,006 INFO L82 PathProgramCache]: Analyzing trace with hash -1900591059, now seen corresponding path program 1 times [2018-10-26 21:19:48,006 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:19:48,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:19:48,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:19:48,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:19:48,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:19:48,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:19:48,759 INFO L134 CoverageAnalysis]: Checked inductivity of 712 backedges. 592 proven. 5 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2018-10-26 21:19:48,759 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:19:48,759 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-26 21:19:48,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:19:48,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:19:48,929 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:19:49,367 INFO L134 CoverageAnalysis]: Checked inductivity of 712 backedges. 539 proven. 0 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2018-10-26 21:19:49,406 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 21:19:49,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-10-26 21:19:49,408 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 21:19:49,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 21:19:49,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-26 21:19:49,410 INFO L87 Difference]: Start difference. First operand 94815 states and 109062 transitions. Second operand 5 states. [2018-10-26 21:20:07,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:20:07,569 INFO L93 Difference]: Finished difference Result 242268 states and 279453 transitions. [2018-10-26 21:20:07,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 21:20:07,569 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 638 [2018-10-26 21:20:07,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:20:07,729 INFO L225 Difference]: With dead ends: 242268 [2018-10-26 21:20:07,730 INFO L226 Difference]: Without dead ends: 148207 [2018-10-26 21:20:07,798 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 646 GetRequests, 640 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-26 21:20:07,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148207 states. [2018-10-26 21:20:09,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148207 to 145951. [2018-10-26 21:20:09,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145951 states. [2018-10-26 21:20:09,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145951 states to 145951 states and 160553 transitions. [2018-10-26 21:20:09,807 INFO L78 Accepts]: Start accepts. Automaton has 145951 states and 160553 transitions. Word has length 638 [2018-10-26 21:20:09,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:20:09,808 INFO L481 AbstractCegarLoop]: Abstraction has 145951 states and 160553 transitions. [2018-10-26 21:20:09,808 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 21:20:09,808 INFO L276 IsEmpty]: Start isEmpty. Operand 145951 states and 160553 transitions. [2018-10-26 21:20:09,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 653 [2018-10-26 21:20:09,838 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:20:09,839 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-26 21:20:09,839 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:20:09,839 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:20:09,840 INFO L82 PathProgramCache]: Analyzing trace with hash 736340522, now seen corresponding path program 1 times [2018-10-26 21:20:09,840 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:20:09,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:20:09,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:20:09,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:20:09,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:20:09,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:20:10,549 INFO L134 CoverageAnalysis]: Checked inductivity of 724 backedges. 468 proven. 0 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-10-26 21:20:10,549 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:20:10,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 21:20:10,550 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 21:20:10,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 21:20:10,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:20:10,551 INFO L87 Difference]: Start difference. First operand 145951 states and 160553 transitions. Second operand 4 states. [2018-10-26 21:20:19,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:20:19,567 INFO L93 Difference]: Finished difference Result 291148 states and 320347 transitions. [2018-10-26 21:20:19,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 21:20:19,567 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 652 [2018-10-26 21:20:19,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:20:19,691 INFO L225 Difference]: With dead ends: 291148 [2018-10-26 21:20:19,691 INFO L226 Difference]: Without dead ends: 123357 [2018-10-26 21:20:19,754 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:20:19,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123357 states. [2018-10-26 21:20:20,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123357 to 121853. [2018-10-26 21:20:20,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121853 states. [2018-10-26 21:20:20,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121853 states to 121853 states and 127885 transitions. [2018-10-26 21:20:20,785 INFO L78 Accepts]: Start accepts. Automaton has 121853 states and 127885 transitions. Word has length 652 [2018-10-26 21:20:20,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:20:20,786 INFO L481 AbstractCegarLoop]: Abstraction has 121853 states and 127885 transitions. [2018-10-26 21:20:20,786 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 21:20:20,786 INFO L276 IsEmpty]: Start isEmpty. Operand 121853 states and 127885 transitions. [2018-10-26 21:20:20,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 654 [2018-10-26 21:20:20,811 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:20:20,811 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 21:20:20,812 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:20:20,812 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:20:20,812 INFO L82 PathProgramCache]: Analyzing trace with hash -227132084, now seen corresponding path program 1 times [2018-10-26 21:20:20,812 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:20:20,812 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:20:20,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:20:20,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:20:20,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:20:20,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:20:22,724 INFO L134 CoverageAnalysis]: Checked inductivity of 731 backedges. 543 proven. 0 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2018-10-26 21:20:22,724 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:20:22,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:20:22,725 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 21:20:22,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 21:20:22,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 21:20:22,725 INFO L87 Difference]: Start difference. First operand 121853 states and 127885 transitions. Second operand 3 states. [2018-10-26 21:20:31,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:20:31,108 INFO L93 Difference]: Finished difference Result 272280 states and 286096 transitions. [2018-10-26 21:20:31,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 21:20:31,109 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 653 [2018-10-26 21:20:31,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:20:31,280 INFO L225 Difference]: With dead ends: 272280 [2018-10-26 21:20:31,280 INFO L226 Difference]: Without dead ends: 151181 [2018-10-26 21:20:31,355 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-26 21:20:31,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151181 states. [2018-10-26 21:20:33,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151181 to 146669. [2018-10-26 21:20:33,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146669 states. [2018-10-26 21:20:33,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146669 states to 146669 states and 153256 transitions. [2018-10-26 21:20:33,798 INFO L78 Accepts]: Start accepts. Automaton has 146669 states and 153256 transitions. Word has length 653 [2018-10-26 21:20:33,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:20:33,799 INFO L481 AbstractCegarLoop]: Abstraction has 146669 states and 153256 transitions. [2018-10-26 21:20:33,799 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 21:20:33,799 INFO L276 IsEmpty]: Start isEmpty. Operand 146669 states and 153256 transitions. [2018-10-26 21:20:33,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 786 [2018-10-26 21:20:33,843 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:20:33,844 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 21:20:33,844 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:20:33,844 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:20:33,845 INFO L82 PathProgramCache]: Analyzing trace with hash 613313174, now seen corresponding path program 1 times [2018-10-26 21:20:33,845 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:20:33,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:20:33,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:20:33,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:20:33,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:20:33,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:20:35,935 INFO L134 CoverageAnalysis]: Checked inductivity of 981 backedges. 601 proven. 0 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2018-10-26 21:20:35,936 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:20:35,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 21:20:35,937 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 21:20:35,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 21:20:35,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:20:35,937 INFO L87 Difference]: Start difference. First operand 146669 states and 153256 transitions. Second operand 4 states. [2018-10-26 21:20:43,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:20:43,651 INFO L93 Difference]: Finished difference Result 294088 states and 307272 transitions. [2018-10-26 21:20:43,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 21:20:43,651 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 785 [2018-10-26 21:20:43,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:20:43,821 INFO L225 Difference]: With dead ends: 294088 [2018-10-26 21:20:43,821 INFO L226 Difference]: Without dead ends: 148173 [2018-10-26 21:20:43,900 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-26 21:20:44,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148173 states. [2018-10-26 21:20:49,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148173 to 142909. [2018-10-26 21:20:49,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142909 states. [2018-10-26 21:20:49,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142909 states to 142909 states and 148003 transitions. [2018-10-26 21:20:49,358 INFO L78 Accepts]: Start accepts. Automaton has 142909 states and 148003 transitions. Word has length 785 [2018-10-26 21:20:49,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:20:49,359 INFO L481 AbstractCegarLoop]: Abstraction has 142909 states and 148003 transitions. [2018-10-26 21:20:49,359 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 21:20:49,359 INFO L276 IsEmpty]: Start isEmpty. Operand 142909 states and 148003 transitions. [2018-10-26 21:20:49,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 801 [2018-10-26 21:20:49,383 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:20:49,384 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 21:20:49,384 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:20:49,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:20:49,385 INFO L82 PathProgramCache]: Analyzing trace with hash 850929166, now seen corresponding path program 1 times [2018-10-26 21:20:49,385 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:20:49,385 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:20:49,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:20:49,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:20:49,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:20:49,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:20:50,810 INFO L134 CoverageAnalysis]: Checked inductivity of 481 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2018-10-26 21:20:50,810 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:20:50,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 21:20:50,811 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 21:20:50,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 21:20:50,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-26 21:20:50,812 INFO L87 Difference]: Start difference. First operand 142909 states and 148003 transitions. Second operand 5 states. [2018-10-26 21:21:01,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:21:01,464 INFO L93 Difference]: Finished difference Result 417439 states and 432256 transitions. [2018-10-26 21:21:01,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 21:21:01,464 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 800 [2018-10-26 21:21:01,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:21:01,465 INFO L225 Difference]: With dead ends: 417439 [2018-10-26 21:21:01,465 INFO L226 Difference]: Without dead ends: 0 [2018-10-26 21:21:01,611 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-26 21:21:01,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-26 21:21:01,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-26 21:21:01,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-26 21:21:01,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-26 21:21:01,612 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 800 [2018-10-26 21:21:01,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:21:01,612 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-26 21:21:01,612 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 21:21:01,612 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-26 21:21:01,612 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-26 21:21:01,617 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-26 21:21:04,304 WARN L179 SmtUtils]: Spent 2.68 s on a formula simplification. DAG size of input: 719 DAG size of output: 573 [2018-10-26 21:21:06,119 WARN L179 SmtUtils]: Spent 1.81 s on a formula simplification. DAG size of input: 719 DAG size of output: 573 [2018-10-26 21:21:07,680 WARN L179 SmtUtils]: Spent 1.56 s on a formula simplification. DAG size of input: 719 DAG size of output: 573 [2018-10-26 21:21:09,279 WARN L179 SmtUtils]: Spent 1.60 s on a formula simplification. DAG size of input: 719 DAG size of output: 573 [2018-10-26 21:21:10,880 WARN L179 SmtUtils]: Spent 1.60 s on a formula simplification. DAG size of input: 719 DAG size of output: 573 [2018-10-26 21:21:16,490 WARN L179 SmtUtils]: Spent 5.60 s on a formula simplification. DAG size of input: 570 DAG size of output: 61 [2018-10-26 21:21:21,760 WARN L179 SmtUtils]: Spent 5.26 s on a formula simplification. DAG size of input: 570 DAG size of output: 61 [2018-10-26 21:21:27,088 WARN L179 SmtUtils]: Spent 5.32 s on a formula simplification. DAG size of input: 570 DAG size of output: 61 Received shutdown request... [2018-10-26 21:21:27,610 WARN L187 SmtUtils]: Removed 4 from assertion stack [2018-10-26 21:21:27,610 INFO L256 ToolchainWalker]: Toolchain cancelled while executing plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction. Reason: Timeout or Toolchain cancelled by user [2018-10-26 21:21:27,611 INFO L168 Benchmark]: Toolchain (without parser) took 224254.42 ms. Allocated memory was 1.5 GB in the beginning and 4.4 GB in the end (delta: 2.9 GB). Free memory was 1.4 GB in the beginning and 2.7 GB in the end (delta: -1.3 GB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2018-10-26 21:21:27,614 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-26 21:21:27,614 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2256.98 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-26 21:21:27,616 INFO L168 Benchmark]: Boogie Procedure Inliner took 700.76 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 790.1 MB). Free memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: -973.2 MB). Peak memory consumption was 68.8 MB. Max. memory is 7.1 GB. [2018-10-26 21:21:27,617 INFO L168 Benchmark]: Boogie Preprocessor took 478.57 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: 37.4 MB). Peak memory consumption was 37.4 MB. Max. memory is 7.1 GB. [2018-10-26 21:21:27,618 INFO L168 Benchmark]: RCFGBuilder took 9266.31 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 242.2 MB). Free memory was 2.1 GB in the beginning and 2.3 GB in the end (delta: -216.3 MB). Peak memory consumption was 658.1 MB. Max. memory is 7.1 GB. [2018-10-26 21:21:27,618 INFO L168 Benchmark]: TraceAbstraction took 211544.54 ms. Allocated memory was 2.5 GB in the beginning and 4.4 GB in the end (delta: 1.9 GB). Free memory was 2.3 GB in the beginning and 2.7 GB in the end (delta: -366.8 MB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2018-10-26 21:21:27,624 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.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 2256.98 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 700.76 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 790.1 MB). Free memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: -973.2 MB). Peak memory consumption was 68.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 478.57 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: 37.4 MB). Peak memory consumption was 37.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 9266.31 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 242.2 MB). Free memory was 2.1 GB in the beginning and 2.3 GB in the end (delta: -216.3 MB). Peak memory consumption was 658.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 211544.54 ms. Allocated memory was 2.5 GB in the beginning and 4.4 GB in the end (delta: 1.9 GB). Free memory was 2.3 GB in the beginning and 2.7 GB in the end (delta: -366.8 MB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 117]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - TimeoutResult: Timeout (de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction) Toolchain cancelled while SimplifyDDAWithTimeout was simplifying term of DAG size 570. RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown