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_label28_false-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 13:17:09,129 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 13:17:09,132 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 13:17:09,145 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 13:17:09,145 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 13:17:09,147 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 13:17:09,148 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 13:17:09,151 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 13:17:09,152 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 13:17:09,153 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 13:17:09,154 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 13:17:09,154 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 13:17:09,155 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 13:17:09,156 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 13:17:09,157 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 13:17:09,158 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 13:17:09,159 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 13:17:09,161 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 13:17:09,168 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 13:17:09,172 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 13:17:09,173 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 13:17:09,174 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 13:17:09,176 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 13:17:09,177 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 13:17:09,177 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 13:17:09,177 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 13:17:09,178 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 13:17:09,179 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 13:17:09,180 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 13:17:09,181 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 13:17:09,181 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 13:17:09,182 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 13:17:09,182 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 13:17:09,182 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 13:17:09,183 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 13:17:09,183 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 13:17:09,184 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 13:17:09,198 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 13:17:09,199 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 13:17:09,199 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 13:17:09,200 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-24 13:17:09,201 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-24 13:17:09,201 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-24 13:17:09,201 INFO L133 SettingsManager]: * Use SBE=true [2018-10-24 13:17:09,203 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 13:17:09,203 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 13:17:09,203 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 13:17:09,203 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 13:17:09,203 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 13:17:09,204 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 13:17:09,204 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 13:17:09,204 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 13:17:09,204 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 13:17:09,204 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 13:17:09,204 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 13:17:09,206 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 13:17:09,206 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 13:17:09,206 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 13:17:09,206 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 13:17:09,206 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 13:17:09,207 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-24 13:17:09,207 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 13:17:09,207 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 13:17:09,207 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 13:17:09,207 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 13:17:09,267 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 13:17:09,281 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 13:17:09,285 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 13:17:09,287 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 13:17:09,287 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 13:17:09,288 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label28_false-unreach-call.c [2018-10-24 13:17:09,345 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/57a78401b/7b05711e9bbd49b486c909482e0acc08/FLAGfe18b57e4 [2018-10-24 13:17:09,971 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 13:17:09,973 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label28_false-unreach-call.c [2018-10-24 13:17:09,994 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/57a78401b/7b05711e9bbd49b486c909482e0acc08/FLAGfe18b57e4 [2018-10-24 13:17:10,016 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/57a78401b/7b05711e9bbd49b486c909482e0acc08 [2018-10-24 13:17:10,028 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 13:17:10,033 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 13:17:10,034 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 13:17:10,034 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 13:17:10,038 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 13:17:10,039 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 01:17:10" (1/1) ... [2018-10-24 13:17:10,043 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cab73e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:17:10, skipping insertion in model container [2018-10-24 13:17:10,043 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 01:17:10" (1/1) ... [2018-10-24 13:17:10,055 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 13:17:10,143 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 13:17:11,013 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 13:17:11,018 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 13:17:11,342 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 13:17:11,366 INFO L193 MainTranslator]: Completed translation [2018-10-24 13:17:11,367 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:17:11 WrapperNode [2018-10-24 13:17:11,367 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 13:17:11,368 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 13:17:11,368 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 13:17:11,368 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 13:17:11,381 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:17:11" (1/1) ... [2018-10-24 13:17:11,431 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:17:11" (1/1) ... [2018-10-24 13:17:11,678 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 13:17:11,679 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 13:17:11,679 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 13:17:11,679 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 13:17:11,690 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:17:11" (1/1) ... [2018-10-24 13:17:11,691 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:17:11" (1/1) ... [2018-10-24 13:17:11,698 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:17:11" (1/1) ... [2018-10-24 13:17:11,699 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:17:11" (1/1) ... [2018-10-24 13:17:11,740 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:17:11" (1/1) ... [2018-10-24 13:17:11,769 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:17:11" (1/1) ... [2018-10-24 13:17:11,779 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:17:11" (1/1) ... [2018-10-24 13:17:11,792 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 13:17:11,793 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 13:17:11,793 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 13:17:11,793 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 13:17:11,794 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:17:11" (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 13:17:11,869 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-24 13:17:11,870 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 13:17:11,870 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 13:17:17,483 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 13:17:17,484 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 01:17:17 BoogieIcfgContainer [2018-10-24 13:17:17,484 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 13:17:17,485 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 13:17:17,486 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 13:17:17,489 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 13:17:17,490 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 01:17:10" (1/3) ... [2018-10-24 13:17:17,490 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56ff4ef0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 01:17:17, skipping insertion in model container [2018-10-24 13:17:17,491 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:17:11" (2/3) ... [2018-10-24 13:17:17,491 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56ff4ef0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 01:17:17, skipping insertion in model container [2018-10-24 13:17:17,491 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 01:17:17" (3/3) ... [2018-10-24 13:17:17,494 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label28_false-unreach-call.c [2018-10-24 13:17:17,506 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 13:17:17,515 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 13:17:17,535 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 13:17:17,574 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-24 13:17:17,575 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 13:17:17,575 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 13:17:17,575 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 13:17:17,575 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 13:17:17,575 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 13:17:17,575 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 13:17:17,576 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 13:17:17,576 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 13:17:17,603 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states. [2018-10-24 13:17:17,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-10-24 13:17:17,620 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 13:17:17,622 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] [2018-10-24 13:17:17,625 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 13:17:17,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 13:17:17,632 INFO L82 PathProgramCache]: Analyzing trace with hash 1324610274, now seen corresponding path program 1 times [2018-10-24 13:17:17,634 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 13:17:17,635 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 13:17:17,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:17:17,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:17:17,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:17:17,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:17:18,514 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 13:17:18,517 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 13:17:18,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 13:17:18,524 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 13:17:18,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 13:17:18,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 13:17:18,544 INFO L87 Difference]: Start difference. First operand 303 states. Second operand 4 states. [2018-10-24 13:17:22,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 13:17:22,674 INFO L93 Difference]: Finished difference Result 1027 states and 1865 transitions. [2018-10-24 13:17:22,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 13:17:22,676 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2018-10-24 13:17:22,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 13:17:22,702 INFO L225 Difference]: With dead ends: 1027 [2018-10-24 13:17:22,703 INFO L226 Difference]: Without dead ends: 717 [2018-10-24 13:17:22,708 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 13:17:22,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2018-10-24 13:17:22,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 715. [2018-10-24 13:17:22,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 715 states. [2018-10-24 13:17:22,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 1145 transitions. [2018-10-24 13:17:22,800 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 1145 transitions. Word has length 153 [2018-10-24 13:17:22,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 13:17:22,801 INFO L481 AbstractCegarLoop]: Abstraction has 715 states and 1145 transitions. [2018-10-24 13:17:22,801 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 13:17:22,801 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1145 transitions. [2018-10-24 13:17:22,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-10-24 13:17:22,807 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 13:17:22,807 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:17:22,808 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 13:17:22,808 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 13:17:22,808 INFO L82 PathProgramCache]: Analyzing trace with hash 729772227, now seen corresponding path program 1 times [2018-10-24 13:17:22,808 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 13:17:22,808 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 13:17:22,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:17:22,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:17:22,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:17:22,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:17:22,961 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 13:17:22,962 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 13:17:22,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 13:17:22,964 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 13:17:22,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 13:17:22,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 13:17:22,965 INFO L87 Difference]: Start difference. First operand 715 states and 1145 transitions. Second operand 3 states. [2018-10-24 13:17:24,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 13:17:24,850 INFO L93 Difference]: Finished difference Result 2058 states and 3347 transitions. [2018-10-24 13:17:24,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 13:17:24,851 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 162 [2018-10-24 13:17:24,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 13:17:24,861 INFO L225 Difference]: With dead ends: 2058 [2018-10-24 13:17:24,861 INFO L226 Difference]: Without dead ends: 1345 [2018-10-24 13:17:24,865 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 13:17:24,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1345 states. [2018-10-24 13:17:24,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1345 to 1331. [2018-10-24 13:17:24,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1331 states. [2018-10-24 13:17:24,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1331 states to 1331 states and 2076 transitions. [2018-10-24 13:17:24,916 INFO L78 Accepts]: Start accepts. Automaton has 1331 states and 2076 transitions. Word has length 162 [2018-10-24 13:17:24,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 13:17:24,917 INFO L481 AbstractCegarLoop]: Abstraction has 1331 states and 2076 transitions. [2018-10-24 13:17:24,917 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 13:17:24,917 INFO L276 IsEmpty]: Start isEmpty. Operand 1331 states and 2076 transitions. [2018-10-24 13:17:24,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-10-24 13:17:24,925 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 13:17:24,925 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 13:17:24,926 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 13:17:24,926 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 13:17:24,926 INFO L82 PathProgramCache]: Analyzing trace with hash -292716689, now seen corresponding path program 1 times [2018-10-24 13:17:24,926 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 13:17:24,927 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 13:17:24,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:17:24,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:17:24,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:17:24,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:17:25,187 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-24 13:17:25,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 13:17:25,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 13:17:25,188 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 13:17:25,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 13:17:25,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 13:17:25,189 INFO L87 Difference]: Start difference. First operand 1331 states and 2076 transitions. Second operand 3 states. [2018-10-24 13:17:28,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 13:17:28,244 INFO L93 Difference]: Finished difference Result 3891 states and 6117 transitions. [2018-10-24 13:17:28,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 13:17:28,245 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 170 [2018-10-24 13:17:28,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 13:17:28,259 INFO L225 Difference]: With dead ends: 3891 [2018-10-24 13:17:28,260 INFO L226 Difference]: Without dead ends: 2562 [2018-10-24 13:17:28,263 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 13:17:28,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2562 states. [2018-10-24 13:17:28,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2562 to 2557. [2018-10-24 13:17:28,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2557 states. [2018-10-24 13:17:28,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2557 states to 2557 states and 3774 transitions. [2018-10-24 13:17:28,322 INFO L78 Accepts]: Start accepts. Automaton has 2557 states and 3774 transitions. Word has length 170 [2018-10-24 13:17:28,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 13:17:28,323 INFO L481 AbstractCegarLoop]: Abstraction has 2557 states and 3774 transitions. [2018-10-24 13:17:28,323 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 13:17:28,323 INFO L276 IsEmpty]: Start isEmpty. Operand 2557 states and 3774 transitions. [2018-10-24 13:17:28,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-10-24 13:17:28,329 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 13:17:28,331 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:17:28,331 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 13:17:28,332 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 13:17:28,332 INFO L82 PathProgramCache]: Analyzing trace with hash 2000314268, now seen corresponding path program 1 times [2018-10-24 13:17:28,332 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 13:17:28,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 13:17:28,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:17:28,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:17:28,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:17:28,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:17:28,492 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 13:17:28,493 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 13:17:28,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 13:17:28,493 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 13:17:28,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 13:17:28,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 13:17:28,494 INFO L87 Difference]: Start difference. First operand 2557 states and 3774 transitions. Second operand 3 states. [2018-10-24 13:17:29,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 13:17:29,809 INFO L93 Difference]: Finished difference Result 6396 states and 9368 transitions. [2018-10-24 13:17:29,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 13:17:29,809 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 182 [2018-10-24 13:17:29,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 13:17:29,830 INFO L225 Difference]: With dead ends: 6396 [2018-10-24 13:17:29,831 INFO L226 Difference]: Without dead ends: 3841 [2018-10-24 13:17:29,835 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 13:17:29,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3841 states. [2018-10-24 13:17:29,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3841 to 3837. [2018-10-24 13:17:29,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3837 states. [2018-10-24 13:17:29,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3837 states to 3837 states and 5572 transitions. [2018-10-24 13:17:29,991 INFO L78 Accepts]: Start accepts. Automaton has 3837 states and 5572 transitions. Word has length 182 [2018-10-24 13:17:29,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 13:17:29,991 INFO L481 AbstractCegarLoop]: Abstraction has 3837 states and 5572 transitions. [2018-10-24 13:17:29,991 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 13:17:29,992 INFO L276 IsEmpty]: Start isEmpty. Operand 3837 states and 5572 transitions. [2018-10-24 13:17:29,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-10-24 13:17:29,999 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 13:17:29,999 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:17:30,000 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 13:17:30,000 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 13:17:30,001 INFO L82 PathProgramCache]: Analyzing trace with hash -75866040, now seen corresponding path program 1 times [2018-10-24 13:17:30,001 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 13:17:30,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 13:17:30,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:17:30,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:17:30,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:17:30,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:17:30,329 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-24 13:17:30,503 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 39 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 13:17:30,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 13:17:30,504 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 13:17:30,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:17:30,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:17:30,652 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 13:17:30,753 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-24 13:17:30,780 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 13:17:30,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2018-10-24 13:17:30,781 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 13:17:30,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 13:17:30,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-24 13:17:30,782 INFO L87 Difference]: Start difference. First operand 3837 states and 5572 transitions. Second operand 6 states. [2018-10-24 13:17:37,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 13:17:37,188 INFO L93 Difference]: Finished difference Result 24481 states and 35515 transitions. [2018-10-24 13:17:37,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-24 13:17:37,188 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 190 [2018-10-24 13:17:37,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 13:17:37,270 INFO L225 Difference]: With dead ends: 24481 [2018-10-24 13:17:37,271 INFO L226 Difference]: Without dead ends: 20646 [2018-10-24 13:17:37,283 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-10-24 13:17:37,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20646 states. [2018-10-24 13:17:37,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20646 to 20571. [2018-10-24 13:17:37,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20571 states. [2018-10-24 13:17:37,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20571 states to 20571 states and 27034 transitions. [2018-10-24 13:17:37,815 INFO L78 Accepts]: Start accepts. Automaton has 20571 states and 27034 transitions. Word has length 190 [2018-10-24 13:17:37,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 13:17:37,816 INFO L481 AbstractCegarLoop]: Abstraction has 20571 states and 27034 transitions. [2018-10-24 13:17:37,817 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 13:17:37,817 INFO L276 IsEmpty]: Start isEmpty. Operand 20571 states and 27034 transitions. [2018-10-24 13:17:37,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2018-10-24 13:17:37,852 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 13:17:37,852 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:17:37,853 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 13:17:37,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 13:17:37,853 INFO L82 PathProgramCache]: Analyzing trace with hash -441917383, now seen corresponding path program 1 times [2018-10-24 13:17:37,853 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 13:17:37,854 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 13:17:37,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:17:37,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:17:37,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:17:37,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:17:38,016 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-10-24 13:17:38,017 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 13:17:38,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 13:17:38,018 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 13:17:38,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 13:17:38,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 13:17:38,018 INFO L87 Difference]: Start difference. First operand 20571 states and 27034 transitions. Second operand 4 states. [2018-10-24 13:17:40,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 13:17:40,032 INFO L93 Difference]: Finished difference Result 74750 states and 98801 transitions. [2018-10-24 13:17:40,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 13:17:40,033 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 221 [2018-10-24 13:17:40,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 13:17:40,146 INFO L225 Difference]: With dead ends: 74750 [2018-10-24 13:17:40,146 INFO L226 Difference]: Without dead ends: 54181 [2018-10-24 13:17:40,178 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 13:17:40,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54181 states. [2018-10-24 13:17:40,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54181 to 37932. [2018-10-24 13:17:40,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37932 states. [2018-10-24 13:17:40,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37932 states to 37932 states and 48172 transitions. [2018-10-24 13:17:40,802 INFO L78 Accepts]: Start accepts. Automaton has 37932 states and 48172 transitions. Word has length 221 [2018-10-24 13:17:40,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 13:17:40,802 INFO L481 AbstractCegarLoop]: Abstraction has 37932 states and 48172 transitions. [2018-10-24 13:17:40,802 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 13:17:40,802 INFO L276 IsEmpty]: Start isEmpty. Operand 37932 states and 48172 transitions. [2018-10-24 13:17:40,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2018-10-24 13:17:40,856 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 13:17:40,856 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:17:40,857 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 13:17:40,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 13:17:40,857 INFO L82 PathProgramCache]: Analyzing trace with hash 703323991, now seen corresponding path program 1 times [2018-10-24 13:17:40,857 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 13:17:40,857 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 13:17:40,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:17:40,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:17:40,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:17:40,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:17:41,265 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-24 13:17:41,266 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 13:17:41,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 13:17:41,266 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 13:17:41,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 13:17:41,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 13:17:41,267 INFO L87 Difference]: Start difference. First operand 37932 states and 48172 transitions. Second operand 5 states. [2018-10-24 13:17:44,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 13:17:44,414 INFO L93 Difference]: Finished difference Result 126163 states and 159704 transitions. [2018-10-24 13:17:44,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 13:17:44,419 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 225 [2018-10-24 13:17:44,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 13:17:44,578 INFO L225 Difference]: With dead ends: 126163 [2018-10-24 13:17:44,579 INFO L226 Difference]: Without dead ends: 88233 [2018-10-24 13:17:44,630 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 13:17:44,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88233 states. [2018-10-24 13:17:45,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88233 to 88220. [2018-10-24 13:17:45,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88220 states. [2018-10-24 13:17:45,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88220 states to 88220 states and 108664 transitions. [2018-10-24 13:17:45,589 INFO L78 Accepts]: Start accepts. Automaton has 88220 states and 108664 transitions. Word has length 225 [2018-10-24 13:17:45,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 13:17:45,589 INFO L481 AbstractCegarLoop]: Abstraction has 88220 states and 108664 transitions. [2018-10-24 13:17:45,589 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 13:17:45,589 INFO L276 IsEmpty]: Start isEmpty. Operand 88220 states and 108664 transitions. [2018-10-24 13:17:45,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2018-10-24 13:17:45,652 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 13:17:45,653 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:17:45,653 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 13:17:45,653 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 13:17:45,654 INFO L82 PathProgramCache]: Analyzing trace with hash 2089000476, now seen corresponding path program 1 times [2018-10-24 13:17:45,654 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 13:17:45,654 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 13:17:45,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:17:45,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:17:45,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:17:45,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:17:46,255 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-10-24 13:17:46,255 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 13:17:46,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 13:17:46,256 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 13:17:46,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 13:17:46,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 13:17:46,257 INFO L87 Difference]: Start difference. First operand 88220 states and 108664 transitions. Second operand 3 states. [2018-10-24 13:17:47,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 13:17:47,424 INFO L93 Difference]: Finished difference Result 168731 states and 207345 transitions. [2018-10-24 13:17:47,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 13:17:47,424 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 264 [2018-10-24 13:17:47,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 13:17:47,524 INFO L225 Difference]: With dead ends: 168731 [2018-10-24 13:17:47,524 INFO L226 Difference]: Without dead ends: 80513 [2018-10-24 13:17:47,586 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 13:17:47,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80513 states. [2018-10-24 13:17:48,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80513 to 80513. [2018-10-24 13:17:48,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80513 states. [2018-10-24 13:17:48,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80513 states to 80513 states and 97363 transitions. [2018-10-24 13:17:48,374 INFO L78 Accepts]: Start accepts. Automaton has 80513 states and 97363 transitions. Word has length 264 [2018-10-24 13:17:48,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 13:17:48,374 INFO L481 AbstractCegarLoop]: Abstraction has 80513 states and 97363 transitions. [2018-10-24 13:17:48,374 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 13:17:48,374 INFO L276 IsEmpty]: Start isEmpty. Operand 80513 states and 97363 transitions. [2018-10-24 13:17:48,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2018-10-24 13:17:48,401 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 13:17:48,401 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 13:17:48,401 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 13:17:48,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 13:17:48,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1369324177, now seen corresponding path program 1 times [2018-10-24 13:17:48,402 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 13:17:48,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 13:17:48,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:17:48,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:17:48,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:17:48,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:17:48,739 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-10-24 13:17:48,739 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 13:17:48,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 13:17:48,740 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 13:17:48,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 13:17:48,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 13:17:48,740 INFO L87 Difference]: Start difference. First operand 80513 states and 97363 transitions. Second operand 4 states. [2018-10-24 13:17:51,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 13:17:51,138 INFO L93 Difference]: Finished difference Result 158145 states and 191328 transitions. [2018-10-24 13:17:51,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 13:17:51,138 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 279 [2018-10-24 13:17:51,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 13:17:51,243 INFO L225 Difference]: With dead ends: 158145 [2018-10-24 13:17:51,244 INFO L226 Difference]: Without dead ends: 77634 [2018-10-24 13:17:51,299 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 13:17:51,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77634 states. [2018-10-24 13:17:52,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77634 to 76410. [2018-10-24 13:17:52,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76410 states. [2018-10-24 13:17:52,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76410 states to 76410 states and 87917 transitions. [2018-10-24 13:17:52,291 INFO L78 Accepts]: Start accepts. Automaton has 76410 states and 87917 transitions. Word has length 279 [2018-10-24 13:17:52,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 13:17:52,291 INFO L481 AbstractCegarLoop]: Abstraction has 76410 states and 87917 transitions. [2018-10-24 13:17:52,291 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 13:17:52,292 INFO L276 IsEmpty]: Start isEmpty. Operand 76410 states and 87917 transitions. [2018-10-24 13:17:52,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-10-24 13:17:52,314 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 13:17:52,315 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 13:17:52,315 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 13:17:52,315 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 13:17:52,316 INFO L82 PathProgramCache]: Analyzing trace with hash 797567040, now seen corresponding path program 1 times [2018-10-24 13:17:52,316 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 13:17:52,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 13:17:52,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:17:52,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:17:52,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:17:52,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:17:52,649 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2018-10-24 13:17:52,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 13:17:52,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 13:17:52,650 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 13:17:52,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 13:17:52,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 13:17:52,651 INFO L87 Difference]: Start difference. First operand 76410 states and 87917 transitions. Second operand 4 states. [2018-10-24 13:17:55,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 13:17:55,664 INFO L93 Difference]: Finished difference Result 278773 states and 320534 transitions. [2018-10-24 13:17:55,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 13:17:55,665 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 292 [2018-10-24 13:17:55,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 13:17:55,886 INFO L225 Difference]: With dead ends: 278773 [2018-10-24 13:17:55,886 INFO L226 Difference]: Without dead ends: 202365 [2018-10-24 13:17:55,953 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 13:17:56,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202365 states. [2018-10-24 13:17:58,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202365 to 199070. [2018-10-24 13:17:58,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199070 states. [2018-10-24 13:17:58,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199070 states to 199070 states and 228706 transitions. [2018-10-24 13:17:58,548 INFO L78 Accepts]: Start accepts. Automaton has 199070 states and 228706 transitions. Word has length 292 [2018-10-24 13:17:58,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 13:17:58,548 INFO L481 AbstractCegarLoop]: Abstraction has 199070 states and 228706 transitions. [2018-10-24 13:17:58,548 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 13:17:58,548 INFO L276 IsEmpty]: Start isEmpty. Operand 199070 states and 228706 transitions. [2018-10-24 13:17:58,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2018-10-24 13:17:58,564 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 13:17:58,565 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 13:17:58,565 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 13:17:58,565 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 13:17:58,565 INFO L82 PathProgramCache]: Analyzing trace with hash -1732862087, now seen corresponding path program 1 times [2018-10-24 13:17:58,566 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 13:17:58,566 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 13:17:58,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:17:58,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:17:58,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:17:58,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:17:59,031 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 205 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 13:17:59,032 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 13:17:59,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 13:17:59,033 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 13:17:59,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 13:17:59,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 13:17:59,033 INFO L87 Difference]: Start difference. First operand 199070 states and 228706 transitions. Second operand 4 states. [2018-10-24 13:18:03,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 13:18:03,961 INFO L93 Difference]: Finished difference Result 468936 states and 535642 transitions. [2018-10-24 13:18:03,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 13:18:03,962 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 305 [2018-10-24 13:18:03,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 13:18:04,312 INFO L225 Difference]: With dead ends: 468936 [2018-10-24 13:18:04,312 INFO L226 Difference]: Without dead ends: 269868 [2018-10-24 13:18:04,441 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 13:18:04,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269868 states. [2018-10-24 13:18:08,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269868 to 269437. [2018-10-24 13:18:08,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269437 states. [2018-10-24 13:18:08,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269437 states to 269437 states and 302663 transitions. [2018-10-24 13:18:08,434 INFO L78 Accepts]: Start accepts. Automaton has 269437 states and 302663 transitions. Word has length 305 [2018-10-24 13:18:08,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 13:18:08,435 INFO L481 AbstractCegarLoop]: Abstraction has 269437 states and 302663 transitions. [2018-10-24 13:18:08,435 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 13:18:08,435 INFO L276 IsEmpty]: Start isEmpty. Operand 269437 states and 302663 transitions. [2018-10-24 13:18:08,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2018-10-24 13:18:08,464 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 13:18:08,464 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 13:18:08,464 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 13:18:08,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 13:18:08,465 INFO L82 PathProgramCache]: Analyzing trace with hash 179923740, now seen corresponding path program 1 times [2018-10-24 13:18:08,465 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 13:18:08,465 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 13:18:08,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:18:08,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:18:08,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:18:08,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:18:08,899 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2018-10-24 13:18:08,899 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 13:18:08,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 13:18:08,900 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 13:18:08,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 13:18:08,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 13:18:08,901 INFO L87 Difference]: Start difference. First operand 269437 states and 302663 transitions. Second operand 4 states. [2018-10-24 13:18:11,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 13:18:11,940 INFO L93 Difference]: Finished difference Result 540775 states and 607217 transitions. [2018-10-24 13:18:11,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 13:18:11,940 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 348 [2018-10-24 13:18:11,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 13:18:12,299 INFO L225 Difference]: With dead ends: 540775 [2018-10-24 13:18:12,300 INFO L226 Difference]: Without dead ends: 271340 [2018-10-24 13:18:12,494 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 13:18:12,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271340 states. [2018-10-24 13:18:22,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271340 to 268580. [2018-10-24 13:18:22,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268580 states. [2018-10-24 13:18:22,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268580 states to 268580 states and 299186 transitions. [2018-10-24 13:18:22,401 INFO L78 Accepts]: Start accepts. Automaton has 268580 states and 299186 transitions. Word has length 348 [2018-10-24 13:18:22,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 13:18:22,401 INFO L481 AbstractCegarLoop]: Abstraction has 268580 states and 299186 transitions. [2018-10-24 13:18:22,401 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 13:18:22,401 INFO L276 IsEmpty]: Start isEmpty. Operand 268580 states and 299186 transitions. [2018-10-24 13:18:22,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2018-10-24 13:18:22,428 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 13:18:22,428 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 13:18:22,428 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 13:18:22,429 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 13:18:22,429 INFO L82 PathProgramCache]: Analyzing trace with hash 2075183857, now seen corresponding path program 1 times [2018-10-24 13:18:22,429 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 13:18:22,429 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 13:18:22,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:18:22,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:18:22,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:18:22,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:18:22,640 INFO L134 CoverageAnalysis]: Checked inductivity of 434 backedges. 162 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2018-10-24 13:18:22,640 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 13:18:22,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 13:18:22,641 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 13:18:22,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 13:18:22,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 13:18:22,641 INFO L87 Difference]: Start difference. First operand 268580 states and 299186 transitions. Second operand 5 states. [2018-10-24 13:18:27,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 13:18:27,742 INFO L93 Difference]: Finished difference Result 679334 states and 758132 transitions. [2018-10-24 13:18:27,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 13:18:27,743 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 368 [2018-10-24 13:18:27,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 13:18:29,583 INFO L225 Difference]: With dead ends: 679334 [2018-10-24 13:18:29,583 INFO L226 Difference]: Without dead ends: 410756 [2018-10-24 13:18:29,700 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 13:18:29,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410756 states. [2018-10-24 13:18:34,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410756 to 406579. [2018-10-24 13:18:34,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 406579 states. [2018-10-24 13:18:35,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406579 states to 406579 states and 452962 transitions. [2018-10-24 13:18:35,351 INFO L78 Accepts]: Start accepts. Automaton has 406579 states and 452962 transitions. Word has length 368 [2018-10-24 13:18:35,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 13:18:35,352 INFO L481 AbstractCegarLoop]: Abstraction has 406579 states and 452962 transitions. [2018-10-24 13:18:35,352 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 13:18:35,352 INFO L276 IsEmpty]: Start isEmpty. Operand 406579 states and 452962 transitions. [2018-10-24 13:18:35,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2018-10-24 13:18:35,381 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 13:18:35,382 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 13:18:35,382 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 13:18:35,382 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 13:18:35,382 INFO L82 PathProgramCache]: Analyzing trace with hash 1022522118, now seen corresponding path program 1 times [2018-10-24 13:18:35,382 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 13:18:35,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 13:18:35,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:18:35,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:18:35,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:18:35,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:18:35,758 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 337 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-24 13:18:35,758 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 13:18:35,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 13:18:35,759 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 13:18:35,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 13:18:35,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 13:18:35,760 INFO L87 Difference]: Start difference. First operand 406579 states and 452962 transitions. Second operand 4 states. [2018-10-24 13:18:40,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 13:18:40,979 INFO L93 Difference]: Finished difference Result 824115 states and 918045 transitions. [2018-10-24 13:18:40,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 13:18:40,980 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 368 [2018-10-24 13:18:40,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 13:18:43,268 INFO L225 Difference]: With dead ends: 824115 [2018-10-24 13:18:43,268 INFO L226 Difference]: Without dead ends: 417538 [2018-10-24 13:18:43,453 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 13:18:43,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417538 states. [2018-10-24 13:18:54,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417538 to 396314. [2018-10-24 13:18:54,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396314 states. [2018-10-24 13:18:55,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396314 states to 396314 states and 440012 transitions. [2018-10-24 13:18:55,228 INFO L78 Accepts]: Start accepts. Automaton has 396314 states and 440012 transitions. Word has length 368 [2018-10-24 13:18:55,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 13:18:55,228 INFO L481 AbstractCegarLoop]: Abstraction has 396314 states and 440012 transitions. [2018-10-24 13:18:55,229 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 13:18:55,229 INFO L276 IsEmpty]: Start isEmpty. Operand 396314 states and 440012 transitions. [2018-10-24 13:18:55,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2018-10-24 13:18:55,251 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 13:18:55,251 INFO L375 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:18:55,251 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 13:18:55,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 13:18:55,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1775015508, now seen corresponding path program 1 times [2018-10-24 13:18:55,252 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 13:18:55,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 13:18:55,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:18:55,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:18:55,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:18:55,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:18:55,449 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 231 proven. 0 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2018-10-24 13:18:55,450 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 13:18:55,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 13:18:55,450 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 13:18:55,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 13:18:55,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 13:18:55,451 INFO L87 Difference]: Start difference. First operand 396314 states and 440012 transitions. Second operand 4 states. [2018-10-24 13:19:00,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 13:19:00,550 INFO L93 Difference]: Finished difference Result 811128 states and 901067 transitions. [2018-10-24 13:19:00,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 13:19:00,551 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 375 [2018-10-24 13:19:00,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 13:19:01,086 INFO L225 Difference]: With dead ends: 811128 [2018-10-24 13:19:01,086 INFO L226 Difference]: Without dead ends: 392272 [2018-10-24 13:19:01,321 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 13:19:01,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392272 states. [2018-10-24 13:19:06,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392272 to 321262. [2018-10-24 13:19:06,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321262 states. [2018-10-24 13:19:07,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321262 states to 321262 states and 350128 transitions. [2018-10-24 13:19:07,122 INFO L78 Accepts]: Start accepts. Automaton has 321262 states and 350128 transitions. Word has length 375 [2018-10-24 13:19:07,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 13:19:07,123 INFO L481 AbstractCegarLoop]: Abstraction has 321262 states and 350128 transitions. [2018-10-24 13:19:07,123 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 13:19:07,123 INFO L276 IsEmpty]: Start isEmpty. Operand 321262 states and 350128 transitions. [2018-10-24 13:19:07,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2018-10-24 13:19:07,149 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 13:19:07,150 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:19:07,150 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 13:19:07,150 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 13:19:07,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1461030302, now seen corresponding path program 1 times [2018-10-24 13:19:07,150 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 13:19:07,151 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 13:19:07,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:19:07,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:19:07,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:19:07,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:19:08,608 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 347 proven. 32 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2018-10-24 13:19:08,609 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 13:19:08,609 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 13:19:08,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:19:08,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:19:08,823 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 13:19:08,971 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 347 proven. 0 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2018-10-24 13:19:08,993 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 13:19:08,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 3 [2018-10-24 13:19:08,994 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 13:19:08,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 13:19:08,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 13:19:08,995 INFO L87 Difference]: Start difference. First operand 321262 states and 350128 transitions. Second operand 4 states. [2018-10-24 13:19:16,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 13:19:16,123 INFO L93 Difference]: Finished difference Result 1119387 states and 1215646 transitions. [2018-10-24 13:19:16,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 13:19:16,123 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 420 [2018-10-24 13:19:16,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 13:19:17,640 INFO L225 Difference]: With dead ends: 1119387 [2018-10-24 13:19:17,640 INFO L226 Difference]: Without dead ends: 798127 [2018-10-24 13:19:17,913 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 420 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 13:19:18,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 798127 states. [2018-10-24 13:19:35,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 798127 to 534707. [2018-10-24 13:19:35,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 534707 states. [2018-10-24 13:19:36,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534707 states to 534707 states and 579768 transitions. [2018-10-24 13:19:36,149 INFO L78 Accepts]: Start accepts. Automaton has 534707 states and 579768 transitions. Word has length 420 [2018-10-24 13:19:36,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 13:19:36,150 INFO L481 AbstractCegarLoop]: Abstraction has 534707 states and 579768 transitions. [2018-10-24 13:19:36,150 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 13:19:36,150 INFO L276 IsEmpty]: Start isEmpty. Operand 534707 states and 579768 transitions. [2018-10-24 13:19:36,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 428 [2018-10-24 13:19:36,225 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 13:19:36,225 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 13:19:36,226 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 13:19:36,226 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 13:19:36,226 INFO L82 PathProgramCache]: Analyzing trace with hash 235689142, now seen corresponding path program 1 times [2018-10-24 13:19:36,226 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 13:19:36,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 13:19:36,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:19:36,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:19:36,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:19:36,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:19:36,830 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-24 13:19:37,197 WARN L179 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 40 [2018-10-24 13:19:39,013 INFO L134 CoverageAnalysis]: Checked inductivity of 464 backedges. 352 proven. 77 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-10-24 13:19:39,013 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 13:19:39,013 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 13:19:39,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:19:39,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:19:39,207 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 13:19:39,496 INFO L134 CoverageAnalysis]: Checked inductivity of 464 backedges. 353 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2018-10-24 13:19:39,538 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 13:19:39,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 11 [2018-10-24 13:19:39,539 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-24 13:19:39,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-24 13:19:39,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2018-10-24 13:19:39,540 INFO L87 Difference]: Start difference. First operand 534707 states and 579768 transitions. Second operand 11 states. [2018-10-24 13:20:05,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 13:20:05,226 INFO L93 Difference]: Finished difference Result 2241898 states and 2422963 transitions. [2018-10-24 13:20:05,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-24 13:20:05,226 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 427 [2018-10-24 13:20:05,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 13:20:08,011 INFO L225 Difference]: With dead ends: 2241898 [2018-10-24 13:20:08,011 INFO L226 Difference]: Without dead ends: 1707193 [2018-10-24 13:20:08,326 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 459 GetRequests, 438 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2018-10-24 13:20:09,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1707193 states. Received shutdown request... [2018-10-24 13:20:35,994 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-24 13:20:35,999 WARN L205 ceAbstractionStarter]: Timeout [2018-10-24 13:20:35,999 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 01:20:35 BoogieIcfgContainer [2018-10-24 13:20:35,999 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-24 13:20:36,000 INFO L168 Benchmark]: Toolchain (without parser) took 205970.96 ms. Allocated memory was 1.5 GB in the beginning and 7.3 GB in the end (delta: 5.8 GB). Free memory was 1.4 GB in the beginning and 4.9 GB in the end (delta: -3.4 GB). Peak memory consumption was 5.2 GB. Max. memory is 7.1 GB. [2018-10-24 13:20:36,001 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 13:20:36,002 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1333.43 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 84.6 MB). Peak memory consumption was 84.6 MB. Max. memory is 7.1 GB. [2018-10-24 13:20:36,002 INFO L168 Benchmark]: Boogie Procedure Inliner took 310.46 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 760.2 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -894.8 MB). Peak memory consumption was 40.3 MB. Max. memory is 7.1 GB. [2018-10-24 13:20:36,003 INFO L168 Benchmark]: Boogie Preprocessor took 113.83 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. [2018-10-24 13:20:36,004 INFO L168 Benchmark]: RCFGBuilder took 5691.74 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 252.5 MB). Peak memory consumption was 252.5 MB. Max. memory is 7.1 GB. [2018-10-24 13:20:36,005 INFO L168 Benchmark]: TraceAbstraction took 198513.71 ms. Allocated memory was 2.3 GB in the beginning and 7.3 GB in the end (delta: 5.0 GB). Free memory was 2.0 GB in the beginning and 4.9 GB in the end (delta: -2.9 GB). Peak memory consumption was 5.0 GB. Max. memory is 7.1 GB. [2018-10-24 13:20:36,010 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1333.43 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 84.6 MB). Peak memory consumption was 84.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 310.46 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 760.2 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -894.8 MB). Peak memory consumption was 40.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 113.83 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 5691.74 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 252.5 MB). Peak memory consumption was 252.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 198513.71 ms. Allocated memory was 2.3 GB in the beginning and 7.3 GB in the end (delta: 5.0 GB). Free memory was 2.0 GB in the beginning and 4.9 GB in the end (delta: -2.9 GB). Peak memory consumption was 5.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1491]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1491). Cancelled while executing MinimizeSevpa. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 303 locations, 1 error locations. TIMEOUT Result, 198.4s OverallTime, 17 OverallIterations, 6 TraceHistogramMax, 97.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4019 SDtfs, 14658 SDslu, 4698 SDs, 0 SdLazy, 25856 SolverSat, 4903 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 47.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1127 GetRequests, 1067 SyntacticMatches, 3 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 3.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=534707occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 89.8s AutomataMinimizationTime, 17 MinimizatonAttempts, 383903 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 5.2s InterpolantComputationTime, 5786 NumberOfCodeBlocks, 5786 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 5766 ConstructedInterpolants, 0 QuantifiedInterpolants, 5832016 SizeOfPredicates, 1 NumberOfNonLiveVariables, 1826 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 20 InterpolantComputations, 17 PerfectInterpolantSequences, 4504/4617 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown