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_label09_false-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-0fd1304 [2018-10-23 17:13:22,191 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-23 17:13:22,197 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-23 17:13:22,214 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-23 17:13:22,215 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-23 17:13:22,216 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-23 17:13:22,217 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-23 17:13:22,219 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-23 17:13:22,221 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-23 17:13:22,222 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-23 17:13:22,223 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-23 17:13:22,223 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-23 17:13:22,224 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-23 17:13:22,225 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-23 17:13:22,226 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-23 17:13:22,227 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-23 17:13:22,228 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-23 17:13:22,230 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-23 17:13:22,232 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-23 17:13:22,234 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-23 17:13:22,235 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-23 17:13:22,236 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-23 17:13:22,239 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-23 17:13:22,239 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-23 17:13:22,239 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-23 17:13:22,241 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-23 17:13:22,242 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-23 17:13:22,242 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-23 17:13:22,243 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-23 17:13:22,245 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-23 17:13:22,245 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-23 17:13:22,246 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-23 17:13:22,246 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-23 17:13:22,246 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-23 17:13:22,247 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-23 17:13:22,248 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-23 17:13:22,248 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-23 17:13:22,263 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-23 17:13:22,264 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-23 17:13:22,265 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-23 17:13:22,265 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-23 17:13:22,266 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-23 17:13:22,266 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-23 17:13:22,266 INFO L133 SettingsManager]: * Use SBE=true [2018-10-23 17:13:22,266 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-23 17:13:22,267 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-23 17:13:22,269 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-23 17:13:22,269 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-23 17:13:22,269 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-23 17:13:22,269 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-23 17:13:22,270 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-23 17:13:22,270 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-23 17:13:22,270 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-23 17:13:22,270 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-23 17:13:22,270 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-23 17:13:22,271 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-23 17:13:22,271 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-23 17:13:22,271 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-23 17:13:22,271 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-23 17:13:22,271 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-23 17:13:22,272 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-23 17:13:22,272 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-23 17:13:22,272 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-23 17:13:22,272 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-23 17:13:22,272 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-23 17:13:22,338 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-23 17:13:22,355 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-23 17:13:22,359 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-23 17:13:22,361 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-23 17:13:22,361 INFO L276 PluginConnector]: CDTParser initialized [2018-10-23 17:13:22,362 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label09_false-unreach-call.c [2018-10-23 17:13:22,426 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/6437d4e2a/5f2f6ef4da484c32b229eaddff1c0355/FLAG91d211486 [2018-10-23 17:13:23,146 INFO L298 CDTParser]: Found 1 translation units. [2018-10-23 17:13:23,147 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label09_false-unreach-call.c [2018-10-23 17:13:23,170 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/6437d4e2a/5f2f6ef4da484c32b229eaddff1c0355/FLAG91d211486 [2018-10-23 17:13:23,192 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/6437d4e2a/5f2f6ef4da484c32b229eaddff1c0355 [2018-10-23 17:13:23,206 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-23 17:13:23,209 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-23 17:13:23,210 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-23 17:13:23,210 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-23 17:13:23,215 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-23 17:13:23,216 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 05:13:23" (1/1) ... [2018-10-23 17:13:23,219 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@727e68dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 05:13:23, skipping insertion in model container [2018-10-23 17:13:23,220 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 05:13:23" (1/1) ... [2018-10-23 17:13:23,230 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-23 17:13:23,329 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-23 17:13:24,147 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-23 17:13:24,156 INFO L189 MainTranslator]: Completed pre-run [2018-10-23 17:13:24,419 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-23 17:13:24,440 INFO L193 MainTranslator]: Completed translation [2018-10-23 17:13:24,441 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 05:13:24 WrapperNode [2018-10-23 17:13:24,441 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-23 17:13:24,442 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-23 17:13:24,442 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-23 17:13:24,442 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-23 17:13:24,453 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 05:13:24" (1/1) ... [2018-10-23 17:13:24,492 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 05:13:24" (1/1) ... [2018-10-23 17:13:24,725 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-23 17:13:24,725 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-23 17:13:24,726 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-23 17:13:24,726 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-23 17:13:24,737 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 05:13:24" (1/1) ... [2018-10-23 17:13:24,737 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 05:13:24" (1/1) ... [2018-10-23 17:13:24,745 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 05:13:24" (1/1) ... [2018-10-23 17:13:24,746 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 05:13:24" (1/1) ... [2018-10-23 17:13:24,805 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 05:13:24" (1/1) ... [2018-10-23 17:13:24,840 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 05:13:24" (1/1) ... [2018-10-23 17:13:24,863 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 05:13:24" (1/1) ... [2018-10-23 17:13:24,877 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-23 17:13:24,878 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-23 17:13:24,878 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-23 17:13:24,878 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-23 17:13:24,879 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 05:13:24" (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-23 17:13:24,955 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-23 17:13:24,955 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-23 17:13:24,955 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-23 17:13:29,960 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-23 17:13:29,961 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 05:13:29 BoogieIcfgContainer [2018-10-23 17:13:29,961 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-23 17:13:29,963 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-23 17:13:29,963 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-23 17:13:29,966 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-23 17:13:29,966 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.10 05:13:23" (1/3) ... [2018-10-23 17:13:29,967 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3528102f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 05:13:29, skipping insertion in model container [2018-10-23 17:13:29,968 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 05:13:24" (2/3) ... [2018-10-23 17:13:29,968 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3528102f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 05:13:29, skipping insertion in model container [2018-10-23 17:13:29,968 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 05:13:29" (3/3) ... [2018-10-23 17:13:29,970 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label09_false-unreach-call.c [2018-10-23 17:13:29,980 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-23 17:13:29,989 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-23 17:13:30,007 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-23 17:13:30,045 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-23 17:13:30,046 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-23 17:13:30,046 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-23 17:13:30,046 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-23 17:13:30,046 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-23 17:13:30,047 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-23 17:13:30,047 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-23 17:13:30,047 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-23 17:13:30,047 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-23 17:13:30,072 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states. [2018-10-23 17:13:30,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-10-23 17:13:30,088 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 17:13:30,089 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] [2018-10-23 17:13:30,092 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 17:13:30,097 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 17:13:30,097 INFO L82 PathProgramCache]: Analyzing trace with hash -1638960046, now seen corresponding path program 1 times [2018-10-23 17:13:30,099 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 17:13:30,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 17:13:30,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 17:13:30,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 17:13:30,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 17:13:30,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 17:13:31,054 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-23 17:13:31,057 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 17:13:31,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 17:13:31,063 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 17:13:31,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 17:13:31,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 17:13:31,083 INFO L87 Difference]: Start difference. First operand 303 states. Second operand 4 states. [2018-10-23 17:13:34,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 17:13:34,392 INFO L93 Difference]: Finished difference Result 1072 states and 1917 transitions. [2018-10-23 17:13:34,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 17:13:34,394 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2018-10-23 17:13:34,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 17:13:34,424 INFO L225 Difference]: With dead ends: 1072 [2018-10-23 17:13:34,424 INFO L226 Difference]: Without dead ends: 762 [2018-10-23 17:13:34,429 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-23 17:13:34,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2018-10-23 17:13:34,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 518. [2018-10-23 17:13:34,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 518 states. [2018-10-23 17:13:34,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 855 transitions. [2018-10-23 17:13:34,512 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 855 transitions. Word has length 149 [2018-10-23 17:13:34,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 17:13:34,513 INFO L481 AbstractCegarLoop]: Abstraction has 518 states and 855 transitions. [2018-10-23 17:13:34,514 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 17:13:34,514 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 855 transitions. [2018-10-23 17:13:34,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-10-23 17:13:34,518 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 17:13:34,519 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 17:13:34,519 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 17:13:34,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 17:13:34,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1214440191, now seen corresponding path program 1 times [2018-10-23 17:13:34,520 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 17:13:34,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 17:13:34,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 17:13:34,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 17:13:34,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 17:13:34,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 17:13:34,804 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 17:13:34,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 17:13:34,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 17:13:34,807 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 17:13:34,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 17:13:34,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 17:13:34,807 INFO L87 Difference]: Start difference. First operand 518 states and 855 transitions. Second operand 4 states. [2018-10-23 17:13:37,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 17:13:37,931 INFO L93 Difference]: Finished difference Result 1917 states and 3253 transitions. [2018-10-23 17:13:37,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 17:13:37,931 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2018-10-23 17:13:37,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 17:13:37,940 INFO L225 Difference]: With dead ends: 1917 [2018-10-23 17:13:37,941 INFO L226 Difference]: Without dead ends: 1401 [2018-10-23 17:13:37,945 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-23 17:13:37,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1401 states. [2018-10-23 17:13:37,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1401 to 933. [2018-10-23 17:13:37,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 933 states. [2018-10-23 17:13:37,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 1472 transitions. [2018-10-23 17:13:37,989 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 1472 transitions. Word has length 155 [2018-10-23 17:13:37,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 17:13:37,990 INFO L481 AbstractCegarLoop]: Abstraction has 933 states and 1472 transitions. [2018-10-23 17:13:37,990 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 17:13:37,990 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1472 transitions. [2018-10-23 17:13:37,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-10-23 17:13:37,994 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 17:13:37,994 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] [2018-10-23 17:13:37,995 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 17:13:37,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 17:13:37,995 INFO L82 PathProgramCache]: Analyzing trace with hash 1128204979, now seen corresponding path program 1 times [2018-10-23 17:13:37,995 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 17:13:37,995 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 17:13:37,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 17:13:37,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 17:13:37,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 17:13:38,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 17:13:38,109 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-23 17:13:38,110 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 17:13:38,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-23 17:13:38,111 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 17:13:38,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 17:13:38,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 17:13:38,111 INFO L87 Difference]: Start difference. First operand 933 states and 1472 transitions. Second operand 3 states. [2018-10-23 17:13:42,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 17:13:42,111 INFO L93 Difference]: Finished difference Result 2699 states and 4315 transitions. [2018-10-23 17:13:42,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 17:13:42,111 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2018-10-23 17:13:42,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 17:13:42,121 INFO L225 Difference]: With dead ends: 2699 [2018-10-23 17:13:42,121 INFO L226 Difference]: Without dead ends: 1768 [2018-10-23 17:13:42,123 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-23 17:13:42,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1768 states. [2018-10-23 17:13:42,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1768 to 1751. [2018-10-23 17:13:42,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1751 states. [2018-10-23 17:13:42,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1751 states to 1751 states and 2699 transitions. [2018-10-23 17:13:42,161 INFO L78 Accepts]: Start accepts. Automaton has 1751 states and 2699 transitions. Word has length 158 [2018-10-23 17:13:42,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 17:13:42,162 INFO L481 AbstractCegarLoop]: Abstraction has 1751 states and 2699 transitions. [2018-10-23 17:13:42,162 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 17:13:42,162 INFO L276 IsEmpty]: Start isEmpty. Operand 1751 states and 2699 transitions. [2018-10-23 17:13:42,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-10-23 17:13:42,166 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 17:13:42,167 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2018-10-23 17:13:42,167 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 17:13:42,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 17:13:42,167 INFO L82 PathProgramCache]: Analyzing trace with hash 1150975335, now seen corresponding path program 1 times [2018-10-23 17:13:42,167 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 17:13:42,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 17:13:42,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 17:13:42,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 17:13:42,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 17:13:42,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 17:13:42,292 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-23 17:13:42,292 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 17:13:42,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-23 17:13:42,293 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 17:13:42,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 17:13:42,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 17:13:42,294 INFO L87 Difference]: Start difference. First operand 1751 states and 2699 transitions. Second operand 3 states. [2018-10-23 17:13:43,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 17:13:43,697 INFO L93 Difference]: Finished difference Result 4329 states and 6639 transitions. [2018-10-23 17:13:43,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 17:13:43,697 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 166 [2018-10-23 17:13:43,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 17:13:43,712 INFO L225 Difference]: With dead ends: 4329 [2018-10-23 17:13:43,712 INFO L226 Difference]: Without dead ends: 2580 [2018-10-23 17:13:43,715 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-23 17:13:43,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2580 states. [2018-10-23 17:13:43,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2580 to 2579. [2018-10-23 17:13:43,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2579 states. [2018-10-23 17:13:43,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2579 states to 2579 states and 3884 transitions. [2018-10-23 17:13:43,812 INFO L78 Accepts]: Start accepts. Automaton has 2579 states and 3884 transitions. Word has length 166 [2018-10-23 17:13:43,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 17:13:43,813 INFO L481 AbstractCegarLoop]: Abstraction has 2579 states and 3884 transitions. [2018-10-23 17:13:43,813 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 17:13:43,813 INFO L276 IsEmpty]: Start isEmpty. Operand 2579 states and 3884 transitions. [2018-10-23 17:13:43,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-10-23 17:13:43,818 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 17:13:43,818 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 17:13:43,818 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 17:13:43,819 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 17:13:43,819 INFO L82 PathProgramCache]: Analyzing trace with hash -687490482, now seen corresponding path program 1 times [2018-10-23 17:13:43,819 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 17:13:43,819 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 17:13:43,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 17:13:43,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 17:13:43,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 17:13:43,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 17:13:43,973 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-23 17:13:43,973 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 17:13:43,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-23 17:13:43,974 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 17:13:43,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 17:13:43,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 17:13:43,975 INFO L87 Difference]: Start difference. First operand 2579 states and 3884 transitions. Second operand 3 states. [2018-10-23 17:13:44,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 17:13:44,469 INFO L93 Difference]: Finished difference Result 7713 states and 11623 transitions. [2018-10-23 17:13:44,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 17:13:44,477 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 172 [2018-10-23 17:13:44,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 17:13:44,505 INFO L225 Difference]: With dead ends: 7713 [2018-10-23 17:13:44,505 INFO L226 Difference]: Without dead ends: 5136 [2018-10-23 17:13:44,510 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-23 17:13:44,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5136 states. [2018-10-23 17:13:44,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5136 to 5133. [2018-10-23 17:13:44,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5133 states. [2018-10-23 17:13:44,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5133 states to 5133 states and 7720 transitions. [2018-10-23 17:13:44,617 INFO L78 Accepts]: Start accepts. Automaton has 5133 states and 7720 transitions. Word has length 172 [2018-10-23 17:13:44,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 17:13:44,617 INFO L481 AbstractCegarLoop]: Abstraction has 5133 states and 7720 transitions. [2018-10-23 17:13:44,618 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 17:13:44,619 INFO L276 IsEmpty]: Start isEmpty. Operand 5133 states and 7720 transitions. [2018-10-23 17:13:44,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-10-23 17:13:44,628 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 17:13:44,629 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 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] [2018-10-23 17:13:44,629 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 17:13:44,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 17:13:44,631 INFO L82 PathProgramCache]: Analyzing trace with hash 541571989, now seen corresponding path program 1 times [2018-10-23 17:13:44,632 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 17:13:44,632 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 17:13:44,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 17:13:44,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 17:13:44,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 17:13:44,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 17:13:44,958 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 31 proven. 10 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-10-23 17:13:44,958 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 17:13:44,958 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-23 17:13:44,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 17:13:45,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 17:13:45,094 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 17:13:45,139 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-10-23 17:13:45,170 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-23 17:13:45,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 3 [2018-10-23 17:13:45,171 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 17:13:45,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 17:13:45,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 17:13:45,172 INFO L87 Difference]: Start difference. First operand 5133 states and 7720 transitions. Second operand 4 states. [2018-10-23 17:13:47,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 17:13:47,108 INFO L93 Difference]: Finished difference Result 20487 states and 30826 transitions. [2018-10-23 17:13:47,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 17:13:47,109 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 181 [2018-10-23 17:13:47,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 17:13:47,182 INFO L225 Difference]: With dead ends: 20487 [2018-10-23 17:13:47,183 INFO L226 Difference]: Without dead ends: 15356 [2018-10-23 17:13:47,194 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 181 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-23 17:13:47,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15356 states. [2018-10-23 17:13:47,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15356 to 10229. [2018-10-23 17:13:47,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10229 states. [2018-10-23 17:13:47,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10229 states to 10229 states and 15363 transitions. [2018-10-23 17:13:47,417 INFO L78 Accepts]: Start accepts. Automaton has 10229 states and 15363 transitions. Word has length 181 [2018-10-23 17:13:47,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 17:13:47,417 INFO L481 AbstractCegarLoop]: Abstraction has 10229 states and 15363 transitions. [2018-10-23 17:13:47,417 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 17:13:47,417 INFO L276 IsEmpty]: Start isEmpty. Operand 10229 states and 15363 transitions. [2018-10-23 17:13:47,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-10-23 17:13:47,430 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 17:13:47,431 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 17:13:47,431 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 17:13:47,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 17:13:47,431 INFO L82 PathProgramCache]: Analyzing trace with hash -387527722, now seen corresponding path program 1 times [2018-10-23 17:13:47,431 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 17:13:47,432 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 17:13:47,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 17:13:47,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 17:13:47,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 17:13:47,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 17:13:47,955 WARN L179 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2018-10-23 17:13:48,009 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 17:13:48,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 17:13:48,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-23 17:13:48,011 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-23 17:13:48,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-23 17:13:48,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-23 17:13:48,011 INFO L87 Difference]: Start difference. First operand 10229 states and 15363 transitions. Second operand 5 states. [2018-10-23 17:13:51,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 17:13:51,782 INFO L93 Difference]: Finished difference Result 23029 states and 35010 transitions. [2018-10-23 17:13:51,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-23 17:13:51,789 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 189 [2018-10-23 17:13:51,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 17:13:51,820 INFO L225 Difference]: With dead ends: 23029 [2018-10-23 17:13:51,821 INFO L226 Difference]: Without dead ends: 12802 [2018-10-23 17:13:51,939 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-23 17:13:51,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12802 states. [2018-10-23 17:13:52,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12802 to 11045. [2018-10-23 17:13:52,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11045 states. [2018-10-23 17:13:52,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11045 states to 11045 states and 16559 transitions. [2018-10-23 17:13:52,129 INFO L78 Accepts]: Start accepts. Automaton has 11045 states and 16559 transitions. Word has length 189 [2018-10-23 17:13:52,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 17:13:52,129 INFO L481 AbstractCegarLoop]: Abstraction has 11045 states and 16559 transitions. [2018-10-23 17:13:52,129 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-23 17:13:52,129 INFO L276 IsEmpty]: Start isEmpty. Operand 11045 states and 16559 transitions. [2018-10-23 17:13:52,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-10-23 17:13:52,147 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 17:13:52,148 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 17:13:52,148 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 17:13:52,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 17:13:52,148 INFO L82 PathProgramCache]: Analyzing trace with hash 1239035318, now seen corresponding path program 1 times [2018-10-23 17:13:52,148 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 17:13:52,149 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 17:13:52,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 17:13:52,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 17:13:52,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 17:13:52,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 17:13:52,584 WARN L179 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 10 [2018-10-23 17:13:52,694 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 52 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 17:13:52,694 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 17:13:52,694 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-23 17:13:52,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 17:13:52,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 17:13:52,809 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 17:13:52,880 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-23 17:13:52,900 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-23 17:13:52,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2018-10-23 17:13:52,901 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-23 17:13:52,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-23 17:13:52,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-10-23 17:13:52,902 INFO L87 Difference]: Start difference. First operand 11045 states and 16559 transitions. Second operand 7 states. [2018-10-23 17:13:59,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 17:13:59,221 INFO L93 Difference]: Finished difference Result 58087 states and 84612 transitions. [2018-10-23 17:13:59,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-23 17:13:59,221 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 199 [2018-10-23 17:13:59,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 17:13:59,309 INFO L225 Difference]: With dead ends: 58087 [2018-10-23 17:13:59,310 INFO L226 Difference]: Without dead ends: 47044 [2018-10-23 17:13:59,330 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2018-10-23 17:13:59,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47044 states. [2018-10-23 17:13:59,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47044 to 45802. [2018-10-23 17:13:59,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45802 states. [2018-10-23 17:14:00,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45802 states to 45802 states and 56728 transitions. [2018-10-23 17:14:00,033 INFO L78 Accepts]: Start accepts. Automaton has 45802 states and 56728 transitions. Word has length 199 [2018-10-23 17:14:00,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 17:14:00,034 INFO L481 AbstractCegarLoop]: Abstraction has 45802 states and 56728 transitions. [2018-10-23 17:14:00,034 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-23 17:14:00,034 INFO L276 IsEmpty]: Start isEmpty. Operand 45802 states and 56728 transitions. [2018-10-23 17:14:00,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-10-23 17:14:00,072 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 17:14:00,073 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 17:14:00,073 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 17:14:00,073 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 17:14:00,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1403738294, now seen corresponding path program 1 times [2018-10-23 17:14:00,074 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 17:14:00,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 17:14:00,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 17:14:00,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 17:14:00,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 17:14:00,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 17:14:00,200 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2018-10-23 17:14:00,201 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 17:14:00,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 17:14:00,201 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 17:14:00,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 17:14:00,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 17:14:00,202 INFO L87 Difference]: Start difference. First operand 45802 states and 56728 transitions. Second operand 3 states. [2018-10-23 17:14:02,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 17:14:02,487 INFO L93 Difference]: Finished difference Result 105278 states and 132483 transitions. [2018-10-23 17:14:02,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 17:14:02,487 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 211 [2018-10-23 17:14:02,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 17:14:02,594 INFO L225 Difference]: With dead ends: 105278 [2018-10-23 17:14:02,595 INFO L226 Difference]: Without dead ends: 59478 [2018-10-23 17:14:02,639 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 17:14:02,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59478 states. [2018-10-23 17:14:03,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59478 to 59470. [2018-10-23 17:14:03,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59470 states. [2018-10-23 17:14:03,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59470 states to 59470 states and 70980 transitions. [2018-10-23 17:14:03,972 INFO L78 Accepts]: Start accepts. Automaton has 59470 states and 70980 transitions. Word has length 211 [2018-10-23 17:14:03,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 17:14:03,973 INFO L481 AbstractCegarLoop]: Abstraction has 59470 states and 70980 transitions. [2018-10-23 17:14:03,973 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 17:14:03,973 INFO L276 IsEmpty]: Start isEmpty. Operand 59470 states and 70980 transitions. [2018-10-23 17:14:04,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-10-23 17:14:04,011 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 17:14:04,012 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 17:14:04,012 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 17:14:04,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 17:14:04,012 INFO L82 PathProgramCache]: Analyzing trace with hash -423272014, now seen corresponding path program 1 times [2018-10-23 17:14:04,013 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 17:14:04,013 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 17:14:04,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 17:14:04,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 17:14:04,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 17:14:04,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 17:14:04,225 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-10-23 17:14:04,225 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 17:14:04,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-23 17:14:04,226 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 17:14:04,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 17:14:04,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 17:14:04,227 INFO L87 Difference]: Start difference. First operand 59470 states and 70980 transitions. Second operand 3 states. [2018-10-23 17:14:05,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 17:14:05,824 INFO L93 Difference]: Finished difference Result 116382 states and 139036 transitions. [2018-10-23 17:14:05,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 17:14:05,824 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 232 [2018-10-23 17:14:05,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 17:14:05,930 INFO L225 Difference]: With dead ends: 116382 [2018-10-23 17:14:05,930 INFO L226 Difference]: Without dead ends: 56914 [2018-10-23 17:14:05,971 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-23 17:14:06,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56914 states. [2018-10-23 17:14:06,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56914 to 56914. [2018-10-23 17:14:06,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56914 states. [2018-10-23 17:14:06,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56914 states to 56914 states and 66991 transitions. [2018-10-23 17:14:06,691 INFO L78 Accepts]: Start accepts. Automaton has 56914 states and 66991 transitions. Word has length 232 [2018-10-23 17:14:06,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 17:14:06,692 INFO L481 AbstractCegarLoop]: Abstraction has 56914 states and 66991 transitions. [2018-10-23 17:14:06,692 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 17:14:06,692 INFO L276 IsEmpty]: Start isEmpty. Operand 56914 states and 66991 transitions. [2018-10-23 17:14:06,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-10-23 17:14:06,723 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 17:14:06,724 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 17:14:06,724 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 17:14:06,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 17:14:06,724 INFO L82 PathProgramCache]: Analyzing trace with hash 65700242, now seen corresponding path program 1 times [2018-10-23 17:14:06,724 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 17:14:06,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 17:14:06,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 17:14:06,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 17:14:06,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 17:14:06,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 17:14:06,969 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-23 17:14:06,969 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 17:14:06,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 17:14:06,970 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 17:14:06,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 17:14:06,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 17:14:06,970 INFO L87 Difference]: Start difference. First operand 56914 states and 66991 transitions. Second operand 4 states. [2018-10-23 17:14:09,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 17:14:09,165 INFO L93 Difference]: Finished difference Result 164183 states and 193655 transitions. [2018-10-23 17:14:09,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 17:14:09,165 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 252 [2018-10-23 17:14:09,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 17:14:09,296 INFO L225 Difference]: With dead ends: 164183 [2018-10-23 17:14:09,297 INFO L226 Difference]: Without dead ends: 107271 [2018-10-23 17:14:09,343 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-23 17:14:09,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107271 states. [2018-10-23 17:14:10,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107271 to 107269. [2018-10-23 17:14:10,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107269 states. [2018-10-23 17:14:10,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107269 states to 107269 states and 126518 transitions. [2018-10-23 17:14:10,490 INFO L78 Accepts]: Start accepts. Automaton has 107269 states and 126518 transitions. Word has length 252 [2018-10-23 17:14:10,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 17:14:10,491 INFO L481 AbstractCegarLoop]: Abstraction has 107269 states and 126518 transitions. [2018-10-23 17:14:10,491 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 17:14:10,491 INFO L276 IsEmpty]: Start isEmpty. Operand 107269 states and 126518 transitions. [2018-10-23 17:14:10,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2018-10-23 17:14:10,513 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 17:14:10,513 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-23 17:14:10,514 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 17:14:10,514 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 17:14:10,514 INFO L82 PathProgramCache]: Analyzing trace with hash -508054516, now seen corresponding path program 1 times [2018-10-23 17:14:10,514 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 17:14:10,514 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 17:14:10,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 17:14:10,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 17:14:10,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 17:14:10,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 17:14:10,757 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-10-23 17:14:10,757 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 17:14:10,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 17:14:10,758 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 17:14:10,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 17:14:10,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 17:14:10,758 INFO L87 Difference]: Start difference. First operand 107269 states and 126518 transitions. Second operand 4 states. [2018-10-23 17:14:14,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 17:14:14,248 INFO L93 Difference]: Finished difference Result 342982 states and 403342 transitions. [2018-10-23 17:14:14,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 17:14:14,249 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 290 [2018-10-23 17:14:14,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 17:14:14,532 INFO L225 Difference]: With dead ends: 342982 [2018-10-23 17:14:14,533 INFO L226 Difference]: Without dead ends: 235715 [2018-10-23 17:14:14,598 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 17:14:14,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235715 states. [2018-10-23 17:14:16,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235715 to 176416. [2018-10-23 17:14:16,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176416 states. [2018-10-23 17:14:17,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176416 states to 176416 states and 206181 transitions. [2018-10-23 17:14:17,903 INFO L78 Accepts]: Start accepts. Automaton has 176416 states and 206181 transitions. Word has length 290 [2018-10-23 17:14:17,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 17:14:17,903 INFO L481 AbstractCegarLoop]: Abstraction has 176416 states and 206181 transitions. [2018-10-23 17:14:17,903 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 17:14:17,903 INFO L276 IsEmpty]: Start isEmpty. Operand 176416 states and 206181 transitions. [2018-10-23 17:14:17,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2018-10-23 17:14:17,932 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 17:14:17,932 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-23 17:14:17,932 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 17:14:17,932 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 17:14:17,933 INFO L82 PathProgramCache]: Analyzing trace with hash 181568895, now seen corresponding path program 1 times [2018-10-23 17:14:17,933 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 17:14:17,933 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 17:14:17,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 17:14:17,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 17:14:17,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 17:14:17,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 17:14:18,216 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-10-23 17:14:18,217 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 17:14:18,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-23 17:14:18,217 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 17:14:18,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 17:14:18,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 17:14:18,218 INFO L87 Difference]: Start difference. First operand 176416 states and 206181 transitions. Second operand 3 states. [2018-10-23 17:14:20,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 17:14:20,171 INFO L93 Difference]: Finished difference Result 492155 states and 576041 transitions. [2018-10-23 17:14:20,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 17:14:20,171 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 303 [2018-10-23 17:14:20,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 17:14:20,561 INFO L225 Difference]: With dead ends: 492155 [2018-10-23 17:14:20,561 INFO L226 Difference]: Without dead ends: 315741 [2018-10-23 17:14:20,693 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-23 17:14:20,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315741 states. [2018-10-23 17:14:25,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315741 to 315735. [2018-10-23 17:14:25,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315735 states. [2018-10-23 17:14:25,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315735 states to 315735 states and 369658 transitions. [2018-10-23 17:14:25,503 INFO L78 Accepts]: Start accepts. Automaton has 315735 states and 369658 transitions. Word has length 303 [2018-10-23 17:14:25,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 17:14:25,503 INFO L481 AbstractCegarLoop]: Abstraction has 315735 states and 369658 transitions. [2018-10-23 17:14:25,503 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 17:14:25,503 INFO L276 IsEmpty]: Start isEmpty. Operand 315735 states and 369658 transitions. [2018-10-23 17:14:25,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2018-10-23 17:14:25,541 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 17:14:25,542 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-23 17:14:25,542 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 17:14:25,542 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 17:14:25,542 INFO L82 PathProgramCache]: Analyzing trace with hash -839453957, now seen corresponding path program 1 times [2018-10-23 17:14:25,543 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 17:14:25,543 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 17:14:25,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 17:14:25,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 17:14:25,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 17:14:25,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 17:14:25,899 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 200 proven. 8 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-10-23 17:14:25,899 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 17:14:25,899 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-23 17:14:25,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 17:14:26,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 17:14:26,070 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 17:14:32,773 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 200 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-10-23 17:14:32,812 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-23 17:14:32,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-10-23 17:14:32,814 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-23 17:14:32,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-23 17:14:32,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-23 17:14:32,814 INFO L87 Difference]: Start difference. First operand 315735 states and 369658 transitions. Second operand 5 states. [2018-10-23 17:14:37,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 17:14:37,782 INFO L93 Difference]: Finished difference Result 648344 states and 761187 transitions. [2018-10-23 17:14:37,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 17:14:37,783 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 311 [2018-10-23 17:14:37,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 17:14:38,246 INFO L225 Difference]: With dead ends: 648344 [2018-10-23 17:14:38,246 INFO L226 Difference]: Without dead ends: 332611 [2018-10-23 17:14:38,388 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 311 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-23 17:14:38,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332611 states. [2018-10-23 17:14:42,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332611 to 317091. [2018-10-23 17:14:42,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317091 states. [2018-10-23 17:14:43,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317091 states to 317091 states and 367632 transitions. [2018-10-23 17:14:43,263 INFO L78 Accepts]: Start accepts. Automaton has 317091 states and 367632 transitions. Word has length 311 [2018-10-23 17:14:43,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 17:14:43,263 INFO L481 AbstractCegarLoop]: Abstraction has 317091 states and 367632 transitions. [2018-10-23 17:14:43,263 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-23 17:14:43,263 INFO L276 IsEmpty]: Start isEmpty. Operand 317091 states and 367632 transitions. [2018-10-23 17:14:43,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2018-10-23 17:14:43,301 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 17:14:43,301 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 17:14:43,301 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 17:14:43,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 17:14:43,302 INFO L82 PathProgramCache]: Analyzing trace with hash 491571747, now seen corresponding path program 1 times [2018-10-23 17:14:43,302 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 17:14:43,302 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 17:14:43,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 17:14:43,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 17:14:43,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 17:14:43,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 17:14:43,516 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 206 proven. 0 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2018-10-23 17:14:43,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 17:14:43,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-23 17:14:43,517 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 17:14:43,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 17:14:43,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 17:14:43,518 INFO L87 Difference]: Start difference. First operand 317091 states and 367632 transitions. Second operand 3 states. [2018-10-23 17:14:47,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 17:14:47,147 INFO L93 Difference]: Finished difference Result 634164 states and 735246 transitions. [2018-10-23 17:14:47,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 17:14:47,147 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 342 [2018-10-23 17:14:47,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 17:14:47,525 INFO L225 Difference]: With dead ends: 634164 [2018-10-23 17:14:47,525 INFO L226 Difference]: Without dead ends: 317075 [2018-10-23 17:14:47,665 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-23 17:14:47,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317075 states. [2018-10-23 17:14:52,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317075 to 317075. [2018-10-23 17:14:52,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317075 states. [2018-10-23 17:14:53,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317075 states to 317075 states and 367600 transitions. [2018-10-23 17:14:53,093 INFO L78 Accepts]: Start accepts. Automaton has 317075 states and 367600 transitions. Word has length 342 [2018-10-23 17:14:53,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 17:14:53,093 INFO L481 AbstractCegarLoop]: Abstraction has 317075 states and 367600 transitions. [2018-10-23 17:14:53,093 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 17:14:53,093 INFO L276 IsEmpty]: Start isEmpty. Operand 317075 states and 367600 transitions. [2018-10-23 17:14:53,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2018-10-23 17:14:53,132 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 17:14:53,133 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-23 17:14:53,133 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 17:14:53,133 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 17:14:53,133 INFO L82 PathProgramCache]: Analyzing trace with hash 977755767, now seen corresponding path program 1 times [2018-10-23 17:14:53,134 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 17:14:53,134 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 17:14:53,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 17:14:53,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 17:14:53,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 17:14:53,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 17:14:53,318 INFO L134 CoverageAnalysis]: Checked inductivity of 428 backedges. 265 proven. 0 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2018-10-23 17:14:53,318 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 17:14:53,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 17:14:53,319 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 17:14:53,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 17:14:53,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 17:14:53,320 INFO L87 Difference]: Start difference. First operand 317075 states and 367600 transitions. Second operand 3 states. [2018-10-23 17:14:57,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 17:14:57,172 INFO L93 Difference]: Finished difference Result 600564 states and 695026 transitions. [2018-10-23 17:14:57,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 17:14:57,172 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 351 [2018-10-23 17:14:57,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 17:14:57,482 INFO L225 Difference]: With dead ends: 600564 [2018-10-23 17:14:57,482 INFO L226 Difference]: Without dead ends: 283491 [2018-10-23 17:14:57,594 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-23 17:14:57,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283491 states. [2018-10-23 17:15:05,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283491 to 283483. [2018-10-23 17:15:05,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283483 states. [2018-10-23 17:15:06,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283483 states to 283483 states and 315764 transitions. [2018-10-23 17:15:06,209 INFO L78 Accepts]: Start accepts. Automaton has 283483 states and 315764 transitions. Word has length 351 [2018-10-23 17:15:06,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 17:15:06,210 INFO L481 AbstractCegarLoop]: Abstraction has 283483 states and 315764 transitions. [2018-10-23 17:15:06,210 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 17:15:06,210 INFO L276 IsEmpty]: Start isEmpty. Operand 283483 states and 315764 transitions. [2018-10-23 17:15:06,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2018-10-23 17:15:06,248 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 17:15:06,249 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 17:15:06,249 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 17:15:06,249 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 17:15:06,249 INFO L82 PathProgramCache]: Analyzing trace with hash -272507335, now seen corresponding path program 1 times [2018-10-23 17:15:06,249 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 17:15:06,250 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 17:15:06,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 17:15:06,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 17:15:06,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 17:15:07,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 17:15:07,357 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 230 proven. 0 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2018-10-23 17:15:07,357 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 17:15:07,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 17:15:07,358 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 17:15:07,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 17:15:07,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 17:15:07,358 INFO L87 Difference]: Start difference. First operand 283483 states and 315764 transitions. Second operand 4 states. [2018-10-23 17:15:10,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 17:15:10,815 INFO L93 Difference]: Finished difference Result 565808 states and 630708 transitions. [2018-10-23 17:15:10,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 17:15:10,816 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 358 [2018-10-23 17:15:10,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 17:15:11,137 INFO L225 Difference]: With dead ends: 565808 [2018-10-23 17:15:11,137 INFO L226 Difference]: Without dead ends: 282327 [2018-10-23 17:15:11,284 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-23 17:15:11,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282327 states. [2018-10-23 17:15:16,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282327 to 278993. [2018-10-23 17:15:16,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278993 states. [2018-10-23 17:15:16,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278993 states to 278993 states and 307155 transitions. [2018-10-23 17:15:16,495 INFO L78 Accepts]: Start accepts. Automaton has 278993 states and 307155 transitions. Word has length 358 [2018-10-23 17:15:16,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 17:15:16,496 INFO L481 AbstractCegarLoop]: Abstraction has 278993 states and 307155 transitions. [2018-10-23 17:15:16,496 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 17:15:16,496 INFO L276 IsEmpty]: Start isEmpty. Operand 278993 states and 307155 transitions. [2018-10-23 17:15:16,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2018-10-23 17:15:16,530 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 17:15:16,531 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2018-10-23 17:15:16,531 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 17:15:16,531 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 17:15:16,531 INFO L82 PathProgramCache]: Analyzing trace with hash -1584353577, now seen corresponding path program 1 times [2018-10-23 17:15:16,531 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 17:15:16,532 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 17:15:16,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 17:15:16,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 17:15:16,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 17:15:16,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 17:15:16,868 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 317 proven. 0 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2018-10-23 17:15:16,868 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 17:15:16,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-23 17:15:16,869 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 17:15:16,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 17:15:16,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 17:15:16,869 INFO L87 Difference]: Start difference. First operand 278993 states and 307155 transitions. Second operand 4 states. [2018-10-23 17:15:20,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 17:15:20,778 INFO L93 Difference]: Finished difference Result 524999 states and 577635 transitions. [2018-10-23 17:15:20,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 17:15:20,778 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 371 [2018-10-23 17:15:20,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 17:15:21,107 INFO L225 Difference]: With dead ends: 524999 [2018-10-23 17:15:21,107 INFO L226 Difference]: Without dead ends: 246008 [2018-10-23 17:15:21,227 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-23 17:15:21,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246008 states. [2018-10-23 17:15:24,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246008 to 245992. [2018-10-23 17:15:24,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245992 states. [2018-10-23 17:15:25,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245992 states to 245992 states and 266429 transitions. [2018-10-23 17:15:25,025 INFO L78 Accepts]: Start accepts. Automaton has 245992 states and 266429 transitions. Word has length 371 [2018-10-23 17:15:25,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 17:15:25,026 INFO L481 AbstractCegarLoop]: Abstraction has 245992 states and 266429 transitions. [2018-10-23 17:15:25,026 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 17:15:25,026 INFO L276 IsEmpty]: Start isEmpty. Operand 245992 states and 266429 transitions. [2018-10-23 17:15:25,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 465 [2018-10-23 17:15:25,108 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 17:15:25,109 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 17:15:25,109 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 17:15:25,109 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 17:15:25,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1548582743, now seen corresponding path program 1 times [2018-10-23 17:15:25,110 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 17:15:25,110 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 17:15:25,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 17:15:25,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 17:15:25,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 17:15:25,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 17:15:26,534 INFO L134 CoverageAnalysis]: Checked inductivity of 623 backedges. 435 proven. 0 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2018-10-23 17:15:26,535 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 17:15:26,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-23 17:15:26,535 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 17:15:26,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 17:15:26,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 17:15:26,536 INFO L87 Difference]: Start difference. First operand 245992 states and 266429 transitions. Second operand 4 states. [2018-10-23 17:15:30,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 17:15:30,109 INFO L93 Difference]: Finished difference Result 488924 states and 529642 transitions. [2018-10-23 17:15:30,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 17:15:30,109 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 464 [2018-10-23 17:15:30,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 17:15:30,374 INFO L225 Difference]: With dead ends: 488924 [2018-10-23 17:15:30,374 INFO L226 Difference]: Without dead ends: 242934 [2018-10-23 17:15:30,487 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 17:15:30,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242934 states. [2018-10-23 17:15:33,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242934 to 242918. [2018-10-23 17:15:33,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242918 states. [2018-10-23 17:15:40,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242918 states to 242918 states and 260054 transitions. [2018-10-23 17:15:40,205 INFO L78 Accepts]: Start accepts. Automaton has 242918 states and 260054 transitions. Word has length 464 [2018-10-23 17:15:40,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 17:15:40,205 INFO L481 AbstractCegarLoop]: Abstraction has 242918 states and 260054 transitions. [2018-10-23 17:15:40,206 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 17:15:40,206 INFO L276 IsEmpty]: Start isEmpty. Operand 242918 states and 260054 transitions. [2018-10-23 17:15:40,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 487 [2018-10-23 17:15:40,260 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 17:15:40,261 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 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-23 17:15:40,261 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 17:15:40,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 17:15:40,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1908180572, now seen corresponding path program 1 times [2018-10-23 17:15:40,262 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 17:15:40,262 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 17:15:40,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 17:15:40,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 17:15:40,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 17:15:40,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 17:15:41,813 INFO L134 CoverageAnalysis]: Checked inductivity of 656 backedges. 439 proven. 173 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-10-23 17:15:41,813 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 17:15:41,813 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-23 17:15:41,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 17:15:42,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 17:15:42,016 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 17:15:42,802 WARN L179 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-10-23 17:15:43,259 WARN L179 SmtUtils]: Spent 263.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-10-23 17:15:43,998 INFO L134 CoverageAnalysis]: Checked inductivity of 656 backedges. 583 proven. 29 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-10-23 17:15:44,021 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-23 17:15:44,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6] total 13 [2018-10-23 17:15:44,022 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-23 17:15:44,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-23 17:15:44,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2018-10-23 17:15:44,023 INFO L87 Difference]: Start difference. First operand 242918 states and 260054 transitions. Second operand 14 states. [2018-10-23 17:15:44,283 WARN L179 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 42 [2018-10-23 17:15:46,571 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 44 [2018-10-23 17:15:49,096 WARN L179 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 36 [2018-10-23 17:16:03,237 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 39 [2018-10-23 17:16:03,382 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 40 [2018-10-23 17:16:10,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 17:16:10,750 INFO L93 Difference]: Finished difference Result 1246156 states and 1329612 transitions. [2018-10-23 17:16:10,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-10-23 17:16:10,750 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 486 [2018-10-23 17:16:10,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 17:16:13,380 INFO L225 Difference]: With dead ends: 1246156 [2018-10-23 17:16:13,380 INFO L226 Difference]: Without dead ends: 1003240 [2018-10-23 17:16:13,537 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 529 GetRequests, 482 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 651 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=595, Invalid=1661, Unknown=0, NotChecked=0, Total=2256 [2018-10-23 17:16:14,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003240 states. [2018-10-23 17:16:26,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003240 to 891046. [2018-10-23 17:16:26,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 891046 states. [2018-10-23 17:16:29,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 891046 states to 891046 states and 953593 transitions. [2018-10-23 17:16:29,700 INFO L78 Accepts]: Start accepts. Automaton has 891046 states and 953593 transitions. Word has length 486 [2018-10-23 17:16:29,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 17:16:29,700 INFO L481 AbstractCegarLoop]: Abstraction has 891046 states and 953593 transitions. [2018-10-23 17:16:29,700 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-23 17:16:29,700 INFO L276 IsEmpty]: Start isEmpty. Operand 891046 states and 953593 transitions. [2018-10-23 17:16:29,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 488 [2018-10-23 17:16:29,797 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 17:16:29,797 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-23 17:16:29,798 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 17:16:29,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 17:16:29,798 INFO L82 PathProgramCache]: Analyzing trace with hash -1489684767, now seen corresponding path program 1 times [2018-10-23 17:16:29,798 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 17:16:29,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 17:16:29,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 17:16:29,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 17:16:29,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 17:16:29,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 17:16:30,249 WARN L179 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-23 17:16:38,734 INFO L134 CoverageAnalysis]: Checked inductivity of 691 backedges. 407 proven. 63 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2018-10-23 17:16:38,735 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 17:16:38,735 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-23 17:16:38,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 17:16:38,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 17:16:38,953 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 17:16:39,431 INFO L134 CoverageAnalysis]: Checked inductivity of 691 backedges. 470 proven. 0 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2018-10-23 17:16:39,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-23 17:16:39,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2018-10-23 17:16:39,455 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-23 17:16:39,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-23 17:16:39,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-10-23 17:16:39,455 INFO L87 Difference]: Start difference. First operand 891046 states and 953593 transitions. Second operand 9 states. Received shutdown request... [2018-10-23 17:16:48,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-23 17:16:48,675 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-23 17:16:48,680 WARN L205 ceAbstractionStarter]: Timeout [2018-10-23 17:16:48,680 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.10 05:16:48 BoogieIcfgContainer [2018-10-23 17:16:48,681 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-23 17:16:48,681 INFO L168 Benchmark]: Toolchain (without parser) took 205474.29 ms. Allocated memory was 1.5 GB in the beginning and 6.4 GB in the end (delta: 4.9 GB). Free memory was 1.4 GB in the beginning and 4.1 GB in the end (delta: -2.7 GB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2018-10-23 17:16:48,682 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-23 17:16:48,683 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1231.58 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 74.0 MB). Peak memory consumption was 74.0 MB. Max. memory is 7.1 GB. [2018-10-23 17:16:48,684 INFO L168 Benchmark]: Boogie Procedure Inliner took 283.10 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 771.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -895.1 MB). Peak memory consumption was 40.3 MB. Max. memory is 7.1 GB. [2018-10-23 17:16:48,684 INFO L168 Benchmark]: Boogie Preprocessor took 152.07 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.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 7.1 GB. [2018-10-23 17:16:48,685 INFO L168 Benchmark]: RCFGBuilder took 5083.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: 253.2 MB). Peak memory consumption was 253.2 MB. Max. memory is 7.1 GB. [2018-10-23 17:16:48,686 INFO L168 Benchmark]: TraceAbstraction took 198718.12 ms. Allocated memory was 2.3 GB in the beginning and 6.4 GB in the end (delta: 4.1 GB). Free memory was 2.0 GB in the beginning and 4.1 GB in the end (delta: -2.1 GB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2018-10-23 17:16:48,691 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1231.58 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 74.0 MB). Peak memory consumption was 74.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 283.10 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 771.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -895.1 MB). Peak memory consumption was 40.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 152.07 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.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 5083.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: 253.2 MB). Peak memory consumption was 253.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 198718.12 ms. Allocated memory was 2.3 GB in the beginning and 6.4 GB in the end (delta: 4.1 GB). Free memory was 2.0 GB in the beginning and 4.1 GB in the end (delta: -2.1 GB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1479]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1479). Cancelled while BasicCegarLoop was constructing difference of abstraction (891046states) and FLOYD_HOARE automaton (currently 15 states, 9 states before enhancement),while ReachableStatesComputation was computing reachable states (573571 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 303 locations, 1 error locations. TIMEOUT Result, 198.6s OverallTime, 21 OverallIterations, 8 TraceHistogramMax, 102.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5336 SDtfs, 18869 SDslu, 5653 SDs, 0 SdLazy, 34358 SolverSat, 5929 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 54.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1793 GetRequests, 1683 SyntacticMatches, 9 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 708 ImplicationChecksByTransitivity, 8.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=891046occurred in iteration=20, 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: 66.5s AutomataMinimizationTime, 20 MinimizatonAttempts, 199262 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 1.3s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 14.9s InterpolantComputationTime, 7491 NumberOfCodeBlocks, 7491 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 7465 ConstructedInterpolants, 0 QuantifiedInterpolants, 12656903 SizeOfPredicates, 15 NumberOfNonLiveVariables, 2961 ConjunctsInSsa, 36 ConjunctsInUnsatCore, 26 InterpolantComputations, 20 PerfectInterpolantSequences, 6344/6631 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown