java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem15_label16_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-06 21:29:18,269 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-06 21:29:18,272 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-06 21:29:18,289 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-06 21:29:18,290 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-06 21:29:18,291 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-06 21:29:18,292 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-06 21:29:18,295 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-06 21:29:18,298 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-06 21:29:18,298 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-06 21:29:18,301 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-06 21:29:18,303 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-06 21:29:18,305 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-06 21:29:18,306 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-06 21:29:18,307 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-06 21:29:18,310 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-06 21:29:18,311 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-06 21:29:18,318 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-06 21:29:18,321 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-06 21:29:18,322 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-06 21:29:18,323 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-06 21:29:18,325 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-06 21:29:18,327 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-06 21:29:18,327 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-06 21:29:18,327 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-06 21:29:18,328 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-06 21:29:18,329 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-06 21:29:18,330 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-06 21:29:18,330 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-06 21:29:18,331 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-06 21:29:18,332 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-06 21:29:18,332 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-06 21:29:18,333 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-06 21:29:18,333 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-06 21:29:18,334 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-06 21:29:18,334 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-06 21:29:18,335 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-11-06 21:29:18,360 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-06 21:29:18,360 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-06 21:29:18,362 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-06 21:29:18,362 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-06 21:29:18,365 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-06 21:29:18,365 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-06 21:29:18,365 INFO L133 SettingsManager]: * Use SBE=true [2018-11-06 21:29:18,367 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-06 21:29:18,367 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-06 21:29:18,367 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-06 21:29:18,367 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-06 21:29:18,367 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-06 21:29:18,367 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-06 21:29:18,368 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-06 21:29:18,368 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-06 21:29:18,368 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-06 21:29:18,368 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-06 21:29:18,369 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-06 21:29:18,370 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-06 21:29:18,370 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 21:29:18,370 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-06 21:29:18,370 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-06 21:29:18,370 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-06 21:29:18,371 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-06 21:29:18,371 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-06 21:29:18,371 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-06 21:29:18,372 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-06 21:29:18,372 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-06 21:29:18,431 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-06 21:29:18,449 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-06 21:29:18,453 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-06 21:29:18,455 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-06 21:29:18,455 INFO L276 PluginConnector]: CDTParser initialized [2018-11-06 21:29:18,456 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem15_label16_true-unreach-call.c [2018-11-06 21:29:18,517 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3e862ff4/1d168e8aac8e4d1489243c541d528cf5/FLAG4f2a0292c [2018-11-06 21:29:19,169 INFO L298 CDTParser]: Found 1 translation units. [2018-11-06 21:29:19,170 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem15_label16_true-unreach-call.c [2018-11-06 21:29:19,191 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3e862ff4/1d168e8aac8e4d1489243c541d528cf5/FLAG4f2a0292c [2018-11-06 21:29:19,209 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3e862ff4/1d168e8aac8e4d1489243c541d528cf5 [2018-11-06 21:29:19,222 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-06 21:29:19,223 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-06 21:29:19,224 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-06 21:29:19,225 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-06 21:29:19,229 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-06 21:29:19,230 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:29:19" (1/1) ... [2018-11-06 21:29:19,233 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56793b08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:29:19, skipping insertion in model container [2018-11-06 21:29:19,233 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:29:19" (1/1) ... [2018-11-06 21:29:19,243 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-06 21:29:19,349 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-06 21:29:20,253 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 21:29:20,258 INFO L189 MainTranslator]: Completed pre-run [2018-11-06 21:29:20,618 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 21:29:20,641 INFO L193 MainTranslator]: Completed translation [2018-11-06 21:29:20,642 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:29:20 WrapperNode [2018-11-06 21:29:20,642 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-06 21:29:20,644 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-06 21:29:20,644 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-06 21:29:20,644 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-06 21:29:20,655 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:29:20" (1/1) ... [2018-11-06 21:29:20,851 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:29:20" (1/1) ... [2018-11-06 21:29:21,007 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-06 21:29:21,007 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-06 21:29:21,007 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-06 21:29:21,007 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-06 21:29:21,019 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:29:20" (1/1) ... [2018-11-06 21:29:21,020 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:29:20" (1/1) ... [2018-11-06 21:29:21,035 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:29:20" (1/1) ... [2018-11-06 21:29:21,035 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:29:20" (1/1) ... [2018-11-06 21:29:21,128 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:29:20" (1/1) ... [2018-11-06 21:29:21,158 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:29:20" (1/1) ... [2018-11-06 21:29:21,203 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:29:20" (1/1) ... [2018-11-06 21:29:21,237 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-06 21:29:21,237 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-06 21:29:21,237 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-06 21:29:21,237 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-06 21:29:21,238 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:29:20" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 21:29:21,306 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-06 21:29:21,306 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-06 21:29:21,307 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-06 21:29:28,135 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-06 21:29:28,135 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:29:28 BoogieIcfgContainer [2018-11-06 21:29:28,135 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-06 21:29:28,136 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-06 21:29:28,137 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-06 21:29:28,140 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-06 21:29:28,140 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:29:19" (1/3) ... [2018-11-06 21:29:28,141 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a90bba1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:29:28, skipping insertion in model container [2018-11-06 21:29:28,141 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:29:20" (2/3) ... [2018-11-06 21:29:28,142 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a90bba1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:29:28, skipping insertion in model container [2018-11-06 21:29:28,142 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:29:28" (3/3) ... [2018-11-06 21:29:28,144 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem15_label16_true-unreach-call.c [2018-11-06 21:29:28,154 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-06 21:29:28,164 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-06 21:29:28,182 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-06 21:29:28,221 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-06 21:29:28,222 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-06 21:29:28,222 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-06 21:29:28,222 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-06 21:29:28,222 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-06 21:29:28,223 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-06 21:29:28,223 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-06 21:29:28,223 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-06 21:29:28,223 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-06 21:29:28,257 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states. [2018-11-06 21:29:28,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-06 21:29:28,269 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:29:28,270 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:29:28,273 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:29:28,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:29:28,279 INFO L82 PathProgramCache]: Analyzing trace with hash 265969354, now seen corresponding path program 1 times [2018-11-06 21:29:28,280 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:29:28,281 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:29:28,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:29:28,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:29:28,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:29:28,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:29:28,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:29:28,742 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:29:28,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:29:28,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:29:28,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:29:28,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:29:28,766 INFO L87 Difference]: Start difference. First operand 425 states. Second operand 4 states. [2018-11-06 21:29:35,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:29:35,756 INFO L93 Difference]: Finished difference Result 1474 states and 2723 transitions. [2018-11-06 21:29:35,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:29:35,758 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2018-11-06 21:29:35,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:29:35,793 INFO L225 Difference]: With dead ends: 1474 [2018-11-06 21:29:35,793 INFO L226 Difference]: Without dead ends: 1042 [2018-11-06 21:29:35,802 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:29:35,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1042 states. [2018-11-06 21:29:35,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1042 to 1040. [2018-11-06 21:29:35,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1040 states. [2018-11-06 21:29:35,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1040 states to 1040 states and 1638 transitions. [2018-11-06 21:29:35,925 INFO L78 Accepts]: Start accepts. Automaton has 1040 states and 1638 transitions. Word has length 63 [2018-11-06 21:29:35,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:29:35,926 INFO L480 AbstractCegarLoop]: Abstraction has 1040 states and 1638 transitions. [2018-11-06 21:29:35,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:29:35,926 INFO L276 IsEmpty]: Start isEmpty. Operand 1040 states and 1638 transitions. [2018-11-06 21:29:35,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-11-06 21:29:35,936 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:29:35,936 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:29:35,937 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:29:35,937 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:29:35,937 INFO L82 PathProgramCache]: Analyzing trace with hash -899294482, now seen corresponding path program 1 times [2018-11-06 21:29:35,937 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:29:35,937 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:29:35,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:29:35,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:29:35,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:29:36,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:29:36,396 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:29:36,396 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:29:36,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:29:36,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 21:29:36,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 21:29:36,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:29:36,399 INFO L87 Difference]: Start difference. First operand 1040 states and 1638 transitions. Second operand 5 states. [2018-11-06 21:29:46,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:29:46,086 INFO L93 Difference]: Finished difference Result 3299 states and 5135 transitions. [2018-11-06 21:29:46,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:29:46,086 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 129 [2018-11-06 21:29:46,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:29:46,099 INFO L225 Difference]: With dead ends: 3299 [2018-11-06 21:29:46,099 INFO L226 Difference]: Without dead ends: 2261 [2018-11-06 21:29:46,104 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:29:46,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2261 states. [2018-11-06 21:29:46,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2261 to 1953. [2018-11-06 21:29:46,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1953 states. [2018-11-06 21:29:46,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1953 states to 1953 states and 2816 transitions. [2018-11-06 21:29:46,179 INFO L78 Accepts]: Start accepts. Automaton has 1953 states and 2816 transitions. Word has length 129 [2018-11-06 21:29:46,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:29:46,181 INFO L480 AbstractCegarLoop]: Abstraction has 1953 states and 2816 transitions. [2018-11-06 21:29:46,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 21:29:46,181 INFO L276 IsEmpty]: Start isEmpty. Operand 1953 states and 2816 transitions. [2018-11-06 21:29:46,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-11-06 21:29:46,193 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:29:46,194 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:29:46,194 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:29:46,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:29:46,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1716183744, now seen corresponding path program 1 times [2018-11-06 21:29:46,195 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:29:46,195 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:29:46,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:29:46,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:29:46,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:29:46,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:29:46,500 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:29:46,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:29:46,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:29:46,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:29:46,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:29:46,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:29:46,501 INFO L87 Difference]: Start difference. First operand 1953 states and 2816 transitions. Second operand 4 states. [2018-11-06 21:29:50,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:29:50,539 INFO L93 Difference]: Finished difference Result 7212 states and 10585 transitions. [2018-11-06 21:29:50,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:29:50,540 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 134 [2018-11-06 21:29:50,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:29:50,565 INFO L225 Difference]: With dead ends: 7212 [2018-11-06 21:29:50,566 INFO L226 Difference]: Without dead ends: 5261 [2018-11-06 21:29:50,570 INFO L604 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-11-06 21:29:50,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5261 states. [2018-11-06 21:29:50,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5261 to 5255. [2018-11-06 21:29:50,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5255 states. [2018-11-06 21:29:50,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5255 states to 5255 states and 6986 transitions. [2018-11-06 21:29:50,661 INFO L78 Accepts]: Start accepts. Automaton has 5255 states and 6986 transitions. Word has length 134 [2018-11-06 21:29:50,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:29:50,662 INFO L480 AbstractCegarLoop]: Abstraction has 5255 states and 6986 transitions. [2018-11-06 21:29:50,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:29:50,662 INFO L276 IsEmpty]: Start isEmpty. Operand 5255 states and 6986 transitions. [2018-11-06 21:29:50,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2018-11-06 21:29:50,668 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:29:50,668 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 21:29:50,668 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:29:50,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:29:50,669 INFO L82 PathProgramCache]: Analyzing trace with hash -648643925, now seen corresponding path program 1 times [2018-11-06 21:29:50,669 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:29:50,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:29:50,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:29:50,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:29:50,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:29:50,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:29:50,966 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 121 proven. 4 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-11-06 21:29:50,966 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:29:50,967 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 21:29:50,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:29:51,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:29:51,085 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:29:51,177 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 200 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:29:51,212 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 21:29:51,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2018-11-06 21:29:51,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:29:51,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:29:51,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:29:51,214 INFO L87 Difference]: Start difference. First operand 5255 states and 6986 transitions. Second operand 4 states. [2018-11-06 21:29:57,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:29:57,328 INFO L93 Difference]: Finished difference Result 19280 states and 26028 transitions. [2018-11-06 21:29:57,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:29:57,329 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 235 [2018-11-06 21:29:57,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:29:57,387 INFO L225 Difference]: With dead ends: 19280 [2018-11-06 21:29:57,388 INFO L226 Difference]: Without dead ends: 14027 [2018-11-06 21:29:57,396 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:29:57,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14027 states. [2018-11-06 21:29:57,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14027 to 8857. [2018-11-06 21:29:57,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8857 states. [2018-11-06 21:29:57,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8857 states to 8857 states and 11192 transitions. [2018-11-06 21:29:57,592 INFO L78 Accepts]: Start accepts. Automaton has 8857 states and 11192 transitions. Word has length 235 [2018-11-06 21:29:57,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:29:57,593 INFO L480 AbstractCegarLoop]: Abstraction has 8857 states and 11192 transitions. [2018-11-06 21:29:57,593 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:29:57,593 INFO L276 IsEmpty]: Start isEmpty. Operand 8857 states and 11192 transitions. [2018-11-06 21:29:57,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2018-11-06 21:29:57,604 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:29:57,604 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 21:29:57,605 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:29:57,605 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:29:57,605 INFO L82 PathProgramCache]: Analyzing trace with hash -845032929, now seen corresponding path program 1 times [2018-11-06 21:29:57,605 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:29:57,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:29:57,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:29:57,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:29:57,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:29:57,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:29:58,254 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-11-06 21:29:58,254 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:29:58,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:29:58,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 21:29:58,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 21:29:58,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:29:58,255 INFO L87 Difference]: Start difference. First operand 8857 states and 11192 transitions. Second operand 5 states. [2018-11-06 21:30:02,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:30:02,075 INFO L93 Difference]: Finished difference Result 19215 states and 24057 transitions. [2018-11-06 21:30:02,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:30:02,076 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 337 [2018-11-06 21:30:02,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:30:02,110 INFO L225 Difference]: With dead ends: 19215 [2018-11-06 21:30:02,110 INFO L226 Difference]: Without dead ends: 10360 [2018-11-06 21:30:02,117 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:30:02,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10360 states. [2018-11-06 21:30:02,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10360 to 10057. [2018-11-06 21:30:02,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10057 states. [2018-11-06 21:30:02,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10057 states to 10057 states and 12448 transitions. [2018-11-06 21:30:02,315 INFO L78 Accepts]: Start accepts. Automaton has 10057 states and 12448 transitions. Word has length 337 [2018-11-06 21:30:02,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:30:02,316 INFO L480 AbstractCegarLoop]: Abstraction has 10057 states and 12448 transitions. [2018-11-06 21:30:02,316 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 21:30:02,316 INFO L276 IsEmpty]: Start isEmpty. Operand 10057 states and 12448 transitions. [2018-11-06 21:30:02,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 412 [2018-11-06 21:30:02,332 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:30:02,333 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 21:30:02,333 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:30:02,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:30:02,334 INFO L82 PathProgramCache]: Analyzing trace with hash -506042351, now seen corresponding path program 1 times [2018-11-06 21:30:02,334 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:30:02,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:30:02,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:30:02,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:30:02,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:30:02,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:30:02,792 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-11-06 21:30:02,793 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:30:02,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:30:02,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:30:02,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:30:02,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:30:02,794 INFO L87 Difference]: Start difference. First operand 10057 states and 12448 transitions. Second operand 4 states. [2018-11-06 21:30:07,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:30:07,093 INFO L93 Difference]: Finished difference Result 25814 states and 32434 transitions. [2018-11-06 21:30:07,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:30:07,093 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 411 [2018-11-06 21:30:07,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:30:07,121 INFO L225 Difference]: With dead ends: 25814 [2018-11-06 21:30:07,122 INFO L226 Difference]: Without dead ends: 15759 [2018-11-06 21:30:07,133 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:30:07,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15759 states. [2018-11-06 21:30:07,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15759 to 15759. [2018-11-06 21:30:07,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15759 states. [2018-11-06 21:30:07,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15759 states to 15759 states and 18917 transitions. [2018-11-06 21:30:07,335 INFO L78 Accepts]: Start accepts. Automaton has 15759 states and 18917 transitions. Word has length 411 [2018-11-06 21:30:07,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:30:07,337 INFO L480 AbstractCegarLoop]: Abstraction has 15759 states and 18917 transitions. [2018-11-06 21:30:07,337 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:30:07,337 INFO L276 IsEmpty]: Start isEmpty. Operand 15759 states and 18917 transitions. [2018-11-06 21:30:07,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 497 [2018-11-06 21:30:07,356 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:30:07,357 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-06 21:30:07,357 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:30:07,357 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:30:07,357 INFO L82 PathProgramCache]: Analyzing trace with hash -2057211809, now seen corresponding path program 1 times [2018-11-06 21:30:07,358 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:30:07,358 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:30:07,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:30:07,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:30:07,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:30:07,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:30:08,136 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 358 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-11-06 21:30:08,136 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:30:08,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:30:08,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:30:08,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:30:08,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:30:08,141 INFO L87 Difference]: Start difference. First operand 15759 states and 18917 transitions. Second operand 4 states. [2018-11-06 21:30:12,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:30:12,142 INFO L93 Difference]: Finished difference Result 31518 states and 37839 transitions. [2018-11-06 21:30:12,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:30:12,143 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 496 [2018-11-06 21:30:12,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:30:12,177 INFO L225 Difference]: With dead ends: 31518 [2018-11-06 21:30:12,178 INFO L226 Difference]: Without dead ends: 15761 [2018-11-06 21:30:12,193 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:30:12,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15761 states. [2018-11-06 21:30:12,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15761 to 15757. [2018-11-06 21:30:12,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15757 states. [2018-11-06 21:30:12,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15757 states to 15757 states and 18094 transitions. [2018-11-06 21:30:12,385 INFO L78 Accepts]: Start accepts. Automaton has 15757 states and 18094 transitions. Word has length 496 [2018-11-06 21:30:12,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:30:12,385 INFO L480 AbstractCegarLoop]: Abstraction has 15757 states and 18094 transitions. [2018-11-06 21:30:12,386 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:30:12,386 INFO L276 IsEmpty]: Start isEmpty. Operand 15757 states and 18094 transitions. [2018-11-06 21:30:12,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 521 [2018-11-06 21:30:12,407 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:30:12,408 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:30:12,408 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:30:12,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:30:12,409 INFO L82 PathProgramCache]: Analyzing trace with hash -1720017519, now seen corresponding path program 1 times [2018-11-06 21:30:12,409 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:30:12,409 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:30:12,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:30:12,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:30:12,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:30:12,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:30:12,877 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-06 21:30:13,209 WARN L179 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2018-11-06 21:30:13,541 WARN L179 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2018-11-06 21:30:13,998 WARN L179 SmtUtils]: Spent 388.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 14 [2018-11-06 21:30:14,605 WARN L179 SmtUtils]: Spent 509.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 19 [2018-11-06 21:30:15,580 INFO L134 CoverageAnalysis]: Checked inductivity of 745 backedges. 542 proven. 4 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2018-11-06 21:30:15,580 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:30:15,580 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 21:30:15,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:30:15,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:30:15,723 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:30:15,884 INFO L134 CoverageAnalysis]: Checked inductivity of 745 backedges. 593 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2018-11-06 21:30:15,907 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 21:30:15,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2018-11-06 21:30:15,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-06 21:30:15,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-06 21:30:15,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-11-06 21:30:15,909 INFO L87 Difference]: Start difference. First operand 15757 states and 18094 transitions. Second operand 8 states. [2018-11-06 21:30:24,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:30:24,511 INFO L93 Difference]: Finished difference Result 35882 states and 40871 transitions. [2018-11-06 21:30:24,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-06 21:30:24,512 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 520 [2018-11-06 21:30:24,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:30:24,537 INFO L225 Difference]: With dead ends: 35882 [2018-11-06 21:30:24,538 INFO L226 Difference]: Without dead ends: 16052 [2018-11-06 21:30:24,552 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 534 GetRequests, 523 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2018-11-06 21:30:24,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16052 states. [2018-11-06 21:30:24,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16052 to 15752. [2018-11-06 21:30:24,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15752 states. [2018-11-06 21:30:24,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15752 states to 15752 states and 17369 transitions. [2018-11-06 21:30:24,718 INFO L78 Accepts]: Start accepts. Automaton has 15752 states and 17369 transitions. Word has length 520 [2018-11-06 21:30:24,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:30:24,719 INFO L480 AbstractCegarLoop]: Abstraction has 15752 states and 17369 transitions. [2018-11-06 21:30:24,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-06 21:30:24,719 INFO L276 IsEmpty]: Start isEmpty. Operand 15752 states and 17369 transitions. [2018-11-06 21:30:24,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 522 [2018-11-06 21:30:24,728 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:30:24,728 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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] [2018-11-06 21:30:24,729 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:30:24,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:30:24,729 INFO L82 PathProgramCache]: Analyzing trace with hash 1798089204, now seen corresponding path program 1 times [2018-11-06 21:30:24,729 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:30:24,730 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:30:24,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:30:24,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:30:24,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:30:24,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:30:25,665 INFO L134 CoverageAnalysis]: Checked inductivity of 446 backedges. 271 proven. 136 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-06 21:30:25,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:30:25,666 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 21:30:25,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:30:25,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:30:25,798 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:30:26,076 INFO L134 CoverageAnalysis]: Checked inductivity of 446 backedges. 339 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2018-11-06 21:30:26,097 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 21:30:26,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2018-11-06 21:30:26,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-06 21:30:26,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-06 21:30:26,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-06 21:30:26,099 INFO L87 Difference]: Start difference. First operand 15752 states and 17369 transitions. Second operand 9 states. [2018-11-06 21:30:34,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:30:34,587 INFO L93 Difference]: Finished difference Result 31968 states and 35207 transitions. [2018-11-06 21:30:34,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-06 21:30:34,587 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 521 [2018-11-06 21:30:34,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:30:34,606 INFO L225 Difference]: With dead ends: 31968 [2018-11-06 21:30:34,607 INFO L226 Difference]: Without dead ends: 16218 [2018-11-06 21:30:34,618 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 540 GetRequests, 525 SyntacticMatches, 5 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2018-11-06 21:30:34,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16218 states. [2018-11-06 21:30:34,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16218 to 15748. [2018-11-06 21:30:34,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15748 states. [2018-11-06 21:30:34,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15748 states to 15748 states and 16802 transitions. [2018-11-06 21:30:34,792 INFO L78 Accepts]: Start accepts. Automaton has 15748 states and 16802 transitions. Word has length 521 [2018-11-06 21:30:34,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:30:34,793 INFO L480 AbstractCegarLoop]: Abstraction has 15748 states and 16802 transitions. [2018-11-06 21:30:34,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-06 21:30:34,794 INFO L276 IsEmpty]: Start isEmpty. Operand 15748 states and 16802 transitions. [2018-11-06 21:30:34,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 568 [2018-11-06 21:30:34,803 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:30:34,804 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-06 21:30:34,804 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:30:34,804 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:30:34,804 INFO L82 PathProgramCache]: Analyzing trace with hash 191164642, now seen corresponding path program 1 times [2018-11-06 21:30:34,804 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:30:34,804 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:30:34,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:30:34,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:30:34,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:30:34,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:30:35,207 INFO L134 CoverageAnalysis]: Checked inductivity of 519 backedges. 182 proven. 0 refuted. 0 times theorem prover too weak. 337 trivial. 0 not checked. [2018-11-06 21:30:35,207 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:30:35,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:30:35,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 21:30:35,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 21:30:35,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:30:35,209 INFO L87 Difference]: Start difference. First operand 15748 states and 16802 transitions. Second operand 3 states. [2018-11-06 21:30:36,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:30:36,958 INFO L93 Difference]: Finished difference Result 31792 states and 33962 transitions. [2018-11-06 21:30:36,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 21:30:36,959 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 567 [2018-11-06 21:30:36,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:30:36,973 INFO L225 Difference]: With dead ends: 31792 [2018-11-06 21:30:36,973 INFO L226 Difference]: Without dead ends: 16046 [2018-11-06 21:30:36,985 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:30:36,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16046 states. [2018-11-06 21:30:37,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16046 to 15746. [2018-11-06 21:30:37,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15746 states. [2018-11-06 21:30:37,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15746 states to 15746 states and 16798 transitions. [2018-11-06 21:30:37,164 INFO L78 Accepts]: Start accepts. Automaton has 15746 states and 16798 transitions. Word has length 567 [2018-11-06 21:30:37,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:30:37,166 INFO L480 AbstractCegarLoop]: Abstraction has 15746 states and 16798 transitions. [2018-11-06 21:30:37,166 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 21:30:37,166 INFO L276 IsEmpty]: Start isEmpty. Operand 15746 states and 16798 transitions. [2018-11-06 21:30:37,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 646 [2018-11-06 21:30:37,182 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:30:37,182 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:30:37,184 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:30:37,184 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:30:37,184 INFO L82 PathProgramCache]: Analyzing trace with hash -1070353790, now seen corresponding path program 1 times [2018-11-06 21:30:37,184 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:30:37,184 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:30:37,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:30:37,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:30:37,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:30:37,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:30:37,808 INFO L134 CoverageAnalysis]: Checked inductivity of 817 backedges. 482 proven. 0 refuted. 0 times theorem prover too weak. 335 trivial. 0 not checked. [2018-11-06 21:30:37,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:30:37,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:30:37,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 21:30:37,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 21:30:37,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:30:37,810 INFO L87 Difference]: Start difference. First operand 15746 states and 16798 transitions. Second operand 3 states. [2018-11-06 21:30:40,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:30:40,104 INFO L93 Difference]: Finished difference Result 37802 states and 40568 transitions. [2018-11-06 21:30:40,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 21:30:40,104 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 645 [2018-11-06 21:30:40,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:30:40,127 INFO L225 Difference]: With dead ends: 37802 [2018-11-06 21:30:40,127 INFO L226 Difference]: Without dead ends: 22058 [2018-11-06 21:30:40,139 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:30:40,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22058 states. [2018-11-06 21:30:40,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22058 to 22048. [2018-11-06 21:30:40,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22048 states. [2018-11-06 21:30:40,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22048 states to 22048 states and 23453 transitions. [2018-11-06 21:30:40,353 INFO L78 Accepts]: Start accepts. Automaton has 22048 states and 23453 transitions. Word has length 645 [2018-11-06 21:30:40,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:30:40,353 INFO L480 AbstractCegarLoop]: Abstraction has 22048 states and 23453 transitions. [2018-11-06 21:30:40,354 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 21:30:40,354 INFO L276 IsEmpty]: Start isEmpty. Operand 22048 states and 23453 transitions. [2018-11-06 21:30:40,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 692 [2018-11-06 21:30:40,370 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:30:40,371 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 21:30:40,371 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:30:40,371 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:30:40,372 INFO L82 PathProgramCache]: Analyzing trace with hash -684261465, now seen corresponding path program 1 times [2018-11-06 21:30:40,372 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:30:40,372 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:30:40,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:30:40,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:30:40,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:30:40,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:30:40,994 INFO L134 CoverageAnalysis]: Checked inductivity of 643 backedges. 182 proven. 0 refuted. 0 times theorem prover too weak. 461 trivial. 0 not checked. [2018-11-06 21:30:40,994 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:30:40,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-06 21:30:40,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 21:30:40,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 21:30:40,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:30:40,996 INFO L87 Difference]: Start difference. First operand 22048 states and 23453 transitions. Second operand 5 states. [2018-11-06 21:30:45,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:30:45,203 INFO L93 Difference]: Finished difference Result 58815 states and 62612 transitions. [2018-11-06 21:30:45,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 21:30:45,203 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 691 [2018-11-06 21:30:45,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:30:45,235 INFO L225 Difference]: With dead ends: 58815 [2018-11-06 21:30:45,235 INFO L226 Difference]: Without dead ends: 36769 [2018-11-06 21:30:45,252 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:30:45,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36769 states. [2018-11-06 21:30:45,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36769 to 28645. [2018-11-06 21:30:45,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28645 states. [2018-11-06 21:30:45,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28645 states to 28645 states and 30252 transitions. [2018-11-06 21:30:45,536 INFO L78 Accepts]: Start accepts. Automaton has 28645 states and 30252 transitions. Word has length 691 [2018-11-06 21:30:45,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:30:45,536 INFO L480 AbstractCegarLoop]: Abstraction has 28645 states and 30252 transitions. [2018-11-06 21:30:45,536 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 21:30:45,536 INFO L276 IsEmpty]: Start isEmpty. Operand 28645 states and 30252 transitions. [2018-11-06 21:30:45,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 697 [2018-11-06 21:30:45,554 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:30:45,555 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 21:30:45,555 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:30:45,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:30:45,555 INFO L82 PathProgramCache]: Analyzing trace with hash 778946677, now seen corresponding path program 1 times [2018-11-06 21:30:45,556 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:30:45,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:30:45,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:30:45,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:30:45,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:30:45,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:30:46,122 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 182 proven. 0 refuted. 0 times theorem prover too weak. 466 trivial. 0 not checked. [2018-11-06 21:30:46,123 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:30:46,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:30:46,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 21:30:46,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 21:30:46,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:30:46,124 INFO L87 Difference]: Start difference. First operand 28645 states and 30252 transitions. Second operand 3 states. [2018-11-06 21:30:48,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:30:48,081 INFO L93 Difference]: Finished difference Result 59687 states and 63192 transitions. [2018-11-06 21:30:48,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 21:30:48,081 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 696 [2018-11-06 21:30:48,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:30:48,109 INFO L225 Difference]: With dead ends: 59687 [2018-11-06 21:30:48,109 INFO L226 Difference]: Without dead ends: 31044 [2018-11-06 21:30:48,125 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:30:48,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31044 states. [2018-11-06 21:30:48,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31044 to 31044. [2018-11-06 21:30:48,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31044 states. [2018-11-06 21:30:48,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31044 states to 31044 states and 32565 transitions. [2018-11-06 21:30:48,378 INFO L78 Accepts]: Start accepts. Automaton has 31044 states and 32565 transitions. Word has length 696 [2018-11-06 21:30:48,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:30:48,378 INFO L480 AbstractCegarLoop]: Abstraction has 31044 states and 32565 transitions. [2018-11-06 21:30:48,378 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 21:30:48,378 INFO L276 IsEmpty]: Start isEmpty. Operand 31044 states and 32565 transitions. [2018-11-06 21:30:48,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 759 [2018-11-06 21:30:48,397 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:30:48,397 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 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, 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] [2018-11-06 21:30:48,397 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:30:48,398 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:30:48,398 INFO L82 PathProgramCache]: Analyzing trace with hash -1922978813, now seen corresponding path program 1 times [2018-11-06 21:30:48,398 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:30:48,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:30:48,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:30:48,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:30:48,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:30:48,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:30:49,253 INFO L134 CoverageAnalysis]: Checked inductivity of 1289 backedges. 623 proven. 0 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2018-11-06 21:30:49,254 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:30:49,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:30:49,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 21:30:49,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 21:30:49,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:30:49,255 INFO L87 Difference]: Start difference. First operand 31044 states and 32565 transitions. Second operand 3 states. [2018-11-06 21:30:51,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:30:51,008 INFO L93 Difference]: Finished difference Result 56339 states and 59052 transitions. [2018-11-06 21:30:51,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 21:30:51,009 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 758 [2018-11-06 21:30:51,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:30:51,023 INFO L225 Difference]: With dead ends: 56339 [2018-11-06 21:30:51,024 INFO L226 Difference]: Without dead ends: 16562 [2018-11-06 21:30:51,039 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:30:51,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16562 states. [2018-11-06 21:30:51,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16562 to 13862. [2018-11-06 21:30:51,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13862 states. [2018-11-06 21:30:51,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13862 states to 13862 states and 14243 transitions. [2018-11-06 21:30:51,158 INFO L78 Accepts]: Start accepts. Automaton has 13862 states and 14243 transitions. Word has length 758 [2018-11-06 21:30:51,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:30:51,159 INFO L480 AbstractCegarLoop]: Abstraction has 13862 states and 14243 transitions. [2018-11-06 21:30:51,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 21:30:51,159 INFO L276 IsEmpty]: Start isEmpty. Operand 13862 states and 14243 transitions. [2018-11-06 21:30:51,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 814 [2018-11-06 21:30:51,167 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:30:51,168 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:30:51,168 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:30:51,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:30:51,169 INFO L82 PathProgramCache]: Analyzing trace with hash -562456670, now seen corresponding path program 1 times [2018-11-06 21:30:51,169 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:30:51,169 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:30:51,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:30:51,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:30:51,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:30:51,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:30:52,081 INFO L134 CoverageAnalysis]: Checked inductivity of 1082 backedges. 243 proven. 0 refuted. 0 times theorem prover too weak. 839 trivial. 0 not checked. [2018-11-06 21:30:52,082 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:30:52,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:30:52,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 21:30:52,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 21:30:52,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:30:52,084 INFO L87 Difference]: Start difference. First operand 13862 states and 14243 transitions. Second operand 3 states. [2018-11-06 21:30:54,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:30:54,098 INFO L93 Difference]: Finished difference Result 30428 states and 31275 transitions. [2018-11-06 21:30:54,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 21:30:54,099 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 813 [2018-11-06 21:30:54,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:30:54,114 INFO L225 Difference]: With dead ends: 30428 [2018-11-06 21:30:54,115 INFO L226 Difference]: Without dead ends: 16567 [2018-11-06 21:30:54,124 INFO L604 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-11-06 21:30:54,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16567 states. [2018-11-06 21:30:54,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16567 to 15361. [2018-11-06 21:30:54,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15361 states. [2018-11-06 21:30:54,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15361 states to 15361 states and 15758 transitions. [2018-11-06 21:30:54,253 INFO L78 Accepts]: Start accepts. Automaton has 15361 states and 15758 transitions. Word has length 813 [2018-11-06 21:30:54,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:30:54,254 INFO L480 AbstractCegarLoop]: Abstraction has 15361 states and 15758 transitions. [2018-11-06 21:30:54,254 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 21:30:54,254 INFO L276 IsEmpty]: Start isEmpty. Operand 15361 states and 15758 transitions. [2018-11-06 21:30:54,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 833 [2018-11-06 21:30:54,423 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:30:54,424 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:30:54,424 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:30:54,424 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:30:54,424 INFO L82 PathProgramCache]: Analyzing trace with hash 1363917183, now seen corresponding path program 1 times [2018-11-06 21:30:54,425 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:30:54,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:30:54,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:30:54,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:30:54,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:30:54,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:30:55,127 WARN L179 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 3 [2018-11-06 21:30:55,334 WARN L179 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 5 [2018-11-06 21:30:55,886 INFO L134 CoverageAnalysis]: Checked inductivity of 1088 backedges. 682 proven. 56 refuted. 0 times theorem prover too weak. 350 trivial. 0 not checked. [2018-11-06 21:30:55,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:30:55,886 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 21:30:55,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:30:56,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:30:56,115 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:30:56,365 WARN L179 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 17 [2018-11-06 21:30:57,017 WARN L179 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 32 [2018-11-06 21:30:58,715 INFO L134 CoverageAnalysis]: Checked inductivity of 1088 backedges. 684 proven. 54 refuted. 0 times theorem prover too weak. 350 trivial. 0 not checked. [2018-11-06 21:30:58,735 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 21:30:58,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-11-06 21:30:58,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-06 21:30:58,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-06 21:30:58,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-11-06 21:30:58,737 INFO L87 Difference]: Start difference. First operand 15361 states and 15758 transitions. Second operand 8 states. [2018-11-06 21:31:13,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:31:13,881 INFO L93 Difference]: Finished difference Result 39758 states and 40858 transitions. [2018-11-06 21:31:13,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-06 21:31:13,881 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 832 [2018-11-06 21:31:13,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:31:13,903 INFO L225 Difference]: With dead ends: 39758 [2018-11-06 21:31:13,903 INFO L226 Difference]: Without dead ends: 23490 [2018-11-06 21:31:13,915 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 846 GetRequests, 835 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2018-11-06 21:31:13,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23490 states. [2018-11-06 21:31:14,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23490 to 15657. [2018-11-06 21:31:14,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15657 states. [2018-11-06 21:31:14,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15657 states to 15657 states and 16050 transitions. [2018-11-06 21:31:14,079 INFO L78 Accepts]: Start accepts. Automaton has 15657 states and 16050 transitions. Word has length 832 [2018-11-06 21:31:14,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:31:14,079 INFO L480 AbstractCegarLoop]: Abstraction has 15657 states and 16050 transitions. [2018-11-06 21:31:14,079 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-06 21:31:14,079 INFO L276 IsEmpty]: Start isEmpty. Operand 15657 states and 16050 transitions. [2018-11-06 21:31:14,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 842 [2018-11-06 21:31:14,089 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:31:14,090 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:31:14,090 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:31:14,090 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:31:14,090 INFO L82 PathProgramCache]: Analyzing trace with hash 51617314, now seen corresponding path program 1 times [2018-11-06 21:31:14,090 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:31:14,091 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:31:14,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:31:14,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:31:14,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:31:14,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:31:14,514 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 3 [2018-11-06 21:31:14,819 INFO L134 CoverageAnalysis]: Checked inductivity of 1357 backedges. 805 proven. 0 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2018-11-06 21:31:14,819 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:31:14,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:31:14,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 21:31:14,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 21:31:14,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:31:14,820 INFO L87 Difference]: Start difference. First operand 15657 states and 16050 transitions. Second operand 3 states. [2018-11-06 21:31:16,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:31:16,056 INFO L93 Difference]: Finished difference Result 32216 states and 33040 transitions. [2018-11-06 21:31:16,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 21:31:16,057 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 841 [2018-11-06 21:31:16,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:31:16,071 INFO L225 Difference]: With dead ends: 32216 [2018-11-06 21:31:16,071 INFO L226 Difference]: Without dead ends: 16861 [2018-11-06 21:31:16,079 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:31:16,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16861 states. [2018-11-06 21:31:16,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16861 to 15354. [2018-11-06 21:31:16,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15354 states. [2018-11-06 21:31:16,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15354 states to 15354 states and 15717 transitions. [2018-11-06 21:31:16,213 INFO L78 Accepts]: Start accepts. Automaton has 15354 states and 15717 transitions. Word has length 841 [2018-11-06 21:31:16,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:31:16,214 INFO L480 AbstractCegarLoop]: Abstraction has 15354 states and 15717 transitions. [2018-11-06 21:31:16,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 21:31:16,214 INFO L276 IsEmpty]: Start isEmpty. Operand 15354 states and 15717 transitions. [2018-11-06 21:31:16,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 855 [2018-11-06 21:31:16,227 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:31:16,227 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 21:31:16,228 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:31:16,228 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:31:16,228 INFO L82 PathProgramCache]: Analyzing trace with hash 1597390021, now seen corresponding path program 1 times [2018-11-06 21:31:16,228 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:31:16,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:31:16,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:31:16,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:31:16,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:31:16,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:31:18,148 INFO L134 CoverageAnalysis]: Checked inductivity of 1402 backedges. 562 proven. 399 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2018-11-06 21:31:18,148 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:31:18,148 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 21:31:18,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:31:18,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:31:18,376 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:31:19,798 INFO L134 CoverageAnalysis]: Checked inductivity of 1402 backedges. 834 proven. 188 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2018-11-06 21:31:19,819 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 21:31:19,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7] total 10 [2018-11-06 21:31:19,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-06 21:31:19,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-06 21:31:19,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-11-06 21:31:19,821 INFO L87 Difference]: Start difference. First operand 15354 states and 15717 transitions. Second operand 10 states. [2018-11-06 21:31:34,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:31:34,801 INFO L93 Difference]: Finished difference Result 41245 states and 42245 transitions. [2018-11-06 21:31:34,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-06 21:31:34,801 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 854 [2018-11-06 21:31:34,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:31:34,824 INFO L225 Difference]: With dead ends: 41245 [2018-11-06 21:31:34,824 INFO L226 Difference]: Without dead ends: 25886 [2018-11-06 21:31:34,833 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 903 GetRequests, 872 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=223, Invalid=833, Unknown=0, NotChecked=0, Total=1056 [2018-11-06 21:31:34,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25886 states. [2018-11-06 21:31:34,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25886 to 15350. [2018-11-06 21:31:34,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15350 states. [2018-11-06 21:31:35,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15350 states to 15350 states and 15632 transitions. [2018-11-06 21:31:35,010 INFO L78 Accepts]: Start accepts. Automaton has 15350 states and 15632 transitions. Word has length 854 [2018-11-06 21:31:35,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:31:35,010 INFO L480 AbstractCegarLoop]: Abstraction has 15350 states and 15632 transitions. [2018-11-06 21:31:35,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-06 21:31:35,011 INFO L276 IsEmpty]: Start isEmpty. Operand 15350 states and 15632 transitions. [2018-11-06 21:31:35,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 912 [2018-11-06 21:31:35,024 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:31:35,025 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-11-06 21:31:35,025 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:31:35,025 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:31:35,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1666864483, now seen corresponding path program 1 times [2018-11-06 21:31:35,026 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:31:35,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:31:35,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:31:35,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:31:35,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:31:35,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:31:35,988 INFO L134 CoverageAnalysis]: Checked inductivity of 1468 backedges. 1141 proven. 80 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2018-11-06 21:31:35,988 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:31:35,988 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 21:31:35,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:31:36,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:31:36,223 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:31:37,502 INFO L134 CoverageAnalysis]: Checked inductivity of 1468 backedges. 1141 proven. 77 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2018-11-06 21:31:37,522 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 21:31:37,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4] total 11 [2018-11-06 21:31:37,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-06 21:31:37,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-06 21:31:37,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2018-11-06 21:31:37,524 INFO L87 Difference]: Start difference. First operand 15350 states and 15632 transitions. Second operand 11 states. [2018-11-06 21:31:46,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:31:46,809 INFO L93 Difference]: Finished difference Result 31607 states and 32193 transitions. [2018-11-06 21:31:46,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-06 21:31:46,810 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 911 [2018-11-06 21:31:46,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:31:46,826 INFO L225 Difference]: With dead ends: 31607 [2018-11-06 21:31:46,826 INFO L226 Difference]: Without dead ends: 18059 [2018-11-06 21:31:46,835 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 936 GetRequests, 916 SyntacticMatches, 6 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2018-11-06 21:31:46,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18059 states. [2018-11-06 21:31:46,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18059 to 15650. [2018-11-06 21:31:46,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15650 states. [2018-11-06 21:31:46,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15650 states to 15650 states and 15900 transitions. [2018-11-06 21:31:46,989 INFO L78 Accepts]: Start accepts. Automaton has 15650 states and 15900 transitions. Word has length 911 [2018-11-06 21:31:46,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:31:46,990 INFO L480 AbstractCegarLoop]: Abstraction has 15650 states and 15900 transitions. [2018-11-06 21:31:46,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-06 21:31:46,990 INFO L276 IsEmpty]: Start isEmpty. Operand 15650 states and 15900 transitions. [2018-11-06 21:31:47,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 918 [2018-11-06 21:31:47,001 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:31:47,002 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 21:31:47,002 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:31:47,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:31:47,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1766446063, now seen corresponding path program 1 times [2018-11-06 21:31:47,003 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:31:47,003 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:31:47,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:31:47,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:31:47,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:31:47,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:31:47,715 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-06 21:31:47,913 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-11-06 21:31:48,361 WARN L179 SmtUtils]: Spent 412.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 23 [2018-11-06 21:31:50,543 INFO L134 CoverageAnalysis]: Checked inductivity of 1484 backedges. 999 proven. 135 refuted. 0 times theorem prover too weak. 350 trivial. 0 not checked. [2018-11-06 21:31:50,544 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:31:50,544 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 21:31:50,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:31:50,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:31:50,779 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:31:54,198 INFO L134 CoverageAnalysis]: Checked inductivity of 1484 backedges. 927 proven. 207 refuted. 0 times theorem prover too weak. 350 trivial. 0 not checked. [2018-11-06 21:31:54,218 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 21:31:54,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 6] total 18 [2018-11-06 21:31:54,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-06 21:31:54,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-06 21:31:54,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=233, Unknown=1, NotChecked=0, Total=306 [2018-11-06 21:31:54,220 INFO L87 Difference]: Start difference. First operand 15650 states and 15900 transitions. Second operand 18 states. Received shutdown request... [2018-11-06 21:33:13,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-06 21:33:13,605 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-06 21:33:13,612 WARN L205 ceAbstractionStarter]: Timeout [2018-11-06 21:33:13,612 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 09:33:13 BoogieIcfgContainer [2018-11-06 21:33:13,612 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-06 21:33:13,613 INFO L168 Benchmark]: Toolchain (without parser) took 234390.97 ms. Allocated memory was 1.5 GB in the beginning and 4.1 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 3.5 GB in the end (delta: -2.1 GB). Peak memory consumption was 491.0 MB. Max. memory is 7.1 GB. [2018-11-06 21:33:13,614 INFO L168 Benchmark]: CDTParser took 0.27 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-11-06 21:33:13,615 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1418.17 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 105.7 MB). Peak memory consumption was 105.7 MB. Max. memory is 7.1 GB. [2018-11-06 21:33:13,615 INFO L168 Benchmark]: Boogie Procedure Inliner took 363.05 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 739.8 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -856.2 MB). Peak memory consumption was 31.3 MB. Max. memory is 7.1 GB. [2018-11-06 21:33:13,616 INFO L168 Benchmark]: Boogie Preprocessor took 229.77 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 41.0 MB). Peak memory consumption was 41.0 MB. Max. memory is 7.1 GB. [2018-11-06 21:33:13,617 INFO L168 Benchmark]: RCFGBuilder took 6898.35 ms. Allocated memory is still 2.3 GB. Free memory was 2.1 GB in the beginning and 1.8 GB in the end (delta: 301.1 MB). Peak memory consumption was 301.1 MB. Max. memory is 7.1 GB. [2018-11-06 21:33:13,618 INFO L168 Benchmark]: TraceAbstraction took 225476.06 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.9 GB). Free memory was 1.8 GB in the beginning and 3.5 GB in the end (delta: -1.7 GB). Peak memory consumption was 159.6 MB. Max. memory is 7.1 GB. [2018-11-06 21:33:13,625 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.27 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 1418.17 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 105.7 MB). Peak memory consumption was 105.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 363.05 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 739.8 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -856.2 MB). Peak memory consumption was 31.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 229.77 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 41.0 MB). Peak memory consumption was 41.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 6898.35 ms. Allocated memory is still 2.3 GB. Free memory was 2.1 GB in the beginning and 1.8 GB in the end (delta: 301.1 MB). Peak memory consumption was 301.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 225476.06 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.9 GB). Free memory was 1.8 GB in the beginning and 3.5 GB in the end (delta: -1.7 GB). Peak memory consumption was 159.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 193]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 193). Cancelled while BasicCegarLoop was constructing difference of abstraction (15650states) and FLOYD_HOARE automaton (currently 29 states, 18 states before enhancement),while ReachableStatesComputation was computing reachable states (4030 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 425 locations, 1 error locations. TIMEOUT Result, 225.4s OverallTime, 20 OverallIterations, 6 TraceHistogramMax, 190.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5841 SDtfs, 29457 SDslu, 3345 SDs, 0 SdLazy, 70396 SolverSat, 6866 SolverUnsat, 38 SolverUnknown, 0 SolverNotchecked, 170.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5021 GetRequests, 4861 SyntacticMatches, 21 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 791 ImplicationChecksByTransitivity, 11.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31044occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 3.2s AutomataMinimizationTime, 19 MinimizatonAttempts, 41188 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 2.0s SatisfiabilityAnalysisTime, 19.7s InterpolantComputationTime, 16161 NumberOfCodeBlocks, 16161 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 16134 ConstructedInterpolants, 638 QuantifiedInterpolants, 46180833 SizeOfPredicates, 13 NumberOfNonLiveVariables, 5683 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 27 InterpolantComputations, 16 PerfectInterpolantSequences, 19614/20954 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown