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_label06_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1dbac8b [2018-10-26 19:58:03,468 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 19:58:03,472 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 19:58:03,486 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 19:58:03,487 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 19:58:03,488 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 19:58:03,490 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 19:58:03,492 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 19:58:03,495 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 19:58:03,497 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 19:58:03,498 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 19:58:03,500 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 19:58:03,501 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 19:58:03,503 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 19:58:03,506 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 19:58:03,507 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 19:58:03,508 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 19:58:03,517 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 19:58:03,521 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 19:58:03,523 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 19:58:03,525 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 19:58:03,527 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 19:58:03,529 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 19:58:03,529 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 19:58:03,530 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 19:58:03,530 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 19:58:03,531 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 19:58:03,532 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 19:58:03,533 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 19:58:03,534 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 19:58:03,534 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 19:58:03,535 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 19:58:03,535 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 19:58:03,535 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 19:58:03,536 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 19:58:03,537 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 19:58:03,537 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-26 19:58:03,552 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 19:58:03,552 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 19:58:03,553 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 19:58:03,553 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-26 19:58:03,554 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-26 19:58:03,554 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-26 19:58:03,554 INFO L133 SettingsManager]: * Use SBE=true [2018-10-26 19:58:03,555 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 19:58:03,555 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 19:58:03,555 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 19:58:03,555 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 19:58:03,555 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 19:58:03,556 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 19:58:03,556 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 19:58:03,556 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 19:58:03,556 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 19:58:03,556 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 19:58:03,557 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 19:58:03,557 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 19:58:03,557 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 19:58:03,557 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 19:58:03,557 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 19:58:03,558 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 19:58:03,558 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-26 19:58:03,558 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 19:58:03,558 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 19:58:03,558 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-26 19:58:03,559 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-26 19:58:03,608 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 19:58:03,623 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 19:58:03,627 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 19:58:03,628 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 19:58:03,629 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 19:58:03,629 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label06_true-unreach-call.c [2018-10-26 19:58:03,706 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/150cd31c6/a6f675a377ad4467acf4a483eec0fb6c/FLAG3377e3fbc [2018-10-26 19:58:04,339 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 19:58:04,340 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label06_true-unreach-call.c [2018-10-26 19:58:04,363 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/150cd31c6/a6f675a377ad4467acf4a483eec0fb6c/FLAG3377e3fbc [2018-10-26 19:58:04,384 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/150cd31c6/a6f675a377ad4467acf4a483eec0fb6c [2018-10-26 19:58:04,397 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 19:58:04,398 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-26 19:58:04,399 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 19:58:04,399 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 19:58:04,406 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 19:58:04,407 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 07:58:04" (1/1) ... [2018-10-26 19:58:04,410 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38d90973 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:58:04, skipping insertion in model container [2018-10-26 19:58:04,410 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 07:58:04" (1/1) ... [2018-10-26 19:58:04,421 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 19:58:04,526 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 19:58:05,280 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 19:58:05,287 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 19:58:05,596 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 19:58:05,621 INFO L193 MainTranslator]: Completed translation [2018-10-26 19:58:05,622 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:58:05 WrapperNode [2018-10-26 19:58:05,622 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 19:58:05,624 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 19:58:05,624 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 19:58:05,624 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 19:58:05,636 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:58:05" (1/1) ... [2018-10-26 19:58:05,688 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:58:05" (1/1) ... [2018-10-26 19:58:05,975 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 19:58:05,975 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 19:58:05,975 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 19:58:05,975 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 19:58:05,987 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:58:05" (1/1) ... [2018-10-26 19:58:05,988 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:58:05" (1/1) ... [2018-10-26 19:58:05,998 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:58:05" (1/1) ... [2018-10-26 19:58:05,998 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:58:05" (1/1) ... [2018-10-26 19:58:06,057 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:58:05" (1/1) ... [2018-10-26 19:58:06,082 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:58:05" (1/1) ... [2018-10-26 19:58:06,098 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:58:05" (1/1) ... [2018-10-26 19:58:06,116 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 19:58:06,116 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 19:58:06,117 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 19:58:06,117 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 19:58:06,118 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:58:05" (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-26 19:58:06,186 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-26 19:58:06,186 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 19:58:06,186 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 19:58:11,713 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 19:58:11,714 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 07:58:11 BoogieIcfgContainer [2018-10-26 19:58:11,715 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 19:58:11,717 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 19:58:11,717 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 19:58:11,721 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 19:58:11,721 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 07:58:04" (1/3) ... [2018-10-26 19:58:11,723 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3142e4c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 07:58:11, skipping insertion in model container [2018-10-26 19:58:11,723 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:58:05" (2/3) ... [2018-10-26 19:58:11,723 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3142e4c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 07:58:11, skipping insertion in model container [2018-10-26 19:58:11,723 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 07:58:11" (3/3) ... [2018-10-26 19:58:11,726 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label06_true-unreach-call.c [2018-10-26 19:58:11,737 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 19:58:11,749 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-26 19:58:11,766 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-26 19:58:11,803 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-26 19:58:11,804 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 19:58:11,805 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 19:58:11,805 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 19:58:11,805 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 19:58:11,805 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 19:58:11,805 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 19:58:11,805 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 19:58:11,806 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 19:58:11,834 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states. [2018-10-26 19:58:11,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-10-26 19:58:11,852 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:58:11,853 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:58:11,856 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:58:11,861 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:58:11,862 INFO L82 PathProgramCache]: Analyzing trace with hash -696038692, now seen corresponding path program 1 times [2018-10-26 19:58:11,863 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:58:11,864 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:58:11,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:11,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:58:11,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:12,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:58:12,708 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-26 19:58:12,711 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:58:12,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:58:12,718 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 19:58:12,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 19:58:12,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:58:12,737 INFO L87 Difference]: Start difference. First operand 303 states. Second operand 4 states. [2018-10-26 19:58:16,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:58:16,714 INFO L93 Difference]: Finished difference Result 1027 states and 1865 transitions. [2018-10-26 19:58:16,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 19:58:16,717 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 170 [2018-10-26 19:58:16,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:58:16,756 INFO L225 Difference]: With dead ends: 1027 [2018-10-26 19:58:16,756 INFO L226 Difference]: Without dead ends: 717 [2018-10-26 19:58:16,763 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-26 19:58:16,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2018-10-26 19:58:16,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 715. [2018-10-26 19:58:16,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 715 states. [2018-10-26 19:58:16,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 1145 transitions. [2018-10-26 19:58:16,871 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 1145 transitions. Word has length 170 [2018-10-26 19:58:16,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:58:16,875 INFO L481 AbstractCegarLoop]: Abstraction has 715 states and 1145 transitions. [2018-10-26 19:58:16,875 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 19:58:16,875 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1145 transitions. [2018-10-26 19:58:16,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-10-26 19:58:16,890 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:58:16,891 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, 1] [2018-10-26 19:58:16,891 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:58:16,892 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:58:16,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1090071323, now seen corresponding path program 1 times [2018-10-26 19:58:16,893 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:58:16,893 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:58:16,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:16,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:58:16,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:16,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:58:17,066 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-26 19:58:17,066 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:58:17,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 19:58:17,068 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:58:17,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:58:17,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:58:17,071 INFO L87 Difference]: Start difference. First operand 715 states and 1145 transitions. Second operand 3 states. [2018-10-26 19:58:19,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:58:19,995 INFO L93 Difference]: Finished difference Result 2058 states and 3347 transitions. [2018-10-26 19:58:19,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:58:19,995 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 179 [2018-10-26 19:58:19,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:58:20,004 INFO L225 Difference]: With dead ends: 2058 [2018-10-26 19:58:20,004 INFO L226 Difference]: Without dead ends: 1345 [2018-10-26 19:58:20,008 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-26 19:58:20,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1345 states. [2018-10-26 19:58:20,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1345 to 1331. [2018-10-26 19:58:20,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1331 states. [2018-10-26 19:58:20,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1331 states to 1331 states and 2076 transitions. [2018-10-26 19:58:20,057 INFO L78 Accepts]: Start accepts. Automaton has 1331 states and 2076 transitions. Word has length 179 [2018-10-26 19:58:20,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:58:20,057 INFO L481 AbstractCegarLoop]: Abstraction has 1331 states and 2076 transitions. [2018-10-26 19:58:20,058 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:58:20,058 INFO L276 IsEmpty]: Start isEmpty. Operand 1331 states and 2076 transitions. [2018-10-26 19:58:20,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-10-26 19:58:20,062 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:58:20,062 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:58:20,063 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:58:20,063 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:58:20,063 INFO L82 PathProgramCache]: Analyzing trace with hash -1031939488, now seen corresponding path program 1 times [2018-10-26 19:58:20,063 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:58:20,063 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:58:20,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:20,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:58:20,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:20,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:58:20,189 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-26 19:58:20,189 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:58:20,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 19:58:20,190 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:58:20,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:58:20,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:58:20,191 INFO L87 Difference]: Start difference. First operand 1331 states and 2076 transitions. Second operand 3 states. [2018-10-26 19:58:22,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:58:22,792 INFO L93 Difference]: Finished difference Result 3977 states and 6209 transitions. [2018-10-26 19:58:22,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:58:22,795 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 193 [2018-10-26 19:58:22,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:58:22,809 INFO L225 Difference]: With dead ends: 3977 [2018-10-26 19:58:22,809 INFO L226 Difference]: Without dead ends: 2648 [2018-10-26 19:58:22,812 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:58:22,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2648 states. [2018-10-26 19:58:22,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2648 to 2645. [2018-10-26 19:58:22,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2645 states. [2018-10-26 19:58:22,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2645 states to 2645 states and 4120 transitions. [2018-10-26 19:58:22,881 INFO L78 Accepts]: Start accepts. Automaton has 2645 states and 4120 transitions. Word has length 193 [2018-10-26 19:58:22,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:58:22,882 INFO L481 AbstractCegarLoop]: Abstraction has 2645 states and 4120 transitions. [2018-10-26 19:58:22,882 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:58:22,882 INFO L276 IsEmpty]: Start isEmpty. Operand 2645 states and 4120 transitions. [2018-10-26 19:58:22,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-10-26 19:58:22,890 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:58:22,891 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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] [2018-10-26 19:58:22,891 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:58:22,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:58:22,891 INFO L82 PathProgramCache]: Analyzing trace with hash 133312332, now seen corresponding path program 1 times [2018-10-26 19:58:22,891 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:58:22,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:58:22,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:22,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:58:22,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:22,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:58:23,089 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-10-26 19:58:23,090 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:58:23,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 19:58:23,090 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:58:23,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:58:23,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:58:23,091 INFO L87 Difference]: Start difference. First operand 2645 states and 4120 transitions. Second operand 3 states. [2018-10-26 19:58:23,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:58:23,873 INFO L93 Difference]: Finished difference Result 5250 states and 8186 transitions. [2018-10-26 19:58:23,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:58:23,883 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 201 [2018-10-26 19:58:23,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:58:23,896 INFO L225 Difference]: With dead ends: 5250 [2018-10-26 19:58:23,896 INFO L226 Difference]: Without dead ends: 2607 [2018-10-26 19:58:23,900 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-26 19:58:23,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2607 states. [2018-10-26 19:58:23,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2607 to 2607. [2018-10-26 19:58:23,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2607 states. [2018-10-26 19:58:23,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2607 states to 2607 states and 3992 transitions. [2018-10-26 19:58:23,954 INFO L78 Accepts]: Start accepts. Automaton has 2607 states and 3992 transitions. Word has length 201 [2018-10-26 19:58:23,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:58:23,954 INFO L481 AbstractCegarLoop]: Abstraction has 2607 states and 3992 transitions. [2018-10-26 19:58:23,955 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:58:23,955 INFO L276 IsEmpty]: Start isEmpty. Operand 2607 states and 3992 transitions. [2018-10-26 19:58:23,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-10-26 19:58:23,962 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:58:23,963 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:58:23,963 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:58:23,963 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:58:23,963 INFO L82 PathProgramCache]: Analyzing trace with hash -1347645992, now seen corresponding path program 1 times [2018-10-26 19:58:23,964 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:58:23,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:58:23,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:23,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:58:23,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:23,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:58:24,432 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2018-10-26 19:58:24,471 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-26 19:58:24,472 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:58:24,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 19:58:24,472 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 19:58:24,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 19:58:24,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-26 19:58:24,473 INFO L87 Difference]: Start difference. First operand 2607 states and 3992 transitions. Second operand 5 states. [2018-10-26 19:58:28,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:58:28,597 INFO L93 Difference]: Finished difference Result 6279 states and 9778 transitions. [2018-10-26 19:58:28,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 19:58:28,598 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 210 [2018-10-26 19:58:28,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:58:28,616 INFO L225 Difference]: With dead ends: 6279 [2018-10-26 19:58:28,616 INFO L226 Difference]: Without dead ends: 3674 [2018-10-26 19:58:28,620 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-26 19:58:28,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3674 states. [2018-10-26 19:58:28,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3674 to 3015. [2018-10-26 19:58:28,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3015 states. [2018-10-26 19:58:28,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3015 states to 3015 states and 4612 transitions. [2018-10-26 19:58:28,679 INFO L78 Accepts]: Start accepts. Automaton has 3015 states and 4612 transitions. Word has length 210 [2018-10-26 19:58:28,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:58:28,679 INFO L481 AbstractCegarLoop]: Abstraction has 3015 states and 4612 transitions. [2018-10-26 19:58:28,679 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 19:58:28,679 INFO L276 IsEmpty]: Start isEmpty. Operand 3015 states and 4612 transitions. [2018-10-26 19:58:28,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-10-26 19:58:28,686 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:58:28,686 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 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-26 19:58:28,687 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:58:28,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:58:28,687 INFO L82 PathProgramCache]: Analyzing trace with hash -1621362332, now seen corresponding path program 1 times [2018-10-26 19:58:28,687 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:58:28,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:58:28,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:28,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:58:28,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:28,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:58:28,966 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 62 proven. 10 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-10-26 19:58:28,966 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:58:28,966 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-26 19:58:28,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:58:29,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:58:29,151 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 19:58:29,241 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-10-26 19:58:29,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 19:58:29,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 3 [2018-10-26 19:58:29,283 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 19:58:29,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 19:58:29,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:58:29,283 INFO L87 Difference]: Start difference. First operand 3015 states and 4612 transitions. Second operand 4 states. [2018-10-26 19:58:32,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:58:32,836 INFO L93 Difference]: Finished difference Result 12048 states and 18435 transitions. [2018-10-26 19:58:32,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 19:58:32,837 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 246 [2018-10-26 19:58:32,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:58:32,882 INFO L225 Difference]: With dead ends: 12048 [2018-10-26 19:58:32,882 INFO L226 Difference]: Without dead ends: 9035 [2018-10-26 19:58:32,889 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 246 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-26 19:58:32,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9035 states. [2018-10-26 19:58:33,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9035 to 6022. [2018-10-26 19:58:33,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6022 states. [2018-10-26 19:58:33,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6022 states to 6022 states and 9192 transitions. [2018-10-26 19:58:33,044 INFO L78 Accepts]: Start accepts. Automaton has 6022 states and 9192 transitions. Word has length 246 [2018-10-26 19:58:33,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:58:33,044 INFO L481 AbstractCegarLoop]: Abstraction has 6022 states and 9192 transitions. [2018-10-26 19:58:33,044 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 19:58:33,045 INFO L276 IsEmpty]: Start isEmpty. Operand 6022 states and 9192 transitions. [2018-10-26 19:58:33,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-10-26 19:58:33,055 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:58:33,055 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 19:58:33,055 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:58:33,056 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:58:33,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1056061885, now seen corresponding path program 1 times [2018-10-26 19:58:33,056 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:58:33,056 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:58:33,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:33,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:58:33,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:33,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:58:33,322 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-26 19:58:33,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:58:33,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:58:33,323 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:58:33,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:58:33,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:58:33,327 INFO L87 Difference]: Start difference. First operand 6022 states and 9192 transitions. Second operand 3 states. [2018-10-26 19:58:34,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:58:34,820 INFO L93 Difference]: Finished difference Result 17361 states and 26560 transitions. [2018-10-26 19:58:34,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:58:34,822 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 246 [2018-10-26 19:58:34,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:58:34,874 INFO L225 Difference]: With dead ends: 17361 [2018-10-26 19:58:34,874 INFO L226 Difference]: Without dead ends: 11341 [2018-10-26 19:58:34,889 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-26 19:58:34,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11341 states. [2018-10-26 19:58:35,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11341 to 11337. [2018-10-26 19:58:35,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11337 states. [2018-10-26 19:58:35,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11337 states to 11337 states and 15999 transitions. [2018-10-26 19:58:35,109 INFO L78 Accepts]: Start accepts. Automaton has 11337 states and 15999 transitions. Word has length 246 [2018-10-26 19:58:35,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:58:35,109 INFO L481 AbstractCegarLoop]: Abstraction has 11337 states and 15999 transitions. [2018-10-26 19:58:35,110 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:58:35,110 INFO L276 IsEmpty]: Start isEmpty. Operand 11337 states and 15999 transitions. [2018-10-26 19:58:35,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-10-26 19:58:35,125 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:58:35,125 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-26 19:58:35,126 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:58:35,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:58:35,126 INFO L82 PathProgramCache]: Analyzing trace with hash -2143225122, now seen corresponding path program 1 times [2018-10-26 19:58:35,126 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:58:35,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:58:35,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:35,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:58:35,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:35,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:58:35,561 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:58:35,561 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:58:35,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:58:35,562 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 19:58:35,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 19:58:35,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:58:35,562 INFO L87 Difference]: Start difference. First operand 11337 states and 15999 transitions. Second operand 4 states. [2018-10-26 19:58:38,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:58:38,490 INFO L93 Difference]: Finished difference Result 41586 states and 58258 transitions. [2018-10-26 19:58:38,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 19:58:38,490 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 249 [2018-10-26 19:58:38,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:58:38,557 INFO L225 Difference]: With dead ends: 41586 [2018-10-26 19:58:38,557 INFO L226 Difference]: Without dead ends: 30251 [2018-10-26 19:58:38,578 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-26 19:58:38,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30251 states. [2018-10-26 19:58:38,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30251 to 21129. [2018-10-26 19:58:38,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21129 states. [2018-10-26 19:58:38,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21129 states to 21129 states and 28285 transitions. [2018-10-26 19:58:38,961 INFO L78 Accepts]: Start accepts. Automaton has 21129 states and 28285 transitions. Word has length 249 [2018-10-26 19:58:38,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:58:38,961 INFO L481 AbstractCegarLoop]: Abstraction has 21129 states and 28285 transitions. [2018-10-26 19:58:38,961 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 19:58:38,961 INFO L276 IsEmpty]: Start isEmpty. Operand 21129 states and 28285 transitions. [2018-10-26 19:58:38,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-10-26 19:58:38,986 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:58:38,986 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-26 19:58:38,986 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:58:38,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:58:38,987 INFO L82 PathProgramCache]: Analyzing trace with hash -2086343220, now seen corresponding path program 1 times [2018-10-26 19:58:38,987 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:58:38,987 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:58:38,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:38,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:58:38,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:39,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:58:39,146 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-10-26 19:58:39,146 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:58:39,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:58:39,147 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:58:39,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:58:39,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:58:39,148 INFO L87 Difference]: Start difference. First operand 21129 states and 28285 transitions. Second operand 3 states. [2018-10-26 19:58:40,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:58:40,732 INFO L93 Difference]: Finished difference Result 42264 states and 56582 transitions. [2018-10-26 19:58:40,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:58:40,733 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 256 [2018-10-26 19:58:40,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:58:40,772 INFO L225 Difference]: With dead ends: 42264 [2018-10-26 19:58:40,772 INFO L226 Difference]: Without dead ends: 21137 [2018-10-26 19:58:40,797 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-26 19:58:40,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21137 states. [2018-10-26 19:58:41,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21137 to 21129. [2018-10-26 19:58:41,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21129 states. [2018-10-26 19:58:41,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21129 states to 21129 states and 25984 transitions. [2018-10-26 19:58:41,349 INFO L78 Accepts]: Start accepts. Automaton has 21129 states and 25984 transitions. Word has length 256 [2018-10-26 19:58:41,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:58:41,351 INFO L481 AbstractCegarLoop]: Abstraction has 21129 states and 25984 transitions. [2018-10-26 19:58:41,351 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:58:41,351 INFO L276 IsEmpty]: Start isEmpty. Operand 21129 states and 25984 transitions. [2018-10-26 19:58:41,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2018-10-26 19:58:41,374 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:58:41,374 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 19:58:41,374 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:58:41,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:58:41,375 INFO L82 PathProgramCache]: Analyzing trace with hash 118608097, now seen corresponding path program 1 times [2018-10-26 19:58:41,375 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:58:41,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:58:41,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:41,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:58:41,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:41,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:58:41,547 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2018-10-26 19:58:41,547 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:58:41,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:58:41,548 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 19:58:41,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 19:58:41,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:58:41,548 INFO L87 Difference]: Start difference. First operand 21129 states and 25984 transitions. Second operand 4 states. [2018-10-26 19:58:42,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:58:42,946 INFO L93 Difference]: Finished difference Result 41848 states and 51444 transitions. [2018-10-26 19:58:42,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 19:58:42,946 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 273 [2018-10-26 19:58:42,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:58:42,975 INFO L225 Difference]: With dead ends: 41848 [2018-10-26 19:58:42,975 INFO L226 Difference]: Without dead ends: 20721 [2018-10-26 19:58:42,997 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-26 19:58:43,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20721 states. [2018-10-26 19:58:43,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20721 to 20721. [2018-10-26 19:58:43,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20721 states. [2018-10-26 19:58:43,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20721 states to 20721 states and 24096 transitions. [2018-10-26 19:58:43,267 INFO L78 Accepts]: Start accepts. Automaton has 20721 states and 24096 transitions. Word has length 273 [2018-10-26 19:58:43,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:58:43,267 INFO L481 AbstractCegarLoop]: Abstraction has 20721 states and 24096 transitions. [2018-10-26 19:58:43,268 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 19:58:43,268 INFO L276 IsEmpty]: Start isEmpty. Operand 20721 states and 24096 transitions. [2018-10-26 19:58:43,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2018-10-26 19:58:43,292 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:58:43,293 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-26 19:58:43,293 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:58:43,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:58:43,293 INFO L82 PathProgramCache]: Analyzing trace with hash -1644802394, now seen corresponding path program 1 times [2018-10-26 19:58:43,294 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:58:43,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:58:43,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:43,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:58:43,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:43,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:58:43,683 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2018-10-26 19:58:43,684 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:58:43,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:58:43,684 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 19:58:43,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 19:58:43,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:58:43,685 INFO L87 Difference]: Start difference. First operand 20721 states and 24096 transitions. Second operand 4 states. [2018-10-26 19:58:46,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:58:46,298 INFO L93 Difference]: Finished difference Result 81404 states and 94705 transitions. [2018-10-26 19:58:46,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 19:58:46,299 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 275 [2018-10-26 19:58:46,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:58:46,386 INFO L225 Difference]: With dead ends: 81404 [2018-10-26 19:58:46,386 INFO L226 Difference]: Without dead ends: 60685 [2018-10-26 19:58:46,416 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-26 19:58:46,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60685 states. [2018-10-26 19:58:47,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60685 to 60681. [2018-10-26 19:58:47,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60681 states. [2018-10-26 19:58:47,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60681 states to 60681 states and 70472 transitions. [2018-10-26 19:58:47,456 INFO L78 Accepts]: Start accepts. Automaton has 60681 states and 70472 transitions. Word has length 275 [2018-10-26 19:58:47,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:58:47,456 INFO L481 AbstractCegarLoop]: Abstraction has 60681 states and 70472 transitions. [2018-10-26 19:58:47,456 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 19:58:47,456 INFO L276 IsEmpty]: Start isEmpty. Operand 60681 states and 70472 transitions. [2018-10-26 19:58:47,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2018-10-26 19:58:47,475 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:58:47,475 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-26 19:58:47,476 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:58:47,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:58:47,476 INFO L82 PathProgramCache]: Analyzing trace with hash 300378130, now seen corresponding path program 1 times [2018-10-26 19:58:47,476 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:58:47,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:58:47,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:47,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:58:47,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:47,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:58:47,641 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2018-10-26 19:58:47,641 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:58:47,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:58:47,642 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:58:47,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:58:47,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:58:47,643 INFO L87 Difference]: Start difference. First operand 60681 states and 70472 transitions. Second operand 3 states. [2018-10-26 19:58:49,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:58:49,437 INFO L93 Difference]: Finished difference Result 165649 states and 191375 transitions. [2018-10-26 19:58:49,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:58:49,438 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 308 [2018-10-26 19:58:49,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:58:49,568 INFO L225 Difference]: With dead ends: 165649 [2018-10-26 19:58:49,568 INFO L226 Difference]: Without dead ends: 104970 [2018-10-26 19:58:49,623 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-26 19:58:49,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104970 states. [2018-10-26 19:58:51,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104970 to 104934. [2018-10-26 19:58:51,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104934 states. [2018-10-26 19:58:51,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104934 states to 104934 states and 118153 transitions. [2018-10-26 19:58:51,497 INFO L78 Accepts]: Start accepts. Automaton has 104934 states and 118153 transitions. Word has length 308 [2018-10-26 19:58:51,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:58:51,497 INFO L481 AbstractCegarLoop]: Abstraction has 104934 states and 118153 transitions. [2018-10-26 19:58:51,497 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:58:51,497 INFO L276 IsEmpty]: Start isEmpty. Operand 104934 states and 118153 transitions. [2018-10-26 19:58:51,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2018-10-26 19:58:51,515 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:58:51,516 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 19:58:51,516 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:58:51,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:58:51,516 INFO L82 PathProgramCache]: Analyzing trace with hash 1533517783, now seen corresponding path program 1 times [2018-10-26 19:58:51,516 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:58:51,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:58:51,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:51,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:58:51,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:51,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:58:51,741 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-10-26 19:58:51,741 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:58:51,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 19:58:51,742 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:58:51,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:58:51,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:58:51,743 INFO L87 Difference]: Start difference. First operand 104934 states and 118153 transitions. Second operand 3 states. [2018-10-26 19:58:54,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:58:54,249 INFO L93 Difference]: Finished difference Result 263408 states and 296380 transitions. [2018-10-26 19:58:54,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:58:54,249 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 309 [2018-10-26 19:58:54,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:58:54,452 INFO L225 Difference]: With dead ends: 263408 [2018-10-26 19:58:54,453 INFO L226 Difference]: Without dead ends: 158476 [2018-10-26 19:58:54,533 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:58:54,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158476 states. [2018-10-26 19:58:57,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158476 to 158458. [2018-10-26 19:58:57,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158458 states. [2018-10-26 19:58:57,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158458 states to 158458 states and 178048 transitions. [2018-10-26 19:58:57,364 INFO L78 Accepts]: Start accepts. Automaton has 158458 states and 178048 transitions. Word has length 309 [2018-10-26 19:58:57,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:58:57,364 INFO L481 AbstractCegarLoop]: Abstraction has 158458 states and 178048 transitions. [2018-10-26 19:58:57,364 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:58:57,364 INFO L276 IsEmpty]: Start isEmpty. Operand 158458 states and 178048 transitions. [2018-10-26 19:58:57,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2018-10-26 19:58:57,387 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:58:57,387 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 19:58:57,387 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:58:57,388 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:58:57,388 INFO L82 PathProgramCache]: Analyzing trace with hash -1717724757, now seen corresponding path program 1 times [2018-10-26 19:58:57,388 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:58:57,388 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:58:57,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:57,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:58:57,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:57,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:58:57,718 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-26 19:58:57,912 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 111 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-10-26 19:58:57,912 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:58:57,912 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-26 19:58:57,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:58:58,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:58:58,065 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 19:58:58,194 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2018-10-26 19:58:58,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 19:58:58,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2018-10-26 19:58:58,216 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-26 19:58:58,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-26 19:58:58,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-26 19:58:58,217 INFO L87 Difference]: Start difference. First operand 158458 states and 178048 transitions. Second operand 6 states. [2018-10-26 19:59:05,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:59:05,215 INFO L93 Difference]: Finished difference Result 454965 states and 512229 transitions. [2018-10-26 19:59:05,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-26 19:59:05,215 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 317 [2018-10-26 19:59:05,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:59:05,582 INFO L225 Difference]: With dead ends: 454965 [2018-10-26 19:59:05,583 INFO L226 Difference]: Without dead ends: 296509 [2018-10-26 19:59:05,701 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 316 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-10-26 19:59:05,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296509 states. [2018-10-26 19:59:09,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296509 to 295200. [2018-10-26 19:59:09,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295200 states. [2018-10-26 19:59:10,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295200 states to 295200 states and 321945 transitions. [2018-10-26 19:59:10,339 INFO L78 Accepts]: Start accepts. Automaton has 295200 states and 321945 transitions. Word has length 317 [2018-10-26 19:59:10,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:59:10,340 INFO L481 AbstractCegarLoop]: Abstraction has 295200 states and 321945 transitions. [2018-10-26 19:59:10,340 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-26 19:59:10,340 INFO L276 IsEmpty]: Start isEmpty. Operand 295200 states and 321945 transitions. [2018-10-26 19:59:10,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2018-10-26 19:59:10,380 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:59:10,380 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-26 19:59:10,380 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:59:10,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:59:10,381 INFO L82 PathProgramCache]: Analyzing trace with hash -22662564, now seen corresponding path program 1 times [2018-10-26 19:59:10,381 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:59:10,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:59:10,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:59:10,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:59:10,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:59:10,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:59:10,922 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2018-10-26 19:59:10,922 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:59:10,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 19:59:10,923 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 19:59:10,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 19:59:10,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-26 19:59:10,924 INFO L87 Difference]: Start difference. First operand 295200 states and 321945 transitions. Second operand 5 states. [2018-10-26 19:59:16,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:59:16,839 INFO L93 Difference]: Finished difference Result 788120 states and 855300 transitions. [2018-10-26 19:59:16,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 19:59:16,839 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 369 [2018-10-26 19:59:16,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:59:17,564 INFO L225 Difference]: With dead ends: 788120 [2018-10-26 19:59:17,564 INFO L226 Difference]: Without dead ends: 492922 [2018-10-26 19:59:25,695 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-26 19:59:25,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492922 states. [2018-10-26 19:59:31,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492922 to 461133. [2018-10-26 19:59:31,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 461133 states. [2018-10-26 19:59:31,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461133 states to 461133 states and 499637 transitions. [2018-10-26 19:59:31,904 INFO L78 Accepts]: Start accepts. Automaton has 461133 states and 499637 transitions. Word has length 369 [2018-10-26 19:59:31,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:59:31,905 INFO L481 AbstractCegarLoop]: Abstraction has 461133 states and 499637 transitions. [2018-10-26 19:59:31,905 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 19:59:31,905 INFO L276 IsEmpty]: Start isEmpty. Operand 461133 states and 499637 transitions. [2018-10-26 19:59:31,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2018-10-26 19:59:31,949 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:59:31,950 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 19:59:31,950 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:59:31,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:59:31,951 INFO L82 PathProgramCache]: Analyzing trace with hash 621590431, now seen corresponding path program 1 times [2018-10-26 19:59:31,951 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:59:31,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:59:31,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:59:31,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:59:31,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:59:31,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:59:32,404 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2018-10-26 19:59:32,404 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:59:32,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:59:32,405 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 19:59:32,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 19:59:32,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:59:32,406 INFO L87 Difference]: Start difference. First operand 461133 states and 499637 transitions. Second operand 4 states. [2018-10-26 19:59:41,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:59:41,591 INFO L93 Difference]: Finished difference Result 1337409 states and 1443549 transitions. [2018-10-26 19:59:41,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 19:59:41,592 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 380 [2018-10-26 19:59:41,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:59:42,917 INFO L225 Difference]: With dead ends: 1337409 [2018-10-26 19:59:42,917 INFO L226 Difference]: Without dead ends: 876278 [2018-10-26 19:59:43,114 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:59:43,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 876278 states. [2018-10-26 20:00:04,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 876278 to 732371. [2018-10-26 20:00:04,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 732371 states. [2018-10-26 20:00:06,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732371 states to 732371 states and 786049 transitions. [2018-10-26 20:00:06,736 INFO L78 Accepts]: Start accepts. Automaton has 732371 states and 786049 transitions. Word has length 380 [2018-10-26 20:00:06,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:00:06,736 INFO L481 AbstractCegarLoop]: Abstraction has 732371 states and 786049 transitions. [2018-10-26 20:00:06,736 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:00:06,737 INFO L276 IsEmpty]: Start isEmpty. Operand 732371 states and 786049 transitions. [2018-10-26 20:00:06,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2018-10-26 20:00:06,776 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:00:06,777 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 20:00:06,777 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:00:06,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:00:06,778 INFO L82 PathProgramCache]: Analyzing trace with hash -2012126856, now seen corresponding path program 1 times [2018-10-26 20:00:06,778 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:00:06,778 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:00:06,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:00:06,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:00:06,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:00:06,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:00:07,325 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 203 proven. 10 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2018-10-26 20:00:07,326 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:00:07,326 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-26 20:00:07,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:00:07,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:00:07,506 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:00:07,623 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 220 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-10-26 20:00:07,645 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 20:00:07,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2018-10-26 20:00:07,647 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-26 20:00:07,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-26 20:00:07,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-10-26 20:00:07,647 INFO L87 Difference]: Start difference. First operand 732371 states and 786049 transitions. Second operand 8 states. [2018-10-26 20:00:09,005 WARN L179 SmtUtils]: Spent 1.34 s on a formula simplification. DAG size of input: 13 DAG size of output: 11 [2018-10-26 20:00:27,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:00:27,197 INFO L93 Difference]: Finished difference Result 1975978 states and 2123306 transitions. [2018-10-26 20:00:27,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-26 20:00:27,198 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 393 [2018-10-26 20:00:27,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:00:27,198 INFO L225 Difference]: With dead ends: 1975978 [2018-10-26 20:00:27,198 INFO L226 Difference]: Without dead ends: 0 [2018-10-26 20:00:27,623 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 403 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=117, Invalid=225, Unknown=0, NotChecked=0, Total=342 [2018-10-26 20:00:27,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-26 20:00:27,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-26 20:00:27,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-26 20:00:27,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-26 20:00:27,624 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 393 [2018-10-26 20:00:27,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:00:27,625 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-26 20:00:27,625 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-26 20:00:27,625 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-26 20:00:27,625 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-26 20:00:27,630 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-26 20:00:48,866 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:00:49,169 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:00:49,170 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:00:55,545 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:01:06,279 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:01:06,280 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:01:09,498 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:01:09,545 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:01:09,550 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:01:09,580 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:01:09,760 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:01:09,967 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:01:09,991 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:01:10,129 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:01:10,263 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:01:10,307 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:01:10,314 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:01:10,651 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:01:10,861 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:01:11,007 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:01:11,822 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:01:11,836 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:01:11,908 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:01:12,033 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:01:12,137 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:01:12,224 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:01:12,265 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:01:12,851 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:01:12,910 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:01:12,920 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:01:13,037 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:01:13,163 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:01:13,173 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:01:13,203 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:01:13,277 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:01:13,348 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:01:13,729 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:01:13,768 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:01:13,828 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:01:13,839 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:01:13,985 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:01:14,113 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:01:14,561 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:01:14,605 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:01:14,631 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:01:14,761 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:01:15,479 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:01:15,883 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:01:16,592 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:01:16,820 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:01:16,855 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:01:17,026 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:01:17,093 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:01:17,140 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:01:17,631 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:01:17,785 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:01:17,826 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:01:17,909 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:01:18,106 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:01:18,632 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:01:18,968 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:01:19,021 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:01:19,313 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:01:19,487 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:01:19,866 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:01:20,557 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:01:21,981 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:01:22,412 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:01:22,758 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:01:22,955 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:01:23,373 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:01:23,439 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:01:23,509 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:01:24,014 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:01:24,264 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:01:24,563 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:01:24,663 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:01:25,898 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:01:26,831 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:01:27,287 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:01:27,893 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:01:28,619 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:01:29,384 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:01:29,518 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:01:29,776 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:01:29,825 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:01:30,902 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:01:33,053 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:01:33,761 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:01:34,149 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:01:35,055 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:01:35,251 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:01:35,367 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:01:35,396 WARN L250 erpolLogProxyWrapper]: Already inconsistent. Received shutdown request... [2018-10-26 20:01:35,750 INFO L256 ToolchainWalker]: Toolchain cancelled while executing plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction. Reason: Timeout or Toolchain cancelled by user [2018-10-26 20:01:35,751 INFO L168 Benchmark]: Toolchain (without parser) took 211353.82 ms. Allocated memory was 1.5 GB in the beginning and 5.9 GB in the end (delta: 4.4 GB). Free memory was 1.4 GB in the beginning and 4.6 GB in the end (delta: -3.2 GB). Peak memory consumption was 5.6 GB. Max. memory is 7.1 GB. [2018-10-26 20:01:35,752 INFO L168 Benchmark]: CDTParser took 0.24 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-26 20:01:35,753 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1224.27 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-26 20:01:35,754 INFO L168 Benchmark]: Boogie Procedure Inliner took 350.98 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 748.7 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -873.2 MB). Peak memory consumption was 40.5 MB. Max. memory is 7.1 GB. [2018-10-26 20:01:35,754 INFO L168 Benchmark]: Boogie Preprocessor took 140.94 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.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 7.1 GB. [2018-10-26 20:01:35,756 INFO L168 Benchmark]: RCFGBuilder took 5598.43 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: 265.9 MB). Peak memory consumption was 265.9 MB. Max. memory is 7.1 GB. [2018-10-26 20:01:35,756 INFO L168 Benchmark]: TraceAbstraction took 204033.11 ms. Allocated memory was 2.3 GB in the beginning and 5.9 GB in the end (delta: 3.6 GB). Free memory was 1.9 GB in the beginning and 4.6 GB in the end (delta: -2.7 GB). Peak memory consumption was 5.4 GB. Max. memory is 7.1 GB. [2018-10-26 20:01:35,762 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.24 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 1224.27 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 350.98 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 748.7 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -873.2 MB). Peak memory consumption was 40.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 140.94 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.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 5598.43 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: 265.9 MB). Peak memory consumption was 265.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 204033.11 ms. Allocated memory was 2.3 GB in the beginning and 5.9 GB in the end (delta: 3.6 GB). Free memory was 1.9 GB in the beginning and 4.6 GB in the end (delta: -2.7 GB). Peak memory consumption was 5.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1542]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - TimeoutResult: Timeout (de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction) Toolchain cancelled while SimplifyDDAWithTimeout was simplifying term of DAG size 7818. RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown