java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-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/Problem17_label28_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-06 21:43:48,608 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-06 21:43:48,610 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-06 21:43:48,624 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-06 21:43:48,625 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-06 21:43:48,628 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-06 21:43:48,629 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-06 21:43:48,632 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-06 21:43:48,634 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-06 21:43:48,634 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-06 21:43:48,635 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-06 21:43:48,636 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-06 21:43:48,637 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-06 21:43:48,638 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-06 21:43:48,639 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-06 21:43:48,640 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-06 21:43:48,641 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-06 21:43:48,642 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-06 21:43:48,644 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-06 21:43:48,646 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-06 21:43:48,647 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-06 21:43:48,648 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-06 21:43:48,651 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-06 21:43:48,651 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-06 21:43:48,651 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-06 21:43:48,652 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-06 21:43:48,653 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-06 21:43:48,654 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-06 21:43:48,655 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-06 21:43:48,656 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-06 21:43:48,656 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-06 21:43:48,657 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-06 21:43:48,657 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-06 21:43:48,657 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-06 21:43:48,658 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-06 21:43:48,659 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-06 21:43:48,660 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-11-06 21:43:48,675 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-06 21:43:48,675 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-06 21:43:48,676 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-06 21:43:48,676 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-06 21:43:48,677 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-06 21:43:48,677 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-06 21:43:48,677 INFO L133 SettingsManager]: * Use SBE=true [2018-11-06 21:43:48,678 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-06 21:43:48,678 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-06 21:43:48,678 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-06 21:43:48,678 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-06 21:43:48,678 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-06 21:43:48,678 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-06 21:43:48,679 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-06 21:43:48,679 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-06 21:43:48,679 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-06 21:43:48,679 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-06 21:43:48,679 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-06 21:43:48,680 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-06 21:43:48,680 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 21:43:48,680 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-06 21:43:48,680 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-06 21:43:48,680 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-06 21:43:48,680 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-06 21:43:48,681 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-06 21:43:48,681 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-06 21:43:48,681 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-06 21:43:48,681 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-06 21:43:48,735 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-06 21:43:48,749 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-06 21:43:48,753 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-06 21:43:48,755 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-06 21:43:48,756 INFO L276 PluginConnector]: CDTParser initialized [2018-11-06 21:43:48,756 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem17_label28_true-unreach-call.c [2018-11-06 21:43:48,816 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a02c1309/22ce7bfcf8764660bfbd47e35949cbfd/FLAGe21145575 [2018-11-06 21:43:49,520 INFO L298 CDTParser]: Found 1 translation units. [2018-11-06 21:43:49,521 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem17_label28_true-unreach-call.c [2018-11-06 21:43:49,547 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a02c1309/22ce7bfcf8764660bfbd47e35949cbfd/FLAGe21145575 [2018-11-06 21:43:49,562 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a02c1309/22ce7bfcf8764660bfbd47e35949cbfd [2018-11-06 21:43:49,574 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-06 21:43:49,575 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-06 21:43:49,576 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-06 21:43:49,577 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-06 21:43:49,581 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-06 21:43:49,582 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:43:49" (1/1) ... [2018-11-06 21:43:49,585 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b330f55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:43:49, skipping insertion in model container [2018-11-06 21:43:49,585 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:43:49" (1/1) ... [2018-11-06 21:43:49,595 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-06 21:43:49,715 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-06 21:43:50,701 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 21:43:50,707 INFO L189 MainTranslator]: Completed pre-run [2018-11-06 21:43:51,113 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 21:43:51,135 INFO L193 MainTranslator]: Completed translation [2018-11-06 21:43:51,135 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:43:51 WrapperNode [2018-11-06 21:43:51,136 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-06 21:43:51,137 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-06 21:43:51,137 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-06 21:43:51,137 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-06 21:43:51,146 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:43:51" (1/1) ... [2018-11-06 21:43:51,380 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:43:51" (1/1) ... [2018-11-06 21:43:51,608 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-06 21:43:51,609 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-06 21:43:51,609 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-06 21:43:51,609 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-06 21:43:51,621 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:43:51" (1/1) ... [2018-11-06 21:43:51,621 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:43:51" (1/1) ... [2018-11-06 21:43:51,643 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:43:51" (1/1) ... [2018-11-06 21:43:51,644 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:43:51" (1/1) ... [2018-11-06 21:43:51,790 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:43:51" (1/1) ... [2018-11-06 21:43:51,826 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:43:51" (1/1) ... [2018-11-06 21:43:51,879 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:43:51" (1/1) ... [2018-11-06 21:43:51,936 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-06 21:43:51,936 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-06 21:43:51,937 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-06 21:43:51,937 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-06 21:43:51,938 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:43:51" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 21:43:52,004 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-06 21:43:52,005 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-06 21:43:52,005 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-06 21:44:00,744 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-06 21:44:00,745 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:44:00 BoogieIcfgContainer [2018-11-06 21:44:00,745 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-06 21:44:00,746 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-06 21:44:00,746 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-06 21:44:00,750 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-06 21:44:00,750 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:43:49" (1/3) ... [2018-11-06 21:44:00,751 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b4c4905 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:44:00, skipping insertion in model container [2018-11-06 21:44:00,751 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:43:51" (2/3) ... [2018-11-06 21:44:00,752 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b4c4905 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:44:00, skipping insertion in model container [2018-11-06 21:44:00,753 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:44:00" (3/3) ... [2018-11-06 21:44:00,756 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem17_label28_true-unreach-call.c [2018-11-06 21:44:00,769 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-06 21:44:00,781 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-06 21:44:00,798 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-06 21:44:00,843 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-06 21:44:00,843 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-06 21:44:00,844 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-06 21:44:00,844 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-06 21:44:00,844 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-06 21:44:00,844 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-06 21:44:00,844 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-06 21:44:00,845 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-06 21:44:00,845 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-06 21:44:00,878 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states. [2018-11-06 21:44:00,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-06 21:44:00,889 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:44:00,891 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 21:44:00,893 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:44:00,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:44:00,900 INFO L82 PathProgramCache]: Analyzing trace with hash -2101344302, now seen corresponding path program 1 times [2018-11-06 21:44:00,902 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:44:00,903 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:44:00,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:44:00,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:44:00,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:44:01,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:44:01,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:44:01,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:44:01,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:44:01,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:44:01,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:44:01,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:44:01,478 INFO L87 Difference]: Start difference. First operand 591 states. Second operand 4 states. [2018-11-06 21:44:10,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:44:10,730 INFO L93 Difference]: Finished difference Result 2093 states and 3901 transitions. [2018-11-06 21:44:10,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:44:10,732 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2018-11-06 21:44:10,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:44:10,765 INFO L225 Difference]: With dead ends: 2093 [2018-11-06 21:44:10,765 INFO L226 Difference]: Without dead ends: 1495 [2018-11-06 21:44:10,772 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:44:10,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1495 states. [2018-11-06 21:44:10,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1495 to 1488. [2018-11-06 21:44:10,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1488 states. [2018-11-06 21:44:10,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1488 states to 1488 states and 2247 transitions. [2018-11-06 21:44:10,923 INFO L78 Accepts]: Start accepts. Automaton has 1488 states and 2247 transitions. Word has length 65 [2018-11-06 21:44:10,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:44:10,924 INFO L480 AbstractCegarLoop]: Abstraction has 1488 states and 2247 transitions. [2018-11-06 21:44:10,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:44:10,925 INFO L276 IsEmpty]: Start isEmpty. Operand 1488 states and 2247 transitions. [2018-11-06 21:44:10,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-11-06 21:44:10,934 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:44:10,937 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 21:44:10,937 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:44:10,937 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:44:10,938 INFO L82 PathProgramCache]: Analyzing trace with hash 2146999654, now seen corresponding path program 1 times [2018-11-06 21:44:10,938 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:44:10,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:44:10,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:44:10,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:44:10,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:44:11,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:44:11,389 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:44:11,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:44:11,390 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 21:44:11,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:44:11,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:44:11,480 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:44:11,913 WARN L179 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 23 [2018-11-06 21:44:12,202 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:44:12,240 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 21:44:12,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2018-11-06 21:44:12,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-06 21:44:12,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-06 21:44:12,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-06 21:44:12,245 INFO L87 Difference]: Start difference. First operand 1488 states and 2247 transitions. Second operand 7 states. [2018-11-06 21:44:12,456 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-11-06 21:45:37,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:45:37,780 INFO L93 Difference]: Finished difference Result 9603 states and 15417 transitions. [2018-11-06 21:45:37,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-06 21:45:37,781 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 136 [2018-11-06 21:45:37,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:45:37,821 INFO L225 Difference]: With dead ends: 9603 [2018-11-06 21:45:37,821 INFO L226 Difference]: Without dead ends: 8117 [2018-11-06 21:45:37,825 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2018-11-06 21:45:37,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8117 states. [2018-11-06 21:45:37,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8117 to 8057. [2018-11-06 21:45:37,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8057 states. [2018-11-06 21:45:37,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8057 states to 8057 states and 10423 transitions. [2018-11-06 21:45:37,982 INFO L78 Accepts]: Start accepts. Automaton has 8057 states and 10423 transitions. Word has length 136 [2018-11-06 21:45:37,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:45:37,982 INFO L480 AbstractCegarLoop]: Abstraction has 8057 states and 10423 transitions. [2018-11-06 21:45:37,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-06 21:45:37,983 INFO L276 IsEmpty]: Start isEmpty. Operand 8057 states and 10423 transitions. [2018-11-06 21:45:37,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-11-06 21:45:37,988 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:45:37,989 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 21:45:37,989 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:45:37,989 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:45:37,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1352519299, now seen corresponding path program 1 times [2018-11-06 21:45:37,990 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:45:37,990 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:45:37,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:45:37,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:45:37,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:45:38,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:45:38,286 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 5 [2018-11-06 21:45:38,317 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:45:38,317 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:45:38,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:45:38,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:45:38,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:45:38,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:45:38,318 INFO L87 Difference]: Start difference. First operand 8057 states and 10423 transitions. Second operand 4 states. [2018-11-06 21:45:44,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:45:44,088 INFO L93 Difference]: Finished difference Result 28054 states and 36850 transitions. [2018-11-06 21:45:44,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:45:44,089 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2018-11-06 21:45:44,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:45:44,172 INFO L225 Difference]: With dead ends: 28054 [2018-11-06 21:45:44,172 INFO L226 Difference]: Without dead ends: 19999 [2018-11-06 21:45:44,187 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:45:44,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19999 states. [2018-11-06 21:45:44,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19999 to 19975. [2018-11-06 21:45:44,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19975 states. [2018-11-06 21:45:44,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19975 states to 19975 states and 23933 transitions. [2018-11-06 21:45:44,560 INFO L78 Accepts]: Start accepts. Automaton has 19975 states and 23933 transitions. Word has length 158 [2018-11-06 21:45:44,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:45:44,561 INFO L480 AbstractCegarLoop]: Abstraction has 19975 states and 23933 transitions. [2018-11-06 21:45:44,561 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:45:44,561 INFO L276 IsEmpty]: Start isEmpty. Operand 19975 states and 23933 transitions. [2018-11-06 21:45:44,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2018-11-06 21:45:44,573 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:45:44,574 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 21:45:44,574 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:45:44,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:45:44,575 INFO L82 PathProgramCache]: Analyzing trace with hash -1374238746, now seen corresponding path program 1 times [2018-11-06 21:45:44,575 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:45:44,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:45:44,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:45:44,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:45:44,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:45:44,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:45:44,947 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-11-06 21:45:44,948 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:45:44,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 21:45:44,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 21:45:44,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 21:45:44,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:45:44,949 INFO L87 Difference]: Start difference. First operand 19975 states and 23933 transitions. Second operand 3 states. [2018-11-06 21:45:48,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:45:48,471 INFO L93 Difference]: Finished difference Result 56565 states and 68188 transitions. [2018-11-06 21:45:48,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 21:45:48,472 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 285 [2018-11-06 21:45:48,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:45:48,522 INFO L225 Difference]: With dead ends: 56565 [2018-11-06 21:45:48,522 INFO L226 Difference]: Without dead ends: 25425 [2018-11-06 21:45:48,555 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-11-06 21:45:48,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25425 states. [2018-11-06 21:45:48,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25425 to 25424. [2018-11-06 21:45:48,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25424 states. [2018-11-06 21:45:48,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25424 states to 25424 states and 28408 transitions. [2018-11-06 21:45:48,896 INFO L78 Accepts]: Start accepts. Automaton has 25424 states and 28408 transitions. Word has length 285 [2018-11-06 21:45:48,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:45:48,896 INFO L480 AbstractCegarLoop]: Abstraction has 25424 states and 28408 transitions. [2018-11-06 21:45:48,896 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 21:45:48,896 INFO L276 IsEmpty]: Start isEmpty. Operand 25424 states and 28408 transitions. [2018-11-06 21:45:48,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2018-11-06 21:45:48,904 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:45:48,904 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 21:45:48,904 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:45:48,904 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:45:48,905 INFO L82 PathProgramCache]: Analyzing trace with hash -1704638485, now seen corresponding path program 1 times [2018-11-06 21:45:48,905 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:45:48,905 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:45:48,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:45:48,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:45:48,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:45:48,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:45:49,405 WARN L179 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 7 [2018-11-06 21:45:49,645 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 203 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:45:49,646 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:45:49,646 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 21:45:49,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:45:49,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:45:49,746 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:45:49,919 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-11-06 21:45:49,948 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 21:45:49,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2018-11-06 21:45:49,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-06 21:45:49,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-06 21:45:49,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-06 21:45:49,951 INFO L87 Difference]: Start difference. First operand 25424 states and 28408 transitions. Second operand 8 states. [2018-11-06 21:45:56,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:45:56,202 INFO L93 Difference]: Finished difference Result 58637 states and 66524 transitions. [2018-11-06 21:45:56,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-06 21:45:56,203 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 298 [2018-11-06 21:45:56,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:45:56,251 INFO L225 Difference]: With dead ends: 58637 [2018-11-06 21:45:56,251 INFO L226 Difference]: Without dead ends: 33641 [2018-11-06 21:45:56,280 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 299 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-11-06 21:45:56,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33641 states. [2018-11-06 21:45:56,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33641 to 33511. [2018-11-06 21:45:56,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33511 states. [2018-11-06 21:45:56,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33511 states to 33511 states and 36891 transitions. [2018-11-06 21:45:56,678 INFO L78 Accepts]: Start accepts. Automaton has 33511 states and 36891 transitions. Word has length 298 [2018-11-06 21:45:56,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:45:56,679 INFO L480 AbstractCegarLoop]: Abstraction has 33511 states and 36891 transitions. [2018-11-06 21:45:56,679 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-06 21:45:56,679 INFO L276 IsEmpty]: Start isEmpty. Operand 33511 states and 36891 transitions. [2018-11-06 21:45:56,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2018-11-06 21:45:56,695 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:45:56,696 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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] [2018-11-06 21:45:56,696 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:45:56,696 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:45:56,697 INFO L82 PathProgramCache]: Analyzing trace with hash 2054148621, now seen corresponding path program 1 times [2018-11-06 21:45:56,697 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:45:56,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:45:56,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:45:56,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:45:56,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:45:56,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:45:57,188 INFO L134 CoverageAnalysis]: Checked inductivity of 460 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2018-11-06 21:45:57,188 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:45:57,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:45:57,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:45:57,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:45:57,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:45:57,190 INFO L87 Difference]: Start difference. First operand 33511 states and 36891 transitions. Second operand 4 states. [2018-11-06 21:46:03,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:46:03,625 INFO L93 Difference]: Finished difference Result 89670 states and 99158 transitions. [2018-11-06 21:46:03,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:46:03,626 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 380 [2018-11-06 21:46:03,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:46:03,703 INFO L225 Difference]: With dead ends: 89670 [2018-11-06 21:46:03,703 INFO L226 Difference]: Without dead ends: 56588 [2018-11-06 21:46:03,732 INFO L604 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-11-06 21:46:03,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56588 states. [2018-11-06 21:46:04,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56588 to 53994. [2018-11-06 21:46:04,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53994 states. [2018-11-06 21:46:04,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53994 states to 53994 states and 58996 transitions. [2018-11-06 21:46:04,412 INFO L78 Accepts]: Start accepts. Automaton has 53994 states and 58996 transitions. Word has length 380 [2018-11-06 21:46:04,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:46:04,413 INFO L480 AbstractCegarLoop]: Abstraction has 53994 states and 58996 transitions. [2018-11-06 21:46:04,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:46:04,413 INFO L276 IsEmpty]: Start isEmpty. Operand 53994 states and 58996 transitions. [2018-11-06 21:46:04,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2018-11-06 21:46:04,429 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:46:04,433 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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] [2018-11-06 21:46:04,433 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:46:04,434 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:46:04,434 INFO L82 PathProgramCache]: Analyzing trace with hash 717470570, now seen corresponding path program 1 times [2018-11-06 21:46:04,434 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:46:04,434 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:46:04,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:46:04,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:46:04,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:46:04,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:46:04,856 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 5 [2018-11-06 21:46:04,967 INFO L134 CoverageAnalysis]: Checked inductivity of 458 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2018-11-06 21:46:04,967 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:46:04,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:46:04,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:46:04,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:46:04,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:46:04,969 INFO L87 Difference]: Start difference. First operand 53994 states and 58996 transitions. Second operand 4 states. [2018-11-06 21:46:11,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:46:11,506 INFO L93 Difference]: Finished difference Result 136587 states and 149748 transitions. [2018-11-06 21:46:11,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:46:11,507 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 387 [2018-11-06 21:46:11,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:46:11,574 INFO L225 Difference]: With dead ends: 136587 [2018-11-06 21:46:11,574 INFO L226 Difference]: Without dead ends: 70121 [2018-11-06 21:46:11,610 INFO L604 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-11-06 21:46:11,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70121 states. [2018-11-06 21:46:12,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70121 to 59431. [2018-11-06 21:46:12,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59431 states. [2018-11-06 21:46:12,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59431 states to 59431 states and 64072 transitions. [2018-11-06 21:46:12,261 INFO L78 Accepts]: Start accepts. Automaton has 59431 states and 64072 transitions. Word has length 387 [2018-11-06 21:46:12,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:46:12,261 INFO L480 AbstractCegarLoop]: Abstraction has 59431 states and 64072 transitions. [2018-11-06 21:46:12,261 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:46:12,262 INFO L276 IsEmpty]: Start isEmpty. Operand 59431 states and 64072 transitions. [2018-11-06 21:46:12,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 750 [2018-11-06 21:46:12,350 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:46:12,351 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 21:46:12,352 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:46:12,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:46:12,352 INFO L82 PathProgramCache]: Analyzing trace with hash -1980473089, now seen corresponding path program 1 times [2018-11-06 21:46:12,352 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:46:12,352 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:46:12,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:46:12,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:46:12,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:46:12,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:46:13,430 INFO L134 CoverageAnalysis]: Checked inductivity of 864 backedges. 594 proven. 0 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2018-11-06 21:46:13,431 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:46:13,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:46:13,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 21:46:13,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 21:46:13,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:46:13,433 INFO L87 Difference]: Start difference. First operand 59431 states and 64072 transitions. Second operand 3 states. [2018-11-06 21:46:16,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:46:16,568 INFO L93 Difference]: Finished difference Result 132061 states and 142817 transitions. [2018-11-06 21:46:16,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 21:46:16,570 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 749 [2018-11-06 21:46:16,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:46:16,642 INFO L225 Difference]: With dead ends: 132061 [2018-11-06 21:46:16,642 INFO L226 Difference]: Without dead ends: 70486 [2018-11-06 21:46:16,676 INFO L604 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-11-06 21:46:16,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70486 states. [2018-11-06 21:46:17,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70486 to 67929. [2018-11-06 21:46:17,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67929 states. [2018-11-06 21:46:17,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67929 states to 67929 states and 73165 transitions. [2018-11-06 21:46:17,283 INFO L78 Accepts]: Start accepts. Automaton has 67929 states and 73165 transitions. Word has length 749 [2018-11-06 21:46:17,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:46:17,284 INFO L480 AbstractCegarLoop]: Abstraction has 67929 states and 73165 transitions. [2018-11-06 21:46:17,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 21:46:17,284 INFO L276 IsEmpty]: Start isEmpty. Operand 67929 states and 73165 transitions. [2018-11-06 21:46:17,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 791 [2018-11-06 21:46:17,326 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:46:17,327 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 21:46:17,327 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:46:17,327 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:46:17,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1938059626, now seen corresponding path program 1 times [2018-11-06 21:46:17,328 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:46:17,328 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:46:17,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:46:17,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:46:17,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:46:17,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:46:18,520 INFO L134 CoverageAnalysis]: Checked inductivity of 1384 backedges. 826 proven. 0 refuted. 0 times theorem prover too weak. 558 trivial. 0 not checked. [2018-11-06 21:46:18,520 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:46:18,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 21:46:18,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 21:46:18,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 21:46:18,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:46:18,522 INFO L87 Difference]: Start difference. First operand 67929 states and 73165 transitions. Second operand 3 states. [2018-11-06 21:46:20,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:46:20,426 INFO L93 Difference]: Finished difference Result 133715 states and 144101 transitions. [2018-11-06 21:46:20,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 21:46:20,426 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 790 [2018-11-06 21:46:20,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:46:20,490 INFO L225 Difference]: With dead ends: 133715 [2018-11-06 21:46:20,490 INFO L226 Difference]: Without dead ends: 66214 [2018-11-06 21:46:20,524 INFO L604 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-11-06 21:46:20,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66214 states. [2018-11-06 21:46:20,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66214 to 59814. [2018-11-06 21:46:20,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59814 states. [2018-11-06 21:46:21,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59814 states to 59814 states and 64656 transitions. [2018-11-06 21:46:21,047 INFO L78 Accepts]: Start accepts. Automaton has 59814 states and 64656 transitions. Word has length 790 [2018-11-06 21:46:21,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:46:21,048 INFO L480 AbstractCegarLoop]: Abstraction has 59814 states and 64656 transitions. [2018-11-06 21:46:21,048 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 21:46:21,048 INFO L276 IsEmpty]: Start isEmpty. Operand 59814 states and 64656 transitions. [2018-11-06 21:46:21,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 794 [2018-11-06 21:46:21,085 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:46:21,086 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:46:21,086 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:46:21,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:46:21,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1705355184, now seen corresponding path program 1 times [2018-11-06 21:46:21,087 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:46:21,087 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:46:21,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:46:21,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:46:21,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:46:21,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:46:23,066 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 188 proven. 407 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:46:23,066 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:46:23,066 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-11-06 21:46:23,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:46:23,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:46:23,284 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:46:23,663 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 14 [2018-11-06 21:46:24,893 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 512 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2018-11-06 21:46:24,912 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 21:46:24,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2018-11-06 21:46:24,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-06 21:46:24,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-06 21:46:24,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-11-06 21:46:24,915 INFO L87 Difference]: Start difference. First operand 59814 states and 64656 transitions. Second operand 8 states. [2018-11-06 21:46:33,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:46:33,685 INFO L93 Difference]: Finished difference Result 134154 states and 145020 transitions. [2018-11-06 21:46:33,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-06 21:46:33,686 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 793 [2018-11-06 21:46:33,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:46:33,762 INFO L225 Difference]: With dead ends: 134154 [2018-11-06 21:46:33,762 INFO L226 Difference]: Without dead ends: 74769 [2018-11-06 21:46:33,794 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 798 GetRequests, 791 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-11-06 21:46:33,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74769 states. [2018-11-06 21:46:34,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74769 to 62796. [2018-11-06 21:46:34,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62796 states. [2018-11-06 21:46:34,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62796 states to 62796 states and 67474 transitions. [2018-11-06 21:46:34,395 INFO L78 Accepts]: Start accepts. Automaton has 62796 states and 67474 transitions. Word has length 793 [2018-11-06 21:46:34,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:46:34,396 INFO L480 AbstractCegarLoop]: Abstraction has 62796 states and 67474 transitions. [2018-11-06 21:46:34,396 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-06 21:46:34,396 INFO L276 IsEmpty]: Start isEmpty. Operand 62796 states and 67474 transitions. [2018-11-06 21:46:34,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 812 [2018-11-06 21:46:34,431 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:46:34,432 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 21:46:34,433 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:46:34,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:46:34,433 INFO L82 PathProgramCache]: Analyzing trace with hash -418876671, now seen corresponding path program 1 times [2018-11-06 21:46:34,433 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:46:34,433 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:46:34,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:46:34,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:46:34,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:46:34,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:46:35,563 INFO L134 CoverageAnalysis]: Checked inductivity of 949 backedges. 499 proven. 83 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2018-11-06 21:46:35,563 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:46:35,563 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 21:46:35,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:46:35,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:46:35,789 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:46:36,265 WARN L179 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 29 [2018-11-06 21:46:38,555 INFO L134 CoverageAnalysis]: Checked inductivity of 949 backedges. 679 proven. 0 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2018-11-06 21:46:38,576 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 21:46:38,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2018-11-06 21:46:38,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-06 21:46:38,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-06 21:46:38,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-06 21:46:38,578 INFO L87 Difference]: Start difference. First operand 62796 states and 67474 transitions. Second operand 6 states. [2018-11-06 21:46:46,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:46:46,502 INFO L93 Difference]: Finished difference Result 146095 states and 157052 transitions. [2018-11-06 21:46:46,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-06 21:46:46,502 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 811 [2018-11-06 21:46:46,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:46:46,583 INFO L225 Difference]: With dead ends: 146095 [2018-11-06 21:46:46,583 INFO L226 Difference]: Without dead ends: 83728 [2018-11-06 21:46:46,619 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 814 GetRequests, 810 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-06 21:46:46,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83728 states. [2018-11-06 21:46:47,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83728 to 69192. [2018-11-06 21:46:47,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69192 states. [2018-11-06 21:46:47,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69192 states to 69192 states and 73477 transitions. [2018-11-06 21:46:47,289 INFO L78 Accepts]: Start accepts. Automaton has 69192 states and 73477 transitions. Word has length 811 [2018-11-06 21:46:47,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:46:47,290 INFO L480 AbstractCegarLoop]: Abstraction has 69192 states and 73477 transitions. [2018-11-06 21:46:47,290 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-06 21:46:47,290 INFO L276 IsEmpty]: Start isEmpty. Operand 69192 states and 73477 transitions. [2018-11-06 21:46:47,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 823 [2018-11-06 21:46:47,319 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:46:47,319 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-06 21:46:47,320 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:46:47,320 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:46:47,320 INFO L82 PathProgramCache]: Analyzing trace with hash 1156954229, now seen corresponding path program 1 times [2018-11-06 21:46:47,320 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:46:47,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:46:47,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:46:47,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:46:47,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:46:47,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:46:48,302 INFO L134 CoverageAnalysis]: Checked inductivity of 1468 backedges. 762 proven. 0 refuted. 0 times theorem prover too weak. 706 trivial. 0 not checked. [2018-11-06 21:46:48,302 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:46:48,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:46:48,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 21:46:48,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 21:46:48,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:46:48,304 INFO L87 Difference]: Start difference. First operand 69192 states and 73477 transitions. Second operand 3 states. [2018-11-06 21:46:50,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:46:50,964 INFO L93 Difference]: Finished difference Result 150321 states and 159529 transitions. [2018-11-06 21:46:50,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 21:46:50,965 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 822 [2018-11-06 21:46:50,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:46:51,037 INFO L225 Difference]: With dead ends: 150321 [2018-11-06 21:46:51,037 INFO L226 Difference]: Without dead ends: 81558 [2018-11-06 21:46:51,074 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:46:51,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81558 states. [2018-11-06 21:46:51,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81558 to 75576. [2018-11-06 21:46:51,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75576 states. [2018-11-06 21:46:51,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75576 states to 75576 states and 80207 transitions. [2018-11-06 21:46:51,781 INFO L78 Accepts]: Start accepts. Automaton has 75576 states and 80207 transitions. Word has length 822 [2018-11-06 21:46:51,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:46:51,782 INFO L480 AbstractCegarLoop]: Abstraction has 75576 states and 80207 transitions. [2018-11-06 21:46:51,782 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 21:46:51,782 INFO L276 IsEmpty]: Start isEmpty. Operand 75576 states and 80207 transitions. [2018-11-06 21:46:51,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 924 [2018-11-06 21:46:51,816 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:46:51,817 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 21:46:51,817 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:46:51,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:46:51,817 INFO L82 PathProgramCache]: Analyzing trace with hash 439655643, now seen corresponding path program 1 times [2018-11-06 21:46:51,818 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:46:51,818 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:46:51,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:46:51,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:46:51,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:46:51,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:46:52,888 WARN L179 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 7 [2018-11-06 21:46:56,831 INFO L134 CoverageAnalysis]: Checked inductivity of 1443 backedges. 874 proven. 490 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-11-06 21:46:56,831 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:46:56,831 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 21:46:56,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:46:57,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:46:57,082 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:46:57,646 WARN L179 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-11-06 21:46:59,519 INFO L134 CoverageAnalysis]: Checked inductivity of 1443 backedges. 1091 proven. 246 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2018-11-06 21:46:59,539 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 21:46:59,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 6] total 17 [2018-11-06 21:46:59,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-06 21:46:59,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-06 21:46:59,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2018-11-06 21:46:59,542 INFO L87 Difference]: Start difference. First operand 75576 states and 80207 transitions. Second operand 17 states. [2018-11-06 21:46:59,730 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2018-11-06 21:47:01,241 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 32 [2018-11-06 21:47:20,989 WARN L179 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2018-11-06 21:47:24,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:47:24,118 INFO L93 Difference]: Finished difference Result 155785 states and 165089 transitions. [2018-11-06 21:47:24,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-11-06 21:47:24,119 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 923 [2018-11-06 21:47:24,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:47:24,192 INFO L225 Difference]: With dead ends: 155785 [2018-11-06 21:47:24,192 INFO L226 Difference]: Without dead ends: 80210 [2018-11-06 21:47:24,218 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1033 GetRequests, 966 SyntacticMatches, 4 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1410 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=963, Invalid=3197, Unknown=0, NotChecked=0, Total=4160 [2018-11-06 21:47:24,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80210 states. [2018-11-06 21:47:24,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80210 to 69578. [2018-11-06 21:47:24,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69578 states. [2018-11-06 21:47:24,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69578 states to 69578 states and 72589 transitions. [2018-11-06 21:47:24,937 INFO L78 Accepts]: Start accepts. Automaton has 69578 states and 72589 transitions. Word has length 923 [2018-11-06 21:47:24,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:47:24,937 INFO L480 AbstractCegarLoop]: Abstraction has 69578 states and 72589 transitions. [2018-11-06 21:47:24,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-06 21:47:24,937 INFO L276 IsEmpty]: Start isEmpty. Operand 69578 states and 72589 transitions. [2018-11-06 21:47:24,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1598 [2018-11-06 21:47:24,992 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:47:24,993 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:47:24,993 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:47:24,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:47:24,994 INFO L82 PathProgramCache]: Analyzing trace with hash -1263128196, now seen corresponding path program 1 times [2018-11-06 21:47:24,994 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:47:24,994 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:47:24,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:47:24,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:47:24,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:47:25,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:47:27,561 INFO L134 CoverageAnalysis]: Checked inductivity of 3164 backedges. 2350 proven. 0 refuted. 0 times theorem prover too weak. 814 trivial. 0 not checked. [2018-11-06 21:47:27,561 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:47:27,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:47:27,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 21:47:27,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 21:47:27,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:47:27,563 INFO L87 Difference]: Start difference. First operand 69578 states and 72589 transitions. Second operand 3 states. [2018-11-06 21:47:29,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:47:29,915 INFO L93 Difference]: Finished difference Result 137447 states and 143352 transitions. [2018-11-06 21:47:29,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 21:47:29,915 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1597 [2018-11-06 21:47:29,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:47:29,977 INFO L225 Difference]: With dead ends: 137447 [2018-11-06 21:47:29,977 INFO L226 Difference]: Without dead ends: 68297 [2018-11-06 21:47:30,012 INFO L604 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-11-06 21:47:30,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68297 states. [2018-11-06 21:47:30,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68297 to 66157. [2018-11-06 21:47:30,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66157 states. [2018-11-06 21:47:30,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66157 states to 66157 states and 68721 transitions. [2018-11-06 21:47:30,623 INFO L78 Accepts]: Start accepts. Automaton has 66157 states and 68721 transitions. Word has length 1597 [2018-11-06 21:47:30,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:47:30,624 INFO L480 AbstractCegarLoop]: Abstraction has 66157 states and 68721 transitions. [2018-11-06 21:47:30,624 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 21:47:30,624 INFO L276 IsEmpty]: Start isEmpty. Operand 66157 states and 68721 transitions. [2018-11-06 21:47:30,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1728 [2018-11-06 21:47:30,680 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:47:30,681 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 21:47:30,681 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:47:30,682 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:47:30,682 INFO L82 PathProgramCache]: Analyzing trace with hash 579701680, now seen corresponding path program 1 times [2018-11-06 21:47:30,682 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:47:30,682 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:47:30,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:47:30,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:47:30,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:47:30,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:47:34,009 INFO L134 CoverageAnalysis]: Checked inductivity of 4252 backedges. 2605 proven. 0 refuted. 0 times theorem prover too weak. 1647 trivial. 0 not checked. [2018-11-06 21:47:34,009 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:47:34,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:47:34,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 21:47:34,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 21:47:34,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:47:34,011 INFO L87 Difference]: Start difference. First operand 66157 states and 68721 transitions. Second operand 3 states. [2018-11-06 21:47:36,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:47:36,439 INFO L93 Difference]: Finished difference Result 122484 states and 127226 transitions. [2018-11-06 21:47:36,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 21:47:36,439 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1727 [2018-11-06 21:47:36,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:47:36,441 INFO L225 Difference]: With dead ends: 122484 [2018-11-06 21:47:36,441 INFO L226 Difference]: Without dead ends: 0 [2018-11-06 21:47:36,478 INFO L604 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-11-06 21:47:36,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-06 21:47:36,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-06 21:47:36,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-06 21:47:36,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-06 21:47:36,479 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1727 [2018-11-06 21:47:36,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:47:36,480 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-06 21:47:36,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 21:47:36,480 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-06 21:47:36,480 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-06 21:47:36,485 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-06 21:47:36,592 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:47:36,641 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:47:36,721 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:47:36,775 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:47:36,843 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:47:36,882 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:47:36,889 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:47:36,998 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:47:37,005 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:47:37,015 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:47:37,021 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:47:37,036 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:47:37,091 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:47:37,114 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:47:37,117 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:47:37,176 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:47:37,235 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:47:37,276 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:47:37,288 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:47:37,434 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:47:37,456 WARN L179 SmtUtils]: Spent 958.00 ms on a formula simplification. DAG size of input: 705 DAG size of output: 346 [2018-11-06 21:47:37,520 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:47:37,573 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:47:37,655 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:47:37,674 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:47:37,739 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:47:37,820 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:47:37,841 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:47:37,872 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:47:37,878 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:47:38,079 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:47:38,082 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:47:38,087 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:47:38,092 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:47:38,096 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:47:38,100 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:47:38,107 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:47:38,108 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:47:38,111 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:47:38,116 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:47:38,143 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:47:38,156 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:47:38,189 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:47:38,221 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:47:38,243 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:47:38,258 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:47:38,330 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:47:38,357 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:47:38,374 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:47:38,414 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:47:38,468 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:47:38,490 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:47:38,614 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:47:38,622 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:47:38,644 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:47:38,647 WARN L179 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 817 DAG size of output: 380 [2018-11-06 21:47:38,705 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:47:38,753 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:47:38,829 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:47:38,848 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:47:38,921 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:47:39,001 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:47:39,023 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:47:39,056 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:47:39,063 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:47:39,274 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:47:39,277 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:47:39,283 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:47:39,287 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:47:39,291 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:47:39,296 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:47:39,302 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:47:39,303 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:47:39,305 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:47:39,310 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:47:39,336 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:47:39,349 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:47:39,380 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:47:39,409 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:47:39,429 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:47:39,442 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:47:39,509 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:47:39,533 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:47:39,547 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:47:39,584 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:47:39,630 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:47:39,649 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:47:39,752 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:47:39,760 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:47:39,782 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:47:39,786 WARN L179 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 817 DAG size of output: 380 Received shutdown request... [2018-11-06 21:47:43,339 WARN L187 SmtUtils]: Removed 2 from assertion stack [2018-11-06 21:47:43,339 INFO L256 ToolchainWalker]: Toolchain cancelled while executing plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction. Reason: Timeout or Toolchain cancelled by user [2018-11-06 21:47:43,340 INFO L168 Benchmark]: Toolchain (without parser) took 233766.13 ms. Allocated memory was 1.5 GB in the beginning and 4.0 GB in the end (delta: 2.4 GB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -597.9 MB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2018-11-06 21:47:43,341 INFO L168 Benchmark]: CDTParser took 0.24 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-11-06 21:47:43,342 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1559.71 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 126.8 MB). Peak memory consumption was 126.8 MB. Max. memory is 7.1 GB. [2018-11-06 21:47:43,343 INFO L168 Benchmark]: Boogie Procedure Inliner took 472.02 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 778.0 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -905.7 MB). Peak memory consumption was 42.4 MB. Max. memory is 7.1 GB. [2018-11-06 21:47:43,344 INFO L168 Benchmark]: Boogie Preprocessor took 327.24 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 41.3 MB). Peak memory consumption was 41.3 MB. Max. memory is 7.1 GB. [2018-11-06 21:47:43,345 INFO L168 Benchmark]: RCFGBuilder took 8808.86 ms. Allocated memory is still 2.3 GB. Free memory was 2.1 GB in the beginning and 1.7 GB in the end (delta: 479.7 MB). Peak memory consumption was 479.7 MB. Max. memory is 7.1 GB. [2018-11-06 21:47:43,346 INFO L168 Benchmark]: TraceAbstraction took 222593.46 ms. Allocated memory was 2.3 GB in the beginning and 4.0 GB in the end (delta: 1.7 GB). Free memory was 1.7 GB in the beginning and 2.0 GB in the end (delta: -340.1 MB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2018-11-06 21:47:43,351 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.24 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 1559.71 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 126.8 MB). Peak memory consumption was 126.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 472.02 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 778.0 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -905.7 MB). Peak memory consumption was 42.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 327.24 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 41.3 MB). Peak memory consumption was 41.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 8808.86 ms. Allocated memory is still 2.3 GB. Free memory was 2.1 GB in the beginning and 1.7 GB in the end (delta: 479.7 MB). Peak memory consumption was 479.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 222593.46 ms. Allocated memory was 2.3 GB in the beginning and 4.0 GB in the end (delta: 1.7 GB). Free memory was 1.7 GB in the beginning and 2.0 GB in the end (delta: -340.1 MB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 200]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - TimeoutResult: Timeout (de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction) Toolchain cancelled while SimplifyDDAWithTimeout was simplifying term of DAG size 330. RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown