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_label07_false-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1dbac8b [2018-10-26 19:05:07,961 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 19:05:07,963 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 19:05:07,977 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 19:05:07,977 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 19:05:07,978 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 19:05:07,980 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 19:05:07,981 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 19:05:07,984 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 19:05:07,985 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 19:05:07,986 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 19:05:07,986 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 19:05:07,989 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 19:05:07,990 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 19:05:07,991 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 19:05:07,995 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 19:05:07,996 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 19:05:07,998 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 19:05:08,000 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 19:05:08,001 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 19:05:08,002 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 19:05:08,003 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 19:05:08,005 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 19:05:08,006 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 19:05:08,006 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 19:05:08,007 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 19:05:08,007 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 19:05:08,008 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 19:05:08,009 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 19:05:08,010 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 19:05:08,010 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 19:05:08,011 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 19:05:08,011 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 19:05:08,011 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 19:05:08,012 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 19:05:08,013 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 19:05:08,013 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 19:05:08,033 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 19:05:08,034 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 19:05:08,034 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 19:05:08,035 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-26 19:05:08,035 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-26 19:05:08,036 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-26 19:05:08,036 INFO L133 SettingsManager]: * Use SBE=true [2018-10-26 19:05:08,036 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 19:05:08,036 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 19:05:08,036 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 19:05:08,037 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 19:05:08,038 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 19:05:08,038 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 19:05:08,038 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 19:05:08,038 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 19:05:08,038 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 19:05:08,039 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 19:05:08,039 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 19:05:08,039 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 19:05:08,039 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 19:05:08,039 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 19:05:08,040 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 19:05:08,041 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 19:05:08,041 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-26 19:05:08,041 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 19:05:08,042 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 19:05:08,042 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-26 19:05:08,042 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-26 19:05:08,088 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 19:05:08,103 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 19:05:08,106 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 19:05:08,108 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 19:05:08,108 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 19:05:08,109 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem12_label07_false-unreach-call.c [2018-10-26 19:05:08,168 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/07d5667a6/5ba52a84414a4a11974d19c9b51f3731/FLAGee1955202 [2018-10-26 19:05:08,881 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 19:05:08,882 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem12_label07_false-unreach-call.c [2018-10-26 19:05:08,910 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/07d5667a6/5ba52a84414a4a11974d19c9b51f3731/FLAGee1955202 [2018-10-26 19:05:08,926 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/07d5667a6/5ba52a84414a4a11974d19c9b51f3731 [2018-10-26 19:05:08,939 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 19:05:08,941 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-26 19:05:08,942 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 19:05:08,942 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 19:05:08,947 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 19:05:08,948 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 07:05:08" (1/1) ... [2018-10-26 19:05:08,951 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c6863df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:05:08, skipping insertion in model container [2018-10-26 19:05:08,951 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 07:05:08" (1/1) ... [2018-10-26 19:05:08,963 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 19:05:09,115 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 19:05:10,487 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 19:05:10,491 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 19:05:11,107 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 19:05:11,145 INFO L193 MainTranslator]: Completed translation [2018-10-26 19:05:11,146 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:05:11 WrapperNode [2018-10-26 19:05:11,146 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 19:05:11,147 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 19:05:11,147 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 19:05:11,148 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 19:05:11,158 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:05:11" (1/1) ... [2018-10-26 19:05:11,228 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:05:11" (1/1) ... [2018-10-26 19:05:11,762 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 19:05:11,763 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 19:05:11,763 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 19:05:11,763 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 19:05:11,774 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:05:11" (1/1) ... [2018-10-26 19:05:11,775 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:05:11" (1/1) ... [2018-10-26 19:05:11,825 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:05:11" (1/1) ... [2018-10-26 19:05:11,825 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:05:11" (1/1) ... [2018-10-26 19:05:11,971 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:05:11" (1/1) ... [2018-10-26 19:05:12,017 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:05:11" (1/1) ... [2018-10-26 19:05:12,059 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:05:11" (1/1) ... [2018-10-26 19:05:12,108 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 19:05:12,109 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 19:05:12,109 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 19:05:12,109 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 19:05:12,110 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:05:11" (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 19:05:12,182 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-26 19:05:12,182 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 19:05:12,182 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 19:05:21,475 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 19:05:21,476 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 07:05:21 BoogieIcfgContainer [2018-10-26 19:05:21,476 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 19:05:21,477 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 19:05:21,477 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 19:05:21,481 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 19:05:21,481 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 07:05:08" (1/3) ... [2018-10-26 19:05:21,482 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cda4eab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 07:05:21, skipping insertion in model container [2018-10-26 19:05:21,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:05:11" (2/3) ... [2018-10-26 19:05:21,482 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cda4eab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 07:05:21, skipping insertion in model container [2018-10-26 19:05:21,483 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 07:05:21" (3/3) ... [2018-10-26 19:05:21,485 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem12_label07_false-unreach-call.c [2018-10-26 19:05:21,494 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 19:05:21,504 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-26 19:05:21,522 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-26 19:05:21,567 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-26 19:05:21,568 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 19:05:21,568 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 19:05:21,568 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 19:05:21,568 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 19:05:21,568 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 19:05:21,568 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 19:05:21,569 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 19:05:21,569 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 19:05:21,601 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states. [2018-10-26 19:05:21,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-26 19:05:21,607 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:05:21,608 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:05:21,611 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:05:21,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:05:21,618 INFO L82 PathProgramCache]: Analyzing trace with hash 1805984234, now seen corresponding path program 1 times [2018-10-26 19:05:21,620 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:05:21,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:05:21,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:05:21,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:05:21,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:05:21,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:05:21,832 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 19:05:21,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:05:21,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 19:05:21,838 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:05:21,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:05:21,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:05:21,853 INFO L87 Difference]: Start difference. First operand 819 states. Second operand 3 states. [2018-10-26 19:05:30,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:05:30,309 INFO L93 Difference]: Finished difference Result 2391 states and 4632 transitions. [2018-10-26 19:05:30,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:05:30,311 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-10-26 19:05:30,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:05:30,347 INFO L225 Difference]: With dead ends: 2391 [2018-10-26 19:05:30,347 INFO L226 Difference]: Without dead ends: 1568 [2018-10-26 19:05:30,356 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:05:30,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1568 states. [2018-10-26 19:05:30,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1568 to 1568. [2018-10-26 19:05:30,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1568 states. [2018-10-26 19:05:30,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 2601 transitions. [2018-10-26 19:05:30,485 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 2601 transitions. Word has length 7 [2018-10-26 19:05:30,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:05:30,486 INFO L481 AbstractCegarLoop]: Abstraction has 1568 states and 2601 transitions. [2018-10-26 19:05:30,486 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:05:30,486 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 2601 transitions. [2018-10-26 19:05:30,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-10-26 19:05:30,489 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:05:30,489 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:05:30,490 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:05:30,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:05:30,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1382629178, now seen corresponding path program 1 times [2018-10-26 19:05:30,490 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:05:30,490 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:05:30,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:05:30,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:05:30,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:05:30,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:05:30,724 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:05:30,725 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:05:30,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:05:30,727 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:05:30,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:05:30,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:05:30,728 INFO L87 Difference]: Start difference. First operand 1568 states and 2601 transitions. Second operand 3 states. [2018-10-26 19:05:38,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:05:38,560 INFO L93 Difference]: Finished difference Result 4638 states and 7738 transitions. [2018-10-26 19:05:38,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:05:38,561 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2018-10-26 19:05:38,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:05:38,578 INFO L225 Difference]: With dead ends: 4638 [2018-10-26 19:05:38,578 INFO L226 Difference]: Without dead ends: 3072 [2018-10-26 19:05:38,582 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 19:05:38,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3072 states. [2018-10-26 19:05:38,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3072 to 3072. [2018-10-26 19:05:38,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3072 states. [2018-10-26 19:05:38,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3072 states to 3072 states and 4785 transitions. [2018-10-26 19:05:38,645 INFO L78 Accepts]: Start accepts. Automaton has 3072 states and 4785 transitions. Word has length 79 [2018-10-26 19:05:38,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:05:38,646 INFO L481 AbstractCegarLoop]: Abstraction has 3072 states and 4785 transitions. [2018-10-26 19:05:38,646 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:05:38,647 INFO L276 IsEmpty]: Start isEmpty. Operand 3072 states and 4785 transitions. [2018-10-26 19:05:38,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-10-26 19:05:38,650 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:05:38,650 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:05:38,650 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:05:38,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:05:38,651 INFO L82 PathProgramCache]: Analyzing trace with hash 901345351, now seen corresponding path program 1 times [2018-10-26 19:05:38,651 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:05:38,651 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:05:38,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:05:38,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:05:38,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:05:38,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:05:38,857 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:05:38,857 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:05:38,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:05:38,858 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 19:05:38,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 19:05:38,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:05:38,859 INFO L87 Difference]: Start difference. First operand 3072 states and 4785 transitions. Second operand 4 states. [2018-10-26 19:05:49,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:05:49,294 INFO L93 Difference]: Finished difference Result 12158 states and 19012 transitions. [2018-10-26 19:05:49,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 19:05:49,295 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2018-10-26 19:05:49,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:05:49,342 INFO L225 Difference]: With dead ends: 12158 [2018-10-26 19:05:49,342 INFO L226 Difference]: Without dead ends: 9088 [2018-10-26 19:05:49,348 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-26 19:05:49,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9088 states. [2018-10-26 19:05:49,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9088 to 9088. [2018-10-26 19:05:49,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9088 states. [2018-10-26 19:05:49,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9088 states to 9088 states and 12491 transitions. [2018-10-26 19:05:49,505 INFO L78 Accepts]: Start accepts. Automaton has 9088 states and 12491 transitions. Word has length 82 [2018-10-26 19:05:49,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:05:49,506 INFO L481 AbstractCegarLoop]: Abstraction has 9088 states and 12491 transitions. [2018-10-26 19:05:49,506 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 19:05:49,506 INFO L276 IsEmpty]: Start isEmpty. Operand 9088 states and 12491 transitions. [2018-10-26 19:05:49,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-10-26 19:05:49,508 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:05:49,509 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:05:49,509 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:05:49,509 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:05:49,509 INFO L82 PathProgramCache]: Analyzing trace with hash 808225171, now seen corresponding path program 1 times [2018-10-26 19:05:49,510 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:05:49,510 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:05:49,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:05:49,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:05:49,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:05:49,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:05:49,770 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:05:49,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:05:49,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:05:49,771 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 19:05:49,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 19:05:49,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:05:49,772 INFO L87 Difference]: Start difference. First operand 9088 states and 12491 transitions. Second operand 4 states. [2018-10-26 19:05:57,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:05:57,266 INFO L93 Difference]: Finished difference Result 35532 states and 48960 transitions. [2018-10-26 19:05:57,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 19:05:57,266 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2018-10-26 19:05:57,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:05:57,341 INFO L225 Difference]: With dead ends: 35532 [2018-10-26 19:05:57,341 INFO L226 Difference]: Without dead ends: 26446 [2018-10-26 19:05:57,358 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-26 19:05:57,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26446 states. [2018-10-26 19:05:57,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26446 to 18112. [2018-10-26 19:05:57,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18112 states. [2018-10-26 19:05:57,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18112 states to 18112 states and 23341 transitions. [2018-10-26 19:05:57,706 INFO L78 Accepts]: Start accepts. Automaton has 18112 states and 23341 transitions. Word has length 89 [2018-10-26 19:05:57,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:05:57,707 INFO L481 AbstractCegarLoop]: Abstraction has 18112 states and 23341 transitions. [2018-10-26 19:05:57,707 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 19:05:57,707 INFO L276 IsEmpty]: Start isEmpty. Operand 18112 states and 23341 transitions. [2018-10-26 19:05:57,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-10-26 19:05:57,712 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:05:57,712 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:05:57,713 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:05:57,715 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:05:57,715 INFO L82 PathProgramCache]: Analyzing trace with hash 395154341, now seen corresponding path program 1 times [2018-10-26 19:05:57,715 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:05:57,715 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:05:57,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:05:57,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:05:57,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:05:57,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:05:57,979 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-26 19:05:58,378 WARN L179 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 21 [2018-10-26 19:05:58,418 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:05:58,418 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:05:58,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-26 19:05:58,419 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-26 19:05:58,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-26 19:05:58,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-10-26 19:05:58,420 INFO L87 Difference]: Start difference. First operand 18112 states and 23341 transitions. Second operand 6 states. [2018-10-26 19:06:10,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:06:10,858 INFO L93 Difference]: Finished difference Result 38478 states and 49029 transitions. [2018-10-26 19:06:10,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 19:06:10,859 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2018-10-26 19:06:10,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:06:10,906 INFO L225 Difference]: With dead ends: 38478 [2018-10-26 19:06:10,906 INFO L226 Difference]: Without dead ends: 20368 [2018-10-26 19:06:10,925 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-10-26 19:06:10,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20368 states. [2018-10-26 19:06:11,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20368 to 20368. [2018-10-26 19:06:11,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20368 states. [2018-10-26 19:06:11,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20368 states to 20368 states and 25102 transitions. [2018-10-26 19:06:11,185 INFO L78 Accepts]: Start accepts. Automaton has 20368 states and 25102 transitions. Word has length 94 [2018-10-26 19:06:11,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:06:11,185 INFO L481 AbstractCegarLoop]: Abstraction has 20368 states and 25102 transitions. [2018-10-26 19:06:11,186 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-26 19:06:11,186 INFO L276 IsEmpty]: Start isEmpty. Operand 20368 states and 25102 transitions. [2018-10-26 19:06:11,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-10-26 19:06:11,191 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:06:11,191 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-26 19:06:11,191 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:06:11,192 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:06:11,192 INFO L82 PathProgramCache]: Analyzing trace with hash -1684756667, now seen corresponding path program 1 times [2018-10-26 19:06:11,192 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:06:11,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:06:11,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:06:11,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:06:11,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:06:11,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:06:11,735 WARN L179 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 9 [2018-10-26 19:06:12,055 WARN L179 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 9 [2018-10-26 19:06:12,471 WARN L179 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 19 [2018-10-26 19:06:12,542 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 73 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:06:12,542 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:06:12,543 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 19:06:12,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:06:12,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:06:12,827 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 19:06:13,011 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:06:13,042 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 19:06:13,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2018-10-26 19:06:13,043 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-26 19:06:13,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-26 19:06:13,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-10-26 19:06:13,044 INFO L87 Difference]: Start difference. First operand 20368 states and 25102 transitions. Second operand 6 states. [2018-10-26 19:06:31,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:06:31,256 INFO L93 Difference]: Finished difference Result 64078 states and 77928 transitions. [2018-10-26 19:06:31,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-26 19:06:31,257 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 149 [2018-10-26 19:06:31,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:06:31,321 INFO L225 Difference]: With dead ends: 64078 [2018-10-26 19:06:31,321 INFO L226 Difference]: Without dead ends: 42205 [2018-10-26 19:06:31,342 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 150 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-10-26 19:06:31,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42205 states. [2018-10-26 19:06:31,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42205 to 27887. [2018-10-26 19:06:31,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27887 states. [2018-10-26 19:06:31,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27887 states to 27887 states and 32191 transitions. [2018-10-26 19:06:31,827 INFO L78 Accepts]: Start accepts. Automaton has 27887 states and 32191 transitions. Word has length 149 [2018-10-26 19:06:31,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:06:31,828 INFO L481 AbstractCegarLoop]: Abstraction has 27887 states and 32191 transitions. [2018-10-26 19:06:31,828 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-26 19:06:31,828 INFO L276 IsEmpty]: Start isEmpty. Operand 27887 states and 32191 transitions. [2018-10-26 19:06:31,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-10-26 19:06:31,831 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:06:31,832 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-26 19:06:31,832 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:06:31,832 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:06:31,832 INFO L82 PathProgramCache]: Analyzing trace with hash -747845316, now seen corresponding path program 1 times [2018-10-26 19:06:31,833 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:06:31,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:06:31,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:06:31,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:06:31,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:06:31,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:06:32,129 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-10-26 19:06:32,129 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:06:32,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:06:32,130 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:06:32,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:06:32,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:06:32,131 INFO L87 Difference]: Start difference. First operand 27887 states and 32191 transitions. Second operand 3 states. [2018-10-26 19:06:39,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:06:39,929 INFO L93 Difference]: Finished difference Result 63292 states and 73489 transitions. [2018-10-26 19:06:39,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:06:39,931 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 240 [2018-10-26 19:06:39,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:06:39,973 INFO L225 Difference]: With dead ends: 63292 [2018-10-26 19:06:39,973 INFO L226 Difference]: Without dead ends: 36159 [2018-10-26 19:06:39,997 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-26 19:06:40,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36159 states. [2018-10-26 19:06:40,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36159 to 36159. [2018-10-26 19:06:40,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36159 states. [2018-10-26 19:06:40,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36159 states to 36159 states and 41521 transitions. [2018-10-26 19:06:40,796 INFO L78 Accepts]: Start accepts. Automaton has 36159 states and 41521 transitions. Word has length 240 [2018-10-26 19:06:40,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:06:40,796 INFO L481 AbstractCegarLoop]: Abstraction has 36159 states and 41521 transitions. [2018-10-26 19:06:40,796 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:06:40,796 INFO L276 IsEmpty]: Start isEmpty. Operand 36159 states and 41521 transitions. [2018-10-26 19:06:40,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2018-10-26 19:06:40,802 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:06:40,803 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:06:40,803 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:06:40,803 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:06:40,804 INFO L82 PathProgramCache]: Analyzing trace with hash 1775731377, now seen corresponding path program 1 times [2018-10-26 19:06:40,804 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:06:40,804 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:06:40,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:06:40,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:06:40,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:06:40,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:06:41,029 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2018-10-26 19:06:41,030 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:06:41,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:06:41,030 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:06:41,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:06:41,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:06:41,031 INFO L87 Difference]: Start difference. First operand 36159 states and 41521 transitions. Second operand 3 states. [2018-10-26 19:06:46,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:06:46,724 INFO L93 Difference]: Finished difference Result 71564 states and 82283 transitions. [2018-10-26 19:06:46,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:06:46,725 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 309 [2018-10-26 19:06:46,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:06:46,760 INFO L225 Difference]: With dead ends: 71564 [2018-10-26 19:06:46,761 INFO L226 Difference]: Without dead ends: 36159 [2018-10-26 19:06:46,782 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 19:06:46,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36159 states. [2018-10-26 19:06:47,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36159 to 36159. [2018-10-26 19:06:47,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36159 states. [2018-10-26 19:06:47,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36159 states to 36159 states and 40222 transitions. [2018-10-26 19:06:47,174 INFO L78 Accepts]: Start accepts. Automaton has 36159 states and 40222 transitions. Word has length 309 [2018-10-26 19:06:47,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:06:47,175 INFO L481 AbstractCegarLoop]: Abstraction has 36159 states and 40222 transitions. [2018-10-26 19:06:47,175 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:06:47,175 INFO L276 IsEmpty]: Start isEmpty. Operand 36159 states and 40222 transitions. [2018-10-26 19:06:47,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2018-10-26 19:06:47,182 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:06:47,182 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 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 19:06:47,182 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:06:47,183 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:06:47,183 INFO L82 PathProgramCache]: Analyzing trace with hash -1873491081, now seen corresponding path program 1 times [2018-10-26 19:06:47,183 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:06:47,183 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:06:47,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:06:47,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:06:47,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:06:47,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:06:47,442 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-10-26 19:06:47,442 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:06:47,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:06:47,443 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:06:47,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:06:47,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:06:47,444 INFO L87 Difference]: Start difference. First operand 36159 states and 40222 transitions. Second operand 3 states. [2018-10-26 19:06:52,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:06:52,477 INFO L93 Difference]: Finished difference Result 86604 states and 97012 transitions. [2018-10-26 19:06:52,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:06:52,477 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 337 [2018-10-26 19:06:52,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:06:52,527 INFO L225 Difference]: With dead ends: 86604 [2018-10-26 19:06:52,527 INFO L226 Difference]: Without dead ends: 51199 [2018-10-26 19:06:52,545 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 19:06:52,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51199 states. [2018-10-26 19:06:53,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51199 to 51199. [2018-10-26 19:06:53,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51199 states. [2018-10-26 19:06:53,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51199 states to 51199 states and 56919 transitions. [2018-10-26 19:06:53,073 INFO L78 Accepts]: Start accepts. Automaton has 51199 states and 56919 transitions. Word has length 337 [2018-10-26 19:06:53,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:06:53,074 INFO L481 AbstractCegarLoop]: Abstraction has 51199 states and 56919 transitions. [2018-10-26 19:06:53,074 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:06:53,074 INFO L276 IsEmpty]: Start isEmpty. Operand 51199 states and 56919 transitions. [2018-10-26 19:06:53,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 398 [2018-10-26 19:06:53,089 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:06:53,090 INFO L375 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-26 19:06:53,090 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:06:53,090 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:06:53,090 INFO L82 PathProgramCache]: Analyzing trace with hash 1307002014, now seen corresponding path program 1 times [2018-10-26 19:06:53,091 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:06:53,091 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:06:53,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:06:53,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:06:53,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:06:53,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:06:53,622 INFO L134 CoverageAnalysis]: Checked inductivity of 492 backedges. 401 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-10-26 19:06:53,623 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:06:53,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 19:06:53,624 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 19:06:53,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 19:06:53,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:06:53,624 INFO L87 Difference]: Start difference. First operand 51199 states and 56919 transitions. Second operand 4 states. [2018-10-26 19:07:01,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:07:01,330 INFO L93 Difference]: Finished difference Result 101644 states and 113079 transitions. [2018-10-26 19:07:01,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 19:07:01,330 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 397 [2018-10-26 19:07:01,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:07:01,384 INFO L225 Difference]: With dead ends: 101644 [2018-10-26 19:07:01,384 INFO L226 Difference]: Without dead ends: 51199 [2018-10-26 19:07:01,410 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 19:07:01,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51199 states. [2018-10-26 19:07:02,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51199 to 51199. [2018-10-26 19:07:02,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51199 states. [2018-10-26 19:07:02,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51199 states to 51199 states and 54440 transitions. [2018-10-26 19:07:02,278 INFO L78 Accepts]: Start accepts. Automaton has 51199 states and 54440 transitions. Word has length 397 [2018-10-26 19:07:02,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:07:02,278 INFO L481 AbstractCegarLoop]: Abstraction has 51199 states and 54440 transitions. [2018-10-26 19:07:02,278 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 19:07:02,279 INFO L276 IsEmpty]: Start isEmpty. Operand 51199 states and 54440 transitions. [2018-10-26 19:07:02,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 420 [2018-10-26 19:07:02,290 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:07:02,291 INFO L375 BasicCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:07:02,291 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:07:02,291 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:07:02,291 INFO L82 PathProgramCache]: Analyzing trace with hash 823321056, now seen corresponding path program 1 times [2018-10-26 19:07:02,292 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:07:02,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:07:02,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:07:02,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:07:02,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:07:02,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:07:02,555 INFO L134 CoverageAnalysis]: Checked inductivity of 508 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 489 trivial. 0 not checked. [2018-10-26 19:07:02,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:07:02,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:07:02,556 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:07:02,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:07:02,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:07:02,557 INFO L87 Difference]: Start difference. First operand 51199 states and 54440 transitions. Second operand 3 states. [2018-10-26 19:07:08,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:07:08,829 INFO L93 Difference]: Finished difference Result 103144 states and 109808 transitions. [2018-10-26 19:07:08,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:07:08,829 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 419 [2018-10-26 19:07:08,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:07:08,877 INFO L225 Difference]: With dead ends: 103144 [2018-10-26 19:07:08,877 INFO L226 Difference]: Without dead ends: 52699 [2018-10-26 19:07:08,904 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 19:07:08,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52699 states. [2018-10-26 19:07:09,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52699 to 52699. [2018-10-26 19:07:09,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52699 states. [2018-10-26 19:07:09,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52699 states to 52699 states and 55241 transitions. [2018-10-26 19:07:09,336 INFO L78 Accepts]: Start accepts. Automaton has 52699 states and 55241 transitions. Word has length 419 [2018-10-26 19:07:09,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:07:09,337 INFO L481 AbstractCegarLoop]: Abstraction has 52699 states and 55241 transitions. [2018-10-26 19:07:09,337 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:07:09,337 INFO L276 IsEmpty]: Start isEmpty. Operand 52699 states and 55241 transitions. [2018-10-26 19:07:09,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 603 [2018-10-26 19:07:09,371 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:07:09,372 INFO L375 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:07:09,372 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:07:09,372 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:07:09,373 INFO L82 PathProgramCache]: Analyzing trace with hash -195895467, now seen corresponding path program 1 times [2018-10-26 19:07:09,373 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:07:09,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:07:09,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:07:09,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:07:09,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:07:09,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:07:09,902 INFO L134 CoverageAnalysis]: Checked inductivity of 604 backedges. 524 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-10-26 19:07:09,903 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:07:09,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 19:07:09,904 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 19:07:09,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 19:07:09,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:07:09,904 INFO L87 Difference]: Start difference. First operand 52699 states and 55241 transitions. Second operand 4 states. [2018-10-26 19:07:14,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:07:14,965 INFO L93 Difference]: Finished difference Result 126452 states and 132744 transitions. [2018-10-26 19:07:14,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:07:14,966 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 602 [2018-10-26 19:07:14,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:07:15,033 INFO L225 Difference]: With dead ends: 126452 [2018-10-26 19:07:15,034 INFO L226 Difference]: Without dead ends: 74507 [2018-10-26 19:07:15,064 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-26 19:07:15,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74507 states. [2018-10-26 19:07:15,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74507 to 74507. [2018-10-26 19:07:15,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74507 states. [2018-10-26 19:07:15,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74507 states to 74507 states and 77994 transitions. [2018-10-26 19:07:15,647 INFO L78 Accepts]: Start accepts. Automaton has 74507 states and 77994 transitions. Word has length 602 [2018-10-26 19:07:15,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:07:15,648 INFO L481 AbstractCegarLoop]: Abstraction has 74507 states and 77994 transitions. [2018-10-26 19:07:15,648 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 19:07:15,648 INFO L276 IsEmpty]: Start isEmpty. Operand 74507 states and 77994 transitions. [2018-10-26 19:07:15,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 607 [2018-10-26 19:07:15,678 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:07:15,679 INFO L375 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-26 19:07:15,679 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:07:15,679 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:07:15,679 INFO L82 PathProgramCache]: Analyzing trace with hash -998756597, now seen corresponding path program 1 times [2018-10-26 19:07:15,679 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:07:15,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:07:15,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:07:15,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:07:15,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:07:15,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:07:16,514 INFO L134 CoverageAnalysis]: Checked inductivity of 608 backedges. 352 proven. 0 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-10-26 19:07:16,515 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:07:16,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 19:07:16,516 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 19:07:16,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 19:07:16,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:07:16,516 INFO L87 Difference]: Start difference. First operand 74507 states and 77994 transitions. Second operand 4 states. [2018-10-26 19:07:24,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:07:24,686 INFO L93 Difference]: Finished difference Result 148260 states and 155229 transitions. [2018-10-26 19:07:24,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 19:07:24,687 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 606 [2018-10-26 19:07:24,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:07:24,767 INFO L225 Difference]: With dead ends: 148260 [2018-10-26 19:07:24,767 INFO L226 Difference]: Without dead ends: 72999 [2018-10-26 19:07:24,807 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 19:07:24,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72999 states. [2018-10-26 19:07:25,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72999 to 72999. [2018-10-26 19:07:25,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72999 states. [2018-10-26 19:07:25,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72999 states to 72999 states and 76131 transitions. [2018-10-26 19:07:25,564 INFO L78 Accepts]: Start accepts. Automaton has 72999 states and 76131 transitions. Word has length 606 [2018-10-26 19:07:25,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:07:25,565 INFO L481 AbstractCegarLoop]: Abstraction has 72999 states and 76131 transitions. [2018-10-26 19:07:25,565 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 19:07:25,566 INFO L276 IsEmpty]: Start isEmpty. Operand 72999 states and 76131 transitions. [2018-10-26 19:07:25,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 636 [2018-10-26 19:07:25,594 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:07:25,595 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2018-10-26 19:07:25,595 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:07:25,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:07:25,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1070355263, now seen corresponding path program 1 times [2018-10-26 19:07:25,596 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:07:25,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:07:25,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:07:25,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:07:25,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:07:25,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:07:26,109 INFO L134 CoverageAnalysis]: Checked inductivity of 699 backedges. 581 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-10-26 19:07:26,110 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:07:26,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:07:26,111 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:07:26,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:07:26,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:07:26,111 INFO L87 Difference]: Start difference. First operand 72999 states and 76131 transitions. Second operand 3 states. [2018-10-26 19:07:34,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:07:34,252 INFO L93 Difference]: Finished difference Result 182841 states and 191049 transitions. [2018-10-26 19:07:34,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:07:34,254 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 635 [2018-10-26 19:07:34,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:07:34,370 INFO L225 Difference]: With dead ends: 182841 [2018-10-26 19:07:34,370 INFO L226 Difference]: Without dead ends: 110596 [2018-10-26 19:07:34,406 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 19:07:34,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110596 states. [2018-10-26 19:07:35,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110596 to 108340. [2018-10-26 19:07:35,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108340 states. [2018-10-26 19:07:35,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108340 states to 108340 states and 112311 transitions. [2018-10-26 19:07:35,241 INFO L78 Accepts]: Start accepts. Automaton has 108340 states and 112311 transitions. Word has length 635 [2018-10-26 19:07:35,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:07:35,241 INFO L481 AbstractCegarLoop]: Abstraction has 108340 states and 112311 transitions. [2018-10-26 19:07:35,241 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:07:35,242 INFO L276 IsEmpty]: Start isEmpty. Operand 108340 states and 112311 transitions. [2018-10-26 19:07:35,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 673 [2018-10-26 19:07:35,261 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:07:35,262 INFO L375 BasicCegarLoop]: trace histogram [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, 5, 5, 5, 5, 5, 5, 5, 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] [2018-10-26 19:07:35,262 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:07:35,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:07:35,263 INFO L82 PathProgramCache]: Analyzing trace with hash -301306774, now seen corresponding path program 1 times [2018-10-26 19:07:35,263 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:07:35,263 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:07:35,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:07:35,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:07:35,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:07:35,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:07:35,917 INFO L134 CoverageAnalysis]: Checked inductivity of 876 backedges. 615 proven. 0 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2018-10-26 19:07:35,917 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:07:35,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-26 19:07:35,918 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-26 19:07:35,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-26 19:07:35,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-10-26 19:07:35,918 INFO L87 Difference]: Start difference. First operand 108340 states and 112311 transitions. Second operand 6 states. [2018-10-26 19:07:45,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:07:45,620 INFO L93 Difference]: Finished difference Result 216487 states and 224424 transitions. [2018-10-26 19:07:45,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 19:07:45,620 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 672 [2018-10-26 19:07:45,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:07:45,722 INFO L225 Difference]: With dead ends: 216487 [2018-10-26 19:07:45,722 INFO L226 Difference]: Without dead ends: 94589 [2018-10-26 19:07:45,778 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-10-26 19:07:45,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94589 states. [2018-10-26 19:07:46,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94589 to 90268. [2018-10-26 19:07:46,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90268 states. [2018-10-26 19:07:46,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90268 states to 90268 states and 92608 transitions. [2018-10-26 19:07:46,577 INFO L78 Accepts]: Start accepts. Automaton has 90268 states and 92608 transitions. Word has length 672 [2018-10-26 19:07:46,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:07:46,577 INFO L481 AbstractCegarLoop]: Abstraction has 90268 states and 92608 transitions. [2018-10-26 19:07:46,577 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-26 19:07:46,577 INFO L276 IsEmpty]: Start isEmpty. Operand 90268 states and 92608 transitions. [2018-10-26 19:07:46,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 690 [2018-10-26 19:07:46,591 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:07:46,592 INFO L375 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:07:46,592 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:07:46,592 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:07:46,593 INFO L82 PathProgramCache]: Analyzing trace with hash 625184252, now seen corresponding path program 1 times [2018-10-26 19:07:46,593 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:07:46,593 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:07:46,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:07:46,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:07:46,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:07:46,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:07:47,363 WARN L179 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2018-10-26 19:07:48,186 INFO L134 CoverageAnalysis]: Checked inductivity of 735 backedges. 26 proven. 634 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-10-26 19:07:48,187 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:07:48,187 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 19:07:48,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:07:48,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:07:48,903 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 19:07:49,419 INFO L134 CoverageAnalysis]: Checked inductivity of 735 backedges. 435 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2018-10-26 19:07:49,442 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 19:07:49,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2018-10-26 19:07:49,444 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-26 19:07:49,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-26 19:07:49,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-10-26 19:07:49,444 INFO L87 Difference]: Start difference. First operand 90268 states and 92608 transitions. Second operand 9 states. [2018-10-26 19:08:13,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:08:13,415 INFO L93 Difference]: Finished difference Result 198583 states and 203742 transitions. [2018-10-26 19:08:13,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-26 19:08:13,415 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 689 [2018-10-26 19:08:13,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:08:13,519 INFO L225 Difference]: With dead ends: 198583 [2018-10-26 19:08:13,520 INFO L226 Difference]: Without dead ends: 101539 [2018-10-26 19:08:14,016 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 716 GetRequests, 696 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2018-10-26 19:08:14,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101539 states. [2018-10-26 19:08:14,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101539 to 82739. [2018-10-26 19:08:14,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82739 states. [2018-10-26 19:08:14,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82739 states to 82739 states and 84901 transitions. [2018-10-26 19:08:14,670 INFO L78 Accepts]: Start accepts. Automaton has 82739 states and 84901 transitions. Word has length 689 [2018-10-26 19:08:14,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:08:14,671 INFO L481 AbstractCegarLoop]: Abstraction has 82739 states and 84901 transitions. [2018-10-26 19:08:14,671 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-26 19:08:14,671 INFO L276 IsEmpty]: Start isEmpty. Operand 82739 states and 84901 transitions. [2018-10-26 19:08:14,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 729 [2018-10-26 19:08:14,693 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:08:14,694 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:08:14,694 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:08:14,695 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:08:14,695 INFO L82 PathProgramCache]: Analyzing trace with hash -1460066374, now seen corresponding path program 1 times [2018-10-26 19:08:14,695 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:08:14,695 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:08:14,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:08:14,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:08:14,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:08:14,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:08:15,535 WARN L179 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 10 [2018-10-26 19:08:17,050 INFO L134 CoverageAnalysis]: Checked inductivity of 854 backedges. 150 proven. 591 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2018-10-26 19:08:17,050 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:08:17,050 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 19:08:17,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:08:17,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:08:17,251 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 19:08:17,905 INFO L134 CoverageAnalysis]: Checked inductivity of 854 backedges. 545 proven. 0 refuted. 0 times theorem prover too weak. 309 trivial. 0 not checked. [2018-10-26 19:08:17,943 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 19:08:17,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 11 [2018-10-26 19:08:17,946 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-26 19:08:17,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-26 19:08:17,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-10-26 19:08:17,947 INFO L87 Difference]: Start difference. First operand 82739 states and 84901 transitions. Second operand 11 states. [2018-10-26 19:08:49,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:08:49,616 INFO L93 Difference]: Finished difference Result 203856 states and 209294 transitions. [2018-10-26 19:08:49,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-26 19:08:49,617 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 728 [2018-10-26 19:08:49,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:08:49,749 INFO L225 Difference]: With dead ends: 203856 [2018-10-26 19:08:49,749 INFO L226 Difference]: Without dead ends: 118858 [2018-10-26 19:08:49,789 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 762 GetRequests, 740 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=154, Invalid=398, Unknown=0, NotChecked=0, Total=552 [2018-10-26 19:08:49,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118858 states. [2018-10-26 19:08:50,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118858 to 80479. [2018-10-26 19:08:50,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80479 states. [2018-10-26 19:08:50,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80479 states to 80479 states and 82336 transitions. [2018-10-26 19:08:50,548 INFO L78 Accepts]: Start accepts. Automaton has 80479 states and 82336 transitions. Word has length 728 [2018-10-26 19:08:50,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:08:50,548 INFO L481 AbstractCegarLoop]: Abstraction has 80479 states and 82336 transitions. [2018-10-26 19:08:50,548 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-26 19:08:50,548 INFO L276 IsEmpty]: Start isEmpty. Operand 80479 states and 82336 transitions. [2018-10-26 19:08:50,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 740 [2018-10-26 19:08:50,568 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:08:50,568 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2018-10-26 19:08:50,569 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:08:50,569 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:08:50,569 INFO L82 PathProgramCache]: Analyzing trace with hash 429350737, now seen corresponding path program 1 times [2018-10-26 19:08:50,569 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:08:50,570 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:08:50,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:08:50,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:08:50,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:08:50,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:08:51,261 WARN L179 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 8 [2018-10-26 19:08:52,456 INFO L134 CoverageAnalysis]: Checked inductivity of 865 backedges. 485 proven. 0 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2018-10-26 19:08:52,457 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:08:52,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 19:08:52,458 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 19:08:52,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 19:08:52,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:08:52,458 INFO L87 Difference]: Start difference. First operand 80479 states and 82336 transitions. Second operand 4 states. [2018-10-26 19:08:58,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:08:58,909 INFO L93 Difference]: Finished difference Result 164716 states and 168509 transitions. [2018-10-26 19:08:58,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 19:08:58,909 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 739 [2018-10-26 19:08:58,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:08:58,998 INFO L225 Difference]: With dead ends: 164716 [2018-10-26 19:08:58,998 INFO L226 Difference]: Without dead ends: 84991 [2018-10-26 19:08:59,037 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:08:59,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84991 states. [2018-10-26 19:09:00,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84991 to 79727. [2018-10-26 19:09:00,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79727 states. [2018-10-26 19:09:00,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79727 states to 79727 states and 81547 transitions. [2018-10-26 19:09:00,090 INFO L78 Accepts]: Start accepts. Automaton has 79727 states and 81547 transitions. Word has length 739 [2018-10-26 19:09:00,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:09:00,091 INFO L481 AbstractCegarLoop]: Abstraction has 79727 states and 81547 transitions. [2018-10-26 19:09:00,091 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 19:09:00,091 INFO L276 IsEmpty]: Start isEmpty. Operand 79727 states and 81547 transitions. [2018-10-26 19:09:00,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 774 [2018-10-26 19:09:00,109 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:09:00,110 INFO L375 BasicCegarLoop]: trace histogram [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, 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, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:09:00,110 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:09:00,110 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:09:00,110 INFO L82 PathProgramCache]: Analyzing trace with hash -394278024, now seen corresponding path program 1 times [2018-10-26 19:09:00,111 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:09:00,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:09:00,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:09:00,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:09:00,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:09:00,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:09:00,832 WARN L179 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 8 [2018-10-26 19:09:01,452 WARN L179 SmtUtils]: Spent 471.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 13 [2018-10-26 19:09:02,025 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 524 proven. 0 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2018-10-26 19:09:02,025 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:09:02,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-26 19:09:02,026 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 19:09:02,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 19:09:02,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-26 19:09:02,027 INFO L87 Difference]: Start difference. First operand 79727 states and 81547 transitions. Second operand 5 states. Received shutdown request... [2018-10-26 19:09:02,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-26 19:09:02,115 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-26 19:09:02,122 WARN L205 ceAbstractionStarter]: Timeout [2018-10-26 19:09:02,122 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 07:09:02 BoogieIcfgContainer [2018-10-26 19:09:02,122 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-26 19:09:02,123 INFO L168 Benchmark]: Toolchain (without parser) took 233183.23 ms. Allocated memory was 1.5 GB in the beginning and 3.9 GB in the end (delta: 2.4 GB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -533.2 MB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2018-10-26 19:09:02,124 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-26 19:09:02,125 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2204.63 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 19:09:02,126 INFO L168 Benchmark]: Boogie Procedure Inliner took 615.64 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 803.7 MB). Free memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: -998.6 MB). Peak memory consumption was 69.0 MB. Max. memory is 7.1 GB. [2018-10-26 19:09:02,127 INFO L168 Benchmark]: Boogie Preprocessor took 345.49 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 54.9 MB). Peak memory consumption was 54.9 MB. Max. memory is 7.1 GB. [2018-10-26 19:09:02,127 INFO L168 Benchmark]: RCFGBuilder took 9367.45 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 211.8 MB). Free memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: -158.2 MB). Peak memory consumption was 613.7 MB. Max. memory is 7.1 GB. [2018-10-26 19:09:02,128 INFO L168 Benchmark]: TraceAbstraction took 220645.02 ms. Allocated memory was 2.6 GB in the beginning and 3.9 GB in the end (delta: 1.4 GB). Free memory was 2.3 GB in the beginning and 1.9 GB in the end (delta: 368.0 MB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2018-10-26 19:09:02,134 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 2204.63 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 615.64 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 803.7 MB). Free memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: -998.6 MB). Peak memory consumption was 69.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 345.49 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 54.9 MB). Peak memory consumption was 54.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 9367.45 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 211.8 MB). Free memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: -158.2 MB). Peak memory consumption was 613.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 220645.02 ms. Allocated memory was 2.6 GB in the beginning and 3.9 GB in the end (delta: 1.4 GB). Free memory was 2.3 GB in the beginning and 1.9 GB in the end (delta: 368.0 MB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 30]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 30). Cancelled while BasicCegarLoop was constructing difference of abstraction (79727states) and FLOYD_HOARE automaton (currently 2 states, 5 states before enhancement),while ReachableStatesComputation was computing reachable states (33 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 819 locations, 1 error locations. TIMEOUT Result, 220.5s OverallTime, 19 OverallIterations, 6 TraceHistogramMax, 192.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 13991 SDtfs, 53357 SDslu, 1717 SDs, 0 SdLazy, 105228 SolverSat, 13301 SolverUnsat, 5 SolverUnknown, 0 SolverNotchecked, 155.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1710 GetRequests, 1616 SyntacticMatches, 20 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 6.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=108340occurred in iteration=14, 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: 9.8s AutomataMinimizationTime, 18 MinimizatonAttempts, 91672 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 10.0s InterpolantComputationTime, 9212 NumberOfCodeBlocks, 9212 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 9190 ConstructedInterpolants, 0 QuantifiedInterpolants, 19398699 SizeOfPredicates, 5 NumberOfNonLiveVariables, 1948 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 22 InterpolantComputations, 19 PerfectInterpolantSequences, 8509/9739 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown