java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem13_label50_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-06 21:22:27,996 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-06 21:22:27,998 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-06 21:22:28,011 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-06 21:22:28,012 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-06 21:22:28,013 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-06 21:22:28,014 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-06 21:22:28,016 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-06 21:22:28,018 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-06 21:22:28,018 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-06 21:22:28,019 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-06 21:22:28,020 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-06 21:22:28,020 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-06 21:22:28,021 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-06 21:22:28,024 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-06 21:22:28,025 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-06 21:22:28,026 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-06 21:22:28,031 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-06 21:22:28,035 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-06 21:22:28,037 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-06 21:22:28,038 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-06 21:22:28,040 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-06 21:22:28,042 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-06 21:22:28,043 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-06 21:22:28,043 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-06 21:22:28,044 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-06 21:22:28,045 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-06 21:22:28,046 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-06 21:22:28,047 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-06 21:22:28,048 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-06 21:22:28,048 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-06 21:22:28,049 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-06 21:22:28,050 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-06 21:22:28,051 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-06 21:22:28,052 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-06 21:22:28,053 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-06 21:22:28,053 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-11-06 21:22:28,084 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-06 21:22:28,084 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-06 21:22:28,085 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-06 21:22:28,085 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-06 21:22:28,086 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-06 21:22:28,086 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-06 21:22:28,086 INFO L133 SettingsManager]: * Use SBE=true [2018-11-06 21:22:28,087 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-06 21:22:28,087 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-06 21:22:28,087 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-06 21:22:28,087 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-06 21:22:28,087 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-06 21:22:28,087 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-06 21:22:28,088 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-06 21:22:28,088 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-06 21:22:28,088 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-06 21:22:28,088 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-06 21:22:28,088 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-06 21:22:28,089 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-06 21:22:28,089 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 21:22:28,089 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-06 21:22:28,089 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-06 21:22:28,089 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-06 21:22:28,089 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-06 21:22:28,090 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-06 21:22:28,090 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-06 21:22:28,090 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-06 21:22:28,090 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-06 21:22:28,154 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-06 21:22:28,167 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-06 21:22:28,171 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-06 21:22:28,172 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-06 21:22:28,173 INFO L276 PluginConnector]: CDTParser initialized [2018-11-06 21:22:28,174 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem13_label50_true-unreach-call.c [2018-11-06 21:22:28,234 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08ffd2c6b/9dd40abcf97e44fb9649cf97cb44be15/FLAG7152621a7 [2018-11-06 21:22:29,001 INFO L298 CDTParser]: Found 1 translation units. [2018-11-06 21:22:29,002 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem13_label50_true-unreach-call.c [2018-11-06 21:22:29,040 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08ffd2c6b/9dd40abcf97e44fb9649cf97cb44be15/FLAG7152621a7 [2018-11-06 21:22:29,056 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08ffd2c6b/9dd40abcf97e44fb9649cf97cb44be15 [2018-11-06 21:22:29,067 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-06 21:22:29,069 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-06 21:22:29,070 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-06 21:22:29,070 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-06 21:22:29,074 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-06 21:22:29,076 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:22:29" (1/1) ... [2018-11-06 21:22:29,079 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41600c68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:22:29, skipping insertion in model container [2018-11-06 21:22:29,079 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:22:29" (1/1) ... [2018-11-06 21:22:29,090 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-06 21:22:29,258 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-06 21:22:30,783 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 21:22:30,788 INFO L189 MainTranslator]: Completed pre-run [2018-11-06 21:22:31,529 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 21:22:31,568 INFO L193 MainTranslator]: Completed translation [2018-11-06 21:22:31,569 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:22:31 WrapperNode [2018-11-06 21:22:31,569 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-06 21:22:31,570 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-06 21:22:31,570 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-06 21:22:31,570 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-06 21:22:31,582 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:22:31" (1/1) ... [2018-11-06 21:22:31,965 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:22:31" (1/1) ... [2018-11-06 21:22:32,344 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-06 21:22:32,344 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-06 21:22:32,344 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-06 21:22:32,345 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-06 21:22:32,356 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:22:31" (1/1) ... [2018-11-06 21:22:32,356 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:22:31" (1/1) ... [2018-11-06 21:22:32,429 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:22:31" (1/1) ... [2018-11-06 21:22:32,429 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:22:31" (1/1) ... [2018-11-06 21:22:32,647 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:22:31" (1/1) ... [2018-11-06 21:22:32,687 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:22:31" (1/1) ... [2018-11-06 21:22:32,812 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:22:31" (1/1) ... [2018-11-06 21:22:32,941 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-06 21:22:32,942 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-06 21:22:32,942 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-06 21:22:32,942 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-06 21:22:32,943 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:22:31" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 21:22:33,013 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-06 21:22:33,013 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-06 21:22:33,013 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-06 21:22:45,612 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-06 21:22:45,613 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:22:45 BoogieIcfgContainer [2018-11-06 21:22:45,613 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-06 21:22:45,614 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-06 21:22:45,614 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-06 21:22:45,617 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-06 21:22:45,617 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:22:29" (1/3) ... [2018-11-06 21:22:45,618 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@520c5dde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:22:45, skipping insertion in model container [2018-11-06 21:22:45,618 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:22:31" (2/3) ... [2018-11-06 21:22:45,618 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@520c5dde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:22:45, skipping insertion in model container [2018-11-06 21:22:45,619 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:22:45" (3/3) ... [2018-11-06 21:22:45,621 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem13_label50_true-unreach-call.c [2018-11-06 21:22:45,630 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-06 21:22:45,640 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-06 21:22:45,658 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-06 21:22:45,705 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-06 21:22:45,706 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-06 21:22:45,706 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-06 21:22:45,706 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-06 21:22:45,706 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-06 21:22:45,706 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-06 21:22:45,707 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-06 21:22:45,707 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-06 21:22:45,707 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-06 21:22:45,746 INFO L276 IsEmpty]: Start isEmpty. Operand 1099 states. [2018-11-06 21:22:45,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-06 21:22:45,756 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:22:45,758 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:22:45,760 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:22:45,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:22:45,767 INFO L82 PathProgramCache]: Analyzing trace with hash 265969354, now seen corresponding path program 1 times [2018-11-06 21:22:45,769 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:22:45,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:22:45,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:22:45,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:22:45,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:22:45,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:22:46,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:22:46,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:22:46,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:22:46,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:22:46,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:22:46,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:22:46,304 INFO L87 Difference]: Start difference. First operand 1099 states. Second operand 4 states. [2018-11-06 21:23:00,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:23:00,613 INFO L93 Difference]: Finished difference Result 4033 states and 7562 transitions. [2018-11-06 21:23:00,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:23:00,616 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2018-11-06 21:23:00,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:23:00,659 INFO L225 Difference]: With dead ends: 4033 [2018-11-06 21:23:00,659 INFO L226 Difference]: Without dead ends: 2927 [2018-11-06 21:23:00,668 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:23:00,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2927 states. [2018-11-06 21:23:00,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2927 to 2797. [2018-11-06 21:23:00,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2797 states. [2018-11-06 21:23:00,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2797 states to 2797 states and 4999 transitions. [2018-11-06 21:23:00,855 INFO L78 Accepts]: Start accepts. Automaton has 2797 states and 4999 transitions. Word has length 63 [2018-11-06 21:23:00,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:23:00,856 INFO L480 AbstractCegarLoop]: Abstraction has 2797 states and 4999 transitions. [2018-11-06 21:23:00,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:23:00,857 INFO L276 IsEmpty]: Start isEmpty. Operand 2797 states and 4999 transitions. [2018-11-06 21:23:00,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-11-06 21:23:00,863 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:23:00,863 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:23:00,864 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:23:00,864 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:23:00,864 INFO L82 PathProgramCache]: Analyzing trace with hash -1834159543, now seen corresponding path program 1 times [2018-11-06 21:23:00,865 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:23:00,865 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:23:00,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:23:00,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:23:00,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:23:00,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:23:01,193 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:23:01,193 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:23:01,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:23:01,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:23:01,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:23:01,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:23:01,196 INFO L87 Difference]: Start difference. First operand 2797 states and 4999 transitions. Second operand 4 states. [2018-11-06 21:23:17,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:23:17,084 INFO L93 Difference]: Finished difference Result 10367 states and 18929 transitions. [2018-11-06 21:23:17,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:23:17,084 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 130 [2018-11-06 21:23:17,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:23:17,257 INFO L225 Difference]: With dead ends: 10367 [2018-11-06 21:23:17,257 INFO L226 Difference]: Without dead ends: 7572 [2018-11-06 21:23:17,262 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:23:17,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7572 states. [2018-11-06 21:23:17,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7572 to 7549. [2018-11-06 21:23:17,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7549 states. [2018-11-06 21:23:17,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7549 states to 7549 states and 11978 transitions. [2018-11-06 21:23:17,400 INFO L78 Accepts]: Start accepts. Automaton has 7549 states and 11978 transitions. Word has length 130 [2018-11-06 21:23:17,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:23:17,401 INFO L480 AbstractCegarLoop]: Abstraction has 7549 states and 11978 transitions. [2018-11-06 21:23:17,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:23:17,401 INFO L276 IsEmpty]: Start isEmpty. Operand 7549 states and 11978 transitions. [2018-11-06 21:23:17,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-11-06 21:23:17,406 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:23:17,407 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:23:17,407 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:23:17,407 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:23:17,407 INFO L82 PathProgramCache]: Analyzing trace with hash -1357792343, now seen corresponding path program 1 times [2018-11-06 21:23:17,407 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:23:17,408 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:23:17,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:23:17,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:23:17,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:23:17,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:23:17,642 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:23:17,643 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:23:17,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:23:17,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:23:17,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:23:17,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:23:17,644 INFO L87 Difference]: Start difference. First operand 7549 states and 11978 transitions. Second operand 4 states. [2018-11-06 21:23:28,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:23:28,421 INFO L93 Difference]: Finished difference Result 20658 states and 33543 transitions. [2018-11-06 21:23:28,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:23:28,422 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 160 [2018-11-06 21:23:28,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:23:28,482 INFO L225 Difference]: With dead ends: 20658 [2018-11-06 21:23:28,483 INFO L226 Difference]: Without dead ends: 13111 [2018-11-06 21:23:28,492 INFO L604 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-11-06 21:23:28,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13111 states. [2018-11-06 21:23:28,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13111 to 13076. [2018-11-06 21:23:28,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13076 states. [2018-11-06 21:23:28,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13076 states to 13076 states and 19677 transitions. [2018-11-06 21:23:28,723 INFO L78 Accepts]: Start accepts. Automaton has 13076 states and 19677 transitions. Word has length 160 [2018-11-06 21:23:28,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:23:28,724 INFO L480 AbstractCegarLoop]: Abstraction has 13076 states and 19677 transitions. [2018-11-06 21:23:28,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:23:28,724 INFO L276 IsEmpty]: Start isEmpty. Operand 13076 states and 19677 transitions. [2018-11-06 21:23:28,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-11-06 21:23:28,729 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:23:28,730 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:23:28,730 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:23:28,730 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:23:28,731 INFO L82 PathProgramCache]: Analyzing trace with hash -1694419197, now seen corresponding path program 1 times [2018-11-06 21:23:28,731 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:23:28,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:23:28,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:23:28,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:23:28,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:23:28,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:23:28,923 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-11-06 21:23:28,923 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:23:28,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 21:23:28,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 21:23:28,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 21:23:28,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:23:28,925 INFO L87 Difference]: Start difference. First operand 13076 states and 19677 transitions. Second operand 3 states. [2018-11-06 21:23:34,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:23:34,345 INFO L93 Difference]: Finished difference Result 37965 states and 57081 transitions. [2018-11-06 21:23:34,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 21:23:34,346 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 217 [2018-11-06 21:23:34,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:23:34,399 INFO L225 Difference]: With dead ends: 37965 [2018-11-06 21:23:34,399 INFO L226 Difference]: Without dead ends: 24891 [2018-11-06 21:23:34,421 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:23:34,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24891 states. [2018-11-06 21:23:34,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24891 to 24889. [2018-11-06 21:23:34,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24889 states. [2018-11-06 21:23:34,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24889 states to 24889 states and 33741 transitions. [2018-11-06 21:23:34,793 INFO L78 Accepts]: Start accepts. Automaton has 24889 states and 33741 transitions. Word has length 217 [2018-11-06 21:23:34,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:23:34,794 INFO L480 AbstractCegarLoop]: Abstraction has 24889 states and 33741 transitions. [2018-11-06 21:23:34,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 21:23:34,794 INFO L276 IsEmpty]: Start isEmpty. Operand 24889 states and 33741 transitions. [2018-11-06 21:23:34,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-11-06 21:23:34,801 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:23:34,802 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-11-06 21:23:34,802 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:23:34,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:23:34,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1870594673, now seen corresponding path program 1 times [2018-11-06 21:23:34,803 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:23:34,803 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:23:34,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:23:34,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:23:34,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:23:34,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:23:35,147 WARN L179 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-11-06 21:23:35,486 WARN L179 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 27 [2018-11-06 21:23:36,030 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-11-06 21:23:36,030 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:23:36,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:23:36,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 21:23:36,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 21:23:36,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:23:36,032 INFO L87 Difference]: Start difference. First operand 24889 states and 33741 transitions. Second operand 5 states. [2018-11-06 21:23:47,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:23:47,523 INFO L93 Difference]: Finished difference Result 75775 states and 101860 transitions. [2018-11-06 21:23:47,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 21:23:47,524 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 222 [2018-11-06 21:23:47,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:23:47,611 INFO L225 Difference]: With dead ends: 75775 [2018-11-06 21:23:47,611 INFO L226 Difference]: Without dead ends: 50888 [2018-11-06 21:23:47,653 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-11-06 21:23:47,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50888 states. [2018-11-06 21:23:48,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50888 to 50887. [2018-11-06 21:23:48,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50887 states. [2018-11-06 21:23:48,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50887 states to 50887 states and 64470 transitions. [2018-11-06 21:23:48,568 INFO L78 Accepts]: Start accepts. Automaton has 50887 states and 64470 transitions. Word has length 222 [2018-11-06 21:23:48,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:23:48,568 INFO L480 AbstractCegarLoop]: Abstraction has 50887 states and 64470 transitions. [2018-11-06 21:23:48,568 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 21:23:48,569 INFO L276 IsEmpty]: Start isEmpty. Operand 50887 states and 64470 transitions. [2018-11-06 21:23:48,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2018-11-06 21:23:48,594 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:23:48,595 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:23:48,595 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:23:48,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:23:48,596 INFO L82 PathProgramCache]: Analyzing trace with hash -483667799, now seen corresponding path program 1 times [2018-11-06 21:23:48,596 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:23:48,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:23:48,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:23:48,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:23:48,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:23:48,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:23:49,022 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 398 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-11-06 21:23:49,022 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:23:49,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:23:49,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 21:23:49,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 21:23:49,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:23:49,024 INFO L87 Difference]: Start difference. First operand 50887 states and 64470 transitions. Second operand 3 states. [2018-11-06 21:23:53,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:23:53,952 INFO L93 Difference]: Finished difference Result 102543 states and 129797 transitions. [2018-11-06 21:23:53,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 21:23:53,952 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 414 [2018-11-06 21:23:53,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:23:54,040 INFO L225 Difference]: With dead ends: 102543 [2018-11-06 21:23:54,040 INFO L226 Difference]: Without dead ends: 52446 [2018-11-06 21:23:54,086 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:23:54,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52446 states. [2018-11-06 21:23:55,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52446 to 50867. [2018-11-06 21:23:55,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50867 states. [2018-11-06 21:23:55,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50867 states to 50867 states and 59944 transitions. [2018-11-06 21:23:55,247 INFO L78 Accepts]: Start accepts. Automaton has 50867 states and 59944 transitions. Word has length 414 [2018-11-06 21:23:55,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:23:55,248 INFO L480 AbstractCegarLoop]: Abstraction has 50867 states and 59944 transitions. [2018-11-06 21:23:55,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 21:23:55,248 INFO L276 IsEmpty]: Start isEmpty. Operand 50867 states and 59944 transitions. [2018-11-06 21:23:55,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 433 [2018-11-06 21:23:55,274 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:23:55,274 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:23:55,275 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:23:55,275 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:23:55,275 INFO L82 PathProgramCache]: Analyzing trace with hash 1888480088, now seen corresponding path program 1 times [2018-11-06 21:23:55,275 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:23:55,276 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:23:55,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:23:55,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:23:55,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:23:55,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:23:55,625 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 313 proven. 4 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2018-11-06 21:23:55,625 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:23:55,625 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 21:23:55,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:23:55,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:23:55,800 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:23:55,983 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 408 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-11-06 21:23:56,017 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 21:23:56,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2018-11-06 21:23:56,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:23:56,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:23:56,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:23:56,020 INFO L87 Difference]: Start difference. First operand 50867 states and 59944 transitions. Second operand 4 states. [2018-11-06 21:24:07,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:24:07,095 INFO L93 Difference]: Finished difference Result 191606 states and 226051 transitions. [2018-11-06 21:24:07,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:24:07,099 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 432 [2018-11-06 21:24:07,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:24:07,269 INFO L225 Difference]: With dead ends: 191606 [2018-11-06 21:24:07,269 INFO L226 Difference]: Without dead ends: 136779 [2018-11-06 21:24:07,309 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 432 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:24:07,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136779 states. [2018-11-06 21:24:08,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136779 to 94185. [2018-11-06 21:24:08,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94185 states. [2018-11-06 21:24:08,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94185 states to 94185 states and 106505 transitions. [2018-11-06 21:24:08,815 INFO L78 Accepts]: Start accepts. Automaton has 94185 states and 106505 transitions. Word has length 432 [2018-11-06 21:24:08,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:24:08,815 INFO L480 AbstractCegarLoop]: Abstraction has 94185 states and 106505 transitions. [2018-11-06 21:24:08,816 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:24:08,816 INFO L276 IsEmpty]: Start isEmpty. Operand 94185 states and 106505 transitions. [2018-11-06 21:24:08,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 526 [2018-11-06 21:24:08,855 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:24:08,855 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:24:08,856 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:24:08,856 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:24:08,857 INFO L82 PathProgramCache]: Analyzing trace with hash 1856328005, now seen corresponding path program 1 times [2018-11-06 21:24:08,857 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:24:08,857 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:24:08,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:24:08,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:24:08,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:24:08,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:24:09,486 INFO L134 CoverageAnalysis]: Checked inductivity of 791 backedges. 584 proven. 0 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2018-11-06 21:24:09,486 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:24:09,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:24:09,487 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 21:24:09,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 21:24:09,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:24:09,487 INFO L87 Difference]: Start difference. First operand 94185 states and 106505 transitions. Second operand 5 states. [2018-11-06 21:24:27,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:24:27,516 INFO L93 Difference]: Finished difference Result 265087 states and 300109 transitions. [2018-11-06 21:24:27,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 21:24:27,517 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 525 [2018-11-06 21:24:27,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:24:27,711 INFO L225 Difference]: With dead ends: 265087 [2018-11-06 21:24:27,712 INFO L226 Difference]: Without dead ends: 171692 [2018-11-06 21:24:27,778 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:24:27,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171692 states. [2018-11-06 21:24:30,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171692 to 162038. [2018-11-06 21:24:30,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162038 states. [2018-11-06 21:24:30,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162038 states to 162038 states and 180838 transitions. [2018-11-06 21:24:30,249 INFO L78 Accepts]: Start accepts. Automaton has 162038 states and 180838 transitions. Word has length 525 [2018-11-06 21:24:30,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:24:30,250 INFO L480 AbstractCegarLoop]: Abstraction has 162038 states and 180838 transitions. [2018-11-06 21:24:30,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 21:24:30,250 INFO L276 IsEmpty]: Start isEmpty. Operand 162038 states and 180838 transitions. [2018-11-06 21:24:30,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 557 [2018-11-06 21:24:30,287 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:24:30,288 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:24:30,288 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:24:30,288 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:24:30,289 INFO L82 PathProgramCache]: Analyzing trace with hash -1272140782, now seen corresponding path program 1 times [2018-11-06 21:24:30,289 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:24:30,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:24:30,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:24:30,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:24:30,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:24:30,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:24:30,941 WARN L179 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-11-06 21:24:31,070 INFO L134 CoverageAnalysis]: Checked inductivity of 1071 backedges. 632 proven. 0 refuted. 0 times theorem prover too weak. 439 trivial. 0 not checked. [2018-11-06 21:24:31,070 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:24:31,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:24:31,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:24:31,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:24:31,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:24:31,072 INFO L87 Difference]: Start difference. First operand 162038 states and 180838 transitions. Second operand 4 states. [2018-11-06 21:24:41,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:24:41,024 INFO L93 Difference]: Finished difference Result 323307 states and 360915 transitions. [2018-11-06 21:24:41,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:24:41,024 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 556 [2018-11-06 21:24:41,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:24:41,211 INFO L225 Difference]: With dead ends: 323307 [2018-11-06 21:24:41,211 INFO L226 Difference]: Without dead ends: 159676 [2018-11-06 21:24:41,287 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:24:41,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159676 states. [2018-11-06 21:24:42,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159676 to 158866. [2018-11-06 21:24:42,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158866 states. [2018-11-06 21:24:42,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158866 states to 158866 states and 173571 transitions. [2018-11-06 21:24:42,762 INFO L78 Accepts]: Start accepts. Automaton has 158866 states and 173571 transitions. Word has length 556 [2018-11-06 21:24:42,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:24:42,763 INFO L480 AbstractCegarLoop]: Abstraction has 158866 states and 173571 transitions. [2018-11-06 21:24:42,763 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:24:42,763 INFO L276 IsEmpty]: Start isEmpty. Operand 158866 states and 173571 transitions. [2018-11-06 21:24:42,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 586 [2018-11-06 21:24:42,792 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:24:42,792 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:24:42,793 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:24:42,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:24:42,793 INFO L82 PathProgramCache]: Analyzing trace with hash 144221470, now seen corresponding path program 1 times [2018-11-06 21:24:42,793 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:24:42,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:24:42,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:24:42,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:24:42,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:24:42,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:24:43,393 WARN L179 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2018-11-06 21:24:44,967 INFO L134 CoverageAnalysis]: Checked inductivity of 563 backedges. 502 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-11-06 21:24:44,967 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:24:44,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:24:44,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:24:44,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:24:44,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:24:44,969 INFO L87 Difference]: Start difference. First operand 158866 states and 173571 transitions. Second operand 4 states. [2018-11-06 21:24:53,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:24:53,190 INFO L93 Difference]: Finished difference Result 328763 states and 358690 transitions. [2018-11-06 21:24:53,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:24:53,200 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 585 [2018-11-06 21:24:53,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:24:53,397 INFO L225 Difference]: With dead ends: 328763 [2018-11-06 21:24:53,397 INFO L226 Difference]: Without dead ends: 156451 [2018-11-06 21:24:53,471 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:24:53,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156451 states. [2018-11-06 21:24:54,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156451 to 150929. [2018-11-06 21:24:54,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150929 states. [2018-11-06 21:24:55,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150929 states to 150929 states and 163484 transitions. [2018-11-06 21:24:55,175 INFO L78 Accepts]: Start accepts. Automaton has 150929 states and 163484 transitions. Word has length 585 [2018-11-06 21:24:56,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:24:56,272 INFO L480 AbstractCegarLoop]: Abstraction has 150929 states and 163484 transitions. [2018-11-06 21:24:56,273 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:24:56,276 INFO L276 IsEmpty]: Start isEmpty. Operand 150929 states and 163484 transitions. [2018-11-06 21:24:56,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 632 [2018-11-06 21:24:56,299 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:24:56,299 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:24:56,300 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:24:56,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:24:56,300 INFO L82 PathProgramCache]: Analyzing trace with hash -1417238191, now seen corresponding path program 1 times [2018-11-06 21:24:56,301 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:24:56,301 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:24:56,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:24:56,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:24:56,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:24:56,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:24:57,376 INFO L134 CoverageAnalysis]: Checked inductivity of 739 backedges. 243 proven. 0 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2018-11-06 21:24:57,376 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:24:57,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:24:57,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 21:24:57,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 21:24:57,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:24:57,378 INFO L87 Difference]: Start difference. First operand 150929 states and 163484 transitions. Second operand 3 states. [2018-11-06 21:25:06,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:25:06,242 INFO L93 Difference]: Finished difference Result 301066 states and 326173 transitions. [2018-11-06 21:25:06,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 21:25:06,243 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 631 [2018-11-06 21:25:06,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:25:06,424 INFO L225 Difference]: With dead ends: 301066 [2018-11-06 21:25:06,424 INFO L226 Difference]: Without dead ends: 150927 [2018-11-06 21:25:06,485 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 7 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:25:06,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150927 states. [2018-11-06 21:25:08,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150927 to 150926. [2018-11-06 21:25:08,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150926 states. [2018-11-06 21:25:08,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150926 states to 150926 states and 160790 transitions. [2018-11-06 21:25:08,191 INFO L78 Accepts]: Start accepts. Automaton has 150926 states and 160790 transitions. Word has length 631 [2018-11-06 21:25:08,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:25:08,192 INFO L480 AbstractCegarLoop]: Abstraction has 150926 states and 160790 transitions. [2018-11-06 21:25:08,192 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 21:25:08,192 INFO L276 IsEmpty]: Start isEmpty. Operand 150926 states and 160790 transitions. [2018-11-06 21:25:08,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 657 [2018-11-06 21:25:08,209 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:25:08,210 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:25:08,210 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:25:08,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:25:08,211 INFO L82 PathProgramCache]: Analyzing trace with hash 1058101010, now seen corresponding path program 1 times [2018-11-06 21:25:08,211 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:25:08,211 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:25:08,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:25:08,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:25:08,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:25:08,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:25:09,381 INFO L134 CoverageAnalysis]: Checked inductivity of 1247 backedges. 887 proven. 85 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2018-11-06 21:25:09,381 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:25:09,382 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 21:25:09,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:25:09,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:25:09,558 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:25:10,741 INFO L134 CoverageAnalysis]: Checked inductivity of 1247 backedges. 751 proven. 0 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2018-11-06 21:25:10,762 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 21:25:10,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 10 [2018-11-06 21:25:10,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-06 21:25:10,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-06 21:25:10,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-11-06 21:25:10,765 INFO L87 Difference]: Start difference. First operand 150926 states and 160790 transitions. Second operand 10 states. [2018-11-06 21:25:52,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:25:52,446 INFO L93 Difference]: Finished difference Result 363565 states and 386867 transitions. [2018-11-06 21:25:52,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-06 21:25:52,446 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 656 [2018-11-06 21:25:52,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:25:52,663 INFO L225 Difference]: With dead ends: 363565 [2018-11-06 21:25:52,663 INFO L226 Difference]: Without dead ends: 212639 [2018-11-06 21:25:52,714 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 683 GetRequests, 665 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=98, Invalid=282, Unknown=0, NotChecked=0, Total=380 [2018-11-06 21:25:53,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212639 states. [2018-11-06 21:25:54,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212639 to 128022. [2018-11-06 21:25:54,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128022 states. [2018-11-06 21:25:54,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128022 states to 128022 states and 134085 transitions. [2018-11-06 21:25:54,261 INFO L78 Accepts]: Start accepts. Automaton has 128022 states and 134085 transitions. Word has length 656 [2018-11-06 21:25:54,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:25:54,262 INFO L480 AbstractCegarLoop]: Abstraction has 128022 states and 134085 transitions. [2018-11-06 21:25:54,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-06 21:25:54,262 INFO L276 IsEmpty]: Start isEmpty. Operand 128022 states and 134085 transitions. [2018-11-06 21:25:54,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 852 [2018-11-06 21:25:54,281 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:25:54,282 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:25:54,282 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:25:54,282 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:25:54,283 INFO L82 PathProgramCache]: Analyzing trace with hash 1866480563, now seen corresponding path program 1 times [2018-11-06 21:25:54,283 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:25:54,283 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:25:54,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:25:54,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:25:54,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:25:54,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:25:56,026 INFO L134 CoverageAnalysis]: Checked inductivity of 980 backedges. 588 proven. 230 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2018-11-06 21:25:56,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:25:56,027 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 21:25:56,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:25:56,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:25:56,251 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:25:57,685 INFO L134 CoverageAnalysis]: Checked inductivity of 980 backedges. 689 proven. 230 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-11-06 21:25:57,705 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 21:25:57,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-06 21:25:57,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-06 21:25:57,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-06 21:25:57,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-06 21:25:57,708 INFO L87 Difference]: Start difference. First operand 128022 states and 134085 transitions. Second operand 7 states. Received shutdown request... [2018-11-06 21:26:11,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-06 21:26:11,134 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-06 21:26:11,141 WARN L205 ceAbstractionStarter]: Timeout [2018-11-06 21:26:11,141 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 09:26:11 BoogieIcfgContainer [2018-11-06 21:26:11,141 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-06 21:26:11,142 INFO L168 Benchmark]: Toolchain (without parser) took 222074.52 ms. Allocated memory was 1.5 GB in the beginning and 4.5 GB in the end (delta: 3.0 GB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -540.5 MB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2018-11-06 21:26:11,143 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-06 21:26:11,146 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2499.67 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: 253.7 MB). Peak memory consumption was 253.7 MB. Max. memory is 7.1 GB. [2018-11-06 21:26:11,147 INFO L168 Benchmark]: Boogie Procedure Inliner took 774.06 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 831.5 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 67.7 MB. Max. memory is 7.1 GB. [2018-11-06 21:26:11,148 INFO L168 Benchmark]: Boogie Preprocessor took 597.23 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: 66.8 MB). Peak memory consumption was 66.8 MB. Max. memory is 7.1 GB. [2018-11-06 21:26:11,151 INFO L168 Benchmark]: RCFGBuilder took 12670.86 ms. Allocated memory was 2.4 GB in the beginning and 2.6 GB in the end (delta: 221.8 MB). Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 55.1 MB). Peak memory consumption was 577.6 MB. Max. memory is 7.1 GB. [2018-11-06 21:26:11,153 INFO L168 Benchmark]: TraceAbstraction took 205527.69 ms. Allocated memory was 2.6 GB in the beginning and 4.5 GB in the end (delta: 1.9 GB). Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 117.5 MB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2018-11-06 21:26:11,162 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 2499.67 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: 253.7 MB). Peak memory consumption was 253.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 774.06 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 831.5 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 67.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 597.23 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: 66.8 MB). Peak memory consumption was 66.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 12670.86 ms. Allocated memory was 2.4 GB in the beginning and 2.6 GB in the end (delta: 221.8 MB). Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 55.1 MB). Peak memory consumption was 577.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 205527.69 ms. Allocated memory was 2.6 GB in the beginning and 4.5 GB in the end (delta: 1.9 GB). Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 117.5 MB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 198]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 198). Cancelled while BasicCegarLoop was constructing difference of abstraction (128022states) and FLOYD_HOARE automaton (currently 9 states, 7 states before enhancement),while ReachableStatesComputation was computing reachable states (210406 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 1099 locations, 1 error locations. TIMEOUT Result, 205.4s OverallTime, 13 OverallIterations, 6 TraceHistogramMax, 176.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 10511 SDtfs, 48368 SDslu, 4002 SDs, 0 SdLazy, 91435 SolverSat, 18918 SolverUnsat, 4 SolverUnknown, 0 SolverNotchecked, 137.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2021 GetRequests, 1962 SyntacticMatches, 12 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 3.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=162038occurred in iteration=8, 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: 13.3s AutomataMinimizationTime, 12 MinimizatonAttempts, 144968 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 8.7s InterpolantComputationTime, 7381 NumberOfCodeBlocks, 7381 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 7365 ConstructedInterpolants, 90 QuantifiedInterpolants, 12655159 SizeOfPredicates, 1 NumberOfNonLiveVariables, 2421 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 16 InterpolantComputations, 12 PerfectInterpolantSequences, 8991/9540 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown