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_label38_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-0fd1304 [2018-10-23 18:55:34,263 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-23 18:55:34,266 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-23 18:55:34,285 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-23 18:55:34,285 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-23 18:55:34,287 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-23 18:55:34,288 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-23 18:55:34,291 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-23 18:55:34,294 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-23 18:55:34,295 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-23 18:55:34,297 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-23 18:55:34,298 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-23 18:55:34,299 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-23 18:55:34,300 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-23 18:55:34,309 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-23 18:55:34,310 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-23 18:55:34,313 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-23 18:55:34,314 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-23 18:55:34,316 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-23 18:55:34,318 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-23 18:55:34,319 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-23 18:55:34,320 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-23 18:55:34,322 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-23 18:55:34,322 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-23 18:55:34,322 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-23 18:55:34,323 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-23 18:55:34,324 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-23 18:55:34,325 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-23 18:55:34,325 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-23 18:55:34,326 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-23 18:55:34,327 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-23 18:55:34,327 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-23 18:55:34,327 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-23 18:55:34,328 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-23 18:55:34,329 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-23 18:55:34,329 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-23 18:55:34,330 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 18:55:34,356 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-23 18:55:34,359 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-23 18:55:34,360 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-23 18:55:34,360 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-23 18:55:34,361 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-23 18:55:34,361 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-23 18:55:34,361 INFO L133 SettingsManager]: * Use SBE=true [2018-10-23 18:55:34,361 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-23 18:55:34,361 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-23 18:55:34,362 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-23 18:55:34,363 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-23 18:55:34,363 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-23 18:55:34,363 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-23 18:55:34,363 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-23 18:55:34,363 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-23 18:55:34,364 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-23 18:55:34,364 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-23 18:55:34,364 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-23 18:55:34,364 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-23 18:55:34,364 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-23 18:55:34,365 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-23 18:55:34,366 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-23 18:55:34,366 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-23 18:55:34,366 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-23 18:55:34,366 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-23 18:55:34,366 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-23 18:55:34,367 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-23 18:55:34,367 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-23 18:55:34,436 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-23 18:55:34,454 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-23 18:55:34,460 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-23 18:55:34,461 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-23 18:55:34,462 INFO L276 PluginConnector]: CDTParser initialized [2018-10-23 18:55:34,462 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label38_true-unreach-call.c [2018-10-23 18:55:34,531 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/cdbf9d51c/0c9179bf788b42aea8deb7dfd27a0c1c/FLAG2a24a33e1 [2018-10-23 18:55:35,240 INFO L298 CDTParser]: Found 1 translation units. [2018-10-23 18:55:35,241 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label38_true-unreach-call.c [2018-10-23 18:55:35,259 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/cdbf9d51c/0c9179bf788b42aea8deb7dfd27a0c1c/FLAG2a24a33e1 [2018-10-23 18:55:35,277 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/cdbf9d51c/0c9179bf788b42aea8deb7dfd27a0c1c [2018-10-23 18:55:35,290 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-23 18:55:35,291 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-23 18:55:35,292 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-23 18:55:35,292 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-23 18:55:35,296 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-23 18:55:35,298 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 06:55:35" (1/1) ... [2018-10-23 18:55:35,301 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74ad6733 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:55:35, skipping insertion in model container [2018-10-23 18:55:35,301 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 06:55:35" (1/1) ... [2018-10-23 18:55:35,311 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-23 18:55:35,409 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-23 18:55:36,159 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-23 18:55:36,165 INFO L189 MainTranslator]: Completed pre-run [2018-10-23 18:55:36,402 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-23 18:55:36,427 INFO L193 MainTranslator]: Completed translation [2018-10-23 18:55:36,428 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:55:36 WrapperNode [2018-10-23 18:55:36,428 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-23 18:55:36,429 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-23 18:55:36,429 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-23 18:55:36,430 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-23 18:55:36,441 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:55:36" (1/1) ... [2018-10-23 18:55:36,480 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:55:36" (1/1) ... [2018-10-23 18:55:36,747 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-23 18:55:36,747 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-23 18:55:36,748 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-23 18:55:36,748 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-23 18:55:36,760 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:55:36" (1/1) ... [2018-10-23 18:55:36,760 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:55:36" (1/1) ... [2018-10-23 18:55:36,770 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:55:36" (1/1) ... [2018-10-23 18:55:36,771 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:55:36" (1/1) ... [2018-10-23 18:55:36,845 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:55:36" (1/1) ... [2018-10-23 18:55:36,877 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:55:36" (1/1) ... [2018-10-23 18:55:36,892 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:55:36" (1/1) ... [2018-10-23 18:55:36,902 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-23 18:55:36,903 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-23 18:55:36,903 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-23 18:55:36,903 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-23 18:55:36,906 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:55:36" (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 18:55:36,981 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-23 18:55:36,981 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-23 18:55:36,981 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-23 18:55:42,428 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-23 18:55:42,429 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 06:55:42 BoogieIcfgContainer [2018-10-23 18:55:42,429 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-23 18:55:42,430 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-23 18:55:42,430 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-23 18:55:42,434 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-23 18:55:42,434 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.10 06:55:35" (1/3) ... [2018-10-23 18:55:42,435 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2612b721 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 06:55:42, skipping insertion in model container [2018-10-23 18:55:42,435 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:55:36" (2/3) ... [2018-10-23 18:55:42,436 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2612b721 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 06:55:42, skipping insertion in model container [2018-10-23 18:55:42,436 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 06:55:42" (3/3) ... [2018-10-23 18:55:42,438 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label38_true-unreach-call.c [2018-10-23 18:55:42,449 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-23 18:55:42,458 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-23 18:55:42,476 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-23 18:55:42,515 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-23 18:55:42,516 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-23 18:55:42,516 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-23 18:55:42,516 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-23 18:55:42,516 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-23 18:55:42,517 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-23 18:55:42,517 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-23 18:55:42,517 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-23 18:55:42,517 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-23 18:55:42,545 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states. [2018-10-23 18:55:42,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-10-23 18:55:42,567 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:55:42,568 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:55:42,571 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:55:42,577 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:55:42,578 INFO L82 PathProgramCache]: Analyzing trace with hash -1988565156, now seen corresponding path program 1 times [2018-10-23 18:55:42,580 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:55:42,581 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:55:42,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:55:42,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:55:42,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:55:42,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:55:43,433 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 18:55:43,436 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:55:43,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-23 18:55:43,444 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:55:43,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:55:43,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:55:43,466 INFO L87 Difference]: Start difference. First operand 303 states. Second operand 3 states. [2018-10-23 18:55:45,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:55:45,852 INFO L93 Difference]: Finished difference Result 832 states and 1481 transitions. [2018-10-23 18:55:45,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:55:45,854 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 202 [2018-10-23 18:55:45,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:55:45,880 INFO L225 Difference]: With dead ends: 832 [2018-10-23 18:55:45,880 INFO L226 Difference]: Without dead ends: 525 [2018-10-23 18:55:45,886 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 18:55:45,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2018-10-23 18:55:45,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 511. [2018-10-23 18:55:45,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 511 states. [2018-10-23 18:55:45,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 878 transitions. [2018-10-23 18:55:45,973 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 878 transitions. Word has length 202 [2018-10-23 18:55:45,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:55:45,975 INFO L481 AbstractCegarLoop]: Abstraction has 511 states and 878 transitions. [2018-10-23 18:55:45,975 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:55:45,975 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 878 transitions. [2018-10-23 18:55:45,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-10-23 18:55:45,982 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:55:45,983 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:55:45,983 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:55:45,983 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:55:45,984 INFO L82 PathProgramCache]: Analyzing trace with hash 170905101, now seen corresponding path program 1 times [2018-10-23 18:55:45,984 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:55:45,984 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:55:45,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:55:45,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:55:45,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:55:46,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:55:46,338 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-10-23 18:55:46,440 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 18:55:46,441 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:55:46,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:55:46,527 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:55:46,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:55:46,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:55:46,530 INFO L87 Difference]: Start difference. First operand 511 states and 878 transitions. Second operand 4 states. [2018-10-23 18:55:51,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:55:51,561 INFO L93 Difference]: Finished difference Result 1893 states and 3348 transitions. [2018-10-23 18:55:51,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:55:51,562 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 208 [2018-10-23 18:55:51,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:55:51,571 INFO L225 Difference]: With dead ends: 1893 [2018-10-23 18:55:51,572 INFO L226 Difference]: Without dead ends: 1384 [2018-10-23 18:55:51,576 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:55:51,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1384 states. [2018-10-23 18:55:51,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1384 to 923. [2018-10-23 18:55:51,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 923 states. [2018-10-23 18:55:51,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1514 transitions. [2018-10-23 18:55:51,638 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1514 transitions. Word has length 208 [2018-10-23 18:55:51,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:55:51,639 INFO L481 AbstractCegarLoop]: Abstraction has 923 states and 1514 transitions. [2018-10-23 18:55:51,639 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:55:51,639 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1514 transitions. [2018-10-23 18:55:51,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-10-23 18:55:51,647 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:55:51,647 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:55:51,648 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:55:51,648 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:55:51,648 INFO L82 PathProgramCache]: Analyzing trace with hash -461514232, now seen corresponding path program 1 times [2018-10-23 18:55:51,649 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:55:51,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:55:51,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:55:51,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:55:51,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:55:51,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:55:51,989 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 18:55:51,990 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:55:51,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:55:51,993 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:55:51,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:55:51,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:55:51,994 INFO L87 Difference]: Start difference. First operand 923 states and 1514 transitions. Second operand 3 states. [2018-10-23 18:55:53,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:55:53,794 INFO L93 Difference]: Finished difference Result 2673 states and 4433 transitions. [2018-10-23 18:55:53,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:55:53,795 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 210 [2018-10-23 18:55:53,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:55:53,807 INFO L225 Difference]: With dead ends: 2673 [2018-10-23 18:55:53,807 INFO L226 Difference]: Without dead ends: 1752 [2018-10-23 18:55:53,810 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 18:55:53,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1752 states. [2018-10-23 18:55:53,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1752 to 1751. [2018-10-23 18:55:53,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1751 states. [2018-10-23 18:55:53,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1751 states to 1751 states and 2699 transitions. [2018-10-23 18:55:53,853 INFO L78 Accepts]: Start accepts. Automaton has 1751 states and 2699 transitions. Word has length 210 [2018-10-23 18:55:53,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:55:53,854 INFO L481 AbstractCegarLoop]: Abstraction has 1751 states and 2699 transitions. [2018-10-23 18:55:53,854 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:55:53,854 INFO L276 IsEmpty]: Start isEmpty. Operand 1751 states and 2699 transitions. [2018-10-23 18:55:53,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-10-23 18:55:53,861 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:55:53,861 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:55:53,861 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:55:53,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:55:53,862 INFO L82 PathProgramCache]: Analyzing trace with hash -675094169, now seen corresponding path program 1 times [2018-10-23 18:55:53,862 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:55:53,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:55:53,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:55:53,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:55:53,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:55:53,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:55:54,049 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 18:55:54,049 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:55:54,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-23 18:55:54,050 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:55:54,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:55:54,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:55:54,051 INFO L87 Difference]: Start difference. First operand 1751 states and 2699 transitions. Second operand 3 states. [2018-10-23 18:55:55,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:55:55,788 INFO L93 Difference]: Finished difference Result 4329 states and 6639 transitions. [2018-10-23 18:55:55,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:55:55,788 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 219 [2018-10-23 18:55:55,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:55:55,802 INFO L225 Difference]: With dead ends: 4329 [2018-10-23 18:55:55,803 INFO L226 Difference]: Without dead ends: 2580 [2018-10-23 18:55:55,806 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:55:55,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2580 states. [2018-10-23 18:55:55,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2580 to 2579. [2018-10-23 18:55:55,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2579 states. [2018-10-23 18:55:55,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2579 states to 2579 states and 3884 transitions. [2018-10-23 18:55:55,865 INFO L78 Accepts]: Start accepts. Automaton has 2579 states and 3884 transitions. Word has length 219 [2018-10-23 18:55:55,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:55:55,866 INFO L481 AbstractCegarLoop]: Abstraction has 2579 states and 3884 transitions. [2018-10-23 18:55:55,866 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:55:55,866 INFO L276 IsEmpty]: Start isEmpty. Operand 2579 states and 3884 transitions. [2018-10-23 18:55:55,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2018-10-23 18:55:55,874 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:55:55,874 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:55:55,874 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:55:55,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:55:55,875 INFO L82 PathProgramCache]: Analyzing trace with hash 1924425440, now seen corresponding path program 1 times [2018-10-23 18:55:55,875 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:55:55,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:55:55,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:55:55,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:55:55,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:55:55,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:55:56,003 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 18:55:56,003 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:55:56,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-23 18:55:56,004 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:55:56,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:55:56,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:55:56,005 INFO L87 Difference]: Start difference. First operand 2579 states and 3884 transitions. Second operand 3 states. [2018-10-23 18:55:56,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:55:56,617 INFO L93 Difference]: Finished difference Result 7713 states and 11623 transitions. [2018-10-23 18:55:56,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:55:56,618 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 225 [2018-10-23 18:55:56,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:55:56,639 INFO L225 Difference]: With dead ends: 7713 [2018-10-23 18:55:56,639 INFO L226 Difference]: Without dead ends: 5136 [2018-10-23 18:55:56,644 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 18:55:56,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5136 states. [2018-10-23 18:55:56,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5136 to 5133. [2018-10-23 18:55:56,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5133 states. [2018-10-23 18:55:56,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5133 states to 5133 states and 7720 transitions. [2018-10-23 18:55:56,759 INFO L78 Accepts]: Start accepts. Automaton has 5133 states and 7720 transitions. Word has length 225 [2018-10-23 18:55:56,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:55:56,759 INFO L481 AbstractCegarLoop]: Abstraction has 5133 states and 7720 transitions. [2018-10-23 18:55:56,759 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:55:56,760 INFO L276 IsEmpty]: Start isEmpty. Operand 5133 states and 7720 transitions. [2018-10-23 18:55:56,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-10-23 18:55:56,773 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:55:56,774 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:55:56,774 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:55:56,774 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:55:56,775 INFO L82 PathProgramCache]: Analyzing trace with hash -942595079, now seen corresponding path program 1 times [2018-10-23 18:55:56,775 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:55:56,775 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:55:56,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:55:56,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:55:56,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:55:56,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:55:57,128 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 18:55:57,128 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 18:55:57,129 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 18:55:57,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:55:57,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:55:57,282 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 18:55:57,359 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 18:55:57,398 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-23 18:55:57,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 3 [2018-10-23 18:55:57,399 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:55:57,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:55:57,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:55:57,400 INFO L87 Difference]: Start difference. First operand 5133 states and 7720 transitions. Second operand 4 states. [2018-10-23 18:55:59,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:55:59,788 INFO L93 Difference]: Finished difference Result 20487 states and 30826 transitions. [2018-10-23 18:55:59,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:55:59,789 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 234 [2018-10-23 18:55:59,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:55:59,851 INFO L225 Difference]: With dead ends: 20487 [2018-10-23 18:55:59,851 INFO L226 Difference]: Without dead ends: 15356 [2018-10-23 18:55:59,863 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 234 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 18:55:59,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15356 states. [2018-10-23 18:56:00,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15356 to 10229. [2018-10-23 18:56:00,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10229 states. [2018-10-23 18:56:00,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10229 states to 10229 states and 15363 transitions. [2018-10-23 18:56:00,141 INFO L78 Accepts]: Start accepts. Automaton has 10229 states and 15363 transitions. Word has length 234 [2018-10-23 18:56:00,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:56:00,141 INFO L481 AbstractCegarLoop]: Abstraction has 10229 states and 15363 transitions. [2018-10-23 18:56:00,141 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:56:00,142 INFO L276 IsEmpty]: Start isEmpty. Operand 10229 states and 15363 transitions. [2018-10-23 18:56:00,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-10-23 18:56:00,163 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:56:00,163 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:56:00,164 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:56:00,164 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:56:00,164 INFO L82 PathProgramCache]: Analyzing trace with hash -42517928, now seen corresponding path program 1 times [2018-10-23 18:56:00,164 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:56:00,165 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:56:00,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:56:00,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:56:00,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:56:00,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:56:00,559 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 18:56:00,559 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:56:00,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-23 18:56:00,560 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-23 18:56:00,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-23 18:56:00,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-23 18:56:00,561 INFO L87 Difference]: Start difference. First operand 10229 states and 15363 transitions. Second operand 5 states. [2018-10-23 18:56:05,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:56:05,237 INFO L93 Difference]: Finished difference Result 23029 states and 35010 transitions. [2018-10-23 18:56:05,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-23 18:56:05,245 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 242 [2018-10-23 18:56:05,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:56:05,281 INFO L225 Difference]: With dead ends: 23029 [2018-10-23 18:56:05,281 INFO L226 Difference]: Without dead ends: 12802 [2018-10-23 18:56:05,294 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-23 18:56:05,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12802 states. [2018-10-23 18:56:05,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12802 to 11045. [2018-10-23 18:56:05,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11045 states. [2018-10-23 18:56:05,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11045 states to 11045 states and 16559 transitions. [2018-10-23 18:56:05,538 INFO L78 Accepts]: Start accepts. Automaton has 11045 states and 16559 transitions. Word has length 242 [2018-10-23 18:56:05,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:56:05,538 INFO L481 AbstractCegarLoop]: Abstraction has 11045 states and 16559 transitions. [2018-10-23 18:56:05,538 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-23 18:56:05,538 INFO L276 IsEmpty]: Start isEmpty. Operand 11045 states and 16559 transitions. [2018-10-23 18:56:05,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-10-23 18:56:05,560 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:56:05,560 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:56:05,560 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:56:05,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:56:05,561 INFO L82 PathProgramCache]: Analyzing trace with hash 1670858200, now seen corresponding path program 1 times [2018-10-23 18:56:05,562 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:56:05,562 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:56:05,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:56:05,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:56:05,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:56:05,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:56:05,844 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-10-23 18:56:05,845 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:56:05,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:56:05,845 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:56:05,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:56:05,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:56:05,846 INFO L87 Difference]: Start difference. First operand 11045 states and 16559 transitions. Second operand 4 states. [2018-10-23 18:56:08,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:56:08,563 INFO L93 Difference]: Finished difference Result 41024 states and 61360 transitions. [2018-10-23 18:56:08,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:56:08,565 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 242 [2018-10-23 18:56:08,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:56:08,636 INFO L225 Difference]: With dead ends: 41024 [2018-10-23 18:56:08,637 INFO L226 Difference]: Without dead ends: 29981 [2018-10-23 18:56:08,658 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 18:56:08,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29981 states. [2018-10-23 18:56:09,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29981 to 20440. [2018-10-23 18:56:09,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20440 states. [2018-10-23 18:56:09,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20440 states to 20440 states and 29051 transitions. [2018-10-23 18:56:09,044 INFO L78 Accepts]: Start accepts. Automaton has 20440 states and 29051 transitions. Word has length 242 [2018-10-23 18:56:09,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:56:09,044 INFO L481 AbstractCegarLoop]: Abstraction has 20440 states and 29051 transitions. [2018-10-23 18:56:09,044 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:56:09,044 INFO L276 IsEmpty]: Start isEmpty. Operand 20440 states and 29051 transitions. [2018-10-23 18:56:09,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2018-10-23 18:56:09,081 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:56:09,082 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:56:09,082 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:56:09,083 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:56:09,083 INFO L82 PathProgramCache]: Analyzing trace with hash -2012852909, now seen corresponding path program 1 times [2018-10-23 18:56:09,083 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:56:09,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:56:09,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:56:09,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:56:09,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:56:09,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:56:09,251 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-23 18:56:09,251 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:56:09,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:56:09,252 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:56:09,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:56:09,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:56:09,253 INFO L87 Difference]: Start difference. First operand 20440 states and 29051 transitions. Second operand 3 states. [2018-10-23 18:56:10,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:56:10,976 INFO L93 Difference]: Finished difference Result 40906 states and 58154 transitions. [2018-10-23 18:56:10,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:56:10,977 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 243 [2018-10-23 18:56:10,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:56:11,020 INFO L225 Difference]: With dead ends: 40906 [2018-10-23 18:56:11,020 INFO L226 Difference]: Without dead ends: 20468 [2018-10-23 18:56:11,047 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 18:56:11,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20468 states. [2018-10-23 18:56:11,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20468 to 20440. [2018-10-23 18:56:11,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20440 states. [2018-10-23 18:56:11,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20440 states to 20440 states and 27343 transitions. [2018-10-23 18:56:11,338 INFO L78 Accepts]: Start accepts. Automaton has 20440 states and 27343 transitions. Word has length 243 [2018-10-23 18:56:11,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:56:11,339 INFO L481 AbstractCegarLoop]: Abstraction has 20440 states and 27343 transitions. [2018-10-23 18:56:11,339 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:56:11,339 INFO L276 IsEmpty]: Start isEmpty. Operand 20440 states and 27343 transitions. [2018-10-23 18:56:11,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2018-10-23 18:56:11,368 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:56:11,369 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:56:11,370 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:56:11,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:56:11,370 INFO L82 PathProgramCache]: Analyzing trace with hash 1161717019, now seen corresponding path program 1 times [2018-10-23 18:56:11,370 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:56:11,371 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:56:11,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:56:11,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:56:11,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:56:11,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:56:11,532 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-10-23 18:56:11,532 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:56:11,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:56:11,533 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:56:11,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:56:11,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:56:11,534 INFO L87 Difference]: Start difference. First operand 20440 states and 27343 transitions. Second operand 3 states. [2018-10-23 18:56:13,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:56:13,458 INFO L93 Difference]: Finished difference Result 57404 states and 76442 transitions. [2018-10-23 18:56:13,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:56:13,459 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 250 [2018-10-23 18:56:13,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:56:13,517 INFO L225 Difference]: With dead ends: 57404 [2018-10-23 18:56:13,517 INFO L226 Difference]: Without dead ends: 36966 [2018-10-23 18:56:13,546 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 18:56:13,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36966 states. [2018-10-23 18:56:14,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36966 to 36958. [2018-10-23 18:56:14,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36958 states. [2018-10-23 18:56:14,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36958 states to 36958 states and 44611 transitions. [2018-10-23 18:56:14,081 INFO L78 Accepts]: Start accepts. Automaton has 36958 states and 44611 transitions. Word has length 250 [2018-10-23 18:56:14,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:56:14,082 INFO L481 AbstractCegarLoop]: Abstraction has 36958 states and 44611 transitions. [2018-10-23 18:56:14,082 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:56:14,082 INFO L276 IsEmpty]: Start isEmpty. Operand 36958 states and 44611 transitions. [2018-10-23 18:56:14,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2018-10-23 18:56:14,111 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:56:14,111 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:56:14,112 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:56:14,112 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:56:14,112 INFO L82 PathProgramCache]: Analyzing trace with hash -50667516, now seen corresponding path program 1 times [2018-10-23 18:56:14,113 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:56:14,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:56:14,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:56:14,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:56:14,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:56:14,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:56:14,575 WARN L179 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 10 [2018-10-23 18:56:14,819 WARN L179 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2018-10-23 18:56:15,152 WARN L179 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 9 [2018-10-23 18:56:15,240 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 78 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-10-23 18:56:15,240 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 18:56:15,240 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 18:56:15,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:56:15,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:56:15,390 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 18:56:15,739 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-10-23 18:56:15,762 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-23 18:56:15,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2018-10-23 18:56:15,763 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-23 18:56:15,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-23 18:56:15,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-10-23 18:56:15,763 INFO L87 Difference]: Start difference. First operand 36958 states and 44611 transitions. Second operand 7 states. [2018-10-23 18:56:22,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:56:22,449 INFO L93 Difference]: Finished difference Result 148408 states and 179941 transitions. [2018-10-23 18:56:22,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-23 18:56:22,449 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 273 [2018-10-23 18:56:22,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:56:22,603 INFO L225 Difference]: With dead ends: 148408 [2018-10-23 18:56:22,604 INFO L226 Difference]: Without dead ends: 111452 [2018-10-23 18:56:22,655 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2018-10-23 18:56:22,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111452 states. [2018-10-23 18:56:24,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111452 to 111428. [2018-10-23 18:56:24,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111428 states. [2018-10-23 18:56:24,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111428 states to 111428 states and 129315 transitions. [2018-10-23 18:56:24,351 INFO L78 Accepts]: Start accepts. Automaton has 111428 states and 129315 transitions. Word has length 273 [2018-10-23 18:56:24,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:56:24,351 INFO L481 AbstractCegarLoop]: Abstraction has 111428 states and 129315 transitions. [2018-10-23 18:56:24,352 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-23 18:56:24,352 INFO L276 IsEmpty]: Start isEmpty. Operand 111428 states and 129315 transitions. [2018-10-23 18:56:24,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2018-10-23 18:56:24,409 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:56:24,409 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:56:24,410 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:56:24,410 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:56:24,410 INFO L82 PathProgramCache]: Analyzing trace with hash -996362106, now seen corresponding path program 1 times [2018-10-23 18:56:24,411 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:56:24,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:56:24,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:56:24,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:56:24,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:56:24,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:56:24,742 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-10-23 18:56:24,820 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-10-23 18:56:24,820 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:56:24,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:56:24,821 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:56:24,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:56:24,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:56:24,822 INFO L87 Difference]: Start difference. First operand 111428 states and 129315 transitions. Second operand 4 states. [2018-10-23 18:56:29,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:56:29,418 INFO L93 Difference]: Finished difference Result 351941 states and 407982 transitions. [2018-10-23 18:56:29,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:56:29,419 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 302 [2018-10-23 18:56:29,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:56:29,734 INFO L225 Difference]: With dead ends: 351941 [2018-10-23 18:56:29,734 INFO L226 Difference]: Without dead ends: 240515 [2018-10-23 18:56:29,804 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:56:30,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240515 states. [2018-10-23 18:56:31,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240515 to 177289. [2018-10-23 18:56:31,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177289 states. [2018-10-23 18:56:33,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177289 states to 177289 states and 203822 transitions. [2018-10-23 18:56:33,360 INFO L78 Accepts]: Start accepts. Automaton has 177289 states and 203822 transitions. Word has length 302 [2018-10-23 18:56:33,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:56:33,360 INFO L481 AbstractCegarLoop]: Abstraction has 177289 states and 203822 transitions. [2018-10-23 18:56:33,360 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:56:33,360 INFO L276 IsEmpty]: Start isEmpty. Operand 177289 states and 203822 transitions. [2018-10-23 18:56:33,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2018-10-23 18:56:33,456 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:56:33,456 INFO L375 BasicCegarLoop]: trace histogram [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, 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] [2018-10-23 18:56:33,456 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:56:33,457 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:56:33,457 INFO L82 PathProgramCache]: Analyzing trace with hash 1793634105, now seen corresponding path program 1 times [2018-10-23 18:56:33,457 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:56:33,457 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:56:33,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:56:33,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:56:33,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:56:33,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:56:33,697 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-10-23 18:56:33,697 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:56:33,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-23 18:56:33,698 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:56:33,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:56:33,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:56:33,699 INFO L87 Difference]: Start difference. First operand 177289 states and 203822 transitions. Second operand 3 states. [2018-10-23 18:56:36,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:56:36,522 INFO L93 Difference]: Finished difference Result 354568 states and 407634 transitions. [2018-10-23 18:56:36,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:56:36,522 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 330 [2018-10-23 18:56:36,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:56:36,719 INFO L225 Difference]: With dead ends: 354568 [2018-10-23 18:56:36,719 INFO L226 Difference]: Without dead ends: 177281 [2018-10-23 18:56:36,812 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 18:56:36,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177281 states. [2018-10-23 18:56:40,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177281 to 177281. [2018-10-23 18:56:40,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177281 states. [2018-10-23 18:56:40,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177281 states to 177281 states and 203798 transitions. [2018-10-23 18:56:40,848 INFO L78 Accepts]: Start accepts. Automaton has 177281 states and 203798 transitions. Word has length 330 [2018-10-23 18:56:40,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:56:40,848 INFO L481 AbstractCegarLoop]: Abstraction has 177281 states and 203798 transitions. [2018-10-23 18:56:40,848 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:56:40,848 INFO L276 IsEmpty]: Start isEmpty. Operand 177281 states and 203798 transitions. [2018-10-23 18:56:40,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2018-10-23 18:56:40,923 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:56:40,923 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:56:40,923 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:56:40,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:56:40,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1310769329, now seen corresponding path program 1 times [2018-10-23 18:56:40,924 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:56:40,924 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:56:40,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:56:40,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:56:40,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:56:40,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:56:41,156 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-10-23 18:56:41,157 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:56:41,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-23 18:56:41,157 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:56:41,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:56:41,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:56:41,159 INFO L87 Difference]: Start difference. First operand 177281 states and 203798 transitions. Second operand 3 states. [2018-10-23 18:56:43,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:56:43,021 INFO L93 Difference]: Finished difference Result 350124 states and 402284 transitions. [2018-10-23 18:56:43,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:56:43,022 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 332 [2018-10-23 18:56:43,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:56:43,259 INFO L225 Difference]: With dead ends: 350124 [2018-10-23 18:56:43,259 INFO L226 Difference]: Without dead ends: 172845 [2018-10-23 18:56:43,376 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 18:56:43,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172845 states. [2018-10-23 18:56:46,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172845 to 172845. [2018-10-23 18:56:46,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172845 states. [2018-10-23 18:56:47,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172845 states to 172845 states and 196910 transitions. [2018-10-23 18:56:47,029 INFO L78 Accepts]: Start accepts. Automaton has 172845 states and 196910 transitions. Word has length 332 [2018-10-23 18:56:47,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:56:47,029 INFO L481 AbstractCegarLoop]: Abstraction has 172845 states and 196910 transitions. [2018-10-23 18:56:47,030 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:56:47,030 INFO L276 IsEmpty]: Start isEmpty. Operand 172845 states and 196910 transitions. [2018-10-23 18:56:47,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2018-10-23 18:56:47,075 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:56:47,075 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-23 18:56:47,075 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:56:47,075 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:56:47,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1850297527, now seen corresponding path program 1 times [2018-10-23 18:56:47,076 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:56:47,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:56:47,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:56:47,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:56:47,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:56:47,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:56:47,524 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-10-23 18:56:47,614 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 18:56:47,614 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:56:47,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-23 18:56:47,615 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:56:47,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:56:47,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:56:47,616 INFO L87 Difference]: Start difference. First operand 172845 states and 196910 transitions. Second operand 4 states. [2018-10-23 18:56:55,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:56:55,154 INFO L93 Difference]: Finished difference Result 659659 states and 751671 transitions. [2018-10-23 18:56:55,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:56:55,155 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 345 [2018-10-23 18:56:55,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:56:55,763 INFO L225 Difference]: With dead ends: 659659 [2018-10-23 18:56:55,763 INFO L226 Difference]: Without dead ends: 486816 [2018-10-23 18:56:55,896 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:56:56,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486816 states. [2018-10-23 18:57:01,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486816 to 322964. [2018-10-23 18:57:01,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322964 states. [2018-10-23 18:57:01,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322964 states to 322964 states and 368236 transitions. [2018-10-23 18:57:01,529 INFO L78 Accepts]: Start accepts. Automaton has 322964 states and 368236 transitions. Word has length 345 [2018-10-23 18:57:01,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:57:01,530 INFO L481 AbstractCegarLoop]: Abstraction has 322964 states and 368236 transitions. [2018-10-23 18:57:01,530 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:57:01,530 INFO L276 IsEmpty]: Start isEmpty. Operand 322964 states and 368236 transitions. [2018-10-23 18:57:01,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2018-10-23 18:57:01,580 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:57:01,581 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:57:01,581 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:57:01,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:57:01,581 INFO L82 PathProgramCache]: Analyzing trace with hash 972731471, now seen corresponding path program 1 times [2018-10-23 18:57:01,581 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:57:01,581 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:57:01,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:57:01,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:57:01,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:57:01,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:57:03,029 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-10-23 18:57:03,030 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:57:03,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:57:03,031 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:57:03,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:57:03,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:57:03,031 INFO L87 Difference]: Start difference. First operand 322964 states and 368236 transitions. Second operand 4 states. [2018-10-23 18:57:09,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:57:09,614 INFO L93 Difference]: Finished difference Result 663142 states and 756901 transitions. [2018-10-23 18:57:09,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:57:09,615 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 346 [2018-10-23 18:57:09,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:57:10,088 INFO L225 Difference]: With dead ends: 663142 [2018-10-23 18:57:10,088 INFO L226 Difference]: Without dead ends: 340180 [2018-10-23 18:57:10,197 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 18:57:10,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340180 states. [2018-10-23 18:57:15,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340180 to 340130. [2018-10-23 18:57:15,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340130 states. [2018-10-23 18:57:15,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340130 states to 340130 states and 387085 transitions. [2018-10-23 18:57:15,581 INFO L78 Accepts]: Start accepts. Automaton has 340130 states and 387085 transitions. Word has length 346 [2018-10-23 18:57:15,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:57:15,582 INFO L481 AbstractCegarLoop]: Abstraction has 340130 states and 387085 transitions. [2018-10-23 18:57:15,582 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:57:15,582 INFO L276 IsEmpty]: Start isEmpty. Operand 340130 states and 387085 transitions. [2018-10-23 18:57:15,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2018-10-23 18:57:15,636 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:57:15,636 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-23 18:57:15,636 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:57:15,636 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:57:15,636 INFO L82 PathProgramCache]: Analyzing trace with hash -1494854117, now seen corresponding path program 1 times [2018-10-23 18:57:15,636 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:57:15,637 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:57:15,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:57:15,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:57:15,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:57:15,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:57:16,262 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-23 18:57:16,262 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:57:16,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-23 18:57:16,263 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:57:16,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:57:16,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:57:16,263 INFO L87 Difference]: Start difference. First operand 340130 states and 387085 transitions. Second operand 4 states. [2018-10-23 18:57:24,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:57:24,950 INFO L93 Difference]: Finished difference Result 696743 states and 795694 transitions. [2018-10-23 18:57:24,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:57:24,951 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 351 [2018-10-23 18:57:24,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:57:25,605 INFO L225 Difference]: With dead ends: 696743 [2018-10-23 18:57:25,605 INFO L226 Difference]: Without dead ends: 356615 [2018-10-23 18:57:25,802 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:57:26,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356615 states. [2018-10-23 18:57:31,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356615 to 339463. [2018-10-23 18:57:31,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339463 states. [2018-10-23 18:57:32,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339463 states to 339463 states and 383111 transitions. [2018-10-23 18:57:32,000 INFO L78 Accepts]: Start accepts. Automaton has 339463 states and 383111 transitions. Word has length 351 [2018-10-23 18:57:32,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:57:32,001 INFO L481 AbstractCegarLoop]: Abstraction has 339463 states and 383111 transitions. [2018-10-23 18:57:32,001 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:57:32,001 INFO L276 IsEmpty]: Start isEmpty. Operand 339463 states and 383111 transitions. [2018-10-23 18:57:32,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2018-10-23 18:57:32,054 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:57:32,054 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:57:32,054 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:57:32,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:57:32,054 INFO L82 PathProgramCache]: Analyzing trace with hash -846916471, now seen corresponding path program 1 times [2018-10-23 18:57:32,055 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:57:32,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:57:32,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:57:32,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:57:32,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:57:32,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:57:32,333 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 232 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-10-23 18:57:32,333 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:57:32,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:57:32,334 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:57:32,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:57:32,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:57:32,334 INFO L87 Difference]: Start difference. First operand 339463 states and 383111 transitions. Second operand 3 states. [2018-10-23 18:57:36,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:57:36,452 INFO L93 Difference]: Finished difference Result 641129 states and 725196 transitions. [2018-10-23 18:57:36,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:57:36,453 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 368 [2018-10-23 18:57:36,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:57:36,828 INFO L225 Difference]: With dead ends: 641129 [2018-10-23 18:57:36,828 INFO L226 Difference]: Without dead ends: 301668 [2018-10-23 18:57:36,994 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 18:57:37,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301668 states. [2018-10-23 18:57:42,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301668 to 296960. [2018-10-23 18:57:42,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296960 states. [2018-10-23 18:57:43,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296960 states to 296960 states and 328199 transitions. [2018-10-23 18:57:43,003 INFO L78 Accepts]: Start accepts. Automaton has 296960 states and 328199 transitions. Word has length 368 [2018-10-23 18:57:43,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:57:43,004 INFO L481 AbstractCegarLoop]: Abstraction has 296960 states and 328199 transitions. [2018-10-23 18:57:43,004 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:57:43,004 INFO L276 IsEmpty]: Start isEmpty. Operand 296960 states and 328199 transitions. [2018-10-23 18:57:43,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2018-10-23 18:57:43,058 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:57:43,058 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:57:43,059 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:57:43,059 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:57:43,059 INFO L82 PathProgramCache]: Analyzing trace with hash -893696450, now seen corresponding path program 1 times [2018-10-23 18:57:43,059 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:57:43,059 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:57:43,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:57:43,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:57:43,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:57:43,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:57:43,487 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 183 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-10-23 18:57:43,487 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:57:43,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:57:43,488 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:57:43,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:57:43,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:57:43,489 INFO L87 Difference]: Start difference. First operand 296960 states and 328199 transitions. Second operand 4 states. [2018-10-23 18:57:49,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:57:49,371 INFO L93 Difference]: Finished difference Result 1111747 states and 1228016 transitions. [2018-10-23 18:57:49,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:57:49,372 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 374 [2018-10-23 18:57:49,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:57:52,133 INFO L225 Difference]: With dead ends: 1111747 [2018-10-23 18:57:52,133 INFO L226 Difference]: Without dead ends: 814789 [2018-10-23 18:57:52,364 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 18:57:52,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 814789 states. [2018-10-23 18:58:08,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 814789 to 524785. [2018-10-23 18:58:08,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 524785 states. [2018-10-23 18:58:10,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524785 states to 524785 states and 579152 transitions. [2018-10-23 18:58:10,227 INFO L78 Accepts]: Start accepts. Automaton has 524785 states and 579152 transitions. Word has length 374 [2018-10-23 18:58:10,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:58:10,227 INFO L481 AbstractCegarLoop]: Abstraction has 524785 states and 579152 transitions. [2018-10-23 18:58:10,227 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:58:10,228 INFO L276 IsEmpty]: Start isEmpty. Operand 524785 states and 579152 transitions. [2018-10-23 18:58:10,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 386 [2018-10-23 18:58:10,284 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:58:10,285 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:58:10,285 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:58:10,285 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:58:10,286 INFO L82 PathProgramCache]: Analyzing trace with hash -1326023536, now seen corresponding path program 1 times [2018-10-23 18:58:10,286 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:58:10,286 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:58:10,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:58:10,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:58:10,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:58:10,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:58:10,728 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 197 proven. 0 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2018-10-23 18:58:10,728 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:58:10,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-23 18:58:10,729 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:58:10,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:58:10,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:58:10,730 INFO L87 Difference]: Start difference. First operand 524785 states and 579152 transitions. Second operand 4 states. [2018-10-23 18:58:17,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:58:17,128 INFO L93 Difference]: Finished difference Result 1050464 states and 1158599 transitions. [2018-10-23 18:58:17,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:58:17,128 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 385 [2018-10-23 18:58:17,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:58:17,761 INFO L225 Difference]: With dead ends: 1050464 [2018-10-23 18:58:17,761 INFO L226 Difference]: Without dead ends: 525681 [2018-10-23 18:58:18,010 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:58:18,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525681 states. [2018-10-23 18:58:26,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525681 to 505523. [2018-10-23 18:58:26,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505523 states. [2018-10-23 18:58:27,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505523 states to 505523 states and 554820 transitions. [2018-10-23 18:58:27,139 INFO L78 Accepts]: Start accepts. Automaton has 505523 states and 554820 transitions. Word has length 385 [2018-10-23 18:58:27,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:58:27,139 INFO L481 AbstractCegarLoop]: Abstraction has 505523 states and 554820 transitions. [2018-10-23 18:58:27,140 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:58:27,140 INFO L276 IsEmpty]: Start isEmpty. Operand 505523 states and 554820 transitions. [2018-10-23 18:58:27,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2018-10-23 18:58:27,201 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:58:27,201 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-23 18:58:27,202 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:58:27,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:58:27,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1912682089, now seen corresponding path program 1 times [2018-10-23 18:58:27,202 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:58:27,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:58:27,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:58:27,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:58:27,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:58:27,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:58:27,481 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 234 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-10-23 18:58:27,481 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:58:27,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:58:27,482 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:58:27,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:58:27,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:58:27,483 INFO L87 Difference]: Start difference. First operand 505523 states and 554820 transitions. Second operand 3 states. [2018-10-23 18:58:36,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:58:36,400 INFO L93 Difference]: Finished difference Result 921579 states and 1012002 transitions. [2018-10-23 18:58:36,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:58:36,401 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 391 [2018-10-23 18:58:36,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:58:37,940 INFO L225 Difference]: With dead ends: 921579 [2018-10-23 18:58:37,940 INFO L226 Difference]: Without dead ends: 416058 [2018-10-23 18:58:38,113 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 18:58:38,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416058 states. [2018-10-23 18:58:43,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416058 to 416042. [2018-10-23 18:58:43,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416042 states. [2018-10-23 18:58:44,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416042 states to 416042 states and 448273 transitions. [2018-10-23 18:58:44,033 INFO L78 Accepts]: Start accepts. Automaton has 416042 states and 448273 transitions. Word has length 391 [2018-10-23 18:58:44,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:58:44,034 INFO L481 AbstractCegarLoop]: Abstraction has 416042 states and 448273 transitions. [2018-10-23 18:58:44,034 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:58:44,034 INFO L276 IsEmpty]: Start isEmpty. Operand 416042 states and 448273 transitions. [2018-10-23 18:58:44,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2018-10-23 18:58:44,084 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:58:44,085 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-23 18:58:44,085 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:58:44,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:58:44,085 INFO L82 PathProgramCache]: Analyzing trace with hash -1913922487, now seen corresponding path program 1 times [2018-10-23 18:58:44,086 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:58:44,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:58:44,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:58:44,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:58:44,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:58:44,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:58:45,751 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 263 proven. 6 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-10-23 18:58:45,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 18:58:45,751 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) [2018-10-23 18:58:45,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-23 18:58:45,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:58:45,936 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 18:58:46,008 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 263 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-10-23 18:58:46,030 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-23 18:58:46,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2018-10-23 18:58:46,031 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:58:46,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:58:46,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:58:46,032 INFO L87 Difference]: Start difference. First operand 416042 states and 448273 transitions. Second operand 4 states. [2018-10-23 18:58:52,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:58:52,234 INFO L93 Difference]: Finished difference Result 1155885 states and 1237531 transitions. [2018-10-23 18:58:52,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:58:52,235 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 396 [2018-10-23 18:58:52,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:58:54,482 INFO L225 Difference]: With dead ends: 1155885 [2018-10-23 18:58:54,482 INFO L226 Difference]: Without dead ends: 739845 [2018-10-23 18:58:54,720 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 399 GetRequests, 397 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 Received shutdown request... [2018-10-23 18:58:55,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739845 states. [2018-10-23 18:58:55,258 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-23 18:58:55,261 WARN L205 ceAbstractionStarter]: Timeout [2018-10-23 18:58:55,262 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.10 06:58:55 BoogieIcfgContainer [2018-10-23 18:58:55,262 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-23 18:58:55,262 INFO L168 Benchmark]: Toolchain (without parser) took 199972.01 ms. Allocated memory was 1.5 GB in the beginning and 5.4 GB in the end (delta: 3.8 GB). Free memory was 1.4 GB in the beginning and 2.5 GB in the end (delta: -1.1 GB). Peak memory consumption was 3.6 GB. Max. memory is 7.1 GB. [2018-10-23 18:58:55,263 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-23 18:58:55,264 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1136.35 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 84.6 MB). Peak memory consumption was 84.6 MB. Max. memory is 7.1 GB. [2018-10-23 18:58:55,264 INFO L168 Benchmark]: Boogie Procedure Inliner took 317.91 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 761.8 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -895.8 MB). Peak memory consumption was 40.3 MB. Max. memory is 7.1 GB. [2018-10-23 18:58:55,265 INFO L168 Benchmark]: Boogie Preprocessor took 155.18 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.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. [2018-10-23 18:58:55,266 INFO L168 Benchmark]: RCFGBuilder took 5526.37 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: 256.2 MB). Peak memory consumption was 256.2 MB. Max. memory is 7.1 GB. [2018-10-23 18:58:55,267 INFO L168 Benchmark]: TraceAbstraction took 192831.56 ms. Allocated memory was 2.3 GB in the beginning and 5.4 GB in the end (delta: 3.0 GB). Free memory was 2.0 GB in the beginning and 2.5 GB in the end (delta: -514.1 MB). Peak memory consumption was 3.4 GB. Max. memory is 7.1 GB. [2018-10-23 18:58:55,273 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1136.35 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 84.6 MB). Peak memory consumption was 84.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 317.91 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 761.8 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -895.8 MB). Peak memory consumption was 40.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 155.18 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.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 5526.37 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: 256.2 MB). Peak memory consumption was 256.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 192831.56 ms. Allocated memory was 2.3 GB in the beginning and 5.4 GB in the end (delta: 3.0 GB). Free memory was 2.0 GB in the beginning and 2.5 GB in the end (delta: -514.1 MB). Peak memory consumption was 3.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1638]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1638). Cancelled while executing MinimizeSevpa. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 303 locations, 1 error locations. TIMEOUT Result, 192.7s OverallTime, 22 OverallIterations, 6 TraceHistogramMax, 107.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7238 SDtfs, 13509 SDslu, 6658 SDs, 0 SdLazy, 19145 SolverSat, 3804 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 42.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 981 GetRequests, 931 SyntacticMatches, 7 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 3.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=524785occurred in iteration=19, 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: 71.6s AutomataMinimizationTime, 22 MinimizatonAttempts, 576131 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 6.6s InterpolantComputationTime, 7371 NumberOfCodeBlocks, 7371 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 7346 ConstructedInterpolants, 0 QuantifiedInterpolants, 3741598 SizeOfPredicates, 1 NumberOfNonLiveVariables, 1684 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 25 InterpolantComputations, 22 PerfectInterpolantSequences, 3409/3429 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown