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_label18_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 14:56:52,693 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 14:56:52,695 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 14:56:52,710 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 14:56:52,710 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 14:56:52,711 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 14:56:52,714 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 14:56:52,717 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 14:56:52,720 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 14:56:52,721 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 14:56:52,723 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 14:56:52,724 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 14:56:52,725 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 14:56:52,726 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 14:56:52,734 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 14:56:52,735 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 14:56:52,738 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 14:56:52,741 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 14:56:52,743 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 14:56:52,748 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 14:56:52,749 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 14:56:52,752 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 14:56:52,757 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 14:56:52,757 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 14:56:52,757 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 14:56:52,761 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 14:56:52,763 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 14:56:52,764 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 14:56:52,764 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 14:56:52,767 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 14:56:52,767 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 14:56:52,770 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 14:56:52,770 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 14:56:52,770 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 14:56:52,773 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 14:56:52,774 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 14:56:52,775 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-10-24 14:56:52,802 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 14:56:52,802 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 14:56:52,803 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 14:56:52,803 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-24 14:56:52,804 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-24 14:56:52,805 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-24 14:56:52,805 INFO L133 SettingsManager]: * Use SBE=true [2018-10-24 14:56:52,805 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 14:56:52,805 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 14:56:52,806 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 14:56:52,806 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 14:56:52,806 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 14:56:52,807 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 14:56:52,807 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 14:56:52,807 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 14:56:52,807 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 14:56:52,808 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 14:56:52,808 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 14:56:52,808 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 14:56:52,808 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 14:56:52,808 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 14:56:52,808 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 14:56:52,810 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 14:56:52,810 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-24 14:56:52,810 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 14:56:52,811 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 14:56:52,811 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 14:56:52,811 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 14:56:52,876 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 14:56:52,894 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 14:56:52,899 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 14:56:52,900 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 14:56:52,901 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 14:56:52,901 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label18_true-unreach-call.c [2018-10-24 14:56:52,963 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/41dc319ae/8c2ba9643510496e8105c4df5b58cf51/FLAG7cc413f75 [2018-10-24 14:56:53,623 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 14:56:53,624 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label18_true-unreach-call.c [2018-10-24 14:56:53,646 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/41dc319ae/8c2ba9643510496e8105c4df5b58cf51/FLAG7cc413f75 [2018-10-24 14:56:53,669 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/41dc319ae/8c2ba9643510496e8105c4df5b58cf51 [2018-10-24 14:56:53,679 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 14:56:53,681 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 14:56:53,682 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 14:56:53,682 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 14:56:53,686 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 14:56:53,687 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:56:53" (1/1) ... [2018-10-24 14:56:53,690 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68109397 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:56:53, skipping insertion in model container [2018-10-24 14:56:53,690 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:56:53" (1/1) ... [2018-10-24 14:56:53,701 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 14:56:53,809 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 14:56:54,506 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 14:56:54,513 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 14:56:54,827 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 14:56:54,854 INFO L193 MainTranslator]: Completed translation [2018-10-24 14:56:54,854 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:56:54 WrapperNode [2018-10-24 14:56:54,855 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 14:56:54,857 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 14:56:54,858 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 14:56:54,858 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 14:56:54,869 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:56:54" (1/1) ... [2018-10-24 14:56:54,916 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:56:54" (1/1) ... [2018-10-24 14:56:55,183 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 14:56:55,183 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 14:56:55,184 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 14:56:55,184 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 14:56:55,196 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:56:54" (1/1) ... [2018-10-24 14:56:55,197 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:56:54" (1/1) ... [2018-10-24 14:56:55,208 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:56:54" (1/1) ... [2018-10-24 14:56:55,208 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:56:54" (1/1) ... [2018-10-24 14:56:55,258 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:56:54" (1/1) ... [2018-10-24 14:56:55,285 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:56:54" (1/1) ... [2018-10-24 14:56:55,305 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:56:54" (1/1) ... [2018-10-24 14:56:55,321 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 14:56:55,321 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 14:56:55,321 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 14:56:55,322 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 14:56:55,323 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:56:54" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 14:56:55,402 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-24 14:56:55,402 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 14:56:55,403 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 14:57:01,167 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 14:57:01,168 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:57:01 BoogieIcfgContainer [2018-10-24 14:57:01,168 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 14:57:01,169 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 14:57:01,170 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 14:57:01,175 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 14:57:01,176 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 02:56:53" (1/3) ... [2018-10-24 14:57:01,177 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51e4afdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:57:01, skipping insertion in model container [2018-10-24 14:57:01,177 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:56:54" (2/3) ... [2018-10-24 14:57:01,177 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51e4afdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:57:01, skipping insertion in model container [2018-10-24 14:57:01,177 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:57:01" (3/3) ... [2018-10-24 14:57:01,180 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label18_true-unreach-call.c [2018-10-24 14:57:01,190 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 14:57:01,201 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 14:57:01,220 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 14:57:01,262 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-24 14:57:01,263 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 14:57:01,263 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 14:57:01,263 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 14:57:01,263 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 14:57:01,263 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 14:57:01,263 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 14:57:01,264 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 14:57:01,264 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 14:57:01,297 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states. [2018-10-24 14:57:01,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-10-24 14:57:01,321 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:57:01,323 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:57:01,325 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:57:01,332 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:57:01,333 INFO L82 PathProgramCache]: Analyzing trace with hash 249501988, now seen corresponding path program 1 times [2018-10-24 14:57:01,335 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:57:01,336 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:57:01,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:01,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:57:01,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:01,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:57:02,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:57:02,338 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:57:02,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:57:02,344 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:57:02,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:57:02,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:57:02,363 INFO L87 Difference]: Start difference. First operand 303 states. Second operand 4 states. [2018-10-24 14:57:05,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:57:05,868 INFO L93 Difference]: Finished difference Result 1079 states and 1933 transitions. [2018-10-24 14:57:05,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:57:05,870 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 204 [2018-10-24 14:57:05,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:57:05,896 INFO L225 Difference]: With dead ends: 1079 [2018-10-24 14:57:05,896 INFO L226 Difference]: Without dead ends: 769 [2018-10-24 14:57:05,902 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:57:05,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 769 states. [2018-10-24 14:57:06,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 769 to 513. [2018-10-24 14:57:06,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 513 states. [2018-10-24 14:57:06,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 851 transitions. [2018-10-24 14:57:06,036 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 851 transitions. Word has length 204 [2018-10-24 14:57:06,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:57:06,037 INFO L481 AbstractCegarLoop]: Abstraction has 513 states and 851 transitions. [2018-10-24 14:57:06,037 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:57:06,037 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 851 transitions. [2018-10-24 14:57:06,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-10-24 14:57:06,057 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:57:06,057 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:57:06,058 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:57:06,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:57:06,061 INFO L82 PathProgramCache]: Analyzing trace with hash -1825298013, now seen corresponding path program 1 times [2018-10-24 14:57:06,061 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:57:06,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:57:06,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:06,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:57:06,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:06,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:57:06,206 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:57:06,207 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:57:06,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:57:06,211 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:57:06,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:57:06,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:57:06,212 INFO L87 Difference]: Start difference. First operand 513 states and 851 transitions. Second operand 3 states. [2018-10-24 14:57:08,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:57:08,355 INFO L93 Difference]: Finished difference Result 1449 states and 2462 transitions. [2018-10-24 14:57:08,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:57:08,356 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 213 [2018-10-24 14:57:08,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:57:08,363 INFO L225 Difference]: With dead ends: 1449 [2018-10-24 14:57:08,363 INFO L226 Difference]: Without dead ends: 938 [2018-10-24 14:57:08,367 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:57:08,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 938 states. [2018-10-24 14:57:08,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 938 to 923. [2018-10-24 14:57:08,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 923 states. [2018-10-24 14:57:08,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1514 transitions. [2018-10-24 14:57:08,399 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1514 transitions. Word has length 213 [2018-10-24 14:57:08,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:57:08,400 INFO L481 AbstractCegarLoop]: Abstraction has 923 states and 1514 transitions. [2018-10-24 14:57:08,400 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:57:08,400 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1514 transitions. [2018-10-24 14:57:08,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-10-24 14:57:08,405 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:57:08,405 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:57:08,405 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:57:08,406 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:57:08,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1480782977, now seen corresponding path program 1 times [2018-10-24 14:57:08,406 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:57:08,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:57:08,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:08,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:57:08,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:08,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:57:08,541 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:57:08,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:57:08,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:57:08,542 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:57:08,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:57:08,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:57:08,543 INFO L87 Difference]: Start difference. First operand 923 states and 1514 transitions. Second operand 3 states. [2018-10-24 14:57:11,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:57:11,102 INFO L93 Difference]: Finished difference Result 1823 states and 2997 transitions. [2018-10-24 14:57:11,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:57:11,103 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 218 [2018-10-24 14:57:11,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:57:11,109 INFO L225 Difference]: With dead ends: 1823 [2018-10-24 14:57:11,109 INFO L226 Difference]: Without dead ends: 902 [2018-10-24 14:57:11,111 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:57:11,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 902 states. [2018-10-24 14:57:11,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 902 to 902. [2018-10-24 14:57:11,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 902 states. [2018-10-24 14:57:11,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 1435 transitions. [2018-10-24 14:57:11,131 INFO L78 Accepts]: Start accepts. Automaton has 902 states and 1435 transitions. Word has length 218 [2018-10-24 14:57:11,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:57:11,132 INFO L481 AbstractCegarLoop]: Abstraction has 902 states and 1435 transitions. [2018-10-24 14:57:11,132 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:57:11,132 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 1435 transitions. [2018-10-24 14:57:11,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-10-24 14:57:11,135 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:57:11,136 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:57:11,136 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:57:11,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:57:11,137 INFO L82 PathProgramCache]: Analyzing trace with hash 11850556, now seen corresponding path program 1 times [2018-10-24 14:57:11,137 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:57:11,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:57:11,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:11,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:57:11,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:11,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:57:11,402 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-24 14:57:11,403 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:57:11,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:57:11,403 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:57:11,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:57:11,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:57:11,404 INFO L87 Difference]: Start difference. First operand 902 states and 1435 transitions. Second operand 4 states. [2018-10-24 14:57:15,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:57:15,911 INFO L93 Difference]: Finished difference Result 3476 states and 5598 transitions. [2018-10-24 14:57:15,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:57:15,912 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 220 [2018-10-24 14:57:15,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:57:15,927 INFO L225 Difference]: With dead ends: 3476 [2018-10-24 14:57:15,927 INFO L226 Difference]: Without dead ends: 2576 [2018-10-24 14:57:15,930 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:57:15,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2576 states. [2018-10-24 14:57:15,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2576 to 1723. [2018-10-24 14:57:15,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1723 states. [2018-10-24 14:57:15,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1723 states to 1723 states and 2603 transitions. [2018-10-24 14:57:15,993 INFO L78 Accepts]: Start accepts. Automaton has 1723 states and 2603 transitions. Word has length 220 [2018-10-24 14:57:15,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:57:15,993 INFO L481 AbstractCegarLoop]: Abstraction has 1723 states and 2603 transitions. [2018-10-24 14:57:15,994 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:57:15,994 INFO L276 IsEmpty]: Start isEmpty. Operand 1723 states and 2603 transitions. [2018-10-24 14:57:16,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-10-24 14:57:16,001 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:57:16,002 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:57:16,002 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:57:16,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:57:16,003 INFO L82 PathProgramCache]: Analyzing trace with hash -1757886552, now seen corresponding path program 1 times [2018-10-24 14:57:16,003 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:57:16,003 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:57:16,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:16,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:57:16,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:16,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:57:16,221 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-24 14:57:16,221 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:57:16,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:57:16,222 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:57:16,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:57:16,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:57:16,222 INFO L87 Difference]: Start difference. First operand 1723 states and 2603 transitions. Second operand 3 states. [2018-10-24 14:57:16,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:57:16,710 INFO L93 Difference]: Finished difference Result 5159 states and 7797 transitions. [2018-10-24 14:57:16,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:57:16,711 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 227 [2018-10-24 14:57:16,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:57:16,729 INFO L225 Difference]: With dead ends: 5159 [2018-10-24 14:57:16,729 INFO L226 Difference]: Without dead ends: 3438 [2018-10-24 14:57:16,732 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:57:16,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3438 states. [2018-10-24 14:57:16,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3438 to 3436. [2018-10-24 14:57:16,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3436 states. [2018-10-24 14:57:16,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3436 states to 3436 states and 5189 transitions. [2018-10-24 14:57:16,812 INFO L78 Accepts]: Start accepts. Automaton has 3436 states and 5189 transitions. Word has length 227 [2018-10-24 14:57:16,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:57:16,812 INFO L481 AbstractCegarLoop]: Abstraction has 3436 states and 5189 transitions. [2018-10-24 14:57:16,812 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:57:16,812 INFO L276 IsEmpty]: Start isEmpty. Operand 3436 states and 5189 transitions. [2018-10-24 14:57:16,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-10-24 14:57:16,821 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:57:16,822 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:57:16,822 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:57:16,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:57:16,822 INFO L82 PathProgramCache]: Analyzing trace with hash 2090114336, now seen corresponding path program 1 times [2018-10-24 14:57:16,822 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:57:16,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:57:16,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:16,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:57:16,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:16,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:57:17,299 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2018-10-24 14:57:17,340 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:57:17,340 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:57:17,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 14:57:17,340 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 14:57:17,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 14:57:17,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 14:57:17,341 INFO L87 Difference]: Start difference. First operand 3436 states and 5189 transitions. Second operand 5 states. [2018-10-24 14:57:20,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:57:20,550 INFO L93 Difference]: Finished difference Result 7939 states and 12127 transitions. [2018-10-24 14:57:20,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 14:57:20,551 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 244 [2018-10-24 14:57:20,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:57:20,571 INFO L225 Difference]: With dead ends: 7939 [2018-10-24 14:57:20,571 INFO L226 Difference]: Without dead ends: 4505 [2018-10-24 14:57:20,577 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 14:57:20,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4505 states. [2018-10-24 14:57:20,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4505 to 3640. [2018-10-24 14:57:20,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3640 states. [2018-10-24 14:57:20,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3640 states to 3640 states and 5424 transitions. [2018-10-24 14:57:20,648 INFO L78 Accepts]: Start accepts. Automaton has 3640 states and 5424 transitions. Word has length 244 [2018-10-24 14:57:20,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:57:20,648 INFO L481 AbstractCegarLoop]: Abstraction has 3640 states and 5424 transitions. [2018-10-24 14:57:20,648 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 14:57:20,648 INFO L276 IsEmpty]: Start isEmpty. Operand 3640 states and 5424 transitions. [2018-10-24 14:57:20,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-10-24 14:57:20,655 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:57:20,656 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:57:20,656 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:57:20,656 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:57:20,657 INFO L82 PathProgramCache]: Analyzing trace with hash -1437860204, now seen corresponding path program 1 times [2018-10-24 14:57:20,657 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:57:20,657 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:57:20,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:20,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:57:20,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:20,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:57:20,834 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:57:20,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:57:20,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:57:20,835 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:57:20,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:57:20,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:57:20,836 INFO L87 Difference]: Start difference. First operand 3640 states and 5424 transitions. Second operand 3 states. [2018-10-24 14:57:22,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:57:22,215 INFO L93 Difference]: Finished difference Result 8933 states and 13269 transitions. [2018-10-24 14:57:22,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:57:22,223 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 246 [2018-10-24 14:57:22,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:57:22,244 INFO L225 Difference]: With dead ends: 8933 [2018-10-24 14:57:22,244 INFO L226 Difference]: Without dead ends: 5295 [2018-10-24 14:57:22,249 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:57:22,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5295 states. [2018-10-24 14:57:22,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5295 to 5293. [2018-10-24 14:57:22,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5293 states. [2018-10-24 14:57:22,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5293 states to 5293 states and 7795 transitions. [2018-10-24 14:57:22,338 INFO L78 Accepts]: Start accepts. Automaton has 5293 states and 7795 transitions. Word has length 246 [2018-10-24 14:57:22,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:57:22,339 INFO L481 AbstractCegarLoop]: Abstraction has 5293 states and 7795 transitions. [2018-10-24 14:57:22,339 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:57:22,339 INFO L276 IsEmpty]: Start isEmpty. Operand 5293 states and 7795 transitions. [2018-10-24 14:57:22,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2018-10-24 14:57:22,350 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:57:22,351 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:57:22,351 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:57:22,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:57:22,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1798348608, now seen corresponding path program 1 times [2018-10-24 14:57:22,352 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:57:22,352 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:57:22,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:22,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:57:22,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:22,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:57:22,848 WARN L179 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 10 [2018-10-24 14:57:23,018 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 52 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:57:23,019 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 14:57:23,019 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 14:57:23,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:57:23,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:57:23,184 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 14:57:23,313 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-24 14:57:23,339 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 14:57:23,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2018-10-24 14:57:23,340 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-24 14:57:23,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-24 14:57:23,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-24 14:57:23,341 INFO L87 Difference]: Start difference. First operand 5293 states and 7795 transitions. Second operand 7 states. [2018-10-24 14:57:30,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:57:30,369 INFO L93 Difference]: Finished difference Result 23061 states and 33566 transitions. [2018-10-24 14:57:30,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 14:57:30,377 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 254 [2018-10-24 14:57:30,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:57:30,451 INFO L225 Difference]: With dead ends: 23061 [2018-10-24 14:57:30,451 INFO L226 Difference]: Without dead ends: 17770 [2018-10-24 14:57:30,463 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-10-24 14:57:30,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17770 states. [2018-10-24 14:57:30,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17770 to 17766. [2018-10-24 14:57:30,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17766 states. [2018-10-24 14:57:30,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17766 states to 17766 states and 23353 transitions. [2018-10-24 14:57:30,803 INFO L78 Accepts]: Start accepts. Automaton has 17766 states and 23353 transitions. Word has length 254 [2018-10-24 14:57:30,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:57:30,804 INFO L481 AbstractCegarLoop]: Abstraction has 17766 states and 23353 transitions. [2018-10-24 14:57:30,804 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-24 14:57:30,804 INFO L276 IsEmpty]: Start isEmpty. Operand 17766 states and 23353 transitions. [2018-10-24 14:57:30,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2018-10-24 14:57:30,838 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:57:30,838 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:57:30,838 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:57:30,839 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:57:30,839 INFO L82 PathProgramCache]: Analyzing trace with hash 1124759438, now seen corresponding path program 1 times [2018-10-24 14:57:30,839 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:57:30,839 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:57:30,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:30,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:57:30,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:30,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:57:31,156 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-10-24 14:57:31,157 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:57:31,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:57:31,158 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:57:31,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:57:31,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:57:31,159 INFO L87 Difference]: Start difference. First operand 17766 states and 23353 transitions. Second operand 3 states. [2018-10-24 14:57:33,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:57:33,267 INFO L93 Difference]: Finished difference Result 49401 states and 64994 transitions. [2018-10-24 14:57:33,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:57:33,268 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 283 [2018-10-24 14:57:33,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:57:33,321 INFO L225 Difference]: With dead ends: 49401 [2018-10-24 14:57:33,321 INFO L226 Difference]: Without dead ends: 31637 [2018-10-24 14:57:33,346 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:57:33,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31637 states. [2018-10-24 14:57:33,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31637 to 31635. [2018-10-24 14:57:33,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31635 states. [2018-10-24 14:57:33,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31635 states to 31635 states and 39361 transitions. [2018-10-24 14:57:33,811 INFO L78 Accepts]: Start accepts. Automaton has 31635 states and 39361 transitions. Word has length 283 [2018-10-24 14:57:33,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:57:33,811 INFO L481 AbstractCegarLoop]: Abstraction has 31635 states and 39361 transitions. [2018-10-24 14:57:33,811 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:57:33,811 INFO L276 IsEmpty]: Start isEmpty. Operand 31635 states and 39361 transitions. [2018-10-24 14:57:33,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2018-10-24 14:57:33,867 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:57:33,867 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:57:33,867 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:57:33,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:57:33,868 INFO L82 PathProgramCache]: Analyzing trace with hash 65775976, now seen corresponding path program 1 times [2018-10-24 14:57:33,868 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:57:33,868 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:57:33,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:33,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:57:33,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:33,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:57:34,244 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-10-24 14:57:34,244 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:57:34,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 14:57:34,245 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:57:34,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:57:34,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:57:34,246 INFO L87 Difference]: Start difference. First operand 31635 states and 39361 transitions. Second operand 4 states. [2018-10-24 14:57:36,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:57:36,645 INFO L93 Difference]: Finished difference Result 68576 states and 85864 transitions. [2018-10-24 14:57:36,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:57:36,646 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 311 [2018-10-24 14:57:36,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:57:36,705 INFO L225 Difference]: With dead ends: 68576 [2018-10-24 14:57:36,706 INFO L226 Difference]: Without dead ends: 36943 [2018-10-24 14:57:36,748 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:57:36,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36943 states. [2018-10-24 14:57:37,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36943 to 36123. [2018-10-24 14:57:37,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36123 states. [2018-10-24 14:57:37,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36123 states to 36123 states and 41787 transitions. [2018-10-24 14:57:37,544 INFO L78 Accepts]: Start accepts. Automaton has 36123 states and 41787 transitions. Word has length 311 [2018-10-24 14:57:37,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:57:37,544 INFO L481 AbstractCegarLoop]: Abstraction has 36123 states and 41787 transitions. [2018-10-24 14:57:37,544 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:57:37,544 INFO L276 IsEmpty]: Start isEmpty. Operand 36123 states and 41787 transitions. [2018-10-24 14:57:37,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 384 [2018-10-24 14:57:37,579 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:57:37,579 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-24 14:57:37,579 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:57:37,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:57:37,580 INFO L82 PathProgramCache]: Analyzing trace with hash 758772804, now seen corresponding path program 1 times [2018-10-24 14:57:37,580 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:57:37,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:57:37,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:37,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:57:37,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:37,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:57:37,979 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 175 proven. 0 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2018-10-24 14:57:37,979 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:57:37,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:57:37,980 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:57:37,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:57:37,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:57:37,981 INFO L87 Difference]: Start difference. First operand 36123 states and 41787 transitions. Second operand 4 states. [2018-10-24 14:57:40,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:57:40,089 INFO L93 Difference]: Finished difference Result 118452 states and 136506 transitions. [2018-10-24 14:57:40,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:57:40,090 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 383 [2018-10-24 14:57:40,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:57:40,216 INFO L225 Difference]: With dead ends: 118452 [2018-10-24 14:57:40,216 INFO L226 Difference]: Without dead ends: 82331 [2018-10-24 14:57:40,257 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:57:40,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82331 states. [2018-10-24 14:57:40,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82331 to 57541. [2018-10-24 14:57:40,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57541 states. [2018-10-24 14:57:41,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57541 states to 57541 states and 65892 transitions. [2018-10-24 14:57:41,019 INFO L78 Accepts]: Start accepts. Automaton has 57541 states and 65892 transitions. Word has length 383 [2018-10-24 14:57:41,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:57:41,020 INFO L481 AbstractCegarLoop]: Abstraction has 57541 states and 65892 transitions. [2018-10-24 14:57:41,020 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:57:41,020 INFO L276 IsEmpty]: Start isEmpty. Operand 57541 states and 65892 transitions. [2018-10-24 14:57:41,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2018-10-24 14:57:41,497 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:57:41,497 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:57:41,497 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:57:41,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:57:41,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1978223606, now seen corresponding path program 1 times [2018-10-24 14:57:41,498 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:57:41,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:57:41,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:41,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:57:41,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:41,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:57:41,753 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 240 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-10-24 14:57:41,754 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:57:41,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:57:41,755 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:57:41,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:57:41,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:57:41,755 INFO L87 Difference]: Start difference. First operand 57541 states and 65892 transitions. Second operand 3 states. [2018-10-24 14:57:43,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:57:43,833 INFO L93 Difference]: Finished difference Result 113652 states and 130133 transitions. [2018-10-24 14:57:43,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:57:43,833 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 391 [2018-10-24 14:57:43,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:57:43,907 INFO L225 Difference]: With dead ends: 113652 [2018-10-24 14:57:43,907 INFO L226 Difference]: Without dead ends: 56113 [2018-10-24 14:57:43,948 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:57:43,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56113 states. [2018-10-24 14:57:44,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56113 to 55905. [2018-10-24 14:57:44,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55905 states. [2018-10-24 14:57:44,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55905 states to 55905 states and 61880 transitions. [2018-10-24 14:57:44,604 INFO L78 Accepts]: Start accepts. Automaton has 55905 states and 61880 transitions. Word has length 391 [2018-10-24 14:57:44,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:57:44,604 INFO L481 AbstractCegarLoop]: Abstraction has 55905 states and 61880 transitions. [2018-10-24 14:57:44,604 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:57:44,604 INFO L276 IsEmpty]: Start isEmpty. Operand 55905 states and 61880 transitions. [2018-10-24 14:57:44,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2018-10-24 14:57:44,649 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:57:44,649 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:57:44,650 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:57:44,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:57:44,650 INFO L82 PathProgramCache]: Analyzing trace with hash -162814027, now seen corresponding path program 1 times [2018-10-24 14:57:44,650 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:57:44,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:57:44,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:44,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:57:44,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:44,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:57:45,155 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 235 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-10-24 14:57:45,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:57:45,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 14:57:45,156 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 14:57:45,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 14:57:45,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 14:57:45,157 INFO L87 Difference]: Start difference. First operand 55905 states and 61880 transitions. Second operand 5 states. [2018-10-24 14:57:49,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:57:49,629 INFO L93 Difference]: Finished difference Result 261896 states and 289431 transitions. [2018-10-24 14:57:49,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 14:57:49,629 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 404 [2018-10-24 14:57:49,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:57:49,866 INFO L225 Difference]: With dead ends: 261896 [2018-10-24 14:57:49,867 INFO L226 Difference]: Without dead ends: 205993 [2018-10-24 14:57:49,931 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 14:57:50,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205993 states. [2018-10-24 14:57:52,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205993 to 152547. [2018-10-24 14:57:52,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152547 states. [2018-10-24 14:57:52,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152547 states to 152547 states and 168161 transitions. [2018-10-24 14:57:52,592 INFO L78 Accepts]: Start accepts. Automaton has 152547 states and 168161 transitions. Word has length 404 [2018-10-24 14:57:52,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:57:52,593 INFO L481 AbstractCegarLoop]: Abstraction has 152547 states and 168161 transitions. [2018-10-24 14:57:52,593 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 14:57:52,593 INFO L276 IsEmpty]: Start isEmpty. Operand 152547 states and 168161 transitions. [2018-10-24 14:57:52,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 427 [2018-10-24 14:57:52,638 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:57:52,638 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:57:52,639 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:57:52,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:57:52,639 INFO L82 PathProgramCache]: Analyzing trace with hash 361382077, now seen corresponding path program 1 times [2018-10-24 14:57:52,639 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:57:52,639 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:57:52,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:52,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:57:52,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:52,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:57:53,193 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 316 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-10-24 14:57:53,193 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:57:53,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-24 14:57:53,194 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 14:57:53,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 14:57:53,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 14:57:53,194 INFO L87 Difference]: Start difference. First operand 152547 states and 168161 transitions. Second operand 5 states. [2018-10-24 14:57:56,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:57:56,355 INFO L93 Difference]: Finished difference Result 346907 states and 381849 transitions. [2018-10-24 14:57:56,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 14:57:56,356 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 426 [2018-10-24 14:57:56,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:57:56,569 INFO L225 Difference]: With dead ends: 346907 [2018-10-24 14:57:56,570 INFO L226 Difference]: Without dead ends: 194362 [2018-10-24 14:57:56,661 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 14:57:56,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194362 states. [2018-10-24 14:57:59,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194362 to 162585. [2018-10-24 14:57:59,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162585 states. [2018-10-24 14:57:59,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162585 states to 162585 states and 180131 transitions. [2018-10-24 14:57:59,929 INFO L78 Accepts]: Start accepts. Automaton has 162585 states and 180131 transitions. Word has length 426 [2018-10-24 14:57:59,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:57:59,929 INFO L481 AbstractCegarLoop]: Abstraction has 162585 states and 180131 transitions. [2018-10-24 14:57:59,929 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 14:57:59,930 INFO L276 IsEmpty]: Start isEmpty. Operand 162585 states and 180131 transitions. [2018-10-24 14:57:59,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2018-10-24 14:57:59,971 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:57:59,972 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, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:57:59,972 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:57:59,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:57:59,972 INFO L82 PathProgramCache]: Analyzing trace with hash 203787220, now seen corresponding path program 1 times [2018-10-24 14:57:59,972 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:57:59,973 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:57:59,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:59,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:57:59,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:58:00,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:58:00,505 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 298 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-10-24 14:58:00,506 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:58:00,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:58:00,506 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:58:00,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:58:00,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:58:00,507 INFO L87 Difference]: Start difference. First operand 162585 states and 180131 transitions. Second operand 4 states. [2018-10-24 14:58:03,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:58:03,415 INFO L93 Difference]: Finished difference Result 323326 states and 358314 transitions. [2018-10-24 14:58:03,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:58:03,415 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 429 [2018-10-24 14:58:03,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:58:03,606 INFO L225 Difference]: With dead ends: 323326 [2018-10-24 14:58:03,607 INFO L226 Difference]: Without dead ends: 160743 [2018-10-24 14:58:03,693 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:58:03,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160743 states. [2018-10-24 14:58:07,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160743 to 149263. [2018-10-24 14:58:07,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149263 states. [2018-10-24 14:58:07,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149263 states to 149263 states and 164698 transitions. [2018-10-24 14:58:07,203 INFO L78 Accepts]: Start accepts. Automaton has 149263 states and 164698 transitions. Word has length 429 [2018-10-24 14:58:07,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:58:07,203 INFO L481 AbstractCegarLoop]: Abstraction has 149263 states and 164698 transitions. [2018-10-24 14:58:07,203 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:58:07,204 INFO L276 IsEmpty]: Start isEmpty. Operand 149263 states and 164698 transitions. [2018-10-24 14:58:07,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 435 [2018-10-24 14:58:07,251 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:58:07,252 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 14:58:07,252 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:58:07,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:58:07,252 INFO L82 PathProgramCache]: Analyzing trace with hash 15182724, now seen corresponding path program 1 times [2018-10-24 14:58:07,253 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:58:07,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:58:07,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:58:07,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:58:07,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:58:07,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:58:07,648 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 239 proven. 0 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2018-10-24 14:58:07,649 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:58:07,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:58:07,650 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:58:07,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:58:07,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:58:07,650 INFO L87 Difference]: Start difference. First operand 149263 states and 164698 transitions. Second operand 4 states. [2018-10-24 14:58:13,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:58:13,071 INFO L93 Difference]: Finished difference Result 301632 states and 333203 transitions. [2018-10-24 14:58:13,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:58:13,072 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 434 [2018-10-24 14:58:13,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:58:13,260 INFO L225 Difference]: With dead ends: 301632 [2018-10-24 14:58:13,260 INFO L226 Difference]: Without dead ends: 152371 [2018-10-24 14:58:13,342 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:58:13,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152371 states. [2018-10-24 14:58:15,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152371 to 150903. [2018-10-24 14:58:15,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150903 states. [2018-10-24 14:58:15,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150903 states to 150903 states and 165702 transitions. [2018-10-24 14:58:15,658 INFO L78 Accepts]: Start accepts. Automaton has 150903 states and 165702 transitions. Word has length 434 [2018-10-24 14:58:15,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:58:15,658 INFO L481 AbstractCegarLoop]: Abstraction has 150903 states and 165702 transitions. [2018-10-24 14:58:15,658 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:58:15,658 INFO L276 IsEmpty]: Start isEmpty. Operand 150903 states and 165702 transitions. [2018-10-24 14:58:15,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 446 [2018-10-24 14:58:15,700 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:58:15,700 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:58:15,700 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:58:15,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:58:15,701 INFO L82 PathProgramCache]: Analyzing trace with hash 368619541, now seen corresponding path program 1 times [2018-10-24 14:58:15,701 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:58:15,701 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:58:15,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:58:15,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:58:15,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:58:15,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:58:16,173 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 301 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-10-24 14:58:16,173 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:58:16,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 14:58:16,174 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:58:16,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:58:16,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:58:16,174 INFO L87 Difference]: Start difference. First operand 150903 states and 165702 transitions. Second operand 4 states. [2018-10-24 14:58:19,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:58:19,492 INFO L93 Difference]: Finished difference Result 401494 states and 439112 transitions. [2018-10-24 14:58:19,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:58:19,492 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 445 [2018-10-24 14:58:19,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:58:20,851 INFO L225 Difference]: With dead ends: 401494 [2018-10-24 14:58:20,851 INFO L226 Difference]: Without dead ends: 250593 [2018-10-24 14:58:20,926 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:58:21,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250593 states. [2018-10-24 14:58:24,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250593 to 193295. [2018-10-24 14:58:24,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193295 states. [2018-10-24 14:58:24,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193295 states to 193295 states and 209833 transitions. [2018-10-24 14:58:24,329 INFO L78 Accepts]: Start accepts. Automaton has 193295 states and 209833 transitions. Word has length 445 [2018-10-24 14:58:24,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:58:24,329 INFO L481 AbstractCegarLoop]: Abstraction has 193295 states and 209833 transitions. [2018-10-24 14:58:24,329 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:58:24,329 INFO L276 IsEmpty]: Start isEmpty. Operand 193295 states and 209833 transitions. [2018-10-24 14:58:24,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 463 [2018-10-24 14:58:24,381 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:58:24,381 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:58:24,382 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:58:24,382 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:58:24,382 INFO L82 PathProgramCache]: Analyzing trace with hash 153501173, now seen corresponding path program 1 times [2018-10-24 14:58:24,382 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:58:24,382 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:58:24,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:58:24,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:58:24,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:58:24,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:58:25,112 WARN L179 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 17 [2018-10-24 14:58:25,839 INFO L134 CoverageAnalysis]: Checked inductivity of 464 backedges. 347 proven. 55 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-10-24 14:58:25,840 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 14:58:25,840 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 14:58:25,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:58:26,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:58:26,038 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 14:58:26,407 INFO L134 CoverageAnalysis]: Checked inductivity of 464 backedges. 400 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-10-24 14:58:26,428 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 14:58:26,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 11 [2018-10-24 14:58:26,430 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-24 14:58:26,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-24 14:58:26,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-10-24 14:58:26,430 INFO L87 Difference]: Start difference. First operand 193295 states and 209833 transitions. Second operand 11 states. [2018-10-24 14:58:26,858 WARN L179 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-10-24 14:58:41,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:58:41,761 INFO L93 Difference]: Finished difference Result 866303 states and 935702 transitions. [2018-10-24 14:58:41,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-24 14:58:41,762 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 462 [2018-10-24 14:58:41,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:58:42,669 INFO L225 Difference]: With dead ends: 866303 [2018-10-24 14:58:42,670 INFO L226 Difference]: Without dead ends: 673010 [2018-10-24 14:58:42,875 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 515 GetRequests, 482 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=266, Invalid=790, Unknown=0, NotChecked=0, Total=1056 [2018-10-24 14:58:43,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673010 states. [2018-10-24 14:58:52,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673010 to 548958. [2018-10-24 14:58:52,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 548958 states. [2018-10-24 14:58:53,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548958 states to 548958 states and 592773 transitions. [2018-10-24 14:58:53,139 INFO L78 Accepts]: Start accepts. Automaton has 548958 states and 592773 transitions. Word has length 462 [2018-10-24 14:58:53,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:58:53,140 INFO L481 AbstractCegarLoop]: Abstraction has 548958 states and 592773 transitions. [2018-10-24 14:58:53,140 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-24 14:58:53,140 INFO L276 IsEmpty]: Start isEmpty. Operand 548958 states and 592773 transitions. [2018-10-24 14:58:53,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2018-10-24 14:58:53,273 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:58:53,273 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:58:53,274 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:58:53,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:58:53,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1972226690, now seen corresponding path program 1 times [2018-10-24 14:58:53,274 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:58:53,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:58:53,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:58:53,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:58:53,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:58:53,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:58:59,983 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 435 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2018-10-24 14:58:59,984 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:58:59,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 14:58:59,984 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:58:59,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:58:59,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:58:59,985 INFO L87 Difference]: Start difference. First operand 548958 states and 592773 transitions. Second operand 4 states. [2018-10-24 14:59:08,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:59:08,609 INFO L93 Difference]: Finished difference Result 1688014 states and 1813484 transitions. [2018-10-24 14:59:08,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:59:08,610 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 484 [2018-10-24 14:59:08,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:59:10,454 INFO L225 Difference]: With dead ends: 1688014 [2018-10-24 14:59:10,454 INFO L226 Difference]: Without dead ends: 1139058 [2018-10-24 14:59:10,716 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:59:11,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1139058 states. [2018-10-24 14:59:25,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1139058 to 807719. [2018-10-24 14:59:25,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 807719 states. [2018-10-24 14:59:27,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807719 states to 807719 states and 865027 transitions. [2018-10-24 14:59:27,848 INFO L78 Accepts]: Start accepts. Automaton has 807719 states and 865027 transitions. Word has length 484 [2018-10-24 14:59:27,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:59:27,848 INFO L481 AbstractCegarLoop]: Abstraction has 807719 states and 865027 transitions. [2018-10-24 14:59:27,848 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:59:27,849 INFO L276 IsEmpty]: Start isEmpty. Operand 807719 states and 865027 transitions. [2018-10-24 14:59:28,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 523 [2018-10-24 14:59:28,010 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:59:28,010 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:59:28,011 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:59:28,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:59:28,011 INFO L82 PathProgramCache]: Analyzing trace with hash 1740903967, now seen corresponding path program 1 times [2018-10-24 14:59:28,011 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:59:28,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:59:28,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:59:28,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:59:28,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:59:28,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:59:36,296 INFO L134 CoverageAnalysis]: Checked inductivity of 720 backedges. 477 proven. 0 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked. [2018-10-24 14:59:36,297 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:59:36,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:59:36,298 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:59:36,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:59:36,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:59:36,298 INFO L87 Difference]: Start difference. First operand 807719 states and 865027 transitions. Second operand 3 states. [2018-10-24 14:59:44,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:59:44,147 INFO L93 Difference]: Finished difference Result 1463161 states and 1570512 transitions. [2018-10-24 14:59:44,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:59:44,147 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 522 [2018-10-24 14:59:44,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:59:45,188 INFO L225 Difference]: With dead ends: 1463161 [2018-10-24 14:59:45,189 INFO L226 Difference]: Without dead ends: 655444 [2018-10-24 14:59:45,436 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:59:45,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655444 states. [2018-10-24 14:59:55,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655444 to 647893. [2018-10-24 14:59:55,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 647893 states. [2018-10-24 14:59:56,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647893 states to 647893 states and 692151 transitions. [2018-10-24 14:59:56,268 INFO L78 Accepts]: Start accepts. Automaton has 647893 states and 692151 transitions. Word has length 522 [2018-10-24 14:59:56,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:59:56,268 INFO L481 AbstractCegarLoop]: Abstraction has 647893 states and 692151 transitions. [2018-10-24 14:59:56,268 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:59:56,268 INFO L276 IsEmpty]: Start isEmpty. Operand 647893 states and 692151 transitions. [2018-10-24 14:59:58,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 532 [2018-10-24 14:59:58,105 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:59:58,106 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:59:58,106 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:59:58,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:59:58,106 INFO L82 PathProgramCache]: Analyzing trace with hash -1648087323, now seen corresponding path program 1 times [2018-10-24 14:59:58,106 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:59:58,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:59:58,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:59:58,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:59:58,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:59:58,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:59:58,739 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 402 proven. 0 refuted. 0 times theorem prover too weak. 354 trivial. 0 not checked. [2018-10-24 14:59:58,739 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:59:58,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:59:58,740 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:59:58,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:59:58,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:59:58,741 INFO L87 Difference]: Start difference. First operand 647893 states and 692151 transitions. Second operand 4 states. [2018-10-24 15:00:14,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:00:14,397 INFO L93 Difference]: Finished difference Result 1698396 states and 1816489 transitions. [2018-10-24 15:00:14,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 15:00:14,397 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 531 [2018-10-24 15:00:14,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:00:15,940 INFO L225 Difference]: With dead ends: 1698396 [2018-10-24 15:00:15,940 INFO L226 Difference]: Without dead ends: 1050505 [2018-10-24 15:00:16,190 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 15:00:17,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1050505 states. Received shutdown request... [2018-10-24 15:00:20,953 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-24 15:00:20,957 WARN L205 ceAbstractionStarter]: Timeout [2018-10-24 15:00:20,957 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 03:00:20 BoogieIcfgContainer [2018-10-24 15:00:20,957 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-24 15:00:20,958 INFO L168 Benchmark]: Toolchain (without parser) took 207278.21 ms. Allocated memory was 1.5 GB in the beginning and 5.7 GB in the end (delta: 4.2 GB). Free memory was 1.4 GB in the beginning and 3.7 GB in the end (delta: -2.3 GB). Peak memory consumption was 3.4 GB. Max. memory is 7.1 GB. [2018-10-24 15:00:20,959 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 15:00:20,960 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1173.29 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 84.6 MB). Peak memory consumption was 84.6 MB. Max. memory is 7.1 GB. [2018-10-24 15:00:20,960 INFO L168 Benchmark]: Boogie Procedure Inliner took 327.51 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 732.4 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -854.6 MB). Peak memory consumption was 40.3 MB. Max. memory is 7.1 GB. [2018-10-24 15:00:20,961 INFO L168 Benchmark]: Boogie Preprocessor took 137.43 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. [2018-10-24 15:00:20,962 INFO L168 Benchmark]: RCFGBuilder took 5847.19 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 249.7 MB). Peak memory consumption was 249.7 MB. Max. memory is 7.1 GB. [2018-10-24 15:00:20,963 INFO L168 Benchmark]: TraceAbstraction took 199787.79 ms. Allocated memory was 2.2 GB in the beginning and 5.7 GB in the end (delta: 3.5 GB). Free memory was 1.9 GB in the beginning and 3.7 GB in the end (delta: -1.8 GB). Peak memory consumption was 3.2 GB. Max. memory is 7.1 GB. [2018-10-24 15:00:20,979 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1173.29 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 327.51 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 732.4 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -854.6 MB). Peak memory consumption was 40.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 137.43 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 5847.19 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 249.7 MB). Peak memory consumption was 249.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 199787.79 ms. Allocated memory was 2.2 GB in the beginning and 5.7 GB in the end (delta: 3.5 GB). Free memory was 1.9 GB in the beginning and 3.7 GB in the end (delta: -1.8 GB). Peak memory consumption was 3.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1644]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1644). Cancelled while executing MinimizeSevpa. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 303 locations, 1 error locations. TIMEOUT Result, 199.7s OverallTime, 21 OverallIterations, 8 TraceHistogramMax, 109.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5726 SDtfs, 17236 SDslu, 4886 SDs, 0 SdLazy, 27108 SolverSat, 4570 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 48.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 841 GetRequests, 762 SyntacticMatches, 8 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 4.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=807719occurred in iteration=19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 61.6s AutomataMinimizationTime, 21 MinimizatonAttempts, 646228 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 6.7s InterpolantComputationTime, 8047 NumberOfCodeBlocks, 8047 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 8024 ConstructedInterpolants, 0 QuantifiedInterpolants, 8056753 SizeOfPredicates, 5 NumberOfNonLiveVariables, 1165 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 23 InterpolantComputations, 21 PerfectInterpolantSequences, 5960/6019 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown