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/Problem12_label48_false-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-06 19:07:26,046 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-06 19:07:26,048 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-06 19:07:26,066 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-06 19:07:26,066 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-06 19:07:26,068 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-06 19:07:26,069 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-06 19:07:26,073 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-06 19:07:26,075 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-06 19:07:26,076 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-06 19:07:26,077 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-06 19:07:26,077 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-06 19:07:26,078 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-06 19:07:26,079 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-06 19:07:26,080 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-06 19:07:26,081 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-06 19:07:26,082 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-06 19:07:26,084 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-06 19:07:26,086 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-06 19:07:26,088 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-06 19:07:26,089 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-06 19:07:26,090 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-06 19:07:26,092 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-06 19:07:26,093 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-06 19:07:26,093 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-06 19:07:26,094 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-06 19:07:26,095 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-06 19:07:26,096 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-06 19:07:26,097 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-06 19:07:26,098 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-06 19:07:26,098 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-06 19:07:26,099 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-06 19:07:26,099 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-06 19:07:26,099 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-06 19:07:26,100 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-06 19:07:26,101 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-06 19:07:26,101 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 19:07:26,125 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-06 19:07:26,125 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-06 19:07:26,126 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-06 19:07:26,126 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-06 19:07:26,129 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-06 19:07:26,129 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-06 19:07:26,130 INFO L133 SettingsManager]: * Use SBE=true [2018-11-06 19:07:26,130 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-06 19:07:26,130 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-06 19:07:26,130 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-06 19:07:26,131 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-06 19:07:26,131 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-06 19:07:26,131 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-06 19:07:26,131 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-06 19:07:26,131 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-06 19:07:26,132 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-06 19:07:26,133 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-06 19:07:26,133 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-06 19:07:26,133 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-06 19:07:26,133 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 19:07:26,133 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-06 19:07:26,134 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-06 19:07:26,134 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-06 19:07:26,134 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-06 19:07:26,134 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-06 19:07:26,135 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-06 19:07:26,135 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-06 19:07:26,135 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-06 19:07:26,198 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-06 19:07:26,212 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-06 19:07:26,217 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-06 19:07:26,219 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-06 19:07:26,219 INFO L276 PluginConnector]: CDTParser initialized [2018-11-06 19:07:26,220 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem12_label48_false-unreach-call.c [2018-11-06 19:07:26,289 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c0401087/e18d6fd717b745c59e82137fa447473f/FLAG18ebfd231 [2018-11-06 19:07:27,029 INFO L298 CDTParser]: Found 1 translation units. [2018-11-06 19:07:27,030 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem12_label48_false-unreach-call.c [2018-11-06 19:07:27,065 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c0401087/e18d6fd717b745c59e82137fa447473f/FLAG18ebfd231 [2018-11-06 19:07:27,082 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c0401087/e18d6fd717b745c59e82137fa447473f [2018-11-06 19:07:27,094 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-06 19:07:27,096 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-06 19:07:27,097 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-06 19:07:27,097 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-06 19:07:27,101 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-06 19:07:27,103 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:07:27" (1/1) ... [2018-11-06 19:07:27,106 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7293a3c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:07:27, skipping insertion in model container [2018-11-06 19:07:27,106 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:07:27" (1/1) ... [2018-11-06 19:07:27,118 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-06 19:07:27,290 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-06 19:07:28,651 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 19:07:28,656 INFO L189 MainTranslator]: Completed pre-run [2018-11-06 19:07:29,175 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 19:07:29,209 INFO L193 MainTranslator]: Completed translation [2018-11-06 19:07:29,209 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:07:29 WrapperNode [2018-11-06 19:07:29,210 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-06 19:07:29,211 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-06 19:07:29,211 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-06 19:07:29,211 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-06 19:07:29,222 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:07:29" (1/1) ... [2018-11-06 19:07:29,556 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:07:29" (1/1) ... [2018-11-06 19:07:29,827 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-06 19:07:29,828 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-06 19:07:29,828 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-06 19:07:29,828 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-06 19:07:29,839 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:07:29" (1/1) ... [2018-11-06 19:07:29,840 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:07:29" (1/1) ... [2018-11-06 19:07:29,883 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:07:29" (1/1) ... [2018-11-06 19:07:29,883 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:07:29" (1/1) ... [2018-11-06 19:07:29,979 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:07:29" (1/1) ... [2018-11-06 19:07:30,012 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:07:29" (1/1) ... [2018-11-06 19:07:30,052 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:07:29" (1/1) ... [2018-11-06 19:07:30,096 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-06 19:07:30,097 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-06 19:07:30,097 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-06 19:07:30,097 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-06 19:07:30,098 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:07:29" (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 19:07:30,171 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-06 19:07:30,171 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-06 19:07:30,171 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-06 19:07:39,165 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-06 19:07:39,166 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:07:39 BoogieIcfgContainer [2018-11-06 19:07:39,166 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-06 19:07:39,167 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-06 19:07:39,167 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-06 19:07:39,171 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-06 19:07:39,171 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 07:07:27" (1/3) ... [2018-11-06 19:07:39,172 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@356a1b22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:07:39, skipping insertion in model container [2018-11-06 19:07:39,172 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:07:29" (2/3) ... [2018-11-06 19:07:39,172 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@356a1b22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:07:39, skipping insertion in model container [2018-11-06 19:07:39,173 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:07:39" (3/3) ... [2018-11-06 19:07:39,175 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem12_label48_false-unreach-call.c [2018-11-06 19:07:39,186 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-06 19:07:39,196 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-06 19:07:39,214 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-06 19:07:39,258 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-06 19:07:39,259 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-06 19:07:39,259 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-06 19:07:39,259 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-06 19:07:39,259 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-06 19:07:39,259 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-06 19:07:39,260 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-06 19:07:39,260 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-06 19:07:39,260 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-06 19:07:39,294 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states. [2018-11-06 19:07:39,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-06 19:07:39,301 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:07:39,302 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:07:39,305 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:07:39,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:07:39,312 INFO L82 PathProgramCache]: Analyzing trace with hash -159296518, now seen corresponding path program 1 times [2018-11-06 19:07:39,314 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:07:39,315 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:07:39,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:07:39,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:07:39,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:07:39,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:07:39,665 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 19:07:39,668 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:07:39,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:07:39,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:07:39,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:07:39,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:07:39,689 INFO L87 Difference]: Start difference. First operand 819 states. Second operand 4 states. [2018-11-06 19:07:52,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:07:52,005 INFO L93 Difference]: Finished difference Result 3146 states and 6134 transitions. [2018-11-06 19:07:52,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:07:52,008 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-11-06 19:07:52,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:07:52,052 INFO L225 Difference]: With dead ends: 3146 [2018-11-06 19:07:52,053 INFO L226 Difference]: Without dead ends: 2320 [2018-11-06 19:07:52,061 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 19:07:52,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2320 states. [2018-11-06 19:07:52,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2320 to 2320. [2018-11-06 19:07:52,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2320 states. [2018-11-06 19:07:52,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2320 states to 2320 states and 3906 transitions. [2018-11-06 19:07:52,227 INFO L78 Accepts]: Start accepts. Automaton has 2320 states and 3906 transitions. Word has length 11 [2018-11-06 19:07:52,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:07:52,227 INFO L480 AbstractCegarLoop]: Abstraction has 2320 states and 3906 transitions. [2018-11-06 19:07:52,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:07:52,229 INFO L276 IsEmpty]: Start isEmpty. Operand 2320 states and 3906 transitions. [2018-11-06 19:07:52,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-06 19:07:52,235 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:07:52,237 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-06 19:07:52,237 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:07:52,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:07:52,237 INFO L82 PathProgramCache]: Analyzing trace with hash 138820631, now seen corresponding path program 1 times [2018-11-06 19:07:52,237 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:07:52,238 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:07:52,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:07:52,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:07:52,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:07:52,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:07:52,615 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:07:52,615 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:07:52,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:07:52,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:07:52,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:07:52,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:07:52,618 INFO L87 Difference]: Start difference. First operand 2320 states and 3906 transitions. Second operand 4 states. [2018-11-06 19:08:04,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:08:04,390 INFO L93 Difference]: Finished difference Result 9150 states and 15496 transitions. [2018-11-06 19:08:04,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:08:04,390 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 86 [2018-11-06 19:08:04,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:08:04,428 INFO L225 Difference]: With dead ends: 9150 [2018-11-06 19:08:04,428 INFO L226 Difference]: Without dead ends: 6832 [2018-11-06 19:08:04,433 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:08:04,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6832 states. [2018-11-06 19:08:04,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6832 to 6832. [2018-11-06 19:08:04,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6832 states. [2018-11-06 19:08:04,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6832 states to 6832 states and 9984 transitions. [2018-11-06 19:08:04,571 INFO L78 Accepts]: Start accepts. Automaton has 6832 states and 9984 transitions. Word has length 86 [2018-11-06 19:08:04,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:08:04,572 INFO L480 AbstractCegarLoop]: Abstraction has 6832 states and 9984 transitions. [2018-11-06 19:08:04,572 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:08:04,572 INFO L276 IsEmpty]: Start isEmpty. Operand 6832 states and 9984 transitions. [2018-11-06 19:08:04,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-11-06 19:08:04,577 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:08:04,577 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-06 19:08:04,577 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:08:04,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:08:04,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1232946128, now seen corresponding path program 1 times [2018-11-06 19:08:04,578 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:08:04,578 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:08:04,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:08:04,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:08:04,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:08:04,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:08:04,898 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 5 [2018-11-06 19:08:04,923 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:08:04,923 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:08:04,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:08:04,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:08:04,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:08:04,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:08:04,925 INFO L87 Difference]: Start difference. First operand 6832 states and 9984 transitions. Second operand 4 states. [2018-11-06 19:08:13,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:08:13,824 INFO L93 Difference]: Finished difference Result 27215 states and 39824 transitions. [2018-11-06 19:08:13,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:08:13,825 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2018-11-06 19:08:13,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:08:13,908 INFO L225 Difference]: With dead ends: 27215 [2018-11-06 19:08:13,908 INFO L226 Difference]: Without dead ends: 20385 [2018-11-06 19:08:13,920 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:08:13,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20385 states. [2018-11-06 19:08:14,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20385 to 13600. [2018-11-06 19:08:14,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13600 states. [2018-11-06 19:08:14,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13600 states to 13600 states and 17820 transitions. [2018-11-06 19:08:14,228 INFO L78 Accepts]: Start accepts. Automaton has 13600 states and 17820 transitions. Word has length 111 [2018-11-06 19:08:14,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:08:14,229 INFO L480 AbstractCegarLoop]: Abstraction has 13600 states and 17820 transitions. [2018-11-06 19:08:14,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:08:14,229 INFO L276 IsEmpty]: Start isEmpty. Operand 13600 states and 17820 transitions. [2018-11-06 19:08:14,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-11-06 19:08:14,235 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:08:14,235 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:08:14,235 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:08:14,236 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:08:14,236 INFO L82 PathProgramCache]: Analyzing trace with hash 873723500, now seen corresponding path program 1 times [2018-11-06 19:08:14,236 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:08:14,236 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:08:14,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:08:14,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:08:14,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:08:14,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:08:14,809 WARN L179 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 9 [2018-11-06 19:08:15,078 WARN L179 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 9 [2018-11-06 19:08:15,176 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 83 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:08:15,176 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 19:08:15,176 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 19:08:15,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:08:15,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:08:15,269 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 19:08:15,436 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:08:15,470 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 19:08:15,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2018-11-06 19:08:15,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-06 19:08:15,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-06 19:08:15,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-06 19:08:15,475 INFO L87 Difference]: Start difference. First operand 13600 states and 17820 transitions. Second operand 7 states. [2018-11-06 19:08:16,244 WARN L179 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 18 [2018-11-06 19:08:34,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:08:34,629 INFO L93 Difference]: Finished difference Result 58064 states and 73551 transitions. [2018-11-06 19:08:34,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-06 19:08:34,630 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 160 [2018-11-06 19:08:34,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:08:34,707 INFO L225 Difference]: With dead ends: 58064 [2018-11-06 19:08:34,707 INFO L226 Difference]: Without dead ends: 42207 [2018-11-06 19:08:34,729 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 161 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2018-11-06 19:08:34,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42207 states. [2018-11-06 19:08:35,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42207 to 27887. [2018-11-06 19:08:35,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27887 states. [2018-11-06 19:08:35,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27887 states to 27887 states and 33240 transitions. [2018-11-06 19:08:35,358 INFO L78 Accepts]: Start accepts. Automaton has 27887 states and 33240 transitions. Word has length 160 [2018-11-06 19:08:35,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:08:35,358 INFO L480 AbstractCegarLoop]: Abstraction has 27887 states and 33240 transitions. [2018-11-06 19:08:35,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-06 19:08:35,358 INFO L276 IsEmpty]: Start isEmpty. Operand 27887 states and 33240 transitions. [2018-11-06 19:08:35,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-11-06 19:08:35,370 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:08:35,371 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:08:35,371 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:08:35,371 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:08:35,372 INFO L82 PathProgramCache]: Analyzing trace with hash 210682417, now seen corresponding path program 1 times [2018-11-06 19:08:35,373 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:08:35,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:08:35,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:08:35,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:08:35,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:08:35,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:08:35,736 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-11-06 19:08:35,737 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:08:35,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:08:35,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:08:35,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:08:35,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:08:35,738 INFO L87 Difference]: Start difference. First operand 27887 states and 33240 transitions. Second operand 4 states. [2018-11-06 19:08:44,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:08:44,332 INFO L93 Difference]: Finished difference Result 61788 states and 73692 transitions. [2018-11-06 19:08:44,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:08:44,339 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 226 [2018-11-06 19:08:44,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:08:44,397 INFO L225 Difference]: With dead ends: 61788 [2018-11-06 19:08:44,397 INFO L226 Difference]: Without dead ends: 28604 [2018-11-06 19:08:44,429 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:08:44,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28604 states. [2018-11-06 19:08:44,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28604 to 28604. [2018-11-06 19:08:44,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28604 states. [2018-11-06 19:08:44,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28604 states to 28604 states and 31900 transitions. [2018-11-06 19:08:44,758 INFO L78 Accepts]: Start accepts. Automaton has 28604 states and 31900 transitions. Word has length 226 [2018-11-06 19:08:44,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:08:44,760 INFO L480 AbstractCegarLoop]: Abstraction has 28604 states and 31900 transitions. [2018-11-06 19:08:44,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:08:44,760 INFO L276 IsEmpty]: Start isEmpty. Operand 28604 states and 31900 transitions. [2018-11-06 19:08:44,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2018-11-06 19:08:44,765 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:08:44,766 INFO L375 BasicCegarLoop]: trace histogram [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, 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] [2018-11-06 19:08:44,766 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:08:44,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:08:44,767 INFO L82 PathProgramCache]: Analyzing trace with hash -1535610863, now seen corresponding path program 1 times [2018-11-06 19:08:44,767 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:08:44,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:08:44,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:08:44,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:08:44,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:08:44,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:08:45,167 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-11-06 19:08:45,871 WARN L179 SmtUtils]: Spent 655.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 23 [2018-11-06 19:08:45,984 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 23 [2018-11-06 19:08:46,157 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2018-11-06 19:08:46,158 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:08:46,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-06 19:08:46,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-06 19:08:46,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-06 19:08:46,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-11-06 19:08:46,159 INFO L87 Difference]: Start difference. First operand 28604 states and 31900 transitions. Second operand 6 states. [2018-11-06 19:08:54,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:08:54,919 INFO L93 Difference]: Finished difference Result 69992 states and 78115 transitions. [2018-11-06 19:08:54,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 19:08:54,925 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 295 [2018-11-06 19:08:54,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:08:54,996 INFO L225 Difference]: With dead ends: 69992 [2018-11-06 19:08:54,997 INFO L226 Difference]: Without dead ends: 41390 [2018-11-06 19:08:55,022 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-11-06 19:08:55,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41390 states. [2018-11-06 19:08:55,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41390 to 40636. [2018-11-06 19:08:55,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40636 states. [2018-11-06 19:08:55,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40636 states to 40636 states and 44680 transitions. [2018-11-06 19:08:55,459 INFO L78 Accepts]: Start accepts. Automaton has 40636 states and 44680 transitions. Word has length 295 [2018-11-06 19:08:55,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:08:55,459 INFO L480 AbstractCegarLoop]: Abstraction has 40636 states and 44680 transitions. [2018-11-06 19:08:55,459 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-06 19:08:55,460 INFO L276 IsEmpty]: Start isEmpty. Operand 40636 states and 44680 transitions. [2018-11-06 19:08:55,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2018-11-06 19:08:55,470 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:08:55,471 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:08:55,471 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:08:55,471 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:08:55,471 INFO L82 PathProgramCache]: Analyzing trace with hash -356496373, now seen corresponding path program 1 times [2018-11-06 19:08:55,472 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:08:55,472 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:08:55,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:08:55,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:08:55,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:08:55,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:08:55,915 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 378 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2018-11-06 19:08:55,916 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:08:55,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:08:55,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:08:55,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:08:55,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:08:55,917 INFO L87 Difference]: Start difference. First operand 40636 states and 44680 transitions. Second operand 4 states. [2018-11-06 19:09:02,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:09:02,952 INFO L93 Difference]: Finished difference Result 139926 states and 154516 transitions. [2018-11-06 19:09:02,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:09:02,955 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 378 [2018-11-06 19:09:02,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:09:03,102 INFO L225 Difference]: With dead ends: 139926 [2018-11-06 19:09:03,103 INFO L226 Difference]: Without dead ends: 100044 [2018-11-06 19:09:03,142 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:09:03,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100044 states. [2018-11-06 19:09:04,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100044 to 91772. [2018-11-06 19:09:04,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91772 states. [2018-11-06 19:09:04,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91772 states to 91772 states and 100596 transitions. [2018-11-06 19:09:04,114 INFO L78 Accepts]: Start accepts. Automaton has 91772 states and 100596 transitions. Word has length 378 [2018-11-06 19:09:04,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:09:04,114 INFO L480 AbstractCegarLoop]: Abstraction has 91772 states and 100596 transitions. [2018-11-06 19:09:04,114 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:09:04,114 INFO L276 IsEmpty]: Start isEmpty. Operand 91772 states and 100596 transitions. [2018-11-06 19:09:04,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2018-11-06 19:09:04,125 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:09:04,125 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:09:04,125 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:09:04,125 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:09:04,126 INFO L82 PathProgramCache]: Analyzing trace with hash -1212554303, now seen corresponding path program 1 times [2018-11-06 19:09:04,126 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:09:04,126 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:09:04,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:09:04,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:09:04,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:09:04,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:09:04,460 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 371 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-11-06 19:09:04,460 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:09:04,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:09:04,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:09:04,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:09:04,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:09:04,462 INFO L87 Difference]: Start difference. First operand 91772 states and 100596 transitions. Second operand 3 states. [2018-11-06 19:09:08,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:09:08,531 INFO L93 Difference]: Finished difference Result 183542 states and 201190 transitions. [2018-11-06 19:09:08,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:09:08,531 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 382 [2018-11-06 19:09:08,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:09:09,214 INFO L225 Difference]: With dead ends: 183542 [2018-11-06 19:09:09,214 INFO L226 Difference]: Without dead ends: 91772 [2018-11-06 19:09:09,266 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:09:09,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91772 states. [2018-11-06 19:09:09,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91772 to 89516. [2018-11-06 19:09:09,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89516 states. [2018-11-06 19:09:09,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89516 states to 89516 states and 95298 transitions. [2018-11-06 19:09:09,989 INFO L78 Accepts]: Start accepts. Automaton has 89516 states and 95298 transitions. Word has length 382 [2018-11-06 19:09:09,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:09:09,990 INFO L480 AbstractCegarLoop]: Abstraction has 89516 states and 95298 transitions. [2018-11-06 19:09:09,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:09:09,990 INFO L276 IsEmpty]: Start isEmpty. Operand 89516 states and 95298 transitions. [2018-11-06 19:09:09,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2018-11-06 19:09:09,997 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:09:09,997 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:09:09,997 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:09:09,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:09:09,998 INFO L82 PathProgramCache]: Analyzing trace with hash 1192995185, now seen corresponding path program 1 times [2018-11-06 19:09:09,998 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:09:09,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:09:09,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:09:09,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:09:09,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:09:10,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:09:10,392 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 311 proven. 69 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2018-11-06 19:09:10,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 19:09:10,392 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 19:09:10,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:09:10,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:09:10,516 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 19:09:10,802 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 311 proven. 69 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2018-11-06 19:09:10,823 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 19:09:10,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 6 [2018-11-06 19:09:10,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-06 19:09:10,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-06 19:09:10,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-06 19:09:10,825 INFO L87 Difference]: Start difference. First operand 89516 states and 95298 transitions. Second operand 6 states. [2018-11-06 19:09:23,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:09:23,704 INFO L93 Difference]: Finished difference Result 197078 states and 210053 transitions. [2018-11-06 19:09:23,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 19:09:23,704 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 414 [2018-11-06 19:09:23,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:09:23,835 INFO L225 Difference]: With dead ends: 197078 [2018-11-06 19:09:23,836 INFO L226 Difference]: Without dead ends: 107564 [2018-11-06 19:09:23,889 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 418 GetRequests, 413 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-06 19:09:23,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107564 states. [2018-11-06 19:09:24,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107564 to 104556. [2018-11-06 19:09:24,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104556 states. [2018-11-06 19:09:24,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104556 states to 104556 states and 110155 transitions. [2018-11-06 19:09:24,846 INFO L78 Accepts]: Start accepts. Automaton has 104556 states and 110155 transitions. Word has length 414 [2018-11-06 19:09:24,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:09:24,847 INFO L480 AbstractCegarLoop]: Abstraction has 104556 states and 110155 transitions. [2018-11-06 19:09:24,847 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-06 19:09:24,847 INFO L276 IsEmpty]: Start isEmpty. Operand 104556 states and 110155 transitions. [2018-11-06 19:09:24,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 449 [2018-11-06 19:09:24,859 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:09:24,859 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:09:24,860 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:09:24,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:09:24,860 INFO L82 PathProgramCache]: Analyzing trace with hash -1627232402, now seen corresponding path program 1 times [2018-11-06 19:09:24,860 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:09:24,860 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:09:24,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:09:24,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:09:24,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:09:24,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:09:25,351 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 444 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2018-11-06 19:09:25,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:09:25,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:09:25,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:09:25,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:09:25,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:09:25,354 INFO L87 Difference]: Start difference. First operand 104556 states and 110155 transitions. Second operand 4 states. [2018-11-06 19:09:32,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:09:32,904 INFO L93 Difference]: Finished difference Result 214374 states and 225660 transitions. [2018-11-06 19:09:32,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:09:32,905 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 448 [2018-11-06 19:09:32,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:09:33,049 INFO L225 Difference]: With dead ends: 214374 [2018-11-06 19:09:33,050 INFO L226 Difference]: Without dead ends: 109820 [2018-11-06 19:09:33,115 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:09:33,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109820 states. [2018-11-06 19:09:34,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109820 to 106812. [2018-11-06 19:09:34,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106812 states. [2018-11-06 19:09:34,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106812 states to 106812 states and 112122 transitions. [2018-11-06 19:09:34,301 INFO L78 Accepts]: Start accepts. Automaton has 106812 states and 112122 transitions. Word has length 448 [2018-11-06 19:09:34,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:09:34,302 INFO L480 AbstractCegarLoop]: Abstraction has 106812 states and 112122 transitions. [2018-11-06 19:09:34,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:09:34,302 INFO L276 IsEmpty]: Start isEmpty. Operand 106812 states and 112122 transitions. [2018-11-06 19:09:34,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2018-11-06 19:09:34,314 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:09:34,315 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:09:34,315 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:09:34,315 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:09:34,316 INFO L82 PathProgramCache]: Analyzing trace with hash 734228447, now seen corresponding path program 1 times [2018-11-06 19:09:34,316 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:09:34,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:09:34,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:09:34,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:09:34,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:09:34,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:09:34,743 INFO L134 CoverageAnalysis]: Checked inductivity of 550 backedges. 455 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2018-11-06 19:09:34,743 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:09:34,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:09:34,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:09:34,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:09:34,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:09:34,744 INFO L87 Difference]: Start difference. First operand 106812 states and 112122 transitions. Second operand 3 states. [2018-11-06 19:09:41,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:09:41,305 INFO L93 Difference]: Finished difference Result 224902 states and 236713 transitions. [2018-11-06 19:09:41,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:09:41,305 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 459 [2018-11-06 19:09:41,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:09:41,434 INFO L225 Difference]: With dead ends: 224902 [2018-11-06 19:09:41,434 INFO L226 Difference]: Without dead ends: 118092 [2018-11-06 19:09:41,494 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 19:09:41,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118092 states. [2018-11-06 19:09:42,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118092 to 116588. [2018-11-06 19:09:42,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116588 states. [2018-11-06 19:09:42,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116588 states to 116588 states and 122638 transitions. [2018-11-06 19:09:42,597 INFO L78 Accepts]: Start accepts. Automaton has 116588 states and 122638 transitions. Word has length 459 [2018-11-06 19:09:42,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:09:42,598 INFO L480 AbstractCegarLoop]: Abstraction has 116588 states and 122638 transitions. [2018-11-06 19:09:42,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:09:42,598 INFO L276 IsEmpty]: Start isEmpty. Operand 116588 states and 122638 transitions. [2018-11-06 19:09:42,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 468 [2018-11-06 19:09:42,608 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:09:42,609 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:09:42,609 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:09:42,609 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:09:42,610 INFO L82 PathProgramCache]: Analyzing trace with hash 1784193791, now seen corresponding path program 1 times [2018-11-06 19:09:42,610 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:09:42,610 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:09:42,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:09:42,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:09:42,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:09:42,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:09:43,036 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 472 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-11-06 19:09:43,037 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:09:43,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:09:43,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:09:43,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:09:43,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:09:43,038 INFO L87 Difference]: Start difference. First operand 116588 states and 122638 transitions. Second operand 4 states. [2018-11-06 19:09:49,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:09:49,250 INFO L93 Difference]: Finished difference Result 230917 states and 242967 transitions. [2018-11-06 19:09:49,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:09:49,250 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 467 [2018-11-06 19:09:49,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:09:49,392 INFO L225 Difference]: With dead ends: 230917 [2018-11-06 19:09:49,392 INFO L226 Difference]: Without dead ends: 108303 [2018-11-06 19:09:49,463 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:09:49,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108303 states. [2018-11-06 19:09:50,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108303 to 105295. [2018-11-06 19:09:50,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105295 states. [2018-11-06 19:09:50,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105295 states to 105295 states and 108959 transitions. [2018-11-06 19:09:50,438 INFO L78 Accepts]: Start accepts. Automaton has 105295 states and 108959 transitions. Word has length 467 [2018-11-06 19:09:50,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:09:50,439 INFO L480 AbstractCegarLoop]: Abstraction has 105295 states and 108959 transitions. [2018-11-06 19:09:50,439 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:09:50,439 INFO L276 IsEmpty]: Start isEmpty. Operand 105295 states and 108959 transitions. [2018-11-06 19:09:50,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 525 [2018-11-06 19:09:50,449 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:09:50,449 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2018-11-06 19:09:50,449 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:09:50,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:09:50,450 INFO L82 PathProgramCache]: Analyzing trace with hash -2037490819, now seen corresponding path program 1 times [2018-11-06 19:09:50,450 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:09:50,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:09:50,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:09:50,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:09:50,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:09:50,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:09:51,181 INFO L134 CoverageAnalysis]: Checked inductivity of 876 backedges. 537 proven. 86 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2018-11-06 19:09:51,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 19:09:51,181 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 19:09:51,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:09:51,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:09:51,319 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 19:09:52,787 INFO L134 CoverageAnalysis]: Checked inductivity of 876 backedges. 537 proven. 86 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2018-11-06 19:09:52,817 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 19:09:52,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 6 [2018-11-06 19:09:52,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-06 19:09:52,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-06 19:09:52,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-06 19:09:52,820 INFO L87 Difference]: Start difference. First operand 105295 states and 108959 transitions. Second operand 7 states. [2018-11-06 19:10:10,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:10:10,019 INFO L93 Difference]: Finished difference Result 289556 states and 299427 transitions. [2018-11-06 19:10:10,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-06 19:10:10,020 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 524 [2018-11-06 19:10:10,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:10:10,212 INFO L225 Difference]: With dead ends: 289556 [2018-11-06 19:10:10,212 INFO L226 Difference]: Without dead ends: 185015 [2018-11-06 19:10:10,268 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 528 GetRequests, 522 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-06 19:10:10,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185015 states. [2018-11-06 19:10:11,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185015 to 146657. [2018-11-06 19:10:11,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146657 states. [2018-11-06 19:10:11,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146657 states to 146657 states and 150833 transitions. [2018-11-06 19:10:11,787 INFO L78 Accepts]: Start accepts. Automaton has 146657 states and 150833 transitions. Word has length 524 [2018-11-06 19:10:11,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:10:11,787 INFO L480 AbstractCegarLoop]: Abstraction has 146657 states and 150833 transitions. [2018-11-06 19:10:11,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-06 19:10:11,787 INFO L276 IsEmpty]: Start isEmpty. Operand 146657 states and 150833 transitions. [2018-11-06 19:10:11,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 546 [2018-11-06 19:10:11,796 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:10:11,797 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:10:11,797 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:10:11,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:10:11,798 INFO L82 PathProgramCache]: Analyzing trace with hash -767249028, now seen corresponding path program 1 times [2018-11-06 19:10:11,798 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:10:11,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:10:11,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:10:11,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:10:11,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:10:11,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:10:12,912 INFO L134 CoverageAnalysis]: Checked inductivity of 621 backedges. 495 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-11-06 19:10:12,912 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:10:12,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:10:12,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:10:12,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:10:12,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:10:12,914 INFO L87 Difference]: Start difference. First operand 146657 states and 150833 transitions. Second operand 4 states. [2018-11-06 19:10:19,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:10:19,160 INFO L93 Difference]: Finished difference Result 305344 states and 314249 transitions. [2018-11-06 19:10:19,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:10:19,161 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 545 [2018-11-06 19:10:19,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:10:19,385 INFO L225 Difference]: With dead ends: 305344 [2018-11-06 19:10:19,385 INFO L226 Difference]: Without dead ends: 160193 [2018-11-06 19:10:19,490 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 19:10:19,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160193 states. [2018-11-06 19:10:21,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160193 to 158689. [2018-11-06 19:10:21,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158689 states. [2018-11-06 19:10:21,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158689 states to 158689 states and 162782 transitions. [2018-11-06 19:10:21,766 INFO L78 Accepts]: Start accepts. Automaton has 158689 states and 162782 transitions. Word has length 545 [2018-11-06 19:10:21,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:10:21,767 INFO L480 AbstractCegarLoop]: Abstraction has 158689 states and 162782 transitions. [2018-11-06 19:10:21,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:10:21,767 INFO L276 IsEmpty]: Start isEmpty. Operand 158689 states and 162782 transitions. [2018-11-06 19:10:21,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 614 [2018-11-06 19:10:21,779 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:10:21,780 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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] [2018-11-06 19:10:21,780 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:10:21,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:10:21,781 INFO L82 PathProgramCache]: Analyzing trace with hash -1339496796, now seen corresponding path program 1 times [2018-11-06 19:10:21,781 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:10:21,781 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:10:21,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:10:21,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:10:21,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:10:21,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:10:22,354 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 621 proven. 0 refuted. 0 times theorem prover too weak. 309 trivial. 0 not checked. [2018-11-06 19:10:22,355 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:10:22,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:10:22,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:10:22,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:10:22,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:10:22,356 INFO L87 Difference]: Start difference. First operand 158689 states and 162782 transitions. Second operand 4 states. [2018-11-06 19:10:27,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:10:27,382 INFO L93 Difference]: Finished difference Result 324896 states and 333248 transitions. [2018-11-06 19:10:27,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:10:27,382 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 613 [2018-11-06 19:10:27,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:10:27,580 INFO L225 Difference]: With dead ends: 324896 [2018-11-06 19:10:27,580 INFO L226 Difference]: Without dead ends: 166960 [2018-11-06 19:10:27,653 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 19:10:27,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166960 states. [2018-11-06 19:10:28,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166960 to 151920. [2018-11-06 19:10:28,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151920 states. [2018-11-06 19:10:29,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151920 states to 151920 states and 155437 transitions. [2018-11-06 19:10:29,090 INFO L78 Accepts]: Start accepts. Automaton has 151920 states and 155437 transitions. Word has length 613 [2018-11-06 19:10:29,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:10:29,090 INFO L480 AbstractCegarLoop]: Abstraction has 151920 states and 155437 transitions. [2018-11-06 19:10:29,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:10:29,090 INFO L276 IsEmpty]: Start isEmpty. Operand 151920 states and 155437 transitions. [2018-11-06 19:10:29,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 655 [2018-11-06 19:10:29,107 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:10:29,108 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:10:29,108 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:10:29,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:10:29,109 INFO L82 PathProgramCache]: Analyzing trace with hash 335490844, now seen corresponding path program 1 times [2018-11-06 19:10:29,109 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:10:29,109 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:10:29,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:10:29,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:10:29,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:10:29,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:10:29,888 WARN L179 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 11 [2018-11-06 19:10:30,314 WARN L179 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 14 [2018-11-06 19:10:30,571 WARN L179 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 21 [2018-11-06 19:10:31,774 INFO L134 CoverageAnalysis]: Checked inductivity of 619 backedges. 388 proven. 144 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2018-11-06 19:10:31,775 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 19:10:31,775 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 19:10:31,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:10:31,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:10:31,952 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 19:10:32,562 WARN L179 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 17 [2018-11-06 19:10:34,016 INFO L134 CoverageAnalysis]: Checked inductivity of 619 backedges. 477 proven. 55 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2018-11-06 19:10:34,037 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 19:10:34,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 9 [2018-11-06 19:10:34,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-06 19:10:34,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-06 19:10:34,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-11-06 19:10:34,041 INFO L87 Difference]: Start difference. First operand 151920 states and 155437 transitions. Second operand 10 states. [2018-11-06 19:10:57,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:10:57,280 INFO L93 Difference]: Finished difference Result 322638 states and 330155 transitions. [2018-11-06 19:10:57,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-06 19:10:57,281 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 654 [2018-11-06 19:10:57,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:10:57,462 INFO L225 Difference]: With dead ends: 322638 [2018-11-06 19:10:57,462 INFO L226 Difference]: Without dead ends: 169211 [2018-11-06 19:10:57,519 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 667 GetRequests, 651 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2018-11-06 19:10:57,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169211 states. [2018-11-06 19:10:58,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169211 to 154923. [2018-11-06 19:10:58,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154923 states. [2018-11-06 19:10:58,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154923 states to 154923 states and 158358 transitions. [2018-11-06 19:10:58,995 INFO L78 Accepts]: Start accepts. Automaton has 154923 states and 158358 transitions. Word has length 654 [2018-11-06 19:10:58,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:10:58,996 INFO L480 AbstractCegarLoop]: Abstraction has 154923 states and 158358 transitions. [2018-11-06 19:10:58,996 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-06 19:10:58,996 INFO L276 IsEmpty]: Start isEmpty. Operand 154923 states and 158358 transitions. [2018-11-06 19:10:59,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 693 [2018-11-06 19:10:59,008 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:10:59,008 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2018-11-06 19:10:59,009 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:10:59,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:10:59,009 INFO L82 PathProgramCache]: Analyzing trace with hash 577083285, now seen corresponding path program 1 times [2018-11-06 19:10:59,009 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:10:59,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:10:59,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:10:59,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:10:59,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:10:59,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:11:00,447 INFO L134 CoverageAnalysis]: Checked inductivity of 1101 backedges. 678 proven. 0 refuted. 0 times theorem prover too weak. 423 trivial. 0 not checked. [2018-11-06 19:11:00,447 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:11:00,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:11:00,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:11:00,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:11:00,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:11:00,449 INFO L87 Difference]: Start difference. First operand 154923 states and 158358 transitions. Second operand 4 states. [2018-11-06 19:11:07,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:11:07,661 INFO L93 Difference]: Finished difference Result 306836 states and 313665 transitions. [2018-11-06 19:11:07,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:11:07,662 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 692 [2018-11-06 19:11:07,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:11:07,809 INFO L225 Difference]: With dead ends: 306836 [2018-11-06 19:11:07,809 INFO L226 Difference]: Without dead ends: 153419 [2018-11-06 19:11:07,863 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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 19:11:07,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153419 states. Received shutdown request... [2018-11-06 19:11:09,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153419 to 148907. [2018-11-06 19:11:09,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148907 states. [2018-11-06 19:11:09,090 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-06 19:11:09,095 WARN L205 ceAbstractionStarter]: Timeout [2018-11-06 19:11:09,096 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 07:11:09 BoogieIcfgContainer [2018-11-06 19:11:09,096 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-06 19:11:09,097 INFO L168 Benchmark]: Toolchain (without parser) took 222002.22 ms. Allocated memory was 1.5 GB in the beginning and 3.7 GB in the end (delta: 2.1 GB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -75.0 MB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2018-11-06 19:11:09,098 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-06 19:11:09,099 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2113.41 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 200.8 MB). Peak memory consumption was 200.8 MB. Max. memory is 7.1 GB. [2018-11-06 19:11:09,099 INFO L168 Benchmark]: Boogie Procedure Inliner took 616.75 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 798.5 MB). Free memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: -982.6 MB). Peak memory consumption was 54.5 MB. Max. memory is 7.1 GB. [2018-11-06 19:11:09,100 INFO L168 Benchmark]: Boogie Preprocessor took 269.04 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 35.5 MB). Peak memory consumption was 35.5 MB. Max. memory is 7.1 GB. [2018-11-06 19:11:09,104 INFO L168 Benchmark]: RCFGBuilder took 9069.23 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 216.5 MB). Free memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: -163.7 MB). Peak memory consumption was 624.1 MB. Max. memory is 7.1 GB. [2018-11-06 19:11:09,105 INFO L168 Benchmark]: TraceAbstraction took 209928.87 ms. Allocated memory was 2.5 GB in the beginning and 3.7 GB in the end (delta: 1.1 GB). Free memory was 2.3 GB in the beginning and 1.5 GB in the end (delta: 834.9 MB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2018-11-06 19:11:09,111 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 2113.41 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 200.8 MB). Peak memory consumption was 200.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 616.75 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 798.5 MB). Free memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: -982.6 MB). Peak memory consumption was 54.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 269.04 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 35.5 MB). Peak memory consumption was 35.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 9069.23 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 216.5 MB). Free memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: -163.7 MB). Peak memory consumption was 624.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 209928.87 ms. Allocated memory was 2.5 GB in the beginning and 3.7 GB in the end (delta: 1.1 GB). Free memory was 2.3 GB in the beginning and 1.5 GB in the end (delta: 834.9 MB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 42]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 42). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 819 locations, 1 error locations. TIMEOUT Result, 209.8s OverallTime, 17 OverallIterations, 6 TraceHistogramMax, 176.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 9980 SDtfs, 44049 SDslu, 1280 SDs, 0 SdLazy, 97261 SolverSat, 15036 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 135.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1844 GetRequests, 1770 SyntacticMatches, 16 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 6.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=158689occurred in iteration=14, 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: 15.8s AutomataMinimizationTime, 17 MinimizatonAttempts, 112105 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 11.6s InterpolantComputationTime, 8217 NumberOfCodeBlocks, 8217 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 8196 ConstructedInterpolants, 87 QuantifiedInterpolants, 15221774 SizeOfPredicates, 4 NumberOfNonLiveVariables, 2315 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 21 InterpolantComputations, 14 PerfectInterpolantSequences, 9242/9756 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown