java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem13_label28_false-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 14:09:13,141 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 14:09:13,143 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 14:09:13,158 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 14:09:13,159 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 14:09:13,160 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 14:09:13,161 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 14:09:13,163 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 14:09:13,164 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 14:09:13,165 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 14:09:13,166 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 14:09:13,167 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 14:09:13,168 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 14:09:13,170 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 14:09:13,171 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 14:09:13,172 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 14:09:13,176 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 14:09:13,178 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 14:09:13,180 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 14:09:13,185 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 14:09:13,188 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 14:09:13,192 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 14:09:13,195 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 14:09:13,195 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 14:09:13,195 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 14:09:13,196 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 14:09:13,197 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 14:09:13,198 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 14:09:13,201 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 14:09:13,203 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 14:09:13,204 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 14:09:13,204 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 14:09:13,204 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 14:09:13,205 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 14:09:13,206 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 14:09:13,206 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 14:09:13,207 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-10-24 14:09:13,221 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 14:09:13,221 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 14:09:13,222 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 14:09:13,222 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-24 14:09:13,223 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-24 14:09:13,223 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-24 14:09:13,223 INFO L133 SettingsManager]: * Use SBE=true [2018-10-24 14:09:13,224 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 14:09:13,224 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 14:09:13,224 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 14:09:13,224 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 14:09:13,224 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 14:09:13,225 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 14:09:13,225 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 14:09:13,225 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 14:09:13,225 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 14:09:13,225 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 14:09:13,226 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 14:09:13,226 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 14:09:13,226 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 14:09:13,226 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 14:09:13,226 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 14:09:13,227 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 14:09:13,228 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-24 14:09:13,228 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 14:09:13,228 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 14:09:13,228 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 14:09:13,229 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 14:09:13,281 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 14:09:13,296 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 14:09:13,299 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 14:09:13,301 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 14:09:13,301 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 14:09:13,302 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem13_label28_false-unreach-call.c [2018-10-24 14:09:13,357 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/1767c9ab7/22ab958481fc49a19f069fc7b6bb4a0a/FLAG53edc5647 [2018-10-24 14:09:14,097 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 14:09:14,098 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem13_label28_false-unreach-call.c [2018-10-24 14:09:14,138 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/1767c9ab7/22ab958481fc49a19f069fc7b6bb4a0a/FLAG53edc5647 [2018-10-24 14:09:14,154 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/1767c9ab7/22ab958481fc49a19f069fc7b6bb4a0a [2018-10-24 14:09:14,167 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 14:09:14,169 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 14:09:14,174 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 14:09:14,174 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 14:09:14,178 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 14:09:14,179 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:09:14" (1/1) ... [2018-10-24 14:09:14,182 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46764b1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:09:14, skipping insertion in model container [2018-10-24 14:09:14,182 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:09:14" (1/1) ... [2018-10-24 14:09:14,193 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 14:09:14,373 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 14:09:15,883 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 14:09:15,888 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 14:09:16,662 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 14:09:16,701 INFO L193 MainTranslator]: Completed translation [2018-10-24 14:09:16,701 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:09:16 WrapperNode [2018-10-24 14:09:16,701 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 14:09:16,702 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 14:09:16,703 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 14:09:16,706 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 14:09:16,716 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:09:16" (1/1) ... [2018-10-24 14:09:16,789 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:09:16" (1/1) ... [2018-10-24 14:09:17,530 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 14:09:17,530 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 14:09:17,531 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 14:09:17,531 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 14:09:17,541 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:09:16" (1/1) ... [2018-10-24 14:09:17,542 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:09:16" (1/1) ... [2018-10-24 14:09:17,603 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:09:16" (1/1) ... [2018-10-24 14:09:17,604 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:09:16" (1/1) ... [2018-10-24 14:09:17,844 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:09:16" (1/1) ... [2018-10-24 14:09:17,878 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:09:16" (1/1) ... [2018-10-24 14:09:18,007 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:09:16" (1/1) ... [2018-10-24 14:09:18,126 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 14:09:18,127 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 14:09:18,127 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 14:09:18,127 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 14:09:18,128 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:09:16" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 14:09:18,198 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-24 14:09:18,198 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 14:09:18,198 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 14:09:34,266 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 14:09:34,267 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:09:34 BoogieIcfgContainer [2018-10-24 14:09:34,267 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 14:09:34,268 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 14:09:34,268 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 14:09:34,271 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 14:09:34,271 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 02:09:14" (1/3) ... [2018-10-24 14:09:34,272 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53def84f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:09:34, skipping insertion in model container [2018-10-24 14:09:34,272 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:09:16" (2/3) ... [2018-10-24 14:09:34,273 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53def84f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:09:34, skipping insertion in model container [2018-10-24 14:09:34,275 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:09:34" (3/3) ... [2018-10-24 14:09:34,277 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem13_label28_false-unreach-call.c [2018-10-24 14:09:34,286 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 14:09:34,297 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 14:09:34,315 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 14:09:34,363 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-24 14:09:34,364 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 14:09:34,364 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 14:09:34,365 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 14:09:34,365 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 14:09:34,365 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 14:09:34,365 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 14:09:34,365 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 14:09:34,365 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 14:09:34,402 INFO L276 IsEmpty]: Start isEmpty. Operand 1099 states. [2018-10-24 14:09:34,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-24 14:09:34,418 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:09:34,419 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:09:34,422 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:09:34,428 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:09:34,428 INFO L82 PathProgramCache]: Analyzing trace with hash 666618706, now seen corresponding path program 1 times [2018-10-24 14:09:34,430 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:09:34,430 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:09:34,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:09:34,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:09:34,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:09:34,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:09:34,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:09:34,817 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:09:34,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:09:34,822 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:09:34,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:09:34,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:09:34,842 INFO L87 Difference]: Start difference. First operand 1099 states. Second operand 4 states. [2018-10-24 14:09:50,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:09:50,028 INFO L93 Difference]: Finished difference Result 3879 states and 7287 transitions. [2018-10-24 14:09:50,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:09:50,030 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-10-24 14:09:50,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:09:50,076 INFO L225 Difference]: With dead ends: 3879 [2018-10-24 14:09:50,076 INFO L226 Difference]: Without dead ends: 2773 [2018-10-24 14:09:50,086 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:09:50,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2773 states. [2018-10-24 14:09:50,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2773 to 2742. [2018-10-24 14:09:50,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2742 states. [2018-10-24 14:09:50,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2742 states to 2742 states and 4466 transitions. [2018-10-24 14:09:50,242 INFO L78 Accepts]: Start accepts. Automaton has 2742 states and 4466 transitions. Word has length 16 [2018-10-24 14:09:50,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:09:50,243 INFO L481 AbstractCegarLoop]: Abstraction has 2742 states and 4466 transitions. [2018-10-24 14:09:50,243 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:09:50,243 INFO L276 IsEmpty]: Start isEmpty. Operand 2742 states and 4466 transitions. [2018-10-24 14:09:50,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-10-24 14:09:50,249 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:09:50,249 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-24 14:09:50,249 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:09:50,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:09:50,250 INFO L82 PathProgramCache]: Analyzing trace with hash 1158074430, now seen corresponding path program 1 times [2018-10-24 14:09:50,250 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:09:50,250 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:09:50,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:09:50,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:09:50,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:09:50,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:09:50,729 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-24 14:09:50,729 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 14:09:50,729 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 14:09:50,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:09:50,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:09:50,811 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 14:09:50,844 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:09:50,876 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 14:09:50,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2018-10-24 14:09:50,878 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:09:50,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:09:50,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:09:50,879 INFO L87 Difference]: Start difference. First operand 2742 states and 4466 transitions. Second operand 4 states. [2018-10-24 14:10:09,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:10:09,212 INFO L93 Difference]: Finished difference Result 10279 states and 16957 transitions. [2018-10-24 14:10:09,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:10:09,213 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2018-10-24 14:10:09,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:10:09,253 INFO L225 Difference]: With dead ends: 10279 [2018-10-24 14:10:09,254 INFO L226 Difference]: Without dead ends: 7539 [2018-10-24 14:10:09,260 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:10:09,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7539 states. [2018-10-24 14:10:09,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7539 to 5128. [2018-10-24 14:10:09,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5128 states. [2018-10-24 14:10:09,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5128 states to 5128 states and 8009 transitions. [2018-10-24 14:10:09,384 INFO L78 Accepts]: Start accepts. Automaton has 5128 states and 8009 transitions. Word has length 106 [2018-10-24 14:10:09,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:10:09,385 INFO L481 AbstractCegarLoop]: Abstraction has 5128 states and 8009 transitions. [2018-10-24 14:10:09,385 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:10:09,385 INFO L276 IsEmpty]: Start isEmpty. Operand 5128 states and 8009 transitions. [2018-10-24 14:10:09,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-10-24 14:10:09,401 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:10:09,401 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:10:09,401 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:10:09,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:10:09,404 INFO L82 PathProgramCache]: Analyzing trace with hash 305775270, now seen corresponding path program 1 times [2018-10-24 14:10:09,404 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:10:09,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:10:09,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:10:09,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:10:09,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:10:09,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:10:10,145 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-10-24 14:10:10,145 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:10:10,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 14:10:10,147 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 14:10:10,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 14:10:10,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-24 14:10:10,147 INFO L87 Difference]: Start difference. First operand 5128 states and 8009 transitions. Second operand 5 states. [2018-10-24 14:10:23,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:10:23,235 INFO L93 Difference]: Finished difference Result 16563 states and 25362 transitions. [2018-10-24 14:10:23,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 14:10:23,236 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 155 [2018-10-24 14:10:23,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:10:23,287 INFO L225 Difference]: With dead ends: 16563 [2018-10-24 14:10:23,287 INFO L226 Difference]: Without dead ends: 11437 [2018-10-24 14:10:23,295 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-10-24 14:10:23,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11437 states. [2018-10-24 14:10:23,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11437 to 11436. [2018-10-24 14:10:23,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11436 states. [2018-10-24 14:10:23,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11436 states to 11436 states and 15909 transitions. [2018-10-24 14:10:23,492 INFO L78 Accepts]: Start accepts. Automaton has 11436 states and 15909 transitions. Word has length 155 [2018-10-24 14:10:23,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:10:23,493 INFO L481 AbstractCegarLoop]: Abstraction has 11436 states and 15909 transitions. [2018-10-24 14:10:23,493 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 14:10:23,493 INFO L276 IsEmpty]: Start isEmpty. Operand 11436 states and 15909 transitions. [2018-10-24 14:10:23,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-10-24 14:10:23,496 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:10:23,496 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:10:23,497 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:10:23,497 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:10:23,497 INFO L82 PathProgramCache]: Analyzing trace with hash -1703937609, now seen corresponding path program 1 times [2018-10-24 14:10:23,497 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:10:23,497 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:10:23,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:10:23,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:10:23,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:10:23,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:10:23,853 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 27 proven. 66 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-24 14:10:23,853 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 14:10:23,854 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 14:10:23,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:10:23,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:10:23,956 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 14:10:24,074 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:10:24,110 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 14:10:24,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2018-10-24 14:10:24,111 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 14:10:24,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 14:10:24,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 14:10:24,112 INFO L87 Difference]: Start difference. First operand 11436 states and 15909 transitions. Second operand 5 states. [2018-10-24 14:10:40,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:10:40,998 INFO L93 Difference]: Finished difference Result 43401 states and 61089 transitions. [2018-10-24 14:10:40,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 14:10:40,999 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 181 [2018-10-24 14:10:41,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:10:41,091 INFO L225 Difference]: With dead ends: 43401 [2018-10-24 14:10:41,091 INFO L226 Difference]: Without dead ends: 32755 [2018-10-24 14:10:41,108 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 14:10:41,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32755 states. [2018-10-24 14:10:41,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32755 to 25621. [2018-10-24 14:10:41,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25621 states. [2018-10-24 14:10:41,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25621 states to 25621 states and 33098 transitions. [2018-10-24 14:10:41,595 INFO L78 Accepts]: Start accepts. Automaton has 25621 states and 33098 transitions. Word has length 181 [2018-10-24 14:10:41,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:10:41,596 INFO L481 AbstractCegarLoop]: Abstraction has 25621 states and 33098 transitions. [2018-10-24 14:10:41,596 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 14:10:41,596 INFO L276 IsEmpty]: Start isEmpty. Operand 25621 states and 33098 transitions. [2018-10-24 14:10:41,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-10-24 14:10:41,599 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:10:41,599 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:10:41,599 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:10:41,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:10:41,600 INFO L82 PathProgramCache]: Analyzing trace with hash -472738906, now seen corresponding path program 1 times [2018-10-24 14:10:41,600 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:10:41,600 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:10:41,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:10:41,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:10:41,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:10:41,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:10:41,812 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-10-24 14:10:41,812 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:10:41,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:10:41,813 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:10:41,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:10:41,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:10:41,814 INFO L87 Difference]: Start difference. First operand 25621 states and 33098 transitions. Second operand 3 states. [2018-10-24 14:10:50,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:10:50,753 INFO L93 Difference]: Finished difference Result 73301 states and 95285 transitions. [2018-10-24 14:10:50,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:10:50,754 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 192 [2018-10-24 14:10:50,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:10:50,849 INFO L225 Difference]: With dead ends: 73301 [2018-10-24 14:10:50,850 INFO L226 Difference]: Without dead ends: 48470 [2018-10-24 14:10:50,877 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:10:50,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48470 states. [2018-10-24 14:10:51,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48470 to 48469. [2018-10-24 14:10:51,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48469 states. [2018-10-24 14:10:51,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48469 states to 48469 states and 58804 transitions. [2018-10-24 14:10:51,473 INFO L78 Accepts]: Start accepts. Automaton has 48469 states and 58804 transitions. Word has length 192 [2018-10-24 14:10:51,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:10:51,474 INFO L481 AbstractCegarLoop]: Abstraction has 48469 states and 58804 transitions. [2018-10-24 14:10:51,474 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:10:51,474 INFO L276 IsEmpty]: Start isEmpty. Operand 48469 states and 58804 transitions. [2018-10-24 14:10:51,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2018-10-24 14:10:51,482 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:10:51,483 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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] [2018-10-24 14:10:51,483 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:10:51,483 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:10:51,484 INFO L82 PathProgramCache]: Analyzing trace with hash -1442007739, now seen corresponding path program 1 times [2018-10-24 14:10:51,484 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:10:51,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:10:51,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:10:51,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:10:51,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:10:51,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:10:52,121 WARN L179 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 6 [2018-10-24 14:10:52,257 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 184 proven. 4 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2018-10-24 14:10:52,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 14:10:52,257 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-24 14:10:52,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:10:52,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:10:52,370 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 14:10:52,525 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 280 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-10-24 14:10:52,557 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 14:10:52,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2018-10-24 14:10:52,558 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:10:52,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:10:52,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:10:52,559 INFO L87 Difference]: Start difference. First operand 48469 states and 58804 transitions. Second operand 4 states. [2018-10-24 14:11:03,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:11:03,948 INFO L93 Difference]: Finished difference Result 114312 states and 136549 transitions. [2018-10-24 14:11:03,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:11:03,950 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 309 [2018-10-24 14:11:03,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:11:04,072 INFO L225 Difference]: With dead ends: 114312 [2018-10-24 14:11:04,074 INFO L226 Difference]: Without dead ends: 66633 [2018-10-24 14:11:04,126 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 309 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:11:04,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66633 states. [2018-10-24 14:11:04,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66633 to 57138. [2018-10-24 14:11:04,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57138 states. [2018-10-24 14:11:04,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57138 states to 57138 states and 68104 transitions. [2018-10-24 14:11:04,748 INFO L78 Accepts]: Start accepts. Automaton has 57138 states and 68104 transitions. Word has length 309 [2018-10-24 14:11:04,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:11:04,748 INFO L481 AbstractCegarLoop]: Abstraction has 57138 states and 68104 transitions. [2018-10-24 14:11:04,748 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:11:04,749 INFO L276 IsEmpty]: Start isEmpty. Operand 57138 states and 68104 transitions. [2018-10-24 14:11:04,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2018-10-24 14:11:04,758 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:11:04,758 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 14:11:04,758 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:11:04,758 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:11:04,759 INFO L82 PathProgramCache]: Analyzing trace with hash -1145284850, now seen corresponding path program 1 times [2018-10-24 14:11:04,759 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:11:04,759 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:11:04,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:11:04,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:11:04,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:11:04,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:11:05,189 WARN L179 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2018-10-24 14:11:05,350 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 298 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-10-24 14:11:05,351 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:11:05,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:11:05,352 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:11:05,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:11:05,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:11:05,353 INFO L87 Difference]: Start difference. First operand 57138 states and 68104 transitions. Second operand 4 states. [2018-10-24 14:11:16,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:11:16,253 INFO L93 Difference]: Finished difference Result 122940 states and 146167 transitions. [2018-10-24 14:11:16,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:11:16,253 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 338 [2018-10-24 14:11:16,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:11:16,345 INFO L225 Difference]: With dead ends: 122940 [2018-10-24 14:11:16,346 INFO L226 Difference]: Without dead ends: 57862 [2018-10-24 14:11:16,391 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:11:16,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57862 states. [2018-10-24 14:11:16,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57862 to 50769. [2018-10-24 14:11:16,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50769 states. [2018-10-24 14:11:16,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50769 states to 50769 states and 59099 transitions. [2018-10-24 14:11:16,974 INFO L78 Accepts]: Start accepts. Automaton has 50769 states and 59099 transitions. Word has length 338 [2018-10-24 14:11:16,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:11:16,974 INFO L481 AbstractCegarLoop]: Abstraction has 50769 states and 59099 transitions. [2018-10-24 14:11:16,975 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:11:16,975 INFO L276 IsEmpty]: Start isEmpty. Operand 50769 states and 59099 transitions. [2018-10-24 14:11:16,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2018-10-24 14:11:16,982 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:11:16,983 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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] [2018-10-24 14:11:16,983 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:11:16,983 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:11:16,984 INFO L82 PathProgramCache]: Analyzing trace with hash -772890852, now seen corresponding path program 1 times [2018-10-24 14:11:16,984 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:11:16,984 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:11:16,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:11:16,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:11:16,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:11:17,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:11:17,499 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 258 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-10-24 14:11:17,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:11:17,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 14:11:17,501 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:11:17,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:11:17,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:11:17,501 INFO L87 Difference]: Start difference. First operand 50769 states and 59099 transitions. Second operand 4 states. [2018-10-24 14:11:28,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:11:28,215 INFO L93 Difference]: Finished difference Result 130717 states and 153407 transitions. [2018-10-24 14:11:28,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:11:28,216 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 358 [2018-10-24 14:11:28,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:11:28,321 INFO L225 Difference]: With dead ends: 130717 [2018-10-24 14:11:28,321 INFO L226 Difference]: Without dead ends: 80738 [2018-10-24 14:11:28,358 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:11:28,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80738 states. [2018-10-24 14:11:29,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80738 to 78349. [2018-10-24 14:11:29,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78349 states. [2018-10-24 14:11:29,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78349 states to 78349 states and 89264 transitions. [2018-10-24 14:11:29,086 INFO L78 Accepts]: Start accepts. Automaton has 78349 states and 89264 transitions. Word has length 358 [2018-10-24 14:11:29,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:11:29,086 INFO L481 AbstractCegarLoop]: Abstraction has 78349 states and 89264 transitions. [2018-10-24 14:11:29,086 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:11:29,086 INFO L276 IsEmpty]: Start isEmpty. Operand 78349 states and 89264 transitions. [2018-10-24 14:11:29,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2018-10-24 14:11:29,092 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:11:29,092 INFO L375 BasicCegarLoop]: trace histogram [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, 3, 3, 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] [2018-10-24 14:11:29,092 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:11:29,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:11:29,093 INFO L82 PathProgramCache]: Analyzing trace with hash 1803461265, now seen corresponding path program 1 times [2018-10-24 14:11:29,093 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:11:29,093 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:11:29,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:11:29,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:11:29,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:11:29,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:11:29,622 INFO L134 CoverageAnalysis]: Checked inductivity of 531 backedges. 437 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-10-24 14:11:29,622 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:11:29,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 14:11:29,623 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 14:11:29,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 14:11:29,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 14:11:29,624 INFO L87 Difference]: Start difference. First operand 78349 states and 89264 transitions. Second operand 5 states. [2018-10-24 14:11:51,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:11:51,372 INFO L93 Difference]: Finished difference Result 283823 states and 322965 transitions. [2018-10-24 14:11:51,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 14:11:51,373 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 373 [2018-10-24 14:11:51,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:11:51,636 INFO L225 Difference]: With dead ends: 283823 [2018-10-24 14:11:51,636 INFO L226 Difference]: Without dead ends: 206261 [2018-10-24 14:11:51,704 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 14:11:51,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206261 states. [2018-10-24 14:11:54,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206261 to 195057. [2018-10-24 14:11:54,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195057 states. [2018-10-24 14:11:54,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195057 states to 195057 states and 217964 transitions. [2018-10-24 14:11:54,472 INFO L78 Accepts]: Start accepts. Automaton has 195057 states and 217964 transitions. Word has length 373 [2018-10-24 14:11:54,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:11:54,473 INFO L481 AbstractCegarLoop]: Abstraction has 195057 states and 217964 transitions. [2018-10-24 14:11:54,473 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 14:11:54,473 INFO L276 IsEmpty]: Start isEmpty. Operand 195057 states and 217964 transitions. [2018-10-24 14:11:54,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2018-10-24 14:11:54,482 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:11:54,482 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:11:54,483 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:11:54,483 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:11:54,483 INFO L82 PathProgramCache]: Analyzing trace with hash 2125912829, now seen corresponding path program 1 times [2018-10-24 14:11:54,483 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:11:54,483 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:11:54,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:11:54,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:11:54,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:11:54,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:11:54,895 INFO L134 CoverageAnalysis]: Checked inductivity of 880 backedges. 697 proven. 0 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2018-10-24 14:11:54,895 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:11:54,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 14:11:54,896 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:11:54,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:11:54,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:11:54,897 INFO L87 Difference]: Start difference. First operand 195057 states and 217964 transitions. Second operand 4 states. [2018-10-24 14:12:05,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:12:05,588 INFO L93 Difference]: Finished difference Result 387786 states and 433461 transitions. [2018-10-24 14:12:05,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:12:05,589 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 463 [2018-10-24 14:12:05,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:12:05,823 INFO L225 Difference]: With dead ends: 387786 [2018-10-24 14:12:05,823 INFO L226 Difference]: Without dead ends: 193519 [2018-10-24 14:12:05,903 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:12:06,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193519 states. [2018-10-24 14:12:07,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193519 to 191900. [2018-10-24 14:12:07,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191900 states. [2018-10-24 14:12:07,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191900 states to 191900 states and 207829 transitions. [2018-10-24 14:12:07,584 INFO L78 Accepts]: Start accepts. Automaton has 191900 states and 207829 transitions. Word has length 463 [2018-10-24 14:12:07,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:12:07,584 INFO L481 AbstractCegarLoop]: Abstraction has 191900 states and 207829 transitions. [2018-10-24 14:12:07,584 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:12:07,584 INFO L276 IsEmpty]: Start isEmpty. Operand 191900 states and 207829 transitions. [2018-10-24 14:12:07,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 475 [2018-10-24 14:12:07,591 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:12:07,592 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:12:07,592 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:12:07,592 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:12:07,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1451251648, now seen corresponding path program 1 times [2018-10-24 14:12:07,593 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:12:07,593 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:12:07,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:12:07,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:12:07,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:12:07,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:12:09,433 INFO L134 CoverageAnalysis]: Checked inductivity of 825 backedges. 536 proven. 0 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2018-10-24 14:12:09,433 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:12:09,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 14:12:09,434 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:12:09,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:12:09,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:12:09,434 INFO L87 Difference]: Start difference. First operand 191900 states and 207829 transitions. Second operand 4 states. [2018-10-24 14:12:28,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:12:28,428 INFO L93 Difference]: Finished difference Result 429655 states and 465861 transitions. [2018-10-24 14:12:28,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:12:28,428 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 474 [2018-10-24 14:12:28,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:12:28,708 INFO L225 Difference]: With dead ends: 429655 [2018-10-24 14:12:28,708 INFO L226 Difference]: Without dead ends: 238545 [2018-10-24 14:12:28,779 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:12:28,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238545 states. [2018-10-24 14:12:31,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238545 to 236838. [2018-10-24 14:12:31,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236838 states. [2018-10-24 14:12:31,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236838 states to 236838 states and 256050 transitions. [2018-10-24 14:12:31,986 INFO L78 Accepts]: Start accepts. Automaton has 236838 states and 256050 transitions. Word has length 474 [2018-10-24 14:12:31,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:12:31,987 INFO L481 AbstractCegarLoop]: Abstraction has 236838 states and 256050 transitions. [2018-10-24 14:12:31,987 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:12:31,987 INFO L276 IsEmpty]: Start isEmpty. Operand 236838 states and 256050 transitions. [2018-10-24 14:12:31,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 494 [2018-10-24 14:12:31,992 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:12:31,992 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:12:31,993 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:12:31,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:12:31,993 INFO L82 PathProgramCache]: Analyzing trace with hash -747758649, now seen corresponding path program 1 times [2018-10-24 14:12:31,993 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:12:31,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:12:31,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:12:31,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:12:31,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:12:32,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:12:37,639 INFO L134 CoverageAnalysis]: Checked inductivity of 880 backedges. 591 proven. 0 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2018-10-24 14:12:37,640 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:12:37,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 14:12:37,640 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:12:37,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:12:37,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:12:37,641 INFO L87 Difference]: Start difference. First operand 236838 states and 256050 transitions. Second operand 4 states. [2018-10-24 14:12:46,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:12:46,232 INFO L93 Difference]: Finished difference Result 460228 states and 498400 transitions. [2018-10-24 14:12:46,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:12:46,232 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 493 [2018-10-24 14:12:46,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:12:46,500 INFO L225 Difference]: With dead ends: 460228 [2018-10-24 14:12:46,500 INFO L226 Difference]: Without dead ends: 224180 [2018-10-24 14:12:46,587 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:12:46,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224180 states. [2018-10-24 14:12:48,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224180 to 217871. [2018-10-24 14:12:48,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217871 states. [2018-10-24 14:12:48,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217871 states to 217871 states and 229829 transitions. [2018-10-24 14:12:48,943 INFO L78 Accepts]: Start accepts. Automaton has 217871 states and 229829 transitions. Word has length 493 [2018-10-24 14:12:48,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:12:48,943 INFO L481 AbstractCegarLoop]: Abstraction has 217871 states and 229829 transitions. [2018-10-24 14:12:48,943 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:12:48,943 INFO L276 IsEmpty]: Start isEmpty. Operand 217871 states and 229829 transitions. [2018-10-24 14:12:48,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 500 [2018-10-24 14:12:48,948 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:12:48,948 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:12:48,948 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:12:48,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:12:48,949 INFO L82 PathProgramCache]: Analyzing trace with hash -424031071, now seen corresponding path program 1 times [2018-10-24 14:12:48,949 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:12:48,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:12:48,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:12:48,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:12:48,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:12:49,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:12:50,215 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 318 proven. 0 refuted. 0 times theorem prover too weak. 543 trivial. 0 not checked. [2018-10-24 14:12:50,216 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:12:50,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:12:50,217 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:12:50,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:12:50,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:12:50,217 INFO L87 Difference]: Start difference. First operand 217871 states and 229829 transitions. Second operand 3 states. [2018-10-24 14:12:55,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:12:55,272 INFO L93 Difference]: Finished difference Result 434150 states and 457952 transitions. [2018-10-24 14:12:55,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:12:55,273 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 499 [2018-10-24 14:12:55,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:12:55,507 INFO L225 Difference]: With dead ends: 434150 [2018-10-24 14:12:55,507 INFO L226 Difference]: Without dead ends: 217067 [2018-10-24 14:12:56,429 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:12:56,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217067 states. [2018-10-24 14:12:58,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217067 to 217067. [2018-10-24 14:12:58,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217067 states. [2018-10-24 14:12:58,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217067 states to 217067 states and 228892 transitions. [2018-10-24 14:12:58,990 INFO L78 Accepts]: Start accepts. Automaton has 217067 states and 228892 transitions. Word has length 499 [2018-10-24 14:12:58,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:12:58,990 INFO L481 AbstractCegarLoop]: Abstraction has 217067 states and 228892 transitions. [2018-10-24 14:12:58,990 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:12:58,990 INFO L276 IsEmpty]: Start isEmpty. Operand 217067 states and 228892 transitions. [2018-10-24 14:12:58,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 505 [2018-10-24 14:12:58,996 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:12:58,996 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:12:58,996 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:12:58,996 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:12:58,997 INFO L82 PathProgramCache]: Analyzing trace with hash 118459583, now seen corresponding path program 1 times [2018-10-24 14:12:58,997 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:12:58,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:12:58,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:12:58,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:12:58,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:12:59,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:12:59,619 WARN L179 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-10-24 14:12:59,704 INFO L134 CoverageAnalysis]: Checked inductivity of 880 backedges. 332 proven. 0 refuted. 0 times theorem prover too weak. 548 trivial. 0 not checked. [2018-10-24 14:12:59,705 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:12:59,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 14:12:59,705 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:12:59,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:12:59,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:12:59,706 INFO L87 Difference]: Start difference. First operand 217067 states and 228892 transitions. Second operand 4 states. Received shutdown request... [2018-10-24 14:13:01,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:13:01,981 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-24 14:13:01,987 WARN L205 ceAbstractionStarter]: Timeout [2018-10-24 14:13:01,987 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 02:13:01 BoogieIcfgContainer [2018-10-24 14:13:01,987 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-24 14:13:01,988 INFO L168 Benchmark]: Toolchain (without parser) took 227820.07 ms. Allocated memory was 1.5 GB in the beginning and 4.7 GB in the end (delta: 3.1 GB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -515.0 MB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2018-10-24 14:13:01,989 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 14:13:01,990 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2528.19 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: 256.3 MB). Peak memory consumption was 256.3 MB. Max. memory is 7.1 GB. [2018-10-24 14:13:01,991 INFO L168 Benchmark]: Boogie Procedure Inliner took 827.67 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 817.4 MB). Free memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: -1.0 GB). Peak memory consumption was 83.7 MB. Max. memory is 7.1 GB. [2018-10-24 14:13:01,996 INFO L168 Benchmark]: Boogie Preprocessor took 596.17 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 75.0 MB). Peak memory consumption was 75.0 MB. Max. memory is 7.1 GB. [2018-10-24 14:13:01,996 INFO L168 Benchmark]: RCFGBuilder took 16140.08 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 235.9 MB). Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 48.9 MB). Peak memory consumption was 592.2 MB. Max. memory is 7.1 GB. [2018-10-24 14:13:01,997 INFO L168 Benchmark]: TraceAbstraction took 207719.49 ms. Allocated memory was 2.6 GB in the beginning and 4.7 GB in the end (delta: 2.1 GB). Free memory was 2.0 GB in the beginning and 1.9 GB in the end (delta: 122.1 MB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2018-10-24 14:13:02,003 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.23 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 2528.19 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: 256.3 MB). Peak memory consumption was 256.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 827.67 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 817.4 MB). Free memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: -1.0 GB). Peak memory consumption was 83.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 596.17 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 75.0 MB). Peak memory consumption was 75.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 16140.08 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 235.9 MB). Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 48.9 MB). Peak memory consumption was 592.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 207719.49 ms. Allocated memory was 2.6 GB in the beginning and 4.7 GB in the end (delta: 2.1 GB). Free memory was 2.0 GB in the beginning and 1.9 GB in the end (delta: 122.1 MB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 57]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 57). Cancelled while BasicCegarLoop was constructing difference of abstraction (217067states) and FLOYD_HOARE automaton (currently 4 states, 4 states before enhancement),while ReachableStatesComputation was computing reachable states (6876 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 1099 locations, 1 error locations. TIMEOUT Result, 207.6s OverallTime, 14 OverallIterations, 6 TraceHistogramMax, 176.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 9603 SDtfs, 29652 SDslu, 3476 SDs, 0 SdLazy, 64337 SolverSat, 14084 SolverUnsat, 3 SolverUnknown, 0 SolverNotchecked, 141.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 651 GetRequests, 612 SyntacticMatches, 9 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=236838occurred in iteration=11, 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: 16.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 49394 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 5057 NumberOfCodeBlocks, 5057 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 5040 ConstructedInterpolants, 0 QuantifiedInterpolants, 4258499 SizeOfPredicates, 1 NumberOfNonLiveVariables, 877 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 17 InterpolantComputations, 14 PerfectInterpolantSequences, 6366/6440 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown