java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem13_label45_false-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 14:12:16,700 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 14:12:16,702 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 14:12:16,715 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 14:12:16,715 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 14:12:16,716 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 14:12:16,718 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 14:12:16,719 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 14:12:16,721 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 14:12:16,722 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 14:12:16,723 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 14:12:16,723 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 14:12:16,724 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 14:12:16,726 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 14:12:16,727 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 14:12:16,728 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 14:12:16,728 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 14:12:16,730 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 14:12:16,732 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 14:12:16,734 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 14:12:16,735 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 14:12:16,736 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 14:12:16,738 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 14:12:16,739 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 14:12:16,739 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 14:12:16,740 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 14:12:16,741 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 14:12:16,742 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 14:12:16,743 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 14:12:16,744 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 14:12:16,744 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 14:12:16,745 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 14:12:16,745 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 14:12:16,745 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 14:12:16,747 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 14:12:16,747 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 14:12:16,748 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-10-24 14:12:16,763 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 14:12:16,764 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 14:12:16,764 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 14:12:16,765 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-24 14:12:16,765 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-24 14:12:16,766 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-24 14:12:16,766 INFO L133 SettingsManager]: * Use SBE=true [2018-10-24 14:12:16,766 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 14:12:16,766 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 14:12:16,766 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 14:12:16,767 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 14:12:16,767 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 14:12:16,767 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 14:12:16,767 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 14:12:16,767 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 14:12:16,768 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 14:12:16,768 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 14:12:16,768 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 14:12:16,768 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 14:12:16,769 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 14:12:16,769 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 14:12:16,769 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 14:12:16,769 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 14:12:16,769 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-24 14:12:16,770 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 14:12:16,770 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 14:12:16,770 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 14:12:16,770 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 14:12:16,818 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 14:12:16,836 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 14:12:16,840 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 14:12:16,842 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 14:12:16,842 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 14:12:16,843 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem13_label45_false-unreach-call.c [2018-10-24 14:12:16,911 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/4156848ef/88e60602bb8a4b5cbfc1a96c43c25889/FLAGa7eda83c6 [2018-10-24 14:12:17,764 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 14:12:17,766 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem13_label45_false-unreach-call.c [2018-10-24 14:12:17,805 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/4156848ef/88e60602bb8a4b5cbfc1a96c43c25889/FLAGa7eda83c6 [2018-10-24 14:12:17,826 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/4156848ef/88e60602bb8a4b5cbfc1a96c43c25889 [2018-10-24 14:12:17,840 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 14:12:17,843 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 14:12:17,844 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 14:12:17,844 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 14:12:17,850 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 14:12:17,851 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:12:17" (1/1) ... [2018-10-24 14:12:17,854 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@379aca2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:12:17, skipping insertion in model container [2018-10-24 14:12:17,855 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:12:17" (1/1) ... [2018-10-24 14:12:17,866 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 14:12:18,061 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 14:12:19,451 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 14:12:19,458 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 14:12:20,203 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 14:12:20,243 INFO L193 MainTranslator]: Completed translation [2018-10-24 14:12:20,243 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:12:20 WrapperNode [2018-10-24 14:12:20,243 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 14:12:20,244 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 14:12:20,245 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 14:12:20,245 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 14:12:20,255 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:12:20" (1/1) ... [2018-10-24 14:12:20,332 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:12:20" (1/1) ... [2018-10-24 14:12:21,071 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 14:12:21,072 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 14:12:21,072 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 14:12:21,072 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 14:12:21,083 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:12:20" (1/1) ... [2018-10-24 14:12:21,084 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:12:20" (1/1) ... [2018-10-24 14:12:21,180 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:12:20" (1/1) ... [2018-10-24 14:12:21,180 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:12:20" (1/1) ... [2018-10-24 14:12:21,367 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:12:20" (1/1) ... [2018-10-24 14:12:21,418 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:12:20" (1/1) ... [2018-10-24 14:12:21,480 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:12:20" (1/1) ... [2018-10-24 14:12:21,547 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 14:12:21,548 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 14:12:21,548 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 14:12:21,548 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 14:12:21,549 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:12:20" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 14:12:21,619 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-24 14:12:21,620 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 14:12:21,620 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 14:12:34,951 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 14:12:34,951 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:12:34 BoogieIcfgContainer [2018-10-24 14:12:34,952 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 14:12:34,953 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 14:12:34,953 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 14:12:34,957 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 14:12:34,957 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 02:12:17" (1/3) ... [2018-10-24 14:12:34,958 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bfb4c9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:12:34, skipping insertion in model container [2018-10-24 14:12:34,958 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:12:20" (2/3) ... [2018-10-24 14:12:34,959 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bfb4c9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:12:34, skipping insertion in model container [2018-10-24 14:12:34,960 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:12:34" (3/3) ... [2018-10-24 14:12:34,962 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem13_label45_false-unreach-call.c [2018-10-24 14:12:34,973 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 14:12:34,986 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 14:12:35,006 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 14:12:35,066 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-24 14:12:35,066 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 14:12:35,066 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 14:12:35,067 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 14:12:35,067 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 14:12:35,067 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 14:12:35,067 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 14:12:35,067 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 14:12:35,067 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 14:12:35,113 INFO L276 IsEmpty]: Start isEmpty. Operand 1099 states. [2018-10-24 14:12:35,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-24 14:12:35,120 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:12:35,121 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:12:35,123 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:12:35,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:12:35,130 INFO L82 PathProgramCache]: Analyzing trace with hash 150940466, now seen corresponding path program 1 times [2018-10-24 14:12:35,132 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:12:35,133 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:12:35,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:12:35,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:12:35,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:12:35,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:12:35,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:12:35,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:12:35,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:12:35,341 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:12:35,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:12:35,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:12:35,363 INFO L87 Difference]: Start difference. First operand 1099 states. Second operand 3 states. [2018-10-24 14:12:45,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:12:45,202 INFO L93 Difference]: Finished difference Result 3038 states and 5646 transitions. [2018-10-24 14:12:45,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:12:45,204 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-10-24 14:12:45,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:12:45,251 INFO L225 Difference]: With dead ends: 3038 [2018-10-24 14:12:45,252 INFO L226 Difference]: Without dead ends: 1935 [2018-10-24 14:12:45,261 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:12:45,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1935 states. [2018-10-24 14:12:45,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1935 to 1921. [2018-10-24 14:12:45,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1921 states. [2018-10-24 14:12:45,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1921 states to 1921 states and 3004 transitions. [2018-10-24 14:12:45,399 INFO L78 Accepts]: Start accepts. Automaton has 1921 states and 3004 transitions. Word has length 8 [2018-10-24 14:12:45,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:12:45,399 INFO L481 AbstractCegarLoop]: Abstraction has 1921 states and 3004 transitions. [2018-10-24 14:12:45,400 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:12:45,400 INFO L276 IsEmpty]: Start isEmpty. Operand 1921 states and 3004 transitions. [2018-10-24 14:12:45,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-10-24 14:12:45,403 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:12:45,404 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-24 14:12:45,404 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:12:45,404 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:12:45,404 INFO L82 PathProgramCache]: Analyzing trace with hash -1966810658, now seen corresponding path program 1 times [2018-10-24 14:12:45,405 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:12:45,405 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:12:45,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:12:45,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:12:45,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:12:45,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:12:46,676 WARN L179 SmtUtils]: Spent 814.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 27 [2018-10-24 14:12:47,052 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:12:47,053 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:12:47,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 14:12:47,055 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 14:12:47,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 14:12:47,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-24 14:12:47,056 INFO L87 Difference]: Start difference. First operand 1921 states and 3004 transitions. Second operand 5 states. [2018-10-24 14:13:01,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:13:01,645 INFO L93 Difference]: Finished difference Result 7027 states and 10524 transitions. [2018-10-24 14:13:01,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 14:13:01,646 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2018-10-24 14:13:01,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:13:01,677 INFO L225 Difference]: With dead ends: 7027 [2018-10-24 14:13:01,677 INFO L226 Difference]: Without dead ends: 5108 [2018-10-24 14:13:01,682 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-10-24 14:13:01,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5108 states. [2018-10-24 14:13:01,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5108 to 5107. [2018-10-24 14:13:01,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5107 states. [2018-10-24 14:13:01,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5107 states to 5107 states and 6806 transitions. [2018-10-24 14:13:01,793 INFO L78 Accepts]: Start accepts. Automaton has 5107 states and 6806 transitions. Word has length 81 [2018-10-24 14:13:01,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:13:01,793 INFO L481 AbstractCegarLoop]: Abstraction has 5107 states and 6806 transitions. [2018-10-24 14:13:01,793 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 14:13:01,794 INFO L276 IsEmpty]: Start isEmpty. Operand 5107 states and 6806 transitions. [2018-10-24 14:13:01,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-10-24 14:13:01,807 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:13:01,808 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:13:01,808 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:13:01,808 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:13:01,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1519502355, now seen corresponding path program 1 times [2018-10-24 14:13:01,810 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:13:01,810 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:13:01,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:13:01,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:13:01,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:13:01,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:13:02,264 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-10-24 14:13:02,265 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 14:13:02,265 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 14:13:02,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:13:02,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:13:02,396 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 14:13:02,459 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:13:02,491 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 14:13:02,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2018-10-24 14:13:02,492 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:13:02,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:13:02,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:13:02,493 INFO L87 Difference]: Start difference. First operand 5107 states and 6806 transitions. Second operand 4 states. [2018-10-24 14:13:15,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:13:15,639 INFO L93 Difference]: Finished difference Result 16577 states and 23048 transitions. [2018-10-24 14:13:15,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:13:15,639 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 177 [2018-10-24 14:13:15,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:13:15,695 INFO L225 Difference]: With dead ends: 16577 [2018-10-24 14:13:15,695 INFO L226 Difference]: Without dead ends: 12260 [2018-10-24 14:13:15,704 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:13:15,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12260 states. [2018-10-24 14:13:15,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12260 to 8276. [2018-10-24 14:13:15,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8276 states. [2018-10-24 14:13:15,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8276 states to 8276 states and 10661 transitions. [2018-10-24 14:13:15,885 INFO L78 Accepts]: Start accepts. Automaton has 8276 states and 10661 transitions. Word has length 177 [2018-10-24 14:13:15,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:13:15,886 INFO L481 AbstractCegarLoop]: Abstraction has 8276 states and 10661 transitions. [2018-10-24 14:13:15,887 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:13:15,887 INFO L276 IsEmpty]: Start isEmpty. Operand 8276 states and 10661 transitions. [2018-10-24 14:13:15,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-10-24 14:13:15,892 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:13:15,892 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:13:15,892 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:13:15,893 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:13:15,893 INFO L82 PathProgramCache]: Analyzing trace with hash 234639946, now seen corresponding path program 1 times [2018-10-24 14:13:15,893 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:13:15,893 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:13:15,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:13:15,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:13:15,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:13:15,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:13:16,371 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 6 DAG size of output: 3 [2018-10-24 14:13:16,419 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:13:16,419 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:13:16,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 14:13:16,420 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 14:13:16,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 14:13:16,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 14:13:16,421 INFO L87 Difference]: Start difference. First operand 8276 states and 10661 transitions. Second operand 5 states. [2018-10-24 14:13:34,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:13:34,521 INFO L93 Difference]: Finished difference Result 35769 states and 47453 transitions. [2018-10-24 14:13:34,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 14:13:34,522 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 191 [2018-10-24 14:13:34,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:13:34,601 INFO L225 Difference]: With dead ends: 35769 [2018-10-24 14:13:34,602 INFO L226 Difference]: Without dead ends: 28283 [2018-10-24 14:13:34,613 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 14:13:34,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28283 states. [2018-10-24 14:13:34,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28283 to 28107. [2018-10-24 14:13:34,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28107 states. [2018-10-24 14:13:35,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28107 states to 28107 states and 34886 transitions. [2018-10-24 14:13:35,022 INFO L78 Accepts]: Start accepts. Automaton has 28107 states and 34886 transitions. Word has length 191 [2018-10-24 14:13:35,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:13:35,023 INFO L481 AbstractCegarLoop]: Abstraction has 28107 states and 34886 transitions. [2018-10-24 14:13:35,023 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 14:13:35,023 INFO L276 IsEmpty]: Start isEmpty. Operand 28107 states and 34886 transitions. [2018-10-24 14:13:35,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-10-24 14:13:35,026 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:13:35,027 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:13:35,027 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:13:35,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:13:35,027 INFO L82 PathProgramCache]: Analyzing trace with hash 1170448595, now seen corresponding path program 1 times [2018-10-24 14:13:35,027 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:13:35,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:13:35,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:13:35,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:13:35,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:13:35,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:13:35,273 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-10-24 14:13:35,273 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:13:35,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:13:35,274 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:13:35,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:13:35,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:13:35,275 INFO L87 Difference]: Start difference. First operand 28107 states and 34886 transitions. Second operand 3 states. [2018-10-24 14:13:42,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:13:42,028 INFO L93 Difference]: Finished difference Result 79846 states and 99837 transitions. [2018-10-24 14:13:42,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:13:42,033 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 207 [2018-10-24 14:13:42,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:13:42,130 INFO L225 Difference]: With dead ends: 79846 [2018-10-24 14:13:42,131 INFO L226 Difference]: Without dead ends: 52529 [2018-10-24 14:13:42,168 INFO L605 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-10-24 14:13:42,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52529 states. [2018-10-24 14:13:43,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52529 to 50159. [2018-10-24 14:13:43,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50159 states. [2018-10-24 14:13:43,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50159 states to 50159 states and 59198 transitions. [2018-10-24 14:13:43,108 INFO L78 Accepts]: Start accepts. Automaton has 50159 states and 59198 transitions. Word has length 207 [2018-10-24 14:13:43,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:13:43,108 INFO L481 AbstractCegarLoop]: Abstraction has 50159 states and 59198 transitions. [2018-10-24 14:13:43,108 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:13:43,109 INFO L276 IsEmpty]: Start isEmpty. Operand 50159 states and 59198 transitions. [2018-10-24 14:13:43,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2018-10-24 14:13:43,118 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:13:43,119 INFO L375 BasicCegarLoop]: trace histogram [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, 2, 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] [2018-10-24 14:13:43,119 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:13:43,119 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:13:43,120 INFO L82 PathProgramCache]: Analyzing trace with hash -1978878205, now seen corresponding path program 1 times [2018-10-24 14:13:43,120 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:13:43,120 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:13:43,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:13:43,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:13:43,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:13:43,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:13:43,475 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 250 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-24 14:13:43,476 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:13:43,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 14:13:43,477 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:13:43,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:13:43,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:13:43,478 INFO L87 Difference]: Start difference. First operand 50159 states and 59198 transitions. Second operand 4 states. [2018-10-24 14:13:55,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:13:55,751 INFO L93 Difference]: Finished difference Result 144488 states and 175809 transitions. [2018-10-24 14:13:55,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:13:55,751 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 309 [2018-10-24 14:13:55,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:13:55,881 INFO L225 Difference]: With dead ends: 144488 [2018-10-24 14:13:55,881 INFO L226 Difference]: Without dead ends: 95119 [2018-10-24 14:13:55,935 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:13:56,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95119 states. [2018-10-24 14:13:56,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95119 to 90337. [2018-10-24 14:13:56,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90337 states. [2018-10-24 14:13:57,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90337 states to 90337 states and 106598 transitions. [2018-10-24 14:13:57,013 INFO L78 Accepts]: Start accepts. Automaton has 90337 states and 106598 transitions. Word has length 309 [2018-10-24 14:13:57,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:13:57,014 INFO L481 AbstractCegarLoop]: Abstraction has 90337 states and 106598 transitions. [2018-10-24 14:13:57,014 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:13:57,014 INFO L276 IsEmpty]: Start isEmpty. Operand 90337 states and 106598 transitions. [2018-10-24 14:13:57,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2018-10-24 14:13:57,024 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:13:57,025 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:13:57,025 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:13:57,025 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:13:57,026 INFO L82 PathProgramCache]: Analyzing trace with hash 658310034, now seen corresponding path program 1 times [2018-10-24 14:13:57,026 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:13:57,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:13:57,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:13:57,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:13:57,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:13:57,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:13:57,296 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 293 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-24 14:13:57,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:13:57,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:13:57,301 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:13:57,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:13:57,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:13:57,302 INFO L87 Difference]: Start difference. First operand 90337 states and 106598 transitions. Second operand 3 states. [2018-10-24 14:14:04,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:14:04,734 INFO L93 Difference]: Finished difference Result 180651 states and 213027 transitions. [2018-10-24 14:14:04,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:14:04,735 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 328 [2018-10-24 14:14:04,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:14:04,816 INFO L225 Difference]: With dead ends: 180651 [2018-10-24 14:14:04,817 INFO L226 Difference]: Without dead ends: 90310 [2018-10-24 14:14:04,855 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:14:04,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90310 states. [2018-10-24 14:14:05,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90310 to 87940. [2018-10-24 14:14:05,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87940 states. [2018-10-24 14:14:05,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87940 states to 87940 states and 98364 transitions. [2018-10-24 14:14:05,747 INFO L78 Accepts]: Start accepts. Automaton has 87940 states and 98364 transitions. Word has length 328 [2018-10-24 14:14:05,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:14:05,747 INFO L481 AbstractCegarLoop]: Abstraction has 87940 states and 98364 transitions. [2018-10-24 14:14:05,747 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:14:05,748 INFO L276 IsEmpty]: Start isEmpty. Operand 87940 states and 98364 transitions. [2018-10-24 14:14:05,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2018-10-24 14:14:05,757 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:14:05,758 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:14:05,758 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:14:05,758 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:14:05,758 INFO L82 PathProgramCache]: Analyzing trace with hash -1415611987, now seen corresponding path program 1 times [2018-10-24 14:14:05,758 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:14:05,759 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:14:05,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:14:05,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:14:05,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:14:05,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:14:06,362 WARN L179 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 7 [2018-10-24 14:14:06,674 WARN L179 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 8 [2018-10-24 14:14:06,761 INFO L134 CoverageAnalysis]: Checked inductivity of 474 backedges. 390 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-10-24 14:14:06,761 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:14:06,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-24 14:14:06,762 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 14:14:06,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 14:14:06,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-10-24 14:14:06,763 INFO L87 Difference]: Start difference. First operand 87940 states and 98364 transitions. Second operand 6 states. [2018-10-24 14:14:30,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:14:30,022 INFO L93 Difference]: Finished difference Result 232811 states and 260971 transitions. [2018-10-24 14:14:30,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-24 14:14:30,029 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 341 [2018-10-24 14:14:30,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:14:30,201 INFO L225 Difference]: With dead ends: 232811 [2018-10-24 14:14:30,202 INFO L226 Difference]: Without dead ends: 145661 [2018-10-24 14:14:30,253 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-10-24 14:14:30,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145661 states. [2018-10-24 14:14:31,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145661 to 140823. [2018-10-24 14:14:31,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140823 states. [2018-10-24 14:14:31,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140823 states to 140823 states and 156494 transitions. [2018-10-24 14:14:31,463 INFO L78 Accepts]: Start accepts. Automaton has 140823 states and 156494 transitions. Word has length 341 [2018-10-24 14:14:31,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:14:31,463 INFO L481 AbstractCegarLoop]: Abstraction has 140823 states and 156494 transitions. [2018-10-24 14:14:31,463 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 14:14:31,463 INFO L276 IsEmpty]: Start isEmpty. Operand 140823 states and 156494 transitions. [2018-10-24 14:14:31,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2018-10-24 14:14:31,473 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:14:31,474 INFO L375 BasicCegarLoop]: trace histogram [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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:14:31,474 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:14:31,474 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:14:31,474 INFO L82 PathProgramCache]: Analyzing trace with hash 34356073, now seen corresponding path program 1 times [2018-10-24 14:14:31,474 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:14:31,475 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:14:31,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:14:31,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:14:31,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:14:31,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:14:32,967 INFO L134 CoverageAnalysis]: Checked inductivity of 356 backedges. 350 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-24 14:14:32,967 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:14:32,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:14:32,968 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:14:32,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:14:32,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:14:32,969 INFO L87 Difference]: Start difference. First operand 140823 states and 156494 transitions. Second operand 4 states. [2018-10-24 14:14:41,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:14:41,619 INFO L93 Difference]: Finished difference Result 296617 states and 328938 transitions. [2018-10-24 14:14:41,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:14:41,619 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 366 [2018-10-24 14:14:41,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:14:41,777 INFO L225 Difference]: With dead ends: 296617 [2018-10-24 14:14:41,778 INFO L226 Difference]: Without dead ends: 146310 [2018-10-24 14:14:41,853 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:14:41,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146310 states. [2018-10-24 14:14:43,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146310 to 141575. [2018-10-24 14:14:43,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141575 states. [2018-10-24 14:14:44,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141575 states to 141575 states and 155905 transitions. [2018-10-24 14:14:44,115 INFO L78 Accepts]: Start accepts. Automaton has 141575 states and 155905 transitions. Word has length 366 [2018-10-24 14:14:44,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:14:44,115 INFO L481 AbstractCegarLoop]: Abstraction has 141575 states and 155905 transitions. [2018-10-24 14:14:44,115 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:14:44,115 INFO L276 IsEmpty]: Start isEmpty. Operand 141575 states and 155905 transitions. [2018-10-24 14:14:44,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2018-10-24 14:14:44,118 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:14:44,118 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:14:44,118 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:14:44,119 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:14:44,119 INFO L82 PathProgramCache]: Analyzing trace with hash -2074722948, now seen corresponding path program 1 times [2018-10-24 14:14:44,119 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:14:44,119 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:14:44,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:14:44,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:14:44,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:14:44,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:14:44,486 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2018-10-24 14:14:44,487 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:14:44,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 14:14:44,488 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:14:44,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:14:44,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:14:44,488 INFO L87 Difference]: Start difference. First operand 141575 states and 155905 transitions. Second operand 4 states. [2018-10-24 14:14:55,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:14:55,311 INFO L93 Difference]: Finished difference Result 282371 states and 311022 transitions. [2018-10-24 14:14:55,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:14:55,312 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 414 [2018-10-24 14:14:55,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:14:55,465 INFO L225 Difference]: With dead ends: 282371 [2018-10-24 14:14:55,465 INFO L226 Difference]: Without dead ends: 135244 [2018-10-24 14:14:55,519 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:14:55,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135244 states. [2018-10-24 14:14:56,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135244 to 124966. [2018-10-24 14:14:56,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124966 states. [2018-10-24 14:14:56,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124966 states to 124966 states and 132512 transitions. [2018-10-24 14:14:56,490 INFO L78 Accepts]: Start accepts. Automaton has 124966 states and 132512 transitions. Word has length 414 [2018-10-24 14:14:56,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:14:56,491 INFO L481 AbstractCegarLoop]: Abstraction has 124966 states and 132512 transitions. [2018-10-24 14:14:56,491 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:14:56,491 INFO L276 IsEmpty]: Start isEmpty. Operand 124966 states and 132512 transitions. [2018-10-24 14:14:56,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 559 [2018-10-24 14:14:56,496 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:14:56,497 INFO L375 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:14:56,497 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:14:56,497 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:14:56,498 INFO L82 PathProgramCache]: Analyzing trace with hash -2029809358, now seen corresponding path program 1 times [2018-10-24 14:14:56,498 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:14:56,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:14:56,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:14:56,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:14:56,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:14:56,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:14:58,015 INFO L134 CoverageAnalysis]: Checked inductivity of 309 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2018-10-24 14:14:58,015 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:14:58,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:14:58,016 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:14:58,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:14:58,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:14:58,017 INFO L87 Difference]: Start difference. First operand 124966 states and 132512 transitions. Second operand 3 states. [2018-10-24 14:15:04,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:15:04,065 INFO L93 Difference]: Finished difference Result 245982 states and 260780 transitions. [2018-10-24 14:15:04,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:15:04,066 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 558 [2018-10-24 14:15:04,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:15:04,216 INFO L225 Difference]: With dead ends: 245982 [2018-10-24 14:15:04,216 INFO L226 Difference]: Without dead ends: 121806 [2018-10-24 14:15:04,283 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:15:04,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121806 states. [2018-10-24 14:15:06,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121806 to 119441. [2018-10-24 14:15:06,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119441 states. [2018-10-24 14:15:06,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119441 states to 119441 states and 125036 transitions. [2018-10-24 14:15:06,383 INFO L78 Accepts]: Start accepts. Automaton has 119441 states and 125036 transitions. Word has length 558 [2018-10-24 14:15:06,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:15:06,384 INFO L481 AbstractCegarLoop]: Abstraction has 119441 states and 125036 transitions. [2018-10-24 14:15:06,384 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:15:06,384 INFO L276 IsEmpty]: Start isEmpty. Operand 119441 states and 125036 transitions. [2018-10-24 14:15:06,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 714 [2018-10-24 14:15:06,395 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:15:06,396 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:15:06,396 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:15:06,396 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:15:06,397 INFO L82 PathProgramCache]: Analyzing trace with hash -1860205593, now seen corresponding path program 1 times [2018-10-24 14:15:06,397 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:15:06,397 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:15:06,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:15:06,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:15:06,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:15:06,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:15:10,738 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2018-10-24 14:15:10,738 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:15:10,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 14:15:10,739 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 14:15:10,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 14:15:10,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 14:15:10,740 INFO L87 Difference]: Start difference. First operand 119441 states and 125036 transitions. Second operand 5 states. [2018-10-24 14:15:24,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:15:24,938 INFO L93 Difference]: Finished difference Result 322466 states and 338143 transitions. [2018-10-24 14:15:24,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 14:15:24,938 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 713 [2018-10-24 14:15:24,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:15:25,152 INFO L225 Difference]: With dead ends: 322466 [2018-10-24 14:15:25,153 INFO L226 Difference]: Without dead ends: 203815 [2018-10-24 14:15:25,224 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 14:15:25,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203815 states. [2018-10-24 14:15:27,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203815 to 185665. [2018-10-24 14:15:27,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185665 states. [2018-10-24 14:15:27,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185665 states to 185665 states and 192954 transitions. [2018-10-24 14:15:27,324 INFO L78 Accepts]: Start accepts. Automaton has 185665 states and 192954 transitions. Word has length 713 [2018-10-24 14:15:27,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:15:27,325 INFO L481 AbstractCegarLoop]: Abstraction has 185665 states and 192954 transitions. [2018-10-24 14:15:27,325 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 14:15:27,325 INFO L276 IsEmpty]: Start isEmpty. Operand 185665 states and 192954 transitions. [2018-10-24 14:15:27,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 771 [2018-10-24 14:15:27,340 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:15:27,341 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:15:27,341 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:15:27,342 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:15:27,342 INFO L82 PathProgramCache]: Analyzing trace with hash -716144441, now seen corresponding path program 1 times [2018-10-24 14:15:27,342 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:15:27,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:15:27,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:15:27,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:15:27,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:15:27,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:15:28,739 INFO L134 CoverageAnalysis]: Checked inductivity of 1164 backedges. 669 proven. 0 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2018-10-24 14:15:28,740 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:15:28,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 14:15:28,741 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:15:28,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:15:28,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:15:28,741 INFO L87 Difference]: Start difference. First operand 185665 states and 192954 transitions. Second operand 4 states. [2018-10-24 14:15:38,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:15:38,353 INFO L93 Difference]: Finished difference Result 434478 states and 451399 transitions. [2018-10-24 14:15:38,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:15:38,354 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 770 [2018-10-24 14:15:38,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:15:38,618 INFO L225 Difference]: With dead ends: 434478 [2018-10-24 14:15:38,618 INFO L226 Difference]: Without dead ends: 229839 [2018-10-24 14:15:38,712 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:15:38,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229839 states. [2018-10-24 14:15:40,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229839 to 197435. [2018-10-24 14:15:40,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197435 states. [2018-10-24 14:15:41,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197435 states to 197435 states and 204558 transitions. [2018-10-24 14:15:41,117 INFO L78 Accepts]: Start accepts. Automaton has 197435 states and 204558 transitions. Word has length 770 [2018-10-24 14:15:41,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:15:41,118 INFO L481 AbstractCegarLoop]: Abstraction has 197435 states and 204558 transitions. [2018-10-24 14:15:41,118 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:15:41,118 INFO L276 IsEmpty]: Start isEmpty. Operand 197435 states and 204558 transitions. [2018-10-24 14:15:41,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 780 [2018-10-24 14:15:41,129 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:15:41,129 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 14:15:41,130 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:15:41,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:15:41,130 INFO L82 PathProgramCache]: Analyzing trace with hash 48670313, now seen corresponding path program 1 times [2018-10-24 14:15:41,130 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:15:41,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:15:41,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:15:41,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:15:41,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:15:41,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:15:43,029 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 530 proven. 139 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-24 14:15:43,029 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 14:15:43,029 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 14:15:43,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:15:43,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:15:43,244 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 14:15:44,141 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 530 proven. 139 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-24 14:15:44,162 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 14:15:44,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 5 [2018-10-24 14:15:44,164 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 14:15:44,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 14:15:44,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-24 14:15:44,165 INFO L87 Difference]: Start difference. First operand 197435 states and 204558 transitions. Second operand 6 states. Received shutdown request... [2018-10-24 14:16:11,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-24 14:16:11,732 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-24 14:16:11,737 WARN L205 ceAbstractionStarter]: Timeout [2018-10-24 14:16:11,737 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 02:16:11 BoogieIcfgContainer [2018-10-24 14:16:11,737 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-24 14:16:11,738 INFO L168 Benchmark]: Toolchain (without parser) took 233896.48 ms. Allocated memory was 1.5 GB in the beginning and 4.6 GB in the end (delta: 3.0 GB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -782.6 MB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. [2018-10-24 14:16:11,739 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 14:16:11,739 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2399.82 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 243.1 MB). Peak memory consumption was 243.1 MB. Max. memory is 7.1 GB. [2018-10-24 14:16:11,740 INFO L168 Benchmark]: Boogie Procedure Inliner took 827.31 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 837.3 MB). Free memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: -1.0 GB). Peak memory consumption was 83.7 MB. Max. memory is 7.1 GB. [2018-10-24 14:16:11,741 INFO L168 Benchmark]: Boogie Preprocessor took 475.22 ms. Allocated memory is still 2.4 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 61.2 MB). Peak memory consumption was 61.2 MB. Max. memory is 7.1 GB. [2018-10-24 14:16:11,742 INFO L168 Benchmark]: RCFGBuilder took 13404.18 ms. Allocated memory was 2.4 GB in the beginning and 2.6 GB in the end (delta: 235.4 MB). Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 54.5 MB). Peak memory consumption was 605.9 MB. Max. memory is 7.1 GB. [2018-10-24 14:16:11,743 INFO L168 Benchmark]: TraceAbstraction took 216784.40 ms. Allocated memory was 2.6 GB in the beginning and 4.6 GB in the end (delta: 2.0 GB). Free memory was 2.1 GB in the beginning and 2.2 GB in the end (delta: -106.1 MB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2018-10-24 14:16:11,748 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 2399.82 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 243.1 MB). Peak memory consumption was 243.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 827.31 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 837.3 MB). Free memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: -1.0 GB). Peak memory consumption was 83.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 475.22 ms. Allocated memory is still 2.4 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 61.2 MB). Peak memory consumption was 61.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 13404.18 ms. Allocated memory was 2.4 GB in the beginning and 2.6 GB in the end (delta: 235.4 MB). Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 54.5 MB). Peak memory consumption was 605.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 216784.40 ms. Allocated memory was 2.6 GB in the beginning and 4.6 GB in the end (delta: 2.0 GB). Free memory was 2.1 GB in the beginning and 2.2 GB in the end (delta: -106.1 MB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 33]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 33). Cancelled while BasicCegarLoop was constructing difference of abstraction (197435states) and FLOYD_HOARE automaton (currently 6 states, 6 states before enhancement),while ReachableStatesComputation was computing reachable states (270384 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 1099 locations, 1 error locations. TIMEOUT Result, 216.6s OverallTime, 14 OverallIterations, 7 TraceHistogramMax, 184.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 13903 SDtfs, 28950 SDslu, 4024 SDs, 0 SdLazy, 77836 SolverSat, 14587 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 150.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1013 GetRequests, 971 SyntacticMatches, 10 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 3.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=197435occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 14.7s AutomataMinimizationTime, 13 MinimizatonAttempts, 86467 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 8.1s InterpolantComputationTime, 6198 NumberOfCodeBlocks, 6198 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 6182 ConstructedInterpolants, 0 QuantifiedInterpolants, 7372706 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1225 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 16 InterpolantComputations, 13 PerfectInterpolantSequences, 4488/4770 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown