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/Problem03_label33_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 14:57:56,122 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 14:57:56,125 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 14:57:56,138 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 14:57:56,138 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 14:57:56,139 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 14:57:56,141 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 14:57:56,142 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 14:57:56,144 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 14:57:56,145 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 14:57:56,146 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 14:57:56,146 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 14:57:56,149 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 14:57:56,150 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 14:57:56,151 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 14:57:56,155 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 14:57:56,156 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 14:57:56,160 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 14:57:56,164 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 14:57:56,168 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 14:57:56,170 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 14:57:56,172 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 14:57:56,176 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 14:57:56,177 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 14:57:56,177 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 14:57:56,178 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 14:57:56,179 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 14:57:56,181 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 14:57:56,183 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 14:57:56,184 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 14:57:56,185 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 14:57:56,185 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 14:57:56,185 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 14:57:56,186 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 14:57:56,188 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 14:57:56,189 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 14:57:56,190 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:57:56,212 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 14:57:56,213 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 14:57:56,214 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 14:57:56,214 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-24 14:57:56,214 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-24 14:57:56,215 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-24 14:57:56,215 INFO L133 SettingsManager]: * Use SBE=true [2018-10-24 14:57:56,215 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 14:57:56,215 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 14:57:56,215 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 14:57:56,216 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 14:57:56,216 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 14:57:56,216 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 14:57:56,216 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 14:57:56,216 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 14:57:56,217 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 14:57:56,217 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 14:57:56,217 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 14:57:56,217 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 14:57:56,217 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 14:57:56,218 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 14:57:56,218 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 14:57:56,218 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 14:57:56,218 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-24 14:57:56,218 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 14:57:56,219 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 14:57:56,219 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 14:57:56,219 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 14:57:56,261 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 14:57:56,277 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 14:57:56,284 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 14:57:56,285 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 14:57:56,286 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 14:57:56,287 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label33_true-unreach-call.c [2018-10-24 14:57:56,356 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/c9b6c15fc/2cc93e8ba88044ffb5e47dffa4f120e6/FLAG63fc5253b [2018-10-24 14:57:57,058 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 14:57:57,059 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label33_true-unreach-call.c [2018-10-24 14:57:57,083 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/c9b6c15fc/2cc93e8ba88044ffb5e47dffa4f120e6/FLAG63fc5253b [2018-10-24 14:57:57,106 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/c9b6c15fc/2cc93e8ba88044ffb5e47dffa4f120e6 [2018-10-24 14:57:57,119 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 14:57:57,121 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 14:57:57,122 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 14:57:57,123 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 14:57:57,128 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 14:57:57,129 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:57:57" (1/1) ... [2018-10-24 14:57:57,132 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64e2cff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:57:57, skipping insertion in model container [2018-10-24 14:57:57,133 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:57:57" (1/1) ... [2018-10-24 14:57:57,143 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 14:57:57,246 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 14:57:57,959 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 14:57:57,965 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 14:57:58,233 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 14:57:58,257 INFO L193 MainTranslator]: Completed translation [2018-10-24 14:57:58,258 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:57:58 WrapperNode [2018-10-24 14:57:58,258 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 14:57:58,259 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 14:57:58,259 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 14:57:58,259 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 14:57:58,275 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:57:58" (1/1) ... [2018-10-24 14:57:58,334 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:57:58" (1/1) ... [2018-10-24 14:57:58,625 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 14:57:58,626 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 14:57:58,626 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 14:57:58,626 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 14:57:58,638 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:57:58" (1/1) ... [2018-10-24 14:57:58,638 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:57:58" (1/1) ... [2018-10-24 14:57:58,647 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:57:58" (1/1) ... [2018-10-24 14:57:58,647 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:57:58" (1/1) ... [2018-10-24 14:57:58,719 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:57:58" (1/1) ... [2018-10-24 14:57:58,749 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:57:58" (1/1) ... [2018-10-24 14:57:58,775 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:57:58" (1/1) ... [2018-10-24 14:57:58,793 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 14:57:58,794 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 14:57:58,794 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 14:57:58,794 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 14:57:58,795 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:57:58" (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:57:58,871 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-24 14:57:58,872 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 14:57:58,872 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 14:58:05,061 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 14:58:05,062 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:58:05 BoogieIcfgContainer [2018-10-24 14:58:05,063 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 14:58:05,064 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 14:58:05,064 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 14:58:05,068 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 14:58:05,068 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 02:57:57" (1/3) ... [2018-10-24 14:58:05,069 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26220aa9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:58:05, skipping insertion in model container [2018-10-24 14:58:05,070 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:57:58" (2/3) ... [2018-10-24 14:58:05,070 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26220aa9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:58:05, skipping insertion in model container [2018-10-24 14:58:05,070 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:58:05" (3/3) ... [2018-10-24 14:58:05,072 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label33_true-unreach-call.c [2018-10-24 14:58:05,083 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 14:58:05,093 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 14:58:05,112 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 14:58:05,153 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-24 14:58:05,154 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 14:58:05,154 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 14:58:05,154 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 14:58:05,154 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 14:58:05,155 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 14:58:05,155 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 14:58:05,155 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 14:58:05,155 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 14:58:05,182 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states. [2018-10-24 14:58:05,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-10-24 14:58:05,202 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:58:05,203 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:05,206 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:58:05,212 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:58:05,213 INFO L82 PathProgramCache]: Analyzing trace with hash -38821388, now seen corresponding path program 1 times [2018-10-24 14:58:05,215 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:58:05,215 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:58:05,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:58:05,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:58:05,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:58:05,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:58:05,939 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:58:05,942 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:58:05,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:58:05,948 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:58:05,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:58:05,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:58:05,969 INFO L87 Difference]: Start difference. First operand 303 states. Second operand 3 states. [2018-10-24 14:58:07,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:58:07,916 INFO L93 Difference]: Finished difference Result 832 states and 1481 transitions. [2018-10-24 14:58:07,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:58:07,918 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 160 [2018-10-24 14:58:07,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:58:07,951 INFO L225 Difference]: With dead ends: 832 [2018-10-24 14:58:07,952 INFO L226 Difference]: Without dead ends: 525 [2018-10-24 14:58:07,958 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:58:07,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2018-10-24 14:58:08,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 511. [2018-10-24 14:58:08,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 511 states. [2018-10-24 14:58:08,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 878 transitions. [2018-10-24 14:58:08,048 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 878 transitions. Word has length 160 [2018-10-24 14:58:08,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:58:08,052 INFO L481 AbstractCegarLoop]: Abstraction has 511 states and 878 transitions. [2018-10-24 14:58:08,052 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:58:08,052 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 878 transitions. [2018-10-24 14:58:08,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-10-24 14:58:08,064 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:58:08,064 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-24 14:58:08,064 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:58:08,065 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:58:08,065 INFO L82 PathProgramCache]: Analyzing trace with hash -650574363, now seen corresponding path program 1 times [2018-10-24 14:58:08,065 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:58:08,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:58:08,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:58:08,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:58:08,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:58:08,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:58:08,351 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:58:08,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:58:08,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:58:08,354 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:58:08,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:58:08,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:58:08,355 INFO L87 Difference]: Start difference. First operand 511 states and 878 transitions. Second operand 4 states. [2018-10-24 14:58:13,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:58:13,013 INFO L93 Difference]: Finished difference Result 1892 states and 3348 transitions. [2018-10-24 14:58:13,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:58:13,013 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 166 [2018-10-24 14:58:13,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:58:13,024 INFO L225 Difference]: With dead ends: 1892 [2018-10-24 14:58:13,024 INFO L226 Difference]: Without dead ends: 1383 [2018-10-24 14:58:13,029 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:58:13,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1383 states. [2018-10-24 14:58:13,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 923. [2018-10-24 14:58:13,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 923 states. [2018-10-24 14:58:13,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1514 transitions. [2018-10-24 14:58:13,069 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1514 transitions. Word has length 166 [2018-10-24 14:58:13,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:58:13,069 INFO L481 AbstractCegarLoop]: Abstraction has 923 states and 1514 transitions. [2018-10-24 14:58:13,070 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:58:13,070 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1514 transitions. [2018-10-24 14:58:13,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-10-24 14:58:13,075 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:58:13,075 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:13,076 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:58:13,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:58:13,076 INFO L82 PathProgramCache]: Analyzing trace with hash -143747887, now seen corresponding path program 1 times [2018-10-24 14:58:13,076 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:58:13,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:58:13,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:58:13,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:58:13,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:58:13,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:58:13,171 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:58:13,171 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:58:13,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:58:13,172 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:58:13,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:58:13,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:58:13,173 INFO L87 Difference]: Start difference. First operand 923 states and 1514 transitions. Second operand 3 states. [2018-10-24 14:58:14,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:58:14,938 INFO L93 Difference]: Finished difference Result 1823 states and 2997 transitions. [2018-10-24 14:58:14,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:58:14,941 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 174 [2018-10-24 14:58:14,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:58:14,946 INFO L225 Difference]: With dead ends: 1823 [2018-10-24 14:58:14,947 INFO L226 Difference]: Without dead ends: 902 [2018-10-24 14:58:14,949 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:58:14,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 902 states. [2018-10-24 14:58:14,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 902 to 902. [2018-10-24 14:58:14,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 902 states. [2018-10-24 14:58:14,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 1435 transitions. [2018-10-24 14:58:14,973 INFO L78 Accepts]: Start accepts. Automaton has 902 states and 1435 transitions. Word has length 174 [2018-10-24 14:58:14,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:58:14,973 INFO L481 AbstractCegarLoop]: Abstraction has 902 states and 1435 transitions. [2018-10-24 14:58:14,973 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:58:14,974 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 1435 transitions. [2018-10-24 14:58:14,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-10-24 14:58:14,977 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:58:14,977 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:58:14,978 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:58:14,978 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:58:14,978 INFO L82 PathProgramCache]: Analyzing trace with hash -1128783860, now seen corresponding path program 1 times [2018-10-24 14:58:14,978 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:58:14,979 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:58:14,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:58:14,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:58:14,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:58:15,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:58:15,094 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-24 14:58:15,095 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:58:15,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:58:15,095 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:58:15,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:58:15,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:58:15,096 INFO L87 Difference]: Start difference. First operand 902 states and 1435 transitions. Second operand 4 states. [2018-10-24 14:58:17,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:58:17,113 INFO L93 Difference]: Finished difference Result 3476 states and 5598 transitions. [2018-10-24 14:58:17,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:58:17,114 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 176 [2018-10-24 14:58:17,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:58:17,127 INFO L225 Difference]: With dead ends: 3476 [2018-10-24 14:58:17,127 INFO L226 Difference]: Without dead ends: 2576 [2018-10-24 14:58:17,129 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:58:17,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2576 states. [2018-10-24 14:58:17,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2576 to 1723. [2018-10-24 14:58:17,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1723 states. [2018-10-24 14:58:17,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1723 states to 1723 states and 2603 transitions. [2018-10-24 14:58:17,172 INFO L78 Accepts]: Start accepts. Automaton has 1723 states and 2603 transitions. Word has length 176 [2018-10-24 14:58:17,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:58:17,173 INFO L481 AbstractCegarLoop]: Abstraction has 1723 states and 2603 transitions. [2018-10-24 14:58:17,173 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:58:17,173 INFO L276 IsEmpty]: Start isEmpty. Operand 1723 states and 2603 transitions. [2018-10-24 14:58:17,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-10-24 14:58:17,178 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:58:17,178 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:17,178 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:58:17,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:58:17,179 INFO L82 PathProgramCache]: Analyzing trace with hash -877984136, now seen corresponding path program 1 times [2018-10-24 14:58:17,179 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:58:17,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:58:17,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:58:17,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:58:17,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:58:17,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:58:17,327 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-24 14:58:17,328 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:58:17,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:58:17,329 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:58:17,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:58:17,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:58:17,330 INFO L87 Difference]: Start difference. First operand 1723 states and 2603 transitions. Second operand 3 states. [2018-10-24 14:58:17,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:58:17,853 INFO L93 Difference]: Finished difference Result 5159 states and 7797 transitions. [2018-10-24 14:58:17,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:58:17,854 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 183 [2018-10-24 14:58:17,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:58:17,872 INFO L225 Difference]: With dead ends: 5159 [2018-10-24 14:58:17,872 INFO L226 Difference]: Without dead ends: 3438 [2018-10-24 14:58:17,876 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:58:17,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3438 states. [2018-10-24 14:58:17,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3438 to 3436. [2018-10-24 14:58:17,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3436 states. [2018-10-24 14:58:17,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3436 states to 3436 states and 5189 transitions. [2018-10-24 14:58:17,965 INFO L78 Accepts]: Start accepts. Automaton has 3436 states and 5189 transitions. Word has length 183 [2018-10-24 14:58:17,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:58:17,966 INFO L481 AbstractCegarLoop]: Abstraction has 3436 states and 5189 transitions. [2018-10-24 14:58:17,966 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:58:17,966 INFO L276 IsEmpty]: Start isEmpty. Operand 3436 states and 5189 transitions. [2018-10-24 14:58:17,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-10-24 14:58:17,973 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:58:17,974 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:17,974 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:58:17,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:58:17,974 INFO L82 PathProgramCache]: Analyzing trace with hash 1434791920, now seen corresponding path program 1 times [2018-10-24 14:58:17,975 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:58:17,975 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:58:17,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:58:17,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:58:17,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:58:18,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:58:18,374 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:58:18,375 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:58:18,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 14:58:18,375 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 14:58:18,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 14:58:18,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 14:58:18,376 INFO L87 Difference]: Start difference. First operand 3436 states and 5189 transitions. Second operand 5 states. [2018-10-24 14:58:22,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:58:22,493 INFO L93 Difference]: Finished difference Result 7939 states and 12127 transitions. [2018-10-24 14:58:22,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 14:58:22,494 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 200 [2018-10-24 14:58:22,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:58:22,515 INFO L225 Difference]: With dead ends: 7939 [2018-10-24 14:58:22,515 INFO L226 Difference]: Without dead ends: 4505 [2018-10-24 14:58:22,521 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 14:58:22,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4505 states. [2018-10-24 14:58:22,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4505 to 3640. [2018-10-24 14:58:22,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3640 states. [2018-10-24 14:58:22,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3640 states to 3640 states and 5424 transitions. [2018-10-24 14:58:22,598 INFO L78 Accepts]: Start accepts. Automaton has 3640 states and 5424 transitions. Word has length 200 [2018-10-24 14:58:22,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:58:22,598 INFO L481 AbstractCegarLoop]: Abstraction has 3640 states and 5424 transitions. [2018-10-24 14:58:22,599 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 14:58:22,600 INFO L276 IsEmpty]: Start isEmpty. Operand 3640 states and 5424 transitions. [2018-10-24 14:58:22,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-10-24 14:58:22,606 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:58:22,606 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:22,606 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:58:22,607 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:58:22,607 INFO L82 PathProgramCache]: Analyzing trace with hash -1631129756, now seen corresponding path program 1 times [2018-10-24 14:58:22,607 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:58:22,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:58:22,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:58:22,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:58:22,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:58:22,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:58:22,841 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:58:22,842 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:58:22,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:58:22,843 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:58:22,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:58:22,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:58:22,844 INFO L87 Difference]: Start difference. First operand 3640 states and 5424 transitions. Second operand 3 states. [2018-10-24 14:58:24,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:58:24,556 INFO L93 Difference]: Finished difference Result 8933 states and 13269 transitions. [2018-10-24 14:58:24,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:58:24,562 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 202 [2018-10-24 14:58:24,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:58:24,582 INFO L225 Difference]: With dead ends: 8933 [2018-10-24 14:58:24,582 INFO L226 Difference]: Without dead ends: 5295 [2018-10-24 14:58:24,588 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:58:24,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5295 states. [2018-10-24 14:58:24,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5295 to 5293. [2018-10-24 14:58:24,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5293 states. [2018-10-24 14:58:24,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5293 states to 5293 states and 7795 transitions. [2018-10-24 14:58:24,705 INFO L78 Accepts]: Start accepts. Automaton has 5293 states and 7795 transitions. Word has length 202 [2018-10-24 14:58:24,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:58:24,705 INFO L481 AbstractCegarLoop]: Abstraction has 5293 states and 7795 transitions. [2018-10-24 14:58:24,705 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:58:24,705 INFO L276 IsEmpty]: Start isEmpty. Operand 5293 states and 7795 transitions. [2018-10-24 14:58:24,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-10-24 14:58:24,714 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:58:24,715 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:24,715 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:58:24,716 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:58:24,716 INFO L82 PathProgramCache]: Analyzing trace with hash -104078832, now seen corresponding path program 1 times [2018-10-24 14:58:24,716 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:58:24,716 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:58:24,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:58:24,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:58:24,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:58:24,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:58:25,234 WARN L179 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 10 [2018-10-24 14:58:25,461 WARN L179 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2018-10-24 14:58:25,522 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 52 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:58:25,522 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 14:58:25,522 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:58:25,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:58:25,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:58:25,678 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 14:58:25,880 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-24 14:58:25,912 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 14:58:25,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2018-10-24 14:58:25,914 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-24 14:58:25,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-24 14:58:25,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-10-24 14:58:25,914 INFO L87 Difference]: Start difference. First operand 5293 states and 7795 transitions. Second operand 7 states. [2018-10-24 14:58:35,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:58:35,798 INFO L93 Difference]: Finished difference Result 28244 states and 40515 transitions. [2018-10-24 14:58:35,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-24 14:58:35,799 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 210 [2018-10-24 14:58:35,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:58:35,860 INFO L225 Difference]: With dead ends: 28244 [2018-10-24 14:58:35,860 INFO L226 Difference]: Without dead ends: 22953 [2018-10-24 14:58:35,872 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2018-10-24 14:58:35,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22953 states. [2018-10-24 14:58:36,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22953 to 22932. [2018-10-24 14:58:36,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22932 states. [2018-10-24 14:58:36,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22932 states to 22932 states and 28766 transitions. [2018-10-24 14:58:36,328 INFO L78 Accepts]: Start accepts. Automaton has 22932 states and 28766 transitions. Word has length 210 [2018-10-24 14:58:36,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:58:36,329 INFO L481 AbstractCegarLoop]: Abstraction has 22932 states and 28766 transitions. [2018-10-24 14:58:36,329 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-24 14:58:36,329 INFO L276 IsEmpty]: Start isEmpty. Operand 22932 states and 28766 transitions. [2018-10-24 14:58:36,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2018-10-24 14:58:36,354 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:58:36,355 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:36,355 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:58:36,355 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:58:36,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1001781086, now seen corresponding path program 1 times [2018-10-24 14:58:36,355 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:58:36,356 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:58:36,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:58:36,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:58:36,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:58:36,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:58:36,498 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-10-24 14:58:36,499 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:58:36,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:58:36,499 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:58:36,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:58:36,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:58:36,500 INFO L87 Difference]: Start difference. First operand 22932 states and 28766 transitions. Second operand 3 states. [2018-10-24 14:58:39,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:58:39,752 INFO L93 Difference]: Finished difference Result 64222 states and 80670 transitions. [2018-10-24 14:58:39,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:58:39,752 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 239 [2018-10-24 14:58:39,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:58:39,836 INFO L225 Difference]: With dead ends: 64222 [2018-10-24 14:58:39,836 INFO L226 Difference]: Without dead ends: 41292 [2018-10-24 14:58:39,866 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:58:39,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41292 states. [2018-10-24 14:58:40,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41292 to 41290. [2018-10-24 14:58:40,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41290 states. [2018-10-24 14:58:40,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41290 states to 41290 states and 49438 transitions. [2018-10-24 14:58:40,410 INFO L78 Accepts]: Start accepts. Automaton has 41290 states and 49438 transitions. Word has length 239 [2018-10-24 14:58:40,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:58:40,411 INFO L481 AbstractCegarLoop]: Abstraction has 41290 states and 49438 transitions. [2018-10-24 14:58:40,411 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:58:40,411 INFO L276 IsEmpty]: Start isEmpty. Operand 41290 states and 49438 transitions. [2018-10-24 14:58:40,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-10-24 14:58:40,458 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:58:40,458 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:40,458 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:58:40,459 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:58:40,459 INFO L82 PathProgramCache]: Analyzing trace with hash 2047623181, now seen corresponding path program 1 times [2018-10-24 14:58:40,459 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:58:40,459 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:58:40,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:58:40,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:58:40,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:58:40,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:58:40,710 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 105 proven. 8 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-10-24 14:58:40,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 14:58:40,711 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:58:40,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:58:40,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:58:40,847 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 14:58:40,951 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-10-24 14:58:40,987 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 14:58:40,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-10-24 14:58:40,988 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 14:58:40,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 14:58:40,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 14:58:40,989 INFO L87 Difference]: Start difference. First operand 41290 states and 49438 transitions. Second operand 5 states. [2018-10-24 14:58:44,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:58:44,368 INFO L93 Difference]: Finished difference Result 102771 states and 126323 transitions. [2018-10-24 14:58:44,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:58:44,369 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 252 [2018-10-24 14:58:44,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:58:44,478 INFO L225 Difference]: With dead ends: 102771 [2018-10-24 14:58:44,478 INFO L226 Difference]: Without dead ends: 61483 [2018-10-24 14:58:44,535 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 252 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 14:58:44,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61483 states. [2018-10-24 14:58:45,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61483 to 60663. [2018-10-24 14:58:45,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60663 states. [2018-10-24 14:58:45,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60663 states to 60663 states and 71369 transitions. [2018-10-24 14:58:45,407 INFO L78 Accepts]: Start accepts. Automaton has 60663 states and 71369 transitions. Word has length 252 [2018-10-24 14:58:45,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:58:45,407 INFO L481 AbstractCegarLoop]: Abstraction has 60663 states and 71369 transitions. [2018-10-24 14:58:45,407 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 14:58:45,407 INFO L276 IsEmpty]: Start isEmpty. Operand 60663 states and 71369 transitions. [2018-10-24 14:58:45,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2018-10-24 14:58:45,503 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:58:45,503 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:45,504 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:58:45,504 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:58:45,504 INFO L82 PathProgramCache]: Analyzing trace with hash -71420173, now seen corresponding path program 1 times [2018-10-24 14:58:45,504 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:58:45,505 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:58:45,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:58:45,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:58:45,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:58:45,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:58:45,888 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 262 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2018-10-24 14:58:45,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:58:45,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:58:45,889 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:58:45,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:58:45,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:58:45,890 INFO L87 Difference]: Start difference. First operand 60663 states and 71369 transitions. Second operand 3 states. [2018-10-24 14:58:47,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:58:47,884 INFO L93 Difference]: Finished difference Result 118873 states and 139768 transitions. [2018-10-24 14:58:47,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:58:47,885 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 360 [2018-10-24 14:58:47,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:58:47,954 INFO L225 Difference]: With dead ends: 118873 [2018-10-24 14:58:47,955 INFO L226 Difference]: Without dead ends: 58212 [2018-10-24 14:58:47,999 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:58:48,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58212 states. [2018-10-24 14:58:48,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58212 to 58004. [2018-10-24 14:58:48,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58004 states. [2018-10-24 14:58:48,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58004 states to 58004 states and 65746 transitions. [2018-10-24 14:58:48,659 INFO L78 Accepts]: Start accepts. Automaton has 58004 states and 65746 transitions. Word has length 360 [2018-10-24 14:58:48,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:58:48,660 INFO L481 AbstractCegarLoop]: Abstraction has 58004 states and 65746 transitions. [2018-10-24 14:58:48,660 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:58:48,660 INFO L276 IsEmpty]: Start isEmpty. Operand 58004 states and 65746 transitions. [2018-10-24 14:58:48,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2018-10-24 14:58:48,701 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:58:48,702 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 7, 6, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:48,702 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:58:48,703 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:58:48,703 INFO L82 PathProgramCache]: Analyzing trace with hash -114182876, now seen corresponding path program 2 times [2018-10-24 14:58:48,703 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:58:48,703 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:58:48,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:58:48,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:58:48,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:58:48,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:58:49,109 INFO L134 CoverageAnalysis]: Checked inductivity of 426 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2018-10-24 14:58:49,109 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:58:49,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:58:49,110 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:58:49,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:58:49,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:58:49,111 INFO L87 Difference]: Start difference. First operand 58004 states and 65746 transitions. Second operand 4 states. [2018-10-24 14:58:52,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:58:52,357 INFO L93 Difference]: Finished difference Result 211301 states and 238015 transitions. [2018-10-24 14:58:52,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:58:52,358 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 373 [2018-10-24 14:58:52,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:58:52,560 INFO L225 Difference]: With dead ends: 211301 [2018-10-24 14:58:52,561 INFO L226 Difference]: Without dead ends: 153299 [2018-10-24 14:58:52,639 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:58:52,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153299 states. [2018-10-24 14:58:54,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153299 to 153295. [2018-10-24 14:58:54,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153295 states. [2018-10-24 14:58:55,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153295 states to 153295 states and 171946 transitions. [2018-10-24 14:58:55,179 INFO L78 Accepts]: Start accepts. Automaton has 153295 states and 171946 transitions. Word has length 373 [2018-10-24 14:58:55,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:58:55,179 INFO L481 AbstractCegarLoop]: Abstraction has 153295 states and 171946 transitions. [2018-10-24 14:58:55,179 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:58:55,179 INFO L276 IsEmpty]: Start isEmpty. Operand 153295 states and 171946 transitions. [2018-10-24 14:58:55,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 537 [2018-10-24 14:58:55,296 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:58:55,297 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:55,297 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:58:55,297 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:58:55,297 INFO L82 PathProgramCache]: Analyzing trace with hash -1003386127, now seen corresponding path program 1 times [2018-10-24 14:58:55,298 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:58:55,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:58:55,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:58:55,299 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 14:58:55,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:58:55,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:58:55,825 WARN L179 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 8 [2018-10-24 14:58:56,075 INFO L134 CoverageAnalysis]: Checked inductivity of 848 backedges. 284 proven. 0 refuted. 0 times theorem prover too weak. 564 trivial. 0 not checked. [2018-10-24 14:58:56,873 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:58:56,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 14:58:56,874 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:58:56,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:58:56,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:58:56,875 INFO L87 Difference]: Start difference. First operand 153295 states and 171946 transitions. Second operand 4 states. [2018-10-24 14:59:00,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:59:00,551 INFO L93 Difference]: Finished difference Result 304194 states and 340964 transitions. [2018-10-24 14:59:00,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:59:00,551 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 536 [2018-10-24 14:59:00,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:59:00,753 INFO L225 Difference]: With dead ends: 304194 [2018-10-24 14:59:00,753 INFO L226 Difference]: Without dead ends: 150901 [2018-10-24 14:59:00,850 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:59:00,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150901 states. [2018-10-24 14:59:02,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150901 to 146561. [2018-10-24 14:59:02,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146561 states. [2018-10-24 14:59:03,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146561 states to 146561 states and 163713 transitions. [2018-10-24 14:59:03,024 INFO L78 Accepts]: Start accepts. Automaton has 146561 states and 163713 transitions. Word has length 536 [2018-10-24 14:59:03,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:59:03,025 INFO L481 AbstractCegarLoop]: Abstraction has 146561 states and 163713 transitions. [2018-10-24 14:59:03,025 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:59:03,025 INFO L276 IsEmpty]: Start isEmpty. Operand 146561 states and 163713 transitions. [2018-10-24 14:59:03,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 543 [2018-10-24 14:59:03,155 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:59:03,155 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-24 14:59:03,155 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:59:03,156 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:59:03,156 INFO L82 PathProgramCache]: Analyzing trace with hash -237916135, now seen corresponding path program 1 times [2018-10-24 14:59:03,156 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:59:03,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:59:03,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:59:03,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:59:03,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:59:03,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:59:04,524 INFO L134 CoverageAnalysis]: Checked inductivity of 957 backedges. 245 proven. 0 refuted. 0 times theorem prover too weak. 712 trivial. 0 not checked. [2018-10-24 14:59:04,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:59:04,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:59:04,525 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:59:04,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:59:04,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:59:04,528 INFO L87 Difference]: Start difference. First operand 146561 states and 163713 transitions. Second operand 4 states. [2018-10-24 14:59:07,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:59:07,844 INFO L93 Difference]: Finished difference Result 414764 states and 462298 transitions. [2018-10-24 14:59:07,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:59:07,844 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 542 [2018-10-24 14:59:07,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:59:08,137 INFO L225 Difference]: With dead ends: 414764 [2018-10-24 14:59:08,137 INFO L226 Difference]: Without dead ends: 268205 [2018-10-24 14:59:08,242 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:59:08,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268205 states. [2018-10-24 14:59:11,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268205 to 267179. [2018-10-24 14:59:11,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267179 states. [2018-10-24 14:59:11,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267179 states to 267179 states and 294850 transitions. [2018-10-24 14:59:11,747 INFO L78 Accepts]: Start accepts. Automaton has 267179 states and 294850 transitions. Word has length 542 [2018-10-24 14:59:11,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:59:11,748 INFO L481 AbstractCegarLoop]: Abstraction has 267179 states and 294850 transitions. [2018-10-24 14:59:11,748 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:59:11,748 INFO L276 IsEmpty]: Start isEmpty. Operand 267179 states and 294850 transitions. [2018-10-24 14:59:11,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 622 [2018-10-24 14:59:11,873 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:59:11,873 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:59:11,873 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:59:11,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:59:11,874 INFO L82 PathProgramCache]: Analyzing trace with hash 696758080, now seen corresponding path program 1 times [2018-10-24 14:59:11,874 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:59:11,874 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:59:11,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:59:11,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:59:11,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:59:11,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:59:13,149 INFO L134 CoverageAnalysis]: Checked inductivity of 1310 backedges. 345 proven. 0 refuted. 0 times theorem prover too weak. 965 trivial. 0 not checked. [2018-10-24 14:59:13,150 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:59:13,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:59:13,151 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:59:13,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:59:13,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:59:13,152 INFO L87 Difference]: Start difference. First operand 267179 states and 294850 transitions. Second operand 3 states. [2018-10-24 14:59:16,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:59:16,260 INFO L93 Difference]: Finished difference Result 495325 states and 546731 transitions. [2018-10-24 14:59:16,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:59:16,261 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 621 [2018-10-24 14:59:16,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:59:16,578 INFO L225 Difference]: With dead ends: 495325 [2018-10-24 14:59:16,578 INFO L226 Difference]: Without dead ends: 228352 [2018-10-24 14:59:16,736 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:59:16,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228352 states. [2018-10-24 14:59:20,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228352 to 228318. [2018-10-24 14:59:20,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228318 states. [2018-10-24 14:59:20,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228318 states to 228318 states and 249523 transitions. [2018-10-24 14:59:20,600 INFO L78 Accepts]: Start accepts. Automaton has 228318 states and 249523 transitions. Word has length 621 [2018-10-24 14:59:20,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:59:20,600 INFO L481 AbstractCegarLoop]: Abstraction has 228318 states and 249523 transitions. [2018-10-24 14:59:20,600 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:59:20,600 INFO L276 IsEmpty]: Start isEmpty. Operand 228318 states and 249523 transitions. [2018-10-24 14:59:20,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 666 [2018-10-24 14:59:20,738 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:59:20,738 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:59:20,739 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:59:20,739 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:59:20,739 INFO L82 PathProgramCache]: Analyzing trace with hash -1033170859, now seen corresponding path program 1 times [2018-10-24 14:59:20,739 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:59:20,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:59:20,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:59:20,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:59:20,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:59:20,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:59:21,508 WARN L179 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 7 [2018-10-24 14:59:21,947 WARN L179 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 11 [2018-10-24 14:59:22,412 WARN L179 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 12 [2018-10-24 14:59:22,794 INFO L134 CoverageAnalysis]: Checked inductivity of 1471 backedges. 503 proven. 10 refuted. 0 times theorem prover too weak. 958 trivial. 0 not checked. [2018-10-24 14:59:22,795 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 14:59:22,795 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:59:23,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:59:23,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:59:23,668 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 14:59:24,251 INFO L134 CoverageAnalysis]: Checked inductivity of 1471 backedges. 657 proven. 0 refuted. 0 times theorem prover too weak. 814 trivial. 0 not checked. [2018-10-24 14:59:24,292 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 14:59:24,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2018-10-24 14:59:24,294 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-24 14:59:24,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-24 14:59:24,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-10-24 14:59:24,294 INFO L87 Difference]: Start difference. First operand 228318 states and 249523 transitions. Second operand 8 states. [2018-10-24 14:59:24,613 WARN L179 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 13 [2018-10-24 14:59:25,167 WARN L179 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 11 [2018-10-24 14:59:40,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:59:40,985 INFO L93 Difference]: Finished difference Result 1334451 states and 1450311 transitions. [2018-10-24 14:59:40,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-24 14:59:40,985 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 665 [2018-10-24 14:59:40,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:59:42,723 INFO L225 Difference]: With dead ends: 1334451 [2018-10-24 14:59:42,723 INFO L226 Difference]: Without dead ends: 1106953 [2018-10-24 14:59:43,019 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 683 GetRequests, 664 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=117, Invalid=225, Unknown=0, NotChecked=0, Total=342 [2018-10-24 14:59:43,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106953 states. [2018-10-24 14:59:55,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106953 to 746812. [2018-10-24 14:59:55,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 746812 states. [2018-10-24 14:59:56,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746812 states to 746812 states and 807402 transitions. [2018-10-24 14:59:56,903 INFO L78 Accepts]: Start accepts. Automaton has 746812 states and 807402 transitions. Word has length 665 [2018-10-24 14:59:56,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:59:56,903 INFO L481 AbstractCegarLoop]: Abstraction has 746812 states and 807402 transitions. [2018-10-24 14:59:56,904 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-24 14:59:56,904 INFO L276 IsEmpty]: Start isEmpty. Operand 746812 states and 807402 transitions. [2018-10-24 14:59:59,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 769 [2018-10-24 14:59:59,372 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:59:59,372 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2018-10-24 14:59:59,372 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:59:59,373 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:59:59,373 INFO L82 PathProgramCache]: Analyzing trace with hash 471337485, now seen corresponding path program 1 times [2018-10-24 14:59:59,373 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:59:59,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:59:59,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:59:59,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:59:59,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:59:59,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:59:59,772 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-24 15:00:06,251 INFO L134 CoverageAnalysis]: Checked inductivity of 1945 backedges. 282 proven. 4 refuted. 0 times theorem prover too weak. 1659 trivial. 0 not checked. [2018-10-24 15:00:06,251 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 15:00:06,252 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-24 15:00:06,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:00:06,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:00:06,583 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 15:00:07,017 INFO L134 CoverageAnalysis]: Checked inductivity of 1945 backedges. 992 proven. 0 refuted. 0 times theorem prover too weak. 953 trivial. 0 not checked. [2018-10-24 15:00:07,040 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 15:00:07,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2018-10-24 15:00:07,041 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 15:00:07,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 15:00:07,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-24 15:00:07,042 INFO L87 Difference]: Start difference. First operand 746812 states and 807402 transitions. Second operand 6 states. [2018-10-24 15:00:27,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:00:27,625 INFO L93 Difference]: Finished difference Result 3244621 states and 3499012 transitions. [2018-10-24 15:00:27,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-24 15:00:27,625 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 768 [2018-10-24 15:00:27,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:00:33,592 INFO L225 Difference]: With dead ends: 3244621 [2018-10-24 15:00:33,592 INFO L226 Difference]: Without dead ends: 2498629 [2018-10-24 15:00:34,308 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 775 GetRequests, 767 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-10-24 15:00:35,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2498629 states. Received shutdown request...