java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem12_label13_false-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-0fd1304 [2018-10-23 17:57:14,990 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-23 17:57:14,995 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-23 17:57:15,007 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-23 17:57:15,007 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-23 17:57:15,009 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-23 17:57:15,010 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-23 17:57:15,011 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-23 17:57:15,014 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-23 17:57:15,018 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-23 17:57:15,019 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-23 17:57:15,019 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-23 17:57:15,020 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-23 17:57:15,026 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-23 17:57:15,028 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-23 17:57:15,028 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-23 17:57:15,029 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-23 17:57:15,031 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-23 17:57:15,033 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-23 17:57:15,034 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-23 17:57:15,035 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-23 17:57:15,036 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-23 17:57:15,039 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-23 17:57:15,039 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-23 17:57:15,039 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-23 17:57:15,040 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-23 17:57:15,041 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-23 17:57:15,042 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-23 17:57:15,042 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-23 17:57:15,044 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-23 17:57:15,044 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-23 17:57:15,045 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-23 17:57:15,045 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-23 17:57:15,045 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-23 17:57:15,046 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-23 17:57:15,046 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-23 17:57:15,047 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-23 17:57:15,074 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-23 17:57:15,074 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-23 17:57:15,075 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-23 17:57:15,075 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-23 17:57:15,076 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-23 17:57:15,077 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-23 17:57:15,077 INFO L133 SettingsManager]: * Use SBE=true [2018-10-23 17:57:15,077 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-23 17:57:15,077 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-23 17:57:15,077 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-23 17:57:15,078 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-23 17:57:15,078 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-23 17:57:15,078 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-23 17:57:15,078 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-23 17:57:15,078 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-23 17:57:15,079 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-23 17:57:15,079 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-23 17:57:15,079 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-23 17:57:15,079 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-23 17:57:15,079 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-23 17:57:15,079 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-23 17:57:15,081 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-23 17:57:15,081 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-23 17:57:15,081 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-23 17:57:15,081 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-23 17:57:15,081 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-23 17:57:15,082 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-23 17:57:15,082 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-23 17:57:15,140 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-23 17:57:15,156 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-23 17:57:15,160 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-23 17:57:15,161 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-23 17:57:15,162 INFO L276 PluginConnector]: CDTParser initialized [2018-10-23 17:57:15,163 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem12_label13_false-unreach-call.c [2018-10-23 17:57:15,231 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/ddeeed2af/87021c20a94d4adb82de6cc62284fb8f/FLAG8ec7c2dc0 [2018-10-23 17:57:16,043 INFO L298 CDTParser]: Found 1 translation units. [2018-10-23 17:57:16,044 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem12_label13_false-unreach-call.c [2018-10-23 17:57:16,076 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/ddeeed2af/87021c20a94d4adb82de6cc62284fb8f/FLAG8ec7c2dc0 [2018-10-23 17:57:16,098 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/ddeeed2af/87021c20a94d4adb82de6cc62284fb8f [2018-10-23 17:57:16,111 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-23 17:57:16,113 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-23 17:57:16,114 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-23 17:57:16,115 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-23 17:57:16,122 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-23 17:57:16,123 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 05:57:16" (1/1) ... [2018-10-23 17:57:16,126 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10e73541 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 05:57:16, skipping insertion in model container [2018-10-23 17:57:16,127 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 05:57:16" (1/1) ... [2018-10-23 17:57:16,138 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-23 17:57:16,311 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-23 17:57:17,640 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-23 17:57:17,645 INFO L189 MainTranslator]: Completed pre-run [2018-10-23 17:57:18,253 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-23 17:57:18,291 INFO L193 MainTranslator]: Completed translation [2018-10-23 17:57:18,292 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 05:57:18 WrapperNode [2018-10-23 17:57:18,292 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-23 17:57:18,293 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-23 17:57:18,293 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-23 17:57:18,293 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-23 17:57:18,306 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 05:57:18" (1/1) ... [2018-10-23 17:57:18,376 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 05:57:18" (1/1) ... [2018-10-23 17:57:18,988 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-23 17:57:18,989 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-23 17:57:18,989 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-23 17:57:18,989 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-23 17:57:19,001 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 05:57:18" (1/1) ... [2018-10-23 17:57:19,001 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 05:57:18" (1/1) ... [2018-10-23 17:57:19,040 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 05:57:18" (1/1) ... [2018-10-23 17:57:19,040 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 05:57:18" (1/1) ... [2018-10-23 17:57:19,168 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 05:57:18" (1/1) ... [2018-10-23 17:57:19,216 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 05:57:18" (1/1) ... [2018-10-23 17:57:19,258 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 05:57:18" (1/1) ... [2018-10-23 17:57:19,306 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-23 17:57:19,307 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-23 17:57:19,307 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-23 17:57:19,307 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-23 17:57:19,308 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 05:57:18" (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-23 17:57:19,378 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-23 17:57:19,378 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-23 17:57:19,378 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-23 17:57:28,482 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-23 17:57:28,483 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 05:57:28 BoogieIcfgContainer [2018-10-23 17:57:28,483 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-23 17:57:28,484 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-23 17:57:28,484 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-23 17:57:28,487 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-23 17:57:28,487 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.10 05:57:16" (1/3) ... [2018-10-23 17:57:28,488 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5954ac29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 05:57:28, skipping insertion in model container [2018-10-23 17:57:28,488 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 05:57:18" (2/3) ... [2018-10-23 17:57:28,489 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5954ac29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 05:57:28, skipping insertion in model container [2018-10-23 17:57:28,489 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 05:57:28" (3/3) ... [2018-10-23 17:57:28,491 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem12_label13_false-unreach-call.c [2018-10-23 17:57:28,501 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-23 17:57:28,517 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-23 17:57:28,534 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-23 17:57:28,581 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-23 17:57:28,582 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-23 17:57:28,582 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-23 17:57:28,582 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-23 17:57:28,583 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-23 17:57:28,583 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-23 17:57:28,583 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-23 17:57:28,583 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-23 17:57:28,583 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-23 17:57:28,632 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states. [2018-10-23 17:57:28,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-23 17:57:28,650 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 17:57:28,651 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] [2018-10-23 17:57:28,654 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 17:57:28,659 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 17:57:28,659 INFO L82 PathProgramCache]: Analyzing trace with hash 1827210562, now seen corresponding path program 1 times [2018-10-23 17:57:28,661 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 17:57:28,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 17:57:28,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 17:57:28,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 17:57:28,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 17:57:28,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 17:57:29,113 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-10-23 17:57:29,120 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-23 17:57:29,122 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 17:57:29,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 17:57:29,128 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 17:57:29,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 17:57:29,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 17:57:29,147 INFO L87 Difference]: Start difference. First operand 819 states. Second operand 4 states. [2018-10-23 17:57:43,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 17:57:43,501 INFO L93 Difference]: Finished difference Result 3146 states and 6134 transitions. [2018-10-23 17:57:43,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 17:57:43,503 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2018-10-23 17:57:43,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 17:57:43,540 INFO L225 Difference]: With dead ends: 3146 [2018-10-23 17:57:43,541 INFO L226 Difference]: Without dead ends: 2320 [2018-10-23 17:57:43,549 INFO L605 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-10-23 17:57:43,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2320 states. [2018-10-23 17:57:43,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2320 to 2320. [2018-10-23 17:57:43,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2320 states. [2018-10-23 17:57:43,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2320 states to 2320 states and 4229 transitions. [2018-10-23 17:57:43,734 INFO L78 Accepts]: Start accepts. Automaton has 2320 states and 4229 transitions. Word has length 29 [2018-10-23 17:57:43,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 17:57:43,735 INFO L481 AbstractCegarLoop]: Abstraction has 2320 states and 4229 transitions. [2018-10-23 17:57:43,735 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 17:57:43,735 INFO L276 IsEmpty]: Start isEmpty. Operand 2320 states and 4229 transitions. [2018-10-23 17:57:43,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-10-23 17:57:43,741 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 17:57:43,741 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 17:57:43,743 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 17:57:43,744 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 17:57:43,744 INFO L82 PathProgramCache]: Analyzing trace with hash -66195396, now seen corresponding path program 1 times [2018-10-23 17:57:43,744 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 17:57:43,744 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 17:57:43,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 17:57:43,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 17:57:43,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 17:57:43,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 17:57:44,148 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 17:57:44,148 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 17:57:44,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 17:57:44,150 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 17:57:44,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 17:57:44,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 17:57:44,151 INFO L87 Difference]: Start difference. First operand 2320 states and 4229 transitions. Second operand 4 states. [2018-10-23 17:57:55,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 17:57:55,242 INFO L93 Difference]: Finished difference Result 9150 states and 16788 transitions. [2018-10-23 17:57:55,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 17:57:55,243 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2018-10-23 17:57:55,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 17:57:55,279 INFO L225 Difference]: With dead ends: 9150 [2018-10-23 17:57:55,279 INFO L226 Difference]: Without dead ends: 6832 [2018-10-23 17:57:55,284 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 17:57:55,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6832 states. [2018-10-23 17:57:55,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6832 to 6832. [2018-10-23 17:57:55,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6832 states. [2018-10-23 17:57:55,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6832 states to 6832 states and 10629 transitions. [2018-10-23 17:57:55,415 INFO L78 Accepts]: Start accepts. Automaton has 6832 states and 10629 transitions. Word has length 105 [2018-10-23 17:57:55,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 17:57:55,415 INFO L481 AbstractCegarLoop]: Abstraction has 6832 states and 10629 transitions. [2018-10-23 17:57:55,416 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 17:57:55,416 INFO L276 IsEmpty]: Start isEmpty. Operand 6832 states and 10629 transitions. [2018-10-23 17:57:55,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-10-23 17:57:55,421 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 17:57:55,421 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 17:57:55,422 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 17:57:55,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 17:57:55,422 INFO L82 PathProgramCache]: Analyzing trace with hash -1320091957, now seen corresponding path program 1 times [2018-10-23 17:57:55,422 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 17:57:55,422 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 17:57:55,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 17:57:55,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 17:57:55,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 17:57:55,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 17:57:55,596 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 17:57:55,596 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 17:57:55,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 17:57:55,597 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 17:57:55,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 17:57:55,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 17:57:55,598 INFO L87 Difference]: Start difference. First operand 6832 states and 10629 transitions. Second operand 4 states. [2018-10-23 17:58:05,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 17:58:05,991 INFO L93 Difference]: Finished difference Result 27260 states and 42449 transitions. [2018-10-23 17:58:05,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 17:58:05,991 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2018-10-23 17:58:05,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 17:58:06,073 INFO L225 Difference]: With dead ends: 27260 [2018-10-23 17:58:06,074 INFO L226 Difference]: Without dead ends: 20430 [2018-10-23 17:58:06,085 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 17:58:06,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20430 states. [2018-10-23 17:58:06,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20430 to 13600. [2018-10-23 17:58:06,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13600 states. [2018-10-23 17:58:06,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13600 states to 13600 states and 19341 transitions. [2018-10-23 17:58:06,446 INFO L78 Accepts]: Start accepts. Automaton has 13600 states and 19341 transitions. Word has length 111 [2018-10-23 17:58:06,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 17:58:06,451 INFO L481 AbstractCegarLoop]: Abstraction has 13600 states and 19341 transitions. [2018-10-23 17:58:06,451 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 17:58:06,451 INFO L276 IsEmpty]: Start isEmpty. Operand 13600 states and 19341 transitions. [2018-10-23 17:58:06,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-10-23 17:58:06,460 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 17:58:06,460 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 17:58:06,461 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 17:58:06,461 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 17:58:06,461 INFO L82 PathProgramCache]: Analyzing trace with hash -981015944, now seen corresponding path program 1 times [2018-10-23 17:58:06,461 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 17:58:06,461 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 17:58:06,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 17:58:06,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 17:58:06,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 17:58:06,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 17:58:06,772 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 17:58:06,772 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 17:58:06,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 17:58:06,773 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 17:58:06,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 17:58:06,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 17:58:06,774 INFO L87 Difference]: Start difference. First operand 13600 states and 19341 transitions. Second operand 4 states. [2018-10-23 17:58:17,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 17:58:17,823 INFO L93 Difference]: Finished difference Result 52783 states and 74748 transitions. [2018-10-23 17:58:17,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 17:58:17,824 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 129 [2018-10-23 17:58:17,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 17:58:17,895 INFO L225 Difference]: With dead ends: 52783 [2018-10-23 17:58:17,896 INFO L226 Difference]: Without dead ends: 39185 [2018-10-23 17:58:17,917 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-23 17:58:17,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39185 states. [2018-10-23 17:58:18,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39185 to 26384. [2018-10-23 17:58:18,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26384 states. [2018-10-23 17:58:18,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26384 states to 26384 states and 33902 transitions. [2018-10-23 17:58:18,431 INFO L78 Accepts]: Start accepts. Automaton has 26384 states and 33902 transitions. Word has length 129 [2018-10-23 17:58:18,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 17:58:18,431 INFO L481 AbstractCegarLoop]: Abstraction has 26384 states and 33902 transitions. [2018-10-23 17:58:18,431 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 17:58:18,431 INFO L276 IsEmpty]: Start isEmpty. Operand 26384 states and 33902 transitions. [2018-10-23 17:58:18,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2018-10-23 17:58:18,443 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 17:58:18,443 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-23 17:58:18,444 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 17:58:18,444 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 17:58:18,444 INFO L82 PathProgramCache]: Analyzing trace with hash -24275938, now seen corresponding path program 1 times [2018-10-23 17:58:18,444 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 17:58:18,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 17:58:18,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 17:58:18,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 17:58:18,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 17:58:18,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 17:58:18,948 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 17:58:18,949 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 17:58:18,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-23 17:58:18,949 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 17:58:18,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 17:58:18,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 17:58:18,950 INFO L87 Difference]: Start difference. First operand 26384 states and 33902 transitions. Second operand 4 states. [2018-10-23 17:58:29,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 17:58:29,610 INFO L93 Difference]: Finished difference Result 53518 states and 68744 transitions. [2018-10-23 17:58:29,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 17:58:29,610 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 258 [2018-10-23 17:58:29,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 17:58:29,655 INFO L225 Difference]: With dead ends: 53518 [2018-10-23 17:58:29,655 INFO L226 Difference]: Without dead ends: 27136 [2018-10-23 17:58:29,684 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 17:58:29,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27136 states. [2018-10-23 17:58:29,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27136 to 27136. [2018-10-23 17:58:29,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27136 states. [2018-10-23 17:58:30,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27136 states to 27136 states and 33830 transitions. [2018-10-23 17:58:30,008 INFO L78 Accepts]: Start accepts. Automaton has 27136 states and 33830 transitions. Word has length 258 [2018-10-23 17:58:30,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 17:58:30,009 INFO L481 AbstractCegarLoop]: Abstraction has 27136 states and 33830 transitions. [2018-10-23 17:58:30,009 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 17:58:30,009 INFO L276 IsEmpty]: Start isEmpty. Operand 27136 states and 33830 transitions. [2018-10-23 17:58:30,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2018-10-23 17:58:30,016 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 17:58:30,016 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 17:58:30,016 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 17:58:30,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 17:58:30,017 INFO L82 PathProgramCache]: Analyzing trace with hash 1841358292, now seen corresponding path program 1 times [2018-10-23 17:58:30,017 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 17:58:30,017 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 17:58:30,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 17:58:30,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 17:58:30,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 17:58:30,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 17:58:30,334 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-10-23 17:58:30,454 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-10-23 17:58:30,454 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 17:58:30,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-23 17:58:30,455 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 17:58:30,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 17:58:30,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 17:58:30,457 INFO L87 Difference]: Start difference. First operand 27136 states and 33830 transitions. Second operand 4 states. [2018-10-23 17:58:43,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 17:58:43,046 INFO L93 Difference]: Finished difference Result 100142 states and 125232 transitions. [2018-10-23 17:58:43,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 17:58:43,046 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 262 [2018-10-23 17:58:43,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 17:58:43,162 INFO L225 Difference]: With dead ends: 100142 [2018-10-23 17:58:43,162 INFO L226 Difference]: Without dead ends: 73008 [2018-10-23 17:58:43,189 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 17:58:43,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73008 states. [2018-10-23 17:58:43,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73008 to 73008. [2018-10-23 17:58:43,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73008 states. [2018-10-23 17:58:44,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73008 states to 73008 states and 86280 transitions. [2018-10-23 17:58:44,065 INFO L78 Accepts]: Start accepts. Automaton has 73008 states and 86280 transitions. Word has length 262 [2018-10-23 17:58:44,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 17:58:44,066 INFO L481 AbstractCegarLoop]: Abstraction has 73008 states and 86280 transitions. [2018-10-23 17:58:44,066 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 17:58:44,066 INFO L276 IsEmpty]: Start isEmpty. Operand 73008 states and 86280 transitions. [2018-10-23 17:58:44,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2018-10-23 17:58:44,078 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 17:58:44,079 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-23 17:58:44,079 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 17:58:44,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 17:58:44,080 INFO L82 PathProgramCache]: Analyzing trace with hash 407961111, now seen corresponding path program 1 times [2018-10-23 17:58:44,080 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 17:58:44,080 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 17:58:44,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 17:58:44,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 17:58:44,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 17:58:44,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 17:58:44,392 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2018-10-23 17:58:44,393 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 17:58:44,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-23 17:58:44,393 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 17:58:44,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 17:58:44,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 17:58:44,394 INFO L87 Difference]: Start difference. First operand 73008 states and 86280 transitions. Second operand 4 states. [2018-10-23 17:58:54,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 17:58:54,318 INFO L93 Difference]: Finished difference Result 161806 states and 190869 transitions. [2018-10-23 17:58:54,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 17:58:54,320 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 271 [2018-10-23 17:58:54,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 17:58:54,414 INFO L225 Difference]: With dead ends: 161806 [2018-10-23 17:58:54,415 INFO L226 Difference]: Without dead ends: 89552 [2018-10-23 17:58:54,472 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-23 17:58:54,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89552 states. [2018-10-23 17:58:55,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89552 to 88048. [2018-10-23 17:58:55,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88048 states. [2018-10-23 17:58:55,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88048 states to 88048 states and 99116 transitions. [2018-10-23 17:58:55,441 INFO L78 Accepts]: Start accepts. Automaton has 88048 states and 99116 transitions. Word has length 271 [2018-10-23 17:58:55,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 17:58:55,442 INFO L481 AbstractCegarLoop]: Abstraction has 88048 states and 99116 transitions. [2018-10-23 17:58:55,442 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 17:58:55,442 INFO L276 IsEmpty]: Start isEmpty. Operand 88048 states and 99116 transitions. [2018-10-23 17:58:55,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2018-10-23 17:58:55,464 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 17:58:55,465 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 17:58:55,465 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 17:58:55,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 17:58:55,465 INFO L82 PathProgramCache]: Analyzing trace with hash 220808087, now seen corresponding path program 1 times [2018-10-23 17:58:55,465 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 17:58:55,466 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 17:58:55,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 17:58:55,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 17:58:55,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 17:58:55,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 17:58:55,964 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 23 [2018-10-23 17:58:56,156 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 210 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-10-23 17:58:56,157 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 17:58:56,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-23 17:58:56,158 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-23 17:58:56,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-23 17:58:56,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-10-23 17:58:56,158 INFO L87 Difference]: Start difference. First operand 88048 states and 99116 transitions. Second operand 6 states. [2018-10-23 17:59:07,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 17:59:07,781 INFO L93 Difference]: Finished difference Result 204671 states and 232595 transitions. [2018-10-23 17:59:07,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-23 17:59:07,782 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 360 [2018-10-23 17:59:07,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 17:59:07,904 INFO L225 Difference]: With dead ends: 204671 [2018-10-23 17:59:07,904 INFO L226 Difference]: Without dead ends: 115872 [2018-10-23 17:59:07,954 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-10-23 17:59:08,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115872 states. [2018-10-23 17:59:08,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115872 to 112111. [2018-10-23 17:59:08,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112111 states. [2018-10-23 17:59:09,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112111 states to 112111 states and 124851 transitions. [2018-10-23 17:59:09,136 INFO L78 Accepts]: Start accepts. Automaton has 112111 states and 124851 transitions. Word has length 360 [2018-10-23 17:59:09,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 17:59:09,136 INFO L481 AbstractCegarLoop]: Abstraction has 112111 states and 124851 transitions. [2018-10-23 17:59:09,136 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-23 17:59:09,136 INFO L276 IsEmpty]: Start isEmpty. Operand 112111 states and 124851 transitions. [2018-10-23 17:59:09,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2018-10-23 17:59:09,160 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 17:59:09,160 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 17:59:09,161 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 17:59:09,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 17:59:09,161 INFO L82 PathProgramCache]: Analyzing trace with hash -1227984769, now seen corresponding path program 1 times [2018-10-23 17:59:09,161 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 17:59:09,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 17:59:09,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 17:59:09,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 17:59:09,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 17:59:09,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 17:59:09,754 WARN L179 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 19 [2018-10-23 17:59:09,885 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 225 proven. 5 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2018-10-23 17:59:09,885 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 17:59:09,885 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-23 17:59:10,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 17:59:10,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 17:59:10,651 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 17:59:10,869 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 258 trivial. 0 not checked. [2018-10-23 17:59:10,892 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-23 17:59:10,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2018-10-23 17:59:10,893 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-23 17:59:10,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-23 17:59:10,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-23 17:59:10,894 INFO L87 Difference]: Start difference. First operand 112111 states and 124851 transitions. Second operand 7 states. [2018-10-23 17:59:33,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 17:59:33,835 INFO L93 Difference]: Finished difference Result 265596 states and 294766 transitions. [2018-10-23 17:59:33,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-23 17:59:33,836 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 391 [2018-10-23 17:59:33,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 17:59:34,035 INFO L225 Difference]: With dead ends: 265596 [2018-10-23 17:59:34,035 INFO L226 Difference]: Without dead ends: 151980 [2018-10-23 17:59:34,103 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 392 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-23 17:59:34,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151980 states. [2018-10-23 17:59:36,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151980 to 128654. [2018-10-23 17:59:36,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128654 states. [2018-10-23 17:59:36,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128654 states to 128654 states and 140080 transitions. [2018-10-23 17:59:36,543 INFO L78 Accepts]: Start accepts. Automaton has 128654 states and 140080 transitions. Word has length 391 [2018-10-23 17:59:36,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 17:59:36,544 INFO L481 AbstractCegarLoop]: Abstraction has 128654 states and 140080 transitions. [2018-10-23 17:59:36,544 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-23 17:59:36,544 INFO L276 IsEmpty]: Start isEmpty. Operand 128654 states and 140080 transitions. [2018-10-23 17:59:36,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 742 [2018-10-23 17:59:36,671 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 17:59:36,671 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 17:59:36,672 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 17:59:36,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 17:59:36,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1965308007, now seen corresponding path program 1 times [2018-10-23 17:59:36,673 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 17:59:36,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 17:59:36,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 17:59:36,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 17:59:36,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 17:59:36,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 17:59:37,975 INFO L134 CoverageAnalysis]: Checked inductivity of 823 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 716 trivial. 0 not checked. [2018-10-23 17:59:37,975 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 17:59:37,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 17:59:37,976 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 17:59:37,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 17:59:37,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 17:59:37,977 INFO L87 Difference]: Start difference. First operand 128654 states and 140080 transitions. Second operand 3 states. [2018-10-23 17:59:45,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 17:59:45,047 INFO L93 Difference]: Finished difference Result 258057 states and 280901 transitions. [2018-10-23 17:59:45,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 17:59:45,047 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 741 [2018-10-23 17:59:45,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 17:59:45,221 INFO L225 Difference]: With dead ends: 258057 [2018-10-23 17:59:45,221 INFO L226 Difference]: Without dead ends: 130157 [2018-10-23 17:59:45,306 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-23 17:59:45,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130157 states. [2018-10-23 17:59:46,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130157 to 128653. [2018-10-23 17:59:46,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128653 states. [2018-10-23 17:59:46,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128653 states to 128653 states and 137134 transitions. [2018-10-23 17:59:46,509 INFO L78 Accepts]: Start accepts. Automaton has 128653 states and 137134 transitions. Word has length 741 [2018-10-23 17:59:46,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 17:59:46,510 INFO L481 AbstractCegarLoop]: Abstraction has 128653 states and 137134 transitions. [2018-10-23 17:59:46,510 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 17:59:46,511 INFO L276 IsEmpty]: Start isEmpty. Operand 128653 states and 137134 transitions. [2018-10-23 17:59:46,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 929 [2018-10-23 17:59:46,567 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 17:59:46,568 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 17:59:46,569 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 17:59:46,569 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 17:59:46,569 INFO L82 PathProgramCache]: Analyzing trace with hash 1833002094, now seen corresponding path program 1 times [2018-10-23 17:59:46,570 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 17:59:46,570 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 17:59:46,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 17:59:46,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 17:59:46,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 17:59:46,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 17:59:48,430 INFO L134 CoverageAnalysis]: Checked inductivity of 696 backedges. 509 proven. 70 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2018-10-23 17:59:48,430 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 17:59:48,431 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-23 17:59:48,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 17:59:48,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 17:59:48,672 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 17:59:50,067 INFO L134 CoverageAnalysis]: Checked inductivity of 696 backedges. 509 proven. 70 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2018-10-23 17:59:50,088 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-23 17:59:50,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 6 [2018-10-23 17:59:50,090 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-23 17:59:50,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-23 17:59:50,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-23 17:59:50,091 INFO L87 Difference]: Start difference. First operand 128653 states and 137134 transitions. Second operand 6 states. [2018-10-23 18:00:08,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:00:08,365 INFO L93 Difference]: Finished difference Result 299427 states and 319631 transitions. [2018-10-23 18:00:08,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-23 18:00:08,366 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 928 [2018-10-23 18:00:08,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:00:08,582 INFO L225 Difference]: With dead ends: 299427 [2018-10-23 18:00:08,582 INFO L226 Difference]: Without dead ends: 171528 [2018-10-23 18:00:08,655 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 936 GetRequests, 929 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-10-23 18:00:08,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171528 states. [2018-10-23 18:00:09,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171528 to 139933. [2018-10-23 18:00:09,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139933 states. [2018-10-23 18:00:10,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139933 states to 139933 states and 147249 transitions. [2018-10-23 18:00:10,139 INFO L78 Accepts]: Start accepts. Automaton has 139933 states and 147249 transitions. Word has length 928 [2018-10-23 18:00:10,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:00:10,140 INFO L481 AbstractCegarLoop]: Abstraction has 139933 states and 147249 transitions. [2018-10-23 18:00:10,140 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-23 18:00:10,140 INFO L276 IsEmpty]: Start isEmpty. Operand 139933 states and 147249 transitions. [2018-10-23 18:00:10,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1060 [2018-10-23 18:00:10,768 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:00:10,768 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 18:00:10,769 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:00:10,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:00:10,770 INFO L82 PathProgramCache]: Analyzing trace with hash -466829575, now seen corresponding path program 1 times [2018-10-23 18:00:10,770 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:00:10,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:00:10,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:00:10,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:00:10,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:00:10,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:00:11,788 INFO L134 CoverageAnalysis]: Checked inductivity of 951 backedges. 807 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-10-23 18:00:11,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:00:11,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-23 18:00:11,790 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:00:11,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:00:11,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:00:11,790 INFO L87 Difference]: Start difference. First operand 139933 states and 147249 transitions. Second operand 4 states. [2018-10-23 18:00:21,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:00:21,280 INFO L93 Difference]: Finished difference Result 291144 states and 306583 transitions. [2018-10-23 18:00:21,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:00:21,280 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1059 [2018-10-23 18:00:21,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:00:21,459 INFO L225 Difference]: With dead ends: 291144 [2018-10-23 18:00:21,459 INFO L226 Difference]: Without dead ends: 151965 [2018-10-23 18:00:21,549 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-23 18:00:21,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151965 states. [2018-10-23 18:00:23,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151965 to 148957. [2018-10-23 18:00:23,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148957 states. [2018-10-23 18:00:23,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148957 states to 148957 states and 155502 transitions. [2018-10-23 18:00:23,890 INFO L78 Accepts]: Start accepts. Automaton has 148957 states and 155502 transitions. Word has length 1059 [2018-10-23 18:00:23,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:00:23,891 INFO L481 AbstractCegarLoop]: Abstraction has 148957 states and 155502 transitions. [2018-10-23 18:00:23,891 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:00:23,891 INFO L276 IsEmpty]: Start isEmpty. Operand 148957 states and 155502 transitions. [2018-10-23 18:00:23,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1118 [2018-10-23 18:00:23,962 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:00:23,963 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 18:00:23,963 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:00:23,963 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:00:23,964 INFO L82 PathProgramCache]: Analyzing trace with hash -168935257, now seen corresponding path program 1 times [2018-10-23 18:00:23,964 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:00:23,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:00:23,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:00:23,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:00:23,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:00:24,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:00:26,348 INFO L134 CoverageAnalysis]: Checked inductivity of 1399 backedges. 995 proven. 0 refuted. 0 times theorem prover too weak. 404 trivial. 0 not checked. [2018-10-23 18:00:26,348 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:00:26,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-23 18:00:26,350 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:00:26,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:00:26,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:00:26,350 INFO L87 Difference]: Start difference. First operand 148957 states and 155502 transitions. Second operand 4 states. [2018-10-23 18:00:34,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:00:34,348 INFO L93 Difference]: Finished difference Result 295650 states and 308596 transitions. [2018-10-23 18:00:34,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:00:34,348 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1117 [2018-10-23 18:00:34,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:00:34,497 INFO L225 Difference]: With dead ends: 295650 [2018-10-23 18:00:34,497 INFO L226 Difference]: Without dead ends: 140667 [2018-10-23 18:00:34,583 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:00:34,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140667 states. [2018-10-23 18:00:36,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140667 to 134651. [2018-10-23 18:00:36,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134651 states. [2018-10-23 18:00:36,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134651 states to 134651 states and 139039 transitions. [2018-10-23 18:00:36,540 INFO L78 Accepts]: Start accepts. Automaton has 134651 states and 139039 transitions. Word has length 1117 [2018-10-23 18:00:36,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:00:36,541 INFO L481 AbstractCegarLoop]: Abstraction has 134651 states and 139039 transitions. [2018-10-23 18:00:36,541 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:00:36,541 INFO L276 IsEmpty]: Start isEmpty. Operand 134651 states and 139039 transitions. [2018-10-23 18:00:36,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1120 [2018-10-23 18:00:36,605 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:00:36,606 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-23 18:00:36,606 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:00:36,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:00:36,607 INFO L82 PathProgramCache]: Analyzing trace with hash -1846696478, now seen corresponding path program 1 times [2018-10-23 18:00:36,607 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:00:36,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:00:36,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:00:36,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:00:36,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:00:36,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:00:38,576 INFO L134 CoverageAnalysis]: Checked inductivity of 1405 backedges. 658 proven. 0 refuted. 0 times theorem prover too weak. 747 trivial. 0 not checked. [2018-10-23 18:00:38,577 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:00:38,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:00:38,578 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:00:38,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:00:38,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:00:38,578 INFO L87 Difference]: Start difference. First operand 134651 states and 139039 transitions. Second operand 3 states. [2018-10-23 18:00:44,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:00:44,519 INFO L93 Difference]: Finished difference Result 305395 states and 315733 transitions. [2018-10-23 18:00:44,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:00:44,519 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1119 [2018-10-23 18:00:44,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:00:44,711 INFO L225 Difference]: With dead ends: 305395 [2018-10-23 18:00:44,711 INFO L226 Difference]: Without dead ends: 171498 [2018-10-23 18:00:44,779 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-23 18:00:44,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171498 states. [2018-10-23 18:00:46,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171498 to 169242. [2018-10-23 18:00:46,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169242 states. [2018-10-23 18:00:46,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169242 states to 169242 states and 174528 transitions. [2018-10-23 18:00:46,155 INFO L78 Accepts]: Start accepts. Automaton has 169242 states and 174528 transitions. Word has length 1119 [2018-10-23 18:00:46,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:00:46,156 INFO L481 AbstractCegarLoop]: Abstraction has 169242 states and 174528 transitions. [2018-10-23 18:00:46,156 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:00:46,156 INFO L276 IsEmpty]: Start isEmpty. Operand 169242 states and 174528 transitions. [2018-10-23 18:00:46,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1142 [2018-10-23 18:00:46,220 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:00:46,220 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 18:00:46,221 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:00:46,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:00:46,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1383892843, now seen corresponding path program 1 times [2018-10-23 18:00:46,221 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:00:46,222 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:00:46,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:00:46,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:00:46,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:00:46,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:00:47,790 INFO L134 CoverageAnalysis]: Checked inductivity of 1456 backedges. 1119 proven. 0 refuted. 0 times theorem prover too weak. 337 trivial. 0 not checked. [2018-10-23 18:00:47,790 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:00:47,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:00:47,792 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:00:47,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:00:47,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:00:47,792 INFO L87 Difference]: Start difference. First operand 169242 states and 174528 transitions. Second operand 3 states. [2018-10-23 18:00:55,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:00:55,947 INFO L93 Difference]: Finished difference Result 345249 states and 355961 transitions. [2018-10-23 18:00:55,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:00:55,949 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1141 [2018-10-23 18:00:55,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:00:56,127 INFO L225 Difference]: With dead ends: 345249 [2018-10-23 18:00:56,127 INFO L226 Difference]: Without dead ends: 175255 [2018-10-23 18:00:56,211 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:00:56,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175255 states. [2018-10-23 18:00:57,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175255 to 172247. [2018-10-23 18:00:57,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172247 states. [2018-10-23 18:00:58,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172247 states to 172247 states and 177270 transitions. [2018-10-23 18:00:58,494 INFO L78 Accepts]: Start accepts. Automaton has 172247 states and 177270 transitions. Word has length 1141 [2018-10-23 18:00:58,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:00:58,494 INFO L481 AbstractCegarLoop]: Abstraction has 172247 states and 177270 transitions. [2018-10-23 18:00:58,494 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:00:58,494 INFO L276 IsEmpty]: Start isEmpty. Operand 172247 states and 177270 transitions. [2018-10-23 18:00:58,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1250 [2018-10-23 18:00:58,583 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:00:58,584 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 18:00:58,584 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:00:58,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:00:58,585 INFO L82 PathProgramCache]: Analyzing trace with hash 1637846749, now seen corresponding path program 1 times [2018-10-23 18:00:58,585 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:00:58,585 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:00:58,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:00:58,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:00:58,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:00:58,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:00:59,616 WARN L179 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2018-10-23 18:00:59,824 WARN L179 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 9 Received shutdown request... [2018-10-23 18:01:01,030 INFO L134 CoverageAnalysis]: Checked inductivity of 1579 backedges. 1237 proven. 0 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2018-10-23 18:01:01,031 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:01:01,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-23 18:01:01,032 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:01:01,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:01:01,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:01:01,032 INFO L87 Difference]: Start difference. First operand 172247 states and 177270 transitions. Second operand 4 states. [2018-10-23 18:01:01,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-23 18:01:01,033 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-23 18:01:01,039 WARN L205 ceAbstractionStarter]: Timeout [2018-10-23 18:01:01,040 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.10 06:01:01 BoogieIcfgContainer [2018-10-23 18:01:01,040 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-23 18:01:01,041 INFO L168 Benchmark]: Toolchain (without parser) took 224929.82 ms. Allocated memory was 1.5 GB in the beginning and 4.3 GB in the end (delta: 2.8 GB). Free memory was 1.4 GB in the beginning and 3.0 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2018-10-23 18:01:01,043 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-23 18:01:01,043 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2178.15 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 200.8 MB). Peak memory consumption was 200.8 MB. Max. memory is 7.1 GB. [2018-10-23 18:01:01,044 INFO L168 Benchmark]: Boogie Procedure Inliner took 695.38 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 757.1 MB). Free memory was 1.2 GB in the beginning and 2.1 GB in the end (delta: -944.9 MB). Peak memory consumption was 68.8 MB. Max. memory is 7.1 GB. [2018-10-23 18:01:01,045 INFO L168 Benchmark]: Boogie Preprocessor took 317.86 ms. Allocated memory is still 2.3 GB. Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 38.3 MB). Peak memory consumption was 38.3 MB. Max. memory is 7.1 GB. [2018-10-23 18:01:01,046 INFO L168 Benchmark]: RCFGBuilder took 9176.12 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 307.8 MB). Free memory was 2.1 GB in the beginning and 2.4 GB in the end (delta: -303.0 MB). Peak memory consumption was 682.1 MB. Max. memory is 7.1 GB. [2018-10-23 18:01:01,047 INFO L168 Benchmark]: TraceAbstraction took 212556.46 ms. Allocated memory was 2.6 GB in the beginning and 4.3 GB in the end (delta: 1.7 GB). Free memory was 2.4 GB in the beginning and 3.0 GB in the end (delta: -579.2 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2018-10-23 18:01:01,055 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.26 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 2178.15 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 200.8 MB). Peak memory consumption was 200.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 695.38 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 757.1 MB). Free memory was 1.2 GB in the beginning and 2.1 GB in the end (delta: -944.9 MB). Peak memory consumption was 68.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 317.86 ms. Allocated memory is still 2.3 GB. Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 38.3 MB). Peak memory consumption was 38.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 9176.12 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 307.8 MB). Free memory was 2.1 GB in the beginning and 2.4 GB in the end (delta: -303.0 MB). Peak memory consumption was 682.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 212556.46 ms. Allocated memory was 2.6 GB in the beginning and 4.3 GB in the end (delta: 1.7 GB). Free memory was 2.4 GB in the beginning and 3.0 GB in the end (delta: -579.2 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 96]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 96). Cancelled while BasicCegarLoop was constructing difference of abstraction (172247states) and FLOYD_HOARE automaton (currently 2 states, 4 states before enhancement),while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 819 locations, 1 error locations. TIMEOUT Result, 212.4s OverallTime, 16 OverallIterations, 6 TraceHistogramMax, 174.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8892 SDtfs, 29029 SDslu, 1258 SDs, 0 SdLazy, 74432 SolverSat, 16974 SolverUnsat, 6 SolverUnknown, 0 SolverNotchecked, 140.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1395 GetRequests, 1344 SyntacticMatches, 10 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 3.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=172247occurred in iteration=15, 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: 17.6s AutomataMinimizationTime, 15 MinimizatonAttempts, 95609 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 9.1s InterpolantComputationTime, 10589 NumberOfCodeBlocks, 10589 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 10571 ConstructedInterpolants, 0 QuantifiedInterpolants, 17277964 SizeOfPredicates, 1 NumberOfNonLiveVariables, 1600 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 18 InterpolantComputations, 15 PerfectInterpolantSequences, 10378/10523 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown