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_label49_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 15:00:33,412 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 15:00:33,415 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 15:00:33,427 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 15:00:33,427 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 15:00:33,428 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 15:00:33,430 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 15:00:33,432 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 15:00:33,433 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 15:00:33,434 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 15:00:33,435 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 15:00:33,435 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 15:00:33,436 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 15:00:33,437 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 15:00:33,439 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 15:00:33,439 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 15:00:33,440 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 15:00:33,442 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 15:00:33,444 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 15:00:33,446 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 15:00:33,447 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 15:00:33,448 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 15:00:33,451 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 15:00:33,451 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 15:00:33,451 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 15:00:33,452 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 15:00:33,453 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 15:00:33,454 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 15:00:33,458 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 15:00:33,460 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 15:00:33,460 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 15:00:33,464 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 15:00:33,464 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 15:00:33,464 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 15:00:33,465 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 15:00:33,467 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 15:00:33,467 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-10-24 15:00:33,496 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 15:00:33,497 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 15:00:33,498 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 15:00:33,498 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-24 15:00:33,499 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-24 15:00:33,499 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-24 15:00:33,499 INFO L133 SettingsManager]: * Use SBE=true [2018-10-24 15:00:33,500 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 15:00:33,500 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 15:00:33,500 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 15:00:33,500 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 15:00:33,500 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 15:00:33,500 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 15:00:33,502 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 15:00:33,502 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 15:00:33,502 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 15:00:33,502 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 15:00:33,502 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 15:00:33,503 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 15:00:33,504 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 15:00:33,504 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 15:00:33,504 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 15:00:33,505 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 15:00:33,505 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-24 15:00:33,505 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 15:00:33,505 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 15:00:33,505 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 15:00:33,505 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 15:00:33,570 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 15:00:33,589 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 15:00:33,593 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 15:00:33,595 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 15:00:33,595 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 15:00:33,596 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label49_true-unreach-call.c [2018-10-24 15:00:33,663 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/d4a9440f7/2d4d4ed71b574f4aac9f737566b0dc30/FLAGf57bd7110 [2018-10-24 15:00:34,348 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 15:00:34,351 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label49_true-unreach-call.c [2018-10-24 15:00:34,372 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/d4a9440f7/2d4d4ed71b574f4aac9f737566b0dc30/FLAGf57bd7110 [2018-10-24 15:00:34,394 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/d4a9440f7/2d4d4ed71b574f4aac9f737566b0dc30 [2018-10-24 15:00:34,406 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 15:00:34,408 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 15:00:34,409 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 15:00:34,410 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 15:00:34,413 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 15:00:34,414 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 03:00:34" (1/1) ... [2018-10-24 15:00:34,417 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@497fe8da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:00:34, skipping insertion in model container [2018-10-24 15:00:34,418 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 03:00:34" (1/1) ... [2018-10-24 15:00:34,428 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 15:00:34,511 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 15:00:35,215 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 15:00:35,220 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 15:00:35,469 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 15:00:35,508 INFO L193 MainTranslator]: Completed translation [2018-10-24 15:00:35,509 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:00:35 WrapperNode [2018-10-24 15:00:35,509 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 15:00:35,510 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 15:00:35,510 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 15:00:35,510 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 15:00:35,530 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:00:35" (1/1) ... [2018-10-24 15:00:35,576 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:00:35" (1/1) ... [2018-10-24 15:00:35,829 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 15:00:35,829 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 15:00:35,830 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 15:00:35,830 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 15:00:35,840 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:00:35" (1/1) ... [2018-10-24 15:00:35,840 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:00:35" (1/1) ... [2018-10-24 15:00:35,849 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:00:35" (1/1) ... [2018-10-24 15:00:35,849 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:00:35" (1/1) ... [2018-10-24 15:00:35,900 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:00:35" (1/1) ... [2018-10-24 15:00:35,915 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:00:35" (1/1) ... [2018-10-24 15:00:35,927 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:00:35" (1/1) ... [2018-10-24 15:00:35,942 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 15:00:35,943 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 15:00:35,943 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 15:00:35,943 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 15:00:35,944 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:00:35" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 15:00:36,009 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-24 15:00:36,010 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 15:00:36,010 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 15:00:41,555 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 15:00:41,556 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 03:00:41 BoogieIcfgContainer [2018-10-24 15:00:41,556 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 15:00:41,557 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 15:00:41,558 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 15:00:41,563 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 15:00:41,564 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 03:00:34" (1/3) ... [2018-10-24 15:00:41,565 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e2e2958 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 03:00:41, skipping insertion in model container [2018-10-24 15:00:41,566 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:00:35" (2/3) ... [2018-10-24 15:00:41,566 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e2e2958 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 03:00:41, skipping insertion in model container [2018-10-24 15:00:41,566 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 03:00:41" (3/3) ... [2018-10-24 15:00:41,569 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label49_true-unreach-call.c [2018-10-24 15:00:41,580 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 15:00:41,591 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 15:00:41,610 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 15:00:41,660 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-24 15:00:41,661 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 15:00:41,661 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 15:00:41,661 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 15:00:41,662 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 15:00:41,662 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 15:00:41,662 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 15:00:41,662 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 15:00:41,662 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 15:00:41,690 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states. [2018-10-24 15:00:41,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-10-24 15:00:41,710 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:00:41,711 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] [2018-10-24 15:00:41,714 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:00:41,719 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:00:41,720 INFO L82 PathProgramCache]: Analyzing trace with hash -2100663006, now seen corresponding path program 1 times [2018-10-24 15:00:41,721 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:00:41,722 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:00:41,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:00:41,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:00:41,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:00:42,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:00:42,661 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-10-24 15:00:42,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 15:00:42,767 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:00:42,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 15:00:42,776 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 15:00:42,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 15:00:42,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 15:00:42,797 INFO L87 Difference]: Start difference. First operand 303 states. Second operand 4 states. [2018-10-24 15:00:46,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:00:46,997 INFO L93 Difference]: Finished difference Result 1089 states and 1954 transitions. [2018-10-24 15:00:46,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 15:00:47,001 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 169 [2018-10-24 15:00:47,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:00:47,030 INFO L225 Difference]: With dead ends: 1089 [2018-10-24 15:00:47,030 INFO L226 Difference]: Without dead ends: 779 [2018-10-24 15:00:47,036 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 15:00:47,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2018-10-24 15:00:47,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 515. [2018-10-24 15:00:47,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 515 states. [2018-10-24 15:00:47,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 887 transitions. [2018-10-24 15:00:47,128 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 887 transitions. Word has length 169 [2018-10-24 15:00:47,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:00:47,130 INFO L481 AbstractCegarLoop]: Abstraction has 515 states and 887 transitions. [2018-10-24 15:00:47,130 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 15:00:47,130 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 887 transitions. [2018-10-24 15:00:47,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-10-24 15:00:47,137 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:00:47,137 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] [2018-10-24 15:00:47,138 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:00:47,138 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:00:47,138 INFO L82 PathProgramCache]: Analyzing trace with hash -247207855, now seen corresponding path program 1 times [2018-10-24 15:00:47,138 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:00:47,139 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:00:47,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:00:47,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:00:47,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:00:47,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:00:47,394 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 15:00:47,394 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:00:47,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 15:00:47,396 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 15:00:47,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 15:00:47,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 15:00:47,397 INFO L87 Difference]: Start difference. First operand 515 states and 887 transitions. Second operand 4 states. [2018-10-24 15:00:54,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:00:54,134 INFO L93 Difference]: Finished difference Result 1903 states and 3379 transitions. [2018-10-24 15:00:54,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 15:00:54,135 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 175 [2018-10-24 15:00:54,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:00:54,144 INFO L225 Difference]: With dead ends: 1903 [2018-10-24 15:00:54,144 INFO L226 Difference]: Without dead ends: 1390 [2018-10-24 15:00:54,147 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 15:00:54,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states. [2018-10-24 15:00:54,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 927. [2018-10-24 15:00:54,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 927 states. [2018-10-24 15:00:54,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 1521 transitions. [2018-10-24 15:00:54,196 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 1521 transitions. Word has length 175 [2018-10-24 15:00:54,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:00:54,197 INFO L481 AbstractCegarLoop]: Abstraction has 927 states and 1521 transitions. [2018-10-24 15:00:54,197 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 15:00:54,197 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 1521 transitions. [2018-10-24 15:00:54,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-10-24 15:00:54,201 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:00:54,202 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 15:00:54,202 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:00:54,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:00:54,203 INFO L82 PathProgramCache]: Analyzing trace with hash -1073215229, now seen corresponding path program 1 times [2018-10-24 15:00:54,203 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:00:54,203 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:00:54,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:00:54,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:00:54,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:00:54,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:00:54,320 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 15:00:54,320 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:00:54,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 15:00:54,321 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 15:00:54,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 15:00:54,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 15:00:54,322 INFO L87 Difference]: Start difference. First operand 927 states and 1521 transitions. Second operand 3 states. [2018-10-24 15:00:57,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:00:57,469 INFO L93 Difference]: Finished difference Result 2684 states and 4465 transitions. [2018-10-24 15:00:57,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 15:00:57,470 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 178 [2018-10-24 15:00:57,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:00:57,480 INFO L225 Difference]: With dead ends: 2684 [2018-10-24 15:00:57,481 INFO L226 Difference]: Without dead ends: 1759 [2018-10-24 15:00:57,483 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 15:00:57,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1759 states. [2018-10-24 15:00:57,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1759 to 1744. [2018-10-24 15:00:57,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1744 states. [2018-10-24 15:00:57,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1744 states to 1744 states and 2808 transitions. [2018-10-24 15:00:57,528 INFO L78 Accepts]: Start accepts. Automaton has 1744 states and 2808 transitions. Word has length 178 [2018-10-24 15:00:57,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:00:57,528 INFO L481 AbstractCegarLoop]: Abstraction has 1744 states and 2808 transitions. [2018-10-24 15:00:57,528 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 15:00:57,529 INFO L276 IsEmpty]: Start isEmpty. Operand 1744 states and 2808 transitions. [2018-10-24 15:00:57,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-10-24 15:00:57,534 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:00:57,534 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 15:00:57,535 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:00:57,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:00:57,535 INFO L82 PathProgramCache]: Analyzing trace with hash 961694218, now seen corresponding path program 1 times [2018-10-24 15:00:57,535 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:00:57,535 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:00:57,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:00:57,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:00:57,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:00:57,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:00:57,667 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-24 15:00:57,668 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:00:57,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 15:00:57,668 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 15:00:57,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 15:00:57,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 15:00:57,669 INFO L87 Difference]: Start difference. First operand 1744 states and 2808 transitions. Second operand 4 states. [2018-10-24 15:01:00,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:01:00,175 INFO L93 Difference]: Finished difference Result 6799 states and 11033 transitions. [2018-10-24 15:01:00,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 15:01:00,176 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 185 [2018-10-24 15:01:00,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:01:00,202 INFO L225 Difference]: With dead ends: 6799 [2018-10-24 15:01:00,202 INFO L226 Difference]: Without dead ends: 5057 [2018-10-24 15:01:00,206 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 15:01:00,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5057 states. [2018-10-24 15:01:00,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5057 to 3383. [2018-10-24 15:01:00,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3383 states. [2018-10-24 15:01:00,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3383 states to 3383 states and 5097 transitions. [2018-10-24 15:01:00,293 INFO L78 Accepts]: Start accepts. Automaton has 3383 states and 5097 transitions. Word has length 185 [2018-10-24 15:01:00,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:01:00,293 INFO L481 AbstractCegarLoop]: Abstraction has 3383 states and 5097 transitions. [2018-10-24 15:01:00,293 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 15:01:00,294 INFO L276 IsEmpty]: Start isEmpty. Operand 3383 states and 5097 transitions. [2018-10-24 15:01:00,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-10-24 15:01:00,302 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:01:00,303 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] [2018-10-24 15:01:00,303 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:01:00,303 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:01:00,304 INFO L82 PathProgramCache]: Analyzing trace with hash -448930530, now seen corresponding path program 1 times [2018-10-24 15:01:00,304 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:01:00,304 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:01:00,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:00,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:01:00,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:00,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:01:00,439 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-24 15:01:00,440 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:01:00,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 15:01:00,440 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 15:01:00,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 15:01:00,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 15:01:00,441 INFO L87 Difference]: Start difference. First operand 3383 states and 5097 transitions. Second operand 3 states. [2018-10-24 15:01:01,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:01:01,484 INFO L93 Difference]: Finished difference Result 10130 states and 15269 transitions. [2018-10-24 15:01:01,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 15:01:01,485 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 192 [2018-10-24 15:01:01,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:01:01,516 INFO L225 Difference]: With dead ends: 10130 [2018-10-24 15:01:01,516 INFO L226 Difference]: Without dead ends: 6749 [2018-10-24 15:01:01,522 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 15:01:01,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6749 states. [2018-10-24 15:01:01,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6749 to 6745. [2018-10-24 15:01:01,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6745 states. [2018-10-24 15:01:01,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6745 states to 6745 states and 10157 transitions. [2018-10-24 15:01:01,663 INFO L78 Accepts]: Start accepts. Automaton has 6745 states and 10157 transitions. Word has length 192 [2018-10-24 15:01:01,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:01:01,663 INFO L481 AbstractCegarLoop]: Abstraction has 6745 states and 10157 transitions. [2018-10-24 15:01:01,663 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 15:01:01,664 INFO L276 IsEmpty]: Start isEmpty. Operand 6745 states and 10157 transitions. [2018-10-24 15:01:01,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-10-24 15:01:01,677 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:01:01,678 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] [2018-10-24 15:01:01,678 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:01:01,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:01:01,679 INFO L82 PathProgramCache]: Analyzing trace with hash 372169382, now seen corresponding path program 1 times [2018-10-24 15:01:01,679 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:01:01,679 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:01:01,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:01,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:01:01,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:01,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:01:02,209 WARN L179 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2018-10-24 15:01:02,242 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 15:01:02,243 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:01:02,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 15:01:02,243 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 15:01:02,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 15:01:02,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 15:01:02,244 INFO L87 Difference]: Start difference. First operand 6745 states and 10157 transitions. Second operand 5 states. [2018-10-24 15:01:05,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:01:05,513 INFO L93 Difference]: Finished difference Result 15395 states and 23378 transitions. [2018-10-24 15:01:05,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 15:01:05,519 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 209 [2018-10-24 15:01:05,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:01:05,563 INFO L225 Difference]: With dead ends: 15395 [2018-10-24 15:01:05,563 INFO L226 Difference]: Without dead ends: 8652 [2018-10-24 15:01:05,573 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 15:01:05,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8652 states. [2018-10-24 15:01:05,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8652 to 6949. [2018-10-24 15:01:05,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6949 states. [2018-10-24 15:01:05,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6949 states to 6949 states and 10313 transitions. [2018-10-24 15:01:05,737 INFO L78 Accepts]: Start accepts. Automaton has 6949 states and 10313 transitions. Word has length 209 [2018-10-24 15:01:05,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:01:05,738 INFO L481 AbstractCegarLoop]: Abstraction has 6949 states and 10313 transitions. [2018-10-24 15:01:05,738 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 15:01:05,738 INFO L276 IsEmpty]: Start isEmpty. Operand 6949 states and 10313 transitions. [2018-10-24 15:01:05,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-10-24 15:01:05,757 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:01:05,757 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 15:01:05,758 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:01:05,758 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:01:05,758 INFO L82 PathProgramCache]: Analyzing trace with hash -1005874593, now seen corresponding path program 1 times [2018-10-24 15:01:05,758 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:01:05,758 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:01:05,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:05,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:01:05,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:05,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:01:05,943 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-10-24 15:01:05,944 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:01:05,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 15:01:05,945 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 15:01:05,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 15:01:05,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 15:01:05,946 INFO L87 Difference]: Start difference. First operand 6949 states and 10313 transitions. Second operand 3 states. [2018-10-24 15:01:07,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:01:07,697 INFO L93 Difference]: Finished difference Result 13906 states and 20644 transitions. [2018-10-24 15:01:07,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 15:01:07,698 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 232 [2018-10-24 15:01:07,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:01:07,716 INFO L225 Difference]: With dead ends: 13906 [2018-10-24 15:01:07,717 INFO L226 Difference]: Without dead ends: 6959 [2018-10-24 15:01:07,723 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 15:01:07,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6959 states. [2018-10-24 15:01:07,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6959 to 6949. [2018-10-24 15:01:07,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6949 states. [2018-10-24 15:01:07,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6949 states to 6949 states and 9659 transitions. [2018-10-24 15:01:07,832 INFO L78 Accepts]: Start accepts. Automaton has 6949 states and 9659 transitions. Word has length 232 [2018-10-24 15:01:07,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:01:07,832 INFO L481 AbstractCegarLoop]: Abstraction has 6949 states and 9659 transitions. [2018-10-24 15:01:07,832 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 15:01:07,832 INFO L276 IsEmpty]: Start isEmpty. Operand 6949 states and 9659 transitions. [2018-10-24 15:01:07,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2018-10-24 15:01:07,847 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:01:07,847 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 15:01:07,848 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:01:07,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:01:07,848 INFO L82 PathProgramCache]: Analyzing trace with hash -1151845927, now seen corresponding path program 1 times [2018-10-24 15:01:07,848 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:01:07,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:01:07,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:07,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:01:07,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:07,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:01:08,011 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-10-24 15:01:08,011 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:01:08,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 15:01:08,012 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 15:01:08,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 15:01:08,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 15:01:08,012 INFO L87 Difference]: Start difference. First operand 6949 states and 9659 transitions. Second operand 3 states. [2018-10-24 15:01:09,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:01:09,474 INFO L93 Difference]: Finished difference Result 20633 states and 28734 transitions. [2018-10-24 15:01:09,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 15:01:09,474 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 239 [2018-10-24 15:01:09,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:01:09,499 INFO L225 Difference]: With dead ends: 20633 [2018-10-24 15:01:09,499 INFO L226 Difference]: Without dead ends: 13686 [2018-10-24 15:01:09,509 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-24 15:01:09,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13686 states. [2018-10-24 15:01:09,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13686 to 13683. [2018-10-24 15:01:09,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13683 states. [2018-10-24 15:01:09,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13683 states to 13683 states and 17386 transitions. [2018-10-24 15:01:09,707 INFO L78 Accepts]: Start accepts. Automaton has 13683 states and 17386 transitions. Word has length 239 [2018-10-24 15:01:09,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:01:09,707 INFO L481 AbstractCegarLoop]: Abstraction has 13683 states and 17386 transitions. [2018-10-24 15:01:09,708 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 15:01:09,708 INFO L276 IsEmpty]: Start isEmpty. Operand 13683 states and 17386 transitions. [2018-10-24 15:01:09,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2018-10-24 15:01:09,737 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:01:09,738 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, 2, 2, 2, 2, 2, 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] [2018-10-24 15:01:09,738 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:01:09,738 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:01:09,738 INFO L82 PathProgramCache]: Analyzing trace with hash -422108486, now seen corresponding path program 1 times [2018-10-24 15:01:09,739 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:01:09,739 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:01:09,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:09,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:01:09,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:09,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:01:09,910 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2018-10-24 15:01:09,910 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:01:09,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 15:01:09,911 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 15:01:09,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 15:01:09,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 15:01:09,912 INFO L87 Difference]: Start difference. First operand 13683 states and 17386 transitions. Second operand 3 states. [2018-10-24 15:01:11,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:01:11,264 INFO L93 Difference]: Finished difference Result 27317 states and 34706 transitions. [2018-10-24 15:01:11,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 15:01:11,265 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 269 [2018-10-24 15:01:11,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:01:11,299 INFO L225 Difference]: With dead ends: 27317 [2018-10-24 15:01:11,300 INFO L226 Difference]: Without dead ends: 13636 [2018-10-24 15:01:11,316 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 15:01:11,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13636 states. [2018-10-24 15:01:11,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13636 to 13636. [2018-10-24 15:01:11,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13636 states. [2018-10-24 15:01:11,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13636 states to 13636 states and 16884 transitions. [2018-10-24 15:01:11,507 INFO L78 Accepts]: Start accepts. Automaton has 13636 states and 16884 transitions. Word has length 269 [2018-10-24 15:01:11,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:01:11,508 INFO L481 AbstractCegarLoop]: Abstraction has 13636 states and 16884 transitions. [2018-10-24 15:01:11,508 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 15:01:11,508 INFO L276 IsEmpty]: Start isEmpty. Operand 13636 states and 16884 transitions. [2018-10-24 15:01:11,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2018-10-24 15:01:11,534 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:01:11,534 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 15:01:11,535 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:01:11,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:01:11,535 INFO L82 PathProgramCache]: Analyzing trace with hash -952472772, now seen corresponding path program 1 times [2018-10-24 15:01:11,535 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:01:11,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:01:11,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:11,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:01:11,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:11,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:01:11,916 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-10-24 15:01:11,916 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:01:11,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 15:01:11,917 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 15:01:11,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 15:01:11,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 15:01:11,920 INFO L87 Difference]: Start difference. First operand 13636 states and 16884 transitions. Second operand 3 states. [2018-10-24 15:01:13,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:01:13,374 INFO L93 Difference]: Finished difference Result 31985 states and 39729 transitions. [2018-10-24 15:01:13,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 15:01:13,378 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 282 [2018-10-24 15:01:13,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:01:13,407 INFO L225 Difference]: With dead ends: 31985 [2018-10-24 15:01:13,407 INFO L226 Difference]: Without dead ends: 18351 [2018-10-24 15:01:13,425 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 15:01:13,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18351 states. [2018-10-24 15:01:13,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18351 to 18349. [2018-10-24 15:01:13,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18349 states. [2018-10-24 15:01:13,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18349 states to 18349 states and 22651 transitions. [2018-10-24 15:01:13,686 INFO L78 Accepts]: Start accepts. Automaton has 18349 states and 22651 transitions. Word has length 282 [2018-10-24 15:01:13,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:01:13,686 INFO L481 AbstractCegarLoop]: Abstraction has 18349 states and 22651 transitions. [2018-10-24 15:01:13,686 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 15:01:13,686 INFO L276 IsEmpty]: Start isEmpty. Operand 18349 states and 22651 transitions. [2018-10-24 15:01:13,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2018-10-24 15:01:13,711 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:01:13,712 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 15:01:13,712 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:01:13,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:01:13,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1551373769, now seen corresponding path program 1 times [2018-10-24 15:01:13,713 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:01:13,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:01:13,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:13,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:01:13,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:13,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:01:13,938 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-10-24 15:01:13,938 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:01:13,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 15:01:13,939 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 15:01:13,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 15:01:13,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 15:01:13,939 INFO L87 Difference]: Start difference. First operand 18349 states and 22651 transitions. Second operand 4 states. [2018-10-24 15:01:16,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:01:16,362 INFO L93 Difference]: Finished difference Result 64922 states and 79158 transitions. [2018-10-24 15:01:16,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 15:01:16,362 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 285 [2018-10-24 15:01:16,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:01:16,420 INFO L225 Difference]: With dead ends: 64922 [2018-10-24 15:01:16,421 INFO L226 Difference]: Without dead ends: 46575 [2018-10-24 15:01:16,446 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 15:01:16,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46575 states. [2018-10-24 15:01:16,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46575 to 32421. [2018-10-24 15:01:16,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32421 states. [2018-10-24 15:01:16,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32421 states to 32421 states and 38383 transitions. [2018-10-24 15:01:16,979 INFO L78 Accepts]: Start accepts. Automaton has 32421 states and 38383 transitions. Word has length 285 [2018-10-24 15:01:16,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:01:16,980 INFO L481 AbstractCegarLoop]: Abstraction has 32421 states and 38383 transitions. [2018-10-24 15:01:16,980 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 15:01:16,980 INFO L276 IsEmpty]: Start isEmpty. Operand 32421 states and 38383 transitions. [2018-10-24 15:01:17,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2018-10-24 15:01:17,013 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:01:17,013 INFO L375 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 15:01:17,014 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:01:17,015 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:01:17,015 INFO L82 PathProgramCache]: Analyzing trace with hash -15653400, now seen corresponding path program 1 times [2018-10-24 15:01:17,015 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:01:17,016 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:01:17,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:17,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:01:17,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:17,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:01:17,677 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 101 proven. 4 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-10-24 15:01:17,678 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 15:01:17,678 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 15:01:17,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:01:17,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:01:17,848 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 15:01:17,954 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 169 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-24 15:01:17,977 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 15:01:17,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2018-10-24 15:01:17,978 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-24 15:01:17,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-24 15:01:17,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-10-24 15:01:17,979 INFO L87 Difference]: Start difference. First operand 32421 states and 38383 transitions. Second operand 7 states. [2018-10-24 15:01:24,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:01:24,147 INFO L93 Difference]: Finished difference Result 78114 states and 92932 transitions. [2018-10-24 15:01:24,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-24 15:01:24,147 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 290 [2018-10-24 15:01:24,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:01:24,210 INFO L225 Difference]: With dead ends: 78114 [2018-10-24 15:01:24,211 INFO L226 Difference]: Without dead ends: 45695 [2018-10-24 15:01:24,245 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 294 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2018-10-24 15:01:24,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45695 states. [2018-10-24 15:01:25,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45695 to 45690. [2018-10-24 15:01:25,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45690 states. [2018-10-24 15:01:25,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45690 states to 45690 states and 50747 transitions. [2018-10-24 15:01:25,196 INFO L78 Accepts]: Start accepts. Automaton has 45690 states and 50747 transitions. Word has length 290 [2018-10-24 15:01:25,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:01:25,197 INFO L481 AbstractCegarLoop]: Abstraction has 45690 states and 50747 transitions. [2018-10-24 15:01:25,197 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-24 15:01:25,197 INFO L276 IsEmpty]: Start isEmpty. Operand 45690 states and 50747 transitions. [2018-10-24 15:01:25,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2018-10-24 15:01:25,236 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:01:25,236 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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] [2018-10-24 15:01:25,236 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:01:25,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:01:25,237 INFO L82 PathProgramCache]: Analyzing trace with hash 643374151, now seen corresponding path program 1 times [2018-10-24 15:01:25,237 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:01:25,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:01:25,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:25,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:01:25,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:25,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:01:25,643 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 196 proven. 5 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-10-24 15:01:25,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 15:01:25,643 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 15:01:25,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:01:25,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:01:25,812 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 15:01:25,906 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 196 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2018-10-24 15:01:25,928 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 15:01:25,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2018-10-24 15:01:25,929 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 15:01:25,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 15:01:25,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-24 15:01:25,930 INFO L87 Difference]: Start difference. First operand 45690 states and 50747 transitions. Second operand 5 states. [2018-10-24 15:01:28,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:01:28,619 INFO L93 Difference]: Finished difference Result 287405 states and 319884 transitions. [2018-10-24 15:01:28,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 15:01:28,619 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 352 [2018-10-24 15:01:28,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:01:28,943 INFO L225 Difference]: With dead ends: 287405 [2018-10-24 15:01:28,944 INFO L226 Difference]: Without dead ends: 241717 [2018-10-24 15:01:29,049 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 351 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-24 15:01:29,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241717 states. [2018-10-24 15:01:31,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241717 to 164881. [2018-10-24 15:01:31,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164881 states. [2018-10-24 15:01:32,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164881 states to 164881 states and 183285 transitions. [2018-10-24 15:01:32,118 INFO L78 Accepts]: Start accepts. Automaton has 164881 states and 183285 transitions. Word has length 352 [2018-10-24 15:01:32,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:01:32,118 INFO L481 AbstractCegarLoop]: Abstraction has 164881 states and 183285 transitions. [2018-10-24 15:01:32,118 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 15:01:32,119 INFO L276 IsEmpty]: Start isEmpty. Operand 164881 states and 183285 transitions. [2018-10-24 15:01:32,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2018-10-24 15:01:32,210 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:01:32,210 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 15:01:32,211 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:01:32,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:01:32,211 INFO L82 PathProgramCache]: Analyzing trace with hash -1827078017, now seen corresponding path program 1 times [2018-10-24 15:01:32,212 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:01:32,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:01:32,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:32,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:01:32,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:32,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:01:32,633 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 238 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-10-24 15:01:32,633 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:01:32,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 15:01:32,634 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 15:01:32,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 15:01:32,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 15:01:32,635 INFO L87 Difference]: Start difference. First operand 164881 states and 183285 transitions. Second operand 3 states. [2018-10-24 15:01:36,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:01:36,742 INFO L93 Difference]: Finished difference Result 429106 states and 475630 transitions. [2018-10-24 15:01:36,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 15:01:36,742 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 394 [2018-10-24 15:01:36,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:01:37,075 INFO L225 Difference]: With dead ends: 429106 [2018-10-24 15:01:37,075 INFO L226 Difference]: Without dead ends: 264227 [2018-10-24 15:01:37,188 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 15:01:37,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264227 states. [2018-10-24 15:01:41,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264227 to 264223. [2018-10-24 15:01:41,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264223 states. [2018-10-24 15:01:41,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264223 states to 264223 states and 292300 transitions. [2018-10-24 15:01:41,730 INFO L78 Accepts]: Start accepts. Automaton has 264223 states and 292300 transitions. Word has length 394 [2018-10-24 15:01:41,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:01:41,730 INFO L481 AbstractCegarLoop]: Abstraction has 264223 states and 292300 transitions. [2018-10-24 15:01:41,730 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 15:01:41,730 INFO L276 IsEmpty]: Start isEmpty. Operand 264223 states and 292300 transitions. [2018-10-24 15:01:41,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2018-10-24 15:01:41,836 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:01:41,836 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 15:01:41,837 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:01:41,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:01:41,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1542513633, now seen corresponding path program 1 times [2018-10-24 15:01:41,837 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:01:41,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:01:41,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:41,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:01:41,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:41,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:01:42,744 WARN L179 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-24 15:01:43,489 WARN L179 SmtUtils]: Spent 694.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 20 [2018-10-24 15:01:43,797 WARN L179 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 31 [2018-10-24 15:01:44,425 INFO L134 CoverageAnalysis]: Checked inductivity of 536 backedges. 0 proven. 280 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-10-24 15:01:44,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 15:01:44,425 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 15:01:44,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:01:44,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:01:44,608 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 15:01:46,733 INFO L134 CoverageAnalysis]: Checked inductivity of 536 backedges. 262 proven. 0 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2018-10-24 15:01:46,772 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 15:01:46,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 10 [2018-10-24 15:01:46,775 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-24 15:01:46,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-24 15:01:46,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-10-24 15:01:46,775 INFO L87 Difference]: Start difference. First operand 264223 states and 292300 transitions. Second operand 10 states. [2018-10-24 15:02:06,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:02:06,629 INFO L93 Difference]: Finished difference Result 731885 states and 823459 transitions. [2018-10-24 15:02:06,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-24 15:02:06,630 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 469 [2018-10-24 15:02:06,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:02:07,495 INFO L225 Difference]: With dead ends: 731885 [2018-10-24 15:02:07,495 INFO L226 Difference]: Without dead ends: 467664 [2018-10-24 15:02:07,749 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 498 GetRequests, 477 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=132, Invalid=210, Unknown=0, NotChecked=0, Total=342 [2018-10-24 15:02:08,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467664 states. [2018-10-24 15:02:14,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467664 to 339592. [2018-10-24 15:02:14,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339592 states. [2018-10-24 15:02:15,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339592 states to 339592 states and 374231 transitions. [2018-10-24 15:02:15,011 INFO L78 Accepts]: Start accepts. Automaton has 339592 states and 374231 transitions. Word has length 469 [2018-10-24 15:02:15,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:02:15,012 INFO L481 AbstractCegarLoop]: Abstraction has 339592 states and 374231 transitions. [2018-10-24 15:02:15,012 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-24 15:02:15,012 INFO L276 IsEmpty]: Start isEmpty. Operand 339592 states and 374231 transitions. [2018-10-24 15:02:16,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 583 [2018-10-24 15:02:16,660 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:02:16,660 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 9, 9, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 15:02:16,660 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:02:16,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:02:16,661 INFO L82 PathProgramCache]: Analyzing trace with hash -533257052, now seen corresponding path program 1 times [2018-10-24 15:02:16,661 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:02:16,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:02:16,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:02:16,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:02:16,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:02:16,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:02:17,201 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 8 [2018-10-24 15:02:17,344 INFO L134 CoverageAnalysis]: Checked inductivity of 1062 backedges. 366 proven. 0 refuted. 0 times theorem prover too weak. 696 trivial. 0 not checked. [2018-10-24 15:02:17,344 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:02:17,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 15:02:17,345 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 15:02:17,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 15:02:17,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 15:02:17,346 INFO L87 Difference]: Start difference. First operand 339592 states and 374231 transitions. Second operand 5 states. [2018-10-24 15:02:22,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:02:22,805 INFO L93 Difference]: Finished difference Result 721215 states and 793117 transitions. [2018-10-24 15:02:22,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 15:02:22,806 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 582 [2018-10-24 15:02:22,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:02:23,347 INFO L225 Difference]: With dead ends: 721215 [2018-10-24 15:02:23,348 INFO L226 Difference]: Without dead ends: 382238 [2018-10-24 15:02:23,557 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 15:02:23,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382238 states. [2018-10-24 15:02:29,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382238 to 378341. [2018-10-24 15:02:29,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378341 states. [2018-10-24 15:02:30,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378341 states to 378341 states and 413728 transitions. [2018-10-24 15:02:30,930 INFO L78 Accepts]: Start accepts. Automaton has 378341 states and 413728 transitions. Word has length 582 [2018-10-24 15:02:30,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:02:30,930 INFO L481 AbstractCegarLoop]: Abstraction has 378341 states and 413728 transitions. [2018-10-24 15:02:30,930 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 15:02:30,931 INFO L276 IsEmpty]: Start isEmpty. Operand 378341 states and 413728 transitions. [2018-10-24 15:02:31,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 614 [2018-10-24 15:02:31,191 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:02:31,192 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 9, 9, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-24 15:02:31,192 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:02:31,192 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:02:31,192 INFO L82 PathProgramCache]: Analyzing trace with hash -760803655, now seen corresponding path program 1 times [2018-10-24 15:02:31,193 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:02:31,193 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:02:31,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:02:31,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:02:31,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:02:31,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:02:31,904 INFO L134 CoverageAnalysis]: Checked inductivity of 1155 backedges. 459 proven. 0 refuted. 0 times theorem prover too weak. 696 trivial. 0 not checked. [2018-10-24 15:02:31,905 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:02:31,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 15:02:31,906 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 15:02:31,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 15:02:31,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 15:02:31,907 INFO L87 Difference]: Start difference. First operand 378341 states and 413728 transitions. Second operand 4 states. [2018-10-24 15:02:42,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:02:42,881 INFO L93 Difference]: Finished difference Result 981351 states and 1072026 transitions. [2018-10-24 15:02:42,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 15:02:42,881 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 613 [2018-10-24 15:02:42,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:02:43,708 INFO L225 Difference]: With dead ends: 981351 [2018-10-24 15:02:43,708 INFO L226 Difference]: Without dead ends: 603420 [2018-10-24 15:02:43,947 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 15:02:44,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603420 states. [2018-10-24 15:02:51,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603420 to 599936. [2018-10-24 15:02:51,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599936 states. [2018-10-24 15:02:53,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599936 states to 599936 states and 654870 transitions. [2018-10-24 15:02:53,870 INFO L78 Accepts]: Start accepts. Automaton has 599936 states and 654870 transitions. Word has length 613 [2018-10-24 15:02:53,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:02:53,870 INFO L481 AbstractCegarLoop]: Abstraction has 599936 states and 654870 transitions. [2018-10-24 15:02:53,870 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 15:02:53,870 INFO L276 IsEmpty]: Start isEmpty. Operand 599936 states and 654870 transitions. [2018-10-24 15:02:54,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 665 [2018-10-24 15:02:54,185 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:02:54,186 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 15:02:54,186 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:02:54,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:02:54,187 INFO L82 PathProgramCache]: Analyzing trace with hash 242882915, now seen corresponding path program 1 times [2018-10-24 15:02:54,187 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:02:54,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:02:54,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:02:54,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:02:54,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:02:54,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:02:54,708 INFO L134 CoverageAnalysis]: Checked inductivity of 1297 backedges. 692 proven. 0 refuted. 0 times theorem prover too weak. 605 trivial. 0 not checked. [2018-10-24 15:02:54,708 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:02:54,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 15:02:54,709 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 15:02:54,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 15:02:54,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 15:02:54,710 INFO L87 Difference]: Start difference. First operand 599936 states and 654870 transitions. Second operand 3 states. [2018-10-24 15:03:03,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:03:03,780 INFO L93 Difference]: Finished difference Result 1560872 states and 1700382 transitions. [2018-10-24 15:03:03,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 15:03:03,781 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 664 [2018-10-24 15:03:03,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:03:05,297 INFO L225 Difference]: With dead ends: 1560872 [2018-10-24 15:03:05,298 INFO L226 Difference]: Without dead ends: 961346 [2018-10-24 15:03:05,632 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 15:03:06,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 961346 states. [2018-10-24 15:03:30,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 961346 to 960936. [2018-10-24 15:03:30,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 960936 states. [2018-10-24 15:03:33,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 960936 states to 960936 states and 1042174 transitions. [2018-10-24 15:03:33,382 INFO L78 Accepts]: Start accepts. Automaton has 960936 states and 1042174 transitions. Word has length 664 [2018-10-24 15:03:33,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:03:33,383 INFO L481 AbstractCegarLoop]: Abstraction has 960936 states and 1042174 transitions. [2018-10-24 15:03:33,383 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 15:03:33,383 INFO L276 IsEmpty]: Start isEmpty. Operand 960936 states and 1042174 transitions. [2018-10-24 15:03:33,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 707 [2018-10-24 15:03:33,875 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:03:33,876 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-24 15:03:33,876 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:03:33,876 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:03:33,877 INFO L82 PathProgramCache]: Analyzing trace with hash 847419171, now seen corresponding path program 1 times [2018-10-24 15:03:33,877 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:03:33,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:03:33,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:03:33,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:03:33,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:03:33,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:03:34,636 WARN L179 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 7 [2018-10-24 15:03:35,971 INFO L134 CoverageAnalysis]: Checked inductivity of 1563 backedges. 523 proven. 0 refuted. 0 times theorem prover too weak. 1040 trivial. 0 not checked. [2018-10-24 15:03:35,972 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:03:35,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 15:03:35,973 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 15:03:35,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 15:03:35,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 15:03:35,973 INFO L87 Difference]: Start difference. First operand 960936 states and 1042174 transitions. Second operand 4 states. Received shutdown request... [2018-10-24 15:03:57,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 15:03:57,540 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-24 15:03:57,545 WARN L205 ceAbstractionStarter]: Timeout [2018-10-24 15:03:57,545 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 03:03:57 BoogieIcfgContainer [2018-10-24 15:03:57,546 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-24 15:03:57,547 INFO L168 Benchmark]: Toolchain (without parser) took 203139.76 ms. Allocated memory was 1.5 GB in the beginning and 6.9 GB in the end (delta: 5.4 GB). Free memory was 1.4 GB in the beginning and 4.7 GB in the end (delta: -3.3 GB). Peak memory consumption was 5.0 GB. Max. memory is 7.1 GB. [2018-10-24 15:03:57,548 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 15:03:57,548 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1100.07 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 84.6 MB). Peak memory consumption was 84.6 MB. Max. memory is 7.1 GB. [2018-10-24 15:03:57,549 INFO L168 Benchmark]: Boogie Procedure Inliner took 319.31 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 742.9 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -868.2 MB). Peak memory consumption was 40.3 MB. Max. memory is 7.1 GB. [2018-10-24 15:03:57,550 INFO L168 Benchmark]: Boogie Preprocessor took 113.01 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: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. [2018-10-24 15:03:57,551 INFO L168 Benchmark]: RCFGBuilder took 5613.53 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 261.2 MB). Peak memory consumption was 261.2 MB. Max. memory is 7.1 GB. [2018-10-24 15:03:57,551 INFO L168 Benchmark]: TraceAbstraction took 195988.36 ms. Allocated memory was 2.3 GB in the beginning and 6.9 GB in the end (delta: 4.7 GB). Free memory was 1.9 GB in the beginning and 4.7 GB in the end (delta: -2.8 GB). Peak memory consumption was 4.8 GB. Max. memory is 7.1 GB. [2018-10-24 15:03:57,557 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.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1100.07 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 319.31 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 742.9 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -868.2 MB). Peak memory consumption was 40.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 113.01 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: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 5613.53 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 261.2 MB). Peak memory consumption was 261.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 195988.36 ms. Allocated memory was 2.3 GB in the beginning and 6.9 GB in the end (delta: 4.7 GB). Free memory was 1.9 GB in the beginning and 4.7 GB in the end (delta: -2.8 GB). Peak memory consumption was 4.8 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1539]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1539). Cancelled while BasicCegarLoop was constructing difference of abstraction (960936states) and FLOYD_HOARE automaton (currently 4 states, 4 states before enhancement),while ReachableStatesComputation was computing reachable states (1552798 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 303 locations, 1 error locations. TIMEOUT Result, 195.8s OverallTime, 19 OverallIterations, 10 TraceHistogramMax, 115.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5414 SDtfs, 15299 SDslu, 4966 SDs, 0 SdLazy, 25275 SolverSat, 4224 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 59.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1209 GetRequests, 1141 SyntacticMatches, 10 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 4.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=960936occurred in iteration=18, 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: 62.7s AutomataMinimizationTime, 18 MinimizatonAttempts, 231000 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 9.0s InterpolantComputationTime, 7596 NumberOfCodeBlocks, 7596 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 7574 ConstructedInterpolants, 0 QuantifiedInterpolants, 7981403 SizeOfPredicates, 1 NumberOfNonLiveVariables, 1802 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 22 InterpolantComputations, 19 PerfectInterpolantSequences, 7918/8207 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown