java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem03_label38_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 14:59:24,671 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 14:59:24,673 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 14:59:24,691 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 14:59:24,691 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 14:59:24,692 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 14:59:24,693 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 14:59:24,695 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 14:59:24,697 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 14:59:24,698 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 14:59:24,699 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 14:59:24,699 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 14:59:24,700 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 14:59:24,701 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 14:59:24,702 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 14:59:24,703 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 14:59:24,704 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 14:59:24,706 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 14:59:24,708 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 14:59:24,709 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 14:59:24,711 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 14:59:24,714 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 14:59:24,716 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 14:59:24,722 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 14:59:24,722 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 14:59:24,723 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 14:59:24,724 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 14:59:24,725 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 14:59:24,726 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 14:59:24,733 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 14:59:24,733 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 14:59:24,734 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 14:59:24,734 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 14:59:24,735 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 14:59:24,735 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 14:59:24,736 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 14:59:24,736 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:59:24,752 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 14:59:24,752 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 14:59:24,753 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 14:59:24,753 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-24 14:59:24,754 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-24 14:59:24,754 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-24 14:59:24,754 INFO L133 SettingsManager]: * Use SBE=true [2018-10-24 14:59:24,754 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 14:59:24,754 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 14:59:24,755 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 14:59:24,755 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 14:59:24,755 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 14:59:24,755 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 14:59:24,755 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 14:59:24,756 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 14:59:24,756 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 14:59:24,756 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 14:59:24,756 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 14:59:24,756 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 14:59:24,757 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 14:59:24,757 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 14:59:24,757 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 14:59:24,757 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 14:59:24,757 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-24 14:59:24,758 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 14:59:24,758 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 14:59:24,758 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 14:59:24,758 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 14:59:24,803 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 14:59:24,824 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 14:59:24,829 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 14:59:24,831 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 14:59:24,831 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 14:59:24,832 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label38_true-unreach-call.c [2018-10-24 14:59:24,898 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/2dbdd65e5/9e424b3388274228b41106b5dfd380da/FLAG35faf9fd0 [2018-10-24 14:59:25,603 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 14:59:25,604 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label38_true-unreach-call.c [2018-10-24 14:59:25,626 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/2dbdd65e5/9e424b3388274228b41106b5dfd380da/FLAG35faf9fd0 [2018-10-24 14:59:25,649 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/2dbdd65e5/9e424b3388274228b41106b5dfd380da [2018-10-24 14:59:25,662 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 14:59:25,664 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 14:59:25,665 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 14:59:25,665 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 14:59:25,671 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 14:59:25,672 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:59:25" (1/1) ... [2018-10-24 14:59:25,675 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d8d5e21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:59:25, skipping insertion in model container [2018-10-24 14:59:25,676 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:59:25" (1/1) ... [2018-10-24 14:59:25,686 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 14:59:25,776 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 14:59:26,485 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 14:59:26,491 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 14:59:26,848 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 14:59:26,874 INFO L193 MainTranslator]: Completed translation [2018-10-24 14:59:26,874 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:59:26 WrapperNode [2018-10-24 14:59:26,875 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 14:59:26,876 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 14:59:26,876 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 14:59:26,876 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 14:59:26,887 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:59:26" (1/1) ... [2018-10-24 14:59:26,923 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:59:26" (1/1) ... [2018-10-24 14:59:27,208 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 14:59:27,208 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 14:59:27,209 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 14:59:27,209 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 14:59:27,221 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:59:26" (1/1) ... [2018-10-24 14:59:27,221 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:59:26" (1/1) ... [2018-10-24 14:59:27,232 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:59:26" (1/1) ... [2018-10-24 14:59:27,233 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:59:26" (1/1) ... [2018-10-24 14:59:27,302 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:59:26" (1/1) ... [2018-10-24 14:59:27,330 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:59:26" (1/1) ... [2018-10-24 14:59:27,356 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:59:26" (1/1) ... [2018-10-24 14:59:27,372 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 14:59:27,372 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 14:59:27,372 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 14:59:27,373 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 14:59:27,374 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:59:26" (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:59:27,439 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-24 14:59:27,439 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 14:59:27,440 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 14:59:32,802 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 14:59:32,804 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:59:32 BoogieIcfgContainer [2018-10-24 14:59:32,804 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 14:59:32,805 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 14:59:32,805 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 14:59:32,809 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 14:59:32,809 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 02:59:25" (1/3) ... [2018-10-24 14:59:32,810 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b745764 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:59:32, skipping insertion in model container [2018-10-24 14:59:32,810 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:59:26" (2/3) ... [2018-10-24 14:59:32,811 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b745764 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:59:32, skipping insertion in model container [2018-10-24 14:59:32,811 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:59:32" (3/3) ... [2018-10-24 14:59:32,813 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label38_true-unreach-call.c [2018-10-24 14:59:32,825 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 14:59:32,835 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 14:59:32,854 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 14:59:32,899 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-24 14:59:32,900 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 14:59:32,900 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 14:59:32,900 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 14:59:32,901 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 14:59:32,901 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 14:59:32,901 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 14:59:32,901 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 14:59:32,901 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 14:59:32,930 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states. [2018-10-24 14:59:32,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-10-24 14:59:32,953 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:59:32,955 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:59:32,957 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:59:32,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:59:32,963 INFO L82 PathProgramCache]: Analyzing trace with hash -1988565156, now seen corresponding path program 1 times [2018-10-24 14:59:32,965 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:59:32,965 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:59:33,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:59:33,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:59:33,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:59:33,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:59:33,942 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:59:33,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:59:33,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:59:33,954 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:59:33,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:59:33,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:59:33,974 INFO L87 Difference]: Start difference. First operand 303 states. Second operand 3 states. [2018-10-24 14:59:36,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:59:36,295 INFO L93 Difference]: Finished difference Result 832 states and 1481 transitions. [2018-10-24 14:59:36,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:59:36,298 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 202 [2018-10-24 14:59:36,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:59:36,324 INFO L225 Difference]: With dead ends: 832 [2018-10-24 14:59:36,324 INFO L226 Difference]: Without dead ends: 525 [2018-10-24 14:59:36,330 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:59:36,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2018-10-24 14:59:36,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 511. [2018-10-24 14:59:36,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 511 states. [2018-10-24 14:59:36,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 878 transitions. [2018-10-24 14:59:36,441 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 878 transitions. Word has length 202 [2018-10-24 14:59:36,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:59:36,443 INFO L481 AbstractCegarLoop]: Abstraction has 511 states and 878 transitions. [2018-10-24 14:59:36,443 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:59:36,444 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 878 transitions. [2018-10-24 14:59:36,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-10-24 14:59:36,452 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:59:36,452 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:59:36,453 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:59:36,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:59:36,453 INFO L82 PathProgramCache]: Analyzing trace with hash 170905101, now seen corresponding path program 1 times [2018-10-24 14:59:36,453 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:59:36,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:59:36,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:59:36,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:59:36,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:59:36,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:59:36,749 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-10-24 14:59:36,820 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:59:36,821 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:59:36,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:59:36,823 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:59:36,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:59:36,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:59:36,824 INFO L87 Difference]: Start difference. First operand 511 states and 878 transitions. Second operand 4 states. [2018-10-24 14:59:41,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:59:41,064 INFO L93 Difference]: Finished difference Result 1893 states and 3348 transitions. [2018-10-24 14:59:41,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:59:41,064 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 208 [2018-10-24 14:59:41,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:59:41,073 INFO L225 Difference]: With dead ends: 1893 [2018-10-24 14:59:41,074 INFO L226 Difference]: Without dead ends: 1384 [2018-10-24 14:59:41,078 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:59:41,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1384 states. [2018-10-24 14:59:41,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1384 to 923. [2018-10-24 14:59:41,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 923 states. [2018-10-24 14:59:41,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1514 transitions. [2018-10-24 14:59:41,145 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1514 transitions. Word has length 208 [2018-10-24 14:59:41,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:59:41,146 INFO L481 AbstractCegarLoop]: Abstraction has 923 states and 1514 transitions. [2018-10-24 14:59:41,146 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:59:41,146 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1514 transitions. [2018-10-24 14:59:41,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-10-24 14:59:41,158 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:59:41,158 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:59:41,159 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:59:41,159 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:59:41,159 INFO L82 PathProgramCache]: Analyzing trace with hash -461514232, now seen corresponding path program 1 times [2018-10-24 14:59:41,159 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:59:41,160 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:59:41,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:59:41,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:59:41,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:59:41,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:59:41,457 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:59:41,458 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:59:41,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:59:41,459 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:59:41,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:59:41,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:59:41,459 INFO L87 Difference]: Start difference. First operand 923 states and 1514 transitions. Second operand 3 states. [2018-10-24 14:59:43,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:59:43,634 INFO L93 Difference]: Finished difference Result 2673 states and 4433 transitions. [2018-10-24 14:59:43,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:59:43,635 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 210 [2018-10-24 14:59:43,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:59:43,648 INFO L225 Difference]: With dead ends: 2673 [2018-10-24 14:59:43,649 INFO L226 Difference]: Without dead ends: 1752 [2018-10-24 14:59:43,651 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:43,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1752 states. [2018-10-24 14:59:43,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1752 to 1751. [2018-10-24 14:59:43,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1751 states. [2018-10-24 14:59:43,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1751 states to 1751 states and 2699 transitions. [2018-10-24 14:59:43,691 INFO L78 Accepts]: Start accepts. Automaton has 1751 states and 2699 transitions. Word has length 210 [2018-10-24 14:59:43,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:59:43,691 INFO L481 AbstractCegarLoop]: Abstraction has 1751 states and 2699 transitions. [2018-10-24 14:59:43,692 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:59:43,692 INFO L276 IsEmpty]: Start isEmpty. Operand 1751 states and 2699 transitions. [2018-10-24 14:59:43,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-10-24 14:59:43,698 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:59:43,698 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:59:43,698 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:59:43,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:59:43,699 INFO L82 PathProgramCache]: Analyzing trace with hash -675094169, now seen corresponding path program 1 times [2018-10-24 14:59:43,699 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:59:43,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:59:43,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:59:43,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:59:43,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:59:43,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:59:43,876 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-24 14:59:43,876 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:59:43,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:59:43,877 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:59:43,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:59:43,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:59:43,878 INFO L87 Difference]: Start difference. First operand 1751 states and 2699 transitions. Second operand 3 states. [2018-10-24 14:59:45,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:59:45,450 INFO L93 Difference]: Finished difference Result 4329 states and 6639 transitions. [2018-10-24 14:59:45,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:59:45,451 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 219 [2018-10-24 14:59:45,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:59:45,465 INFO L225 Difference]: With dead ends: 4329 [2018-10-24 14:59:45,465 INFO L226 Difference]: Without dead ends: 2580 [2018-10-24 14:59:45,468 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:59:45,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2580 states. [2018-10-24 14:59:45,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2580 to 2579. [2018-10-24 14:59:45,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2579 states. [2018-10-24 14:59:45,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2579 states to 2579 states and 3884 transitions. [2018-10-24 14:59:45,527 INFO L78 Accepts]: Start accepts. Automaton has 2579 states and 3884 transitions. Word has length 219 [2018-10-24 14:59:45,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:59:45,527 INFO L481 AbstractCegarLoop]: Abstraction has 2579 states and 3884 transitions. [2018-10-24 14:59:45,528 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:59:45,528 INFO L276 IsEmpty]: Start isEmpty. Operand 2579 states and 3884 transitions. [2018-10-24 14:59:45,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2018-10-24 14:59:45,537 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:59:45,537 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:59:45,537 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:59:45,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:59:45,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1924425440, now seen corresponding path program 1 times [2018-10-24 14:59:45,538 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:59:45,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:59:45,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:59:45,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:59:45,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:59:45,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:59:45,743 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:59:45,743 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:59:45,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:59:45,744 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:59:45,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:59:45,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:59:45,745 INFO L87 Difference]: Start difference. First operand 2579 states and 3884 transitions. Second operand 3 states. [2018-10-24 14:59:46,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:59:46,439 INFO L93 Difference]: Finished difference Result 7713 states and 11623 transitions. [2018-10-24 14:59:46,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:59:46,439 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 225 [2018-10-24 14:59:46,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:59:46,462 INFO L225 Difference]: With dead ends: 7713 [2018-10-24 14:59:46,463 INFO L226 Difference]: Without dead ends: 5136 [2018-10-24 14:59:46,468 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:59:46,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5136 states. [2018-10-24 14:59:46,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5136 to 5133. [2018-10-24 14:59:46,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5133 states. [2018-10-24 14:59:46,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5133 states to 5133 states and 7720 transitions. [2018-10-24 14:59:46,572 INFO L78 Accepts]: Start accepts. Automaton has 5133 states and 7720 transitions. Word has length 225 [2018-10-24 14:59:46,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:59:46,572 INFO L481 AbstractCegarLoop]: Abstraction has 5133 states and 7720 transitions. [2018-10-24 14:59:46,572 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:59:46,572 INFO L276 IsEmpty]: Start isEmpty. Operand 5133 states and 7720 transitions. [2018-10-24 14:59:46,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-10-24 14:59:46,584 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:59:46,585 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:59:46,585 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:59:46,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:59:46,586 INFO L82 PathProgramCache]: Analyzing trace with hash -942595079, now seen corresponding path program 1 times [2018-10-24 14:59:46,586 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:59:46,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:59:46,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:59:46,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:59:46,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:59:46,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:59:46,948 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 31 proven. 10 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-10-24 14:59:46,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 14:59:46,949 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:59:46,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:59:47,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:59:47,129 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 14:59:47,208 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-10-24 14:59:47,242 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 14:59:47,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 3 [2018-10-24 14:59:47,244 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:59:47,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:59:47,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:59:47,245 INFO L87 Difference]: Start difference. First operand 5133 states and 7720 transitions. Second operand 4 states. [2018-10-24 14:59:49,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:59:49,038 INFO L93 Difference]: Finished difference Result 20487 states and 30826 transitions. [2018-10-24 14:59:49,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:59:49,039 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 234 [2018-10-24 14:59:49,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:59:49,098 INFO L225 Difference]: With dead ends: 20487 [2018-10-24 14:59:49,099 INFO L226 Difference]: Without dead ends: 15356 [2018-10-24 14:59:49,110 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 234 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:59:49,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15356 states. [2018-10-24 14:59:49,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15356 to 10229. [2018-10-24 14:59:49,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10229 states. [2018-10-24 14:59:49,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10229 states to 10229 states and 15363 transitions. [2018-10-24 14:59:49,377 INFO L78 Accepts]: Start accepts. Automaton has 10229 states and 15363 transitions. Word has length 234 [2018-10-24 14:59:49,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:59:49,378 INFO L481 AbstractCegarLoop]: Abstraction has 10229 states and 15363 transitions. [2018-10-24 14:59:49,378 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:59:49,378 INFO L276 IsEmpty]: Start isEmpty. Operand 10229 states and 15363 transitions. [2018-10-24 14:59:49,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-10-24 14:59:49,399 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:59:49,400 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:59:49,400 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:59:49,400 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:59:49,401 INFO L82 PathProgramCache]: Analyzing trace with hash -42517928, now seen corresponding path program 1 times [2018-10-24 14:59:49,401 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:59:49,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:59:49,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:59:49,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:59:49,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:59:49,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:59:49,864 WARN L179 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2018-10-24 14:59:49,898 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:59:49,898 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:59:49,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 14:59:49,899 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 14:59:49,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 14:59:49,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 14:59:49,899 INFO L87 Difference]: Start difference. First operand 10229 states and 15363 transitions. Second operand 5 states. [2018-10-24 14:59:53,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:59:53,904 INFO L93 Difference]: Finished difference Result 23029 states and 35010 transitions. [2018-10-24 14:59:53,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 14:59:53,911 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 242 [2018-10-24 14:59:53,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:59:53,940 INFO L225 Difference]: With dead ends: 23029 [2018-10-24 14:59:53,941 INFO L226 Difference]: Without dead ends: 12802 [2018-10-24 14:59:53,950 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:59:53,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12802 states. [2018-10-24 14:59:54,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12802 to 11045. [2018-10-24 14:59:54,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11045 states. [2018-10-24 14:59:54,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11045 states to 11045 states and 16559 transitions. [2018-10-24 14:59:54,154 INFO L78 Accepts]: Start accepts. Automaton has 11045 states and 16559 transitions. Word has length 242 [2018-10-24 14:59:54,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:59:54,155 INFO L481 AbstractCegarLoop]: Abstraction has 11045 states and 16559 transitions. [2018-10-24 14:59:54,155 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 14:59:54,155 INFO L276 IsEmpty]: Start isEmpty. Operand 11045 states and 16559 transitions. [2018-10-24 14:59:54,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-10-24 14:59:54,176 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:59:54,176 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:59:54,177 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:59:54,177 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:59:54,177 INFO L82 PathProgramCache]: Analyzing trace with hash 1670858200, now seen corresponding path program 1 times [2018-10-24 14:59:54,177 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:59:54,178 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:59:54,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:59:54,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:59:54,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:59:54,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:59:54,442 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-10-24 14:59:54,443 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:59:54,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:59:54,444 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:59:54,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:59:54,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:59:54,444 INFO L87 Difference]: Start difference. First operand 11045 states and 16559 transitions. Second operand 4 states. [2018-10-24 14:59:57,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:59:57,158 INFO L93 Difference]: Finished difference Result 41024 states and 61360 transitions. [2018-10-24 14:59:57,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:59:57,158 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 242 [2018-10-24 14:59:57,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:59:57,210 INFO L225 Difference]: With dead ends: 41024 [2018-10-24 14:59:57,211 INFO L226 Difference]: Without dead ends: 29981 [2018-10-24 14:59:57,228 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:59:57,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29981 states. [2018-10-24 14:59:57,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29981 to 20440. [2018-10-24 14:59:57,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20440 states. [2018-10-24 14:59:57,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20440 states to 20440 states and 29051 transitions. [2018-10-24 14:59:57,568 INFO L78 Accepts]: Start accepts. Automaton has 20440 states and 29051 transitions. Word has length 242 [2018-10-24 14:59:57,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:59:57,568 INFO L481 AbstractCegarLoop]: Abstraction has 20440 states and 29051 transitions. [2018-10-24 14:59:57,568 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:59:57,568 INFO L276 IsEmpty]: Start isEmpty. Operand 20440 states and 29051 transitions. [2018-10-24 14:59:57,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2018-10-24 14:59:57,602 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:59:57,603 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:59:57,603 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:59:57,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:59:57,604 INFO L82 PathProgramCache]: Analyzing trace with hash -2012852909, now seen corresponding path program 1 times [2018-10-24 14:59:57,604 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:59:57,604 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:59:57,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:59:57,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:59:57,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:59:57,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:59:57,765 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-24 14:59:57,765 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:59:57,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:59:57,766 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:59:57,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:59:57,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:59:57,766 INFO L87 Difference]: Start difference. First operand 20440 states and 29051 transitions. Second operand 3 states. [2018-10-24 14:59:59,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:59:59,413 INFO L93 Difference]: Finished difference Result 40906 states and 58154 transitions. [2018-10-24 14:59:59,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:59:59,414 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 243 [2018-10-24 14:59:59,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:59:59,447 INFO L225 Difference]: With dead ends: 40906 [2018-10-24 14:59:59,447 INFO L226 Difference]: Without dead ends: 20468 [2018-10-24 14:59:59,466 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:59,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20468 states. [2018-10-24 14:59:59,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20468 to 20440. [2018-10-24 14:59:59,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20440 states. [2018-10-24 14:59:59,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20440 states to 20440 states and 27343 transitions. [2018-10-24 14:59:59,750 INFO L78 Accepts]: Start accepts. Automaton has 20440 states and 27343 transitions. Word has length 243 [2018-10-24 14:59:59,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:59:59,751 INFO L481 AbstractCegarLoop]: Abstraction has 20440 states and 27343 transitions. [2018-10-24 14:59:59,751 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:59:59,751 INFO L276 IsEmpty]: Start isEmpty. Operand 20440 states and 27343 transitions. [2018-10-24 14:59:59,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2018-10-24 14:59:59,778 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:59:59,778 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:59:59,779 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:59:59,779 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:59:59,779 INFO L82 PathProgramCache]: Analyzing trace with hash 1161717019, now seen corresponding path program 1 times [2018-10-24 14:59:59,779 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:59:59,779 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:59:59,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:59:59,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:59:59,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:59:59,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:59:59,919 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-10-24 14:59:59,920 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:59:59,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:59:59,920 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:59:59,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:59:59,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:59:59,921 INFO L87 Difference]: Start difference. First operand 20440 states and 27343 transitions. Second operand 3 states. [2018-10-24 15:00:01,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:00:01,349 INFO L93 Difference]: Finished difference Result 57404 states and 76442 transitions. [2018-10-24 15:00:01,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 15:00:01,349 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 250 [2018-10-24 15:00:01,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:00:01,391 INFO L225 Difference]: With dead ends: 57404 [2018-10-24 15:00:01,391 INFO L226 Difference]: Without dead ends: 36966 [2018-10-24 15:00:01,413 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 15:00:01,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36966 states. [2018-10-24 15:00:01,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36966 to 36958. [2018-10-24 15:00:01,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36958 states. [2018-10-24 15:00:01,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36958 states to 36958 states and 44611 transitions. [2018-10-24 15:00:01,868 INFO L78 Accepts]: Start accepts. Automaton has 36958 states and 44611 transitions. Word has length 250 [2018-10-24 15:00:01,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:00:01,868 INFO L481 AbstractCegarLoop]: Abstraction has 36958 states and 44611 transitions. [2018-10-24 15:00:01,868 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 15:00:01,869 INFO L276 IsEmpty]: Start isEmpty. Operand 36958 states and 44611 transitions. [2018-10-24 15:00:01,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2018-10-24 15:00:01,909 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:00:01,909 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 15:00:01,910 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:00:01,910 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:00:01,911 INFO L82 PathProgramCache]: Analyzing trace with hash -50667516, now seen corresponding path program 1 times [2018-10-24 15:00:01,911 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:00:01,911 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:00:01,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:00:01,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:00:01,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:00:01,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:00:02,297 WARN L179 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 10 [2018-10-24 15:00:02,365 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 78 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-10-24 15:00:02,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 15:00:02,365 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 15:00:02,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:00:02,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:00:02,484 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 15:00:02,603 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-10-24 15:00:02,626 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 15:00:02,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2018-10-24 15:00:02,627 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-24 15:00:02,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-24 15:00:02,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-10-24 15:00:02,628 INFO L87 Difference]: Start difference. First operand 36958 states and 44611 transitions. Second operand 7 states. [2018-10-24 15:00:09,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:00:09,267 INFO L93 Difference]: Finished difference Result 148408 states and 179941 transitions. [2018-10-24 15:00:09,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-24 15:00:09,268 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 273 [2018-10-24 15:00:09,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:00:09,407 INFO L225 Difference]: With dead ends: 148408 [2018-10-24 15:00:09,408 INFO L226 Difference]: Without dead ends: 111452 [2018-10-24 15:00:09,457 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2018-10-24 15:00:09,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111452 states. [2018-10-24 15:00:11,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111452 to 111428. [2018-10-24 15:00:11,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111428 states. [2018-10-24 15:00:11,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111428 states to 111428 states and 129315 transitions. [2018-10-24 15:00:11,169 INFO L78 Accepts]: Start accepts. Automaton has 111428 states and 129315 transitions. Word has length 273 [2018-10-24 15:00:11,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:00:11,170 INFO L481 AbstractCegarLoop]: Abstraction has 111428 states and 129315 transitions. [2018-10-24 15:00:11,170 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-24 15:00:11,170 INFO L276 IsEmpty]: Start isEmpty. Operand 111428 states and 129315 transitions. [2018-10-24 15:00:11,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2018-10-24 15:00:11,217 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:00:11,218 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 15:00:11,218 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:00:11,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:00:11,219 INFO L82 PathProgramCache]: Analyzing trace with hash -996362106, now seen corresponding path program 1 times [2018-10-24 15:00:11,219 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:00:11,219 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:00:11,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:00:11,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:00:11,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:00:11,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:00:11,589 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-10-24 15:00:11,590 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:00:11,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 15:00:11,590 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 15:00:11,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 15:00:11,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 15:00:11,591 INFO L87 Difference]: Start difference. First operand 111428 states and 129315 transitions. Second operand 4 states. [2018-10-24 15:00:15,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:00:15,058 INFO L93 Difference]: Finished difference Result 351941 states and 407982 transitions. [2018-10-24 15:00:15,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 15:00:15,059 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 302 [2018-10-24 15:00:15,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:00:15,422 INFO L225 Difference]: With dead ends: 351941 [2018-10-24 15:00:15,423 INFO L226 Difference]: Without dead ends: 240515 [2018-10-24 15:00:15,543 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 15:00:15,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240515 states. [2018-10-24 15:00:18,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240515 to 177289. [2018-10-24 15:00:18,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177289 states. [2018-10-24 15:00:18,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177289 states to 177289 states and 203822 transitions. [2018-10-24 15:00:18,612 INFO L78 Accepts]: Start accepts. Automaton has 177289 states and 203822 transitions. Word has length 302 [2018-10-24 15:00:18,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:00:18,613 INFO L481 AbstractCegarLoop]: Abstraction has 177289 states and 203822 transitions. [2018-10-24 15:00:18,613 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 15:00:18,613 INFO L276 IsEmpty]: Start isEmpty. Operand 177289 states and 203822 transitions. [2018-10-24 15:00:18,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2018-10-24 15:00:18,702 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:00:18,702 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 15:00:18,703 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:00:18,703 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:00:18,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1793634105, now seen corresponding path program 1 times [2018-10-24 15:00:18,703 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:00:18,703 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:00:18,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:00:18,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:00:18,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:00:18,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:00:18,898 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-10-24 15:00:18,899 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:00:18,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 15:00:18,899 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 15:00:18,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 15:00:18,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 15:00:18,900 INFO L87 Difference]: Start difference. First operand 177289 states and 203822 transitions. Second operand 3 states. [2018-10-24 15:00:21,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:00:21,787 INFO L93 Difference]: Finished difference Result 354568 states and 407634 transitions. [2018-10-24 15:00:21,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 15:00:21,787 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 330 [2018-10-24 15:00:21,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:00:21,993 INFO L225 Difference]: With dead ends: 354568 [2018-10-24 15:00:21,993 INFO L226 Difference]: Without dead ends: 177281 [2018-10-24 15:00:22,088 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 15:00:22,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177281 states. [2018-10-24 15:00:23,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177281 to 177281. [2018-10-24 15:00:23,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177281 states. [2018-10-24 15:00:23,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177281 states to 177281 states and 203798 transitions. [2018-10-24 15:00:23,863 INFO L78 Accepts]: Start accepts. Automaton has 177281 states and 203798 transitions. Word has length 330 [2018-10-24 15:00:23,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:00:23,863 INFO L481 AbstractCegarLoop]: Abstraction has 177281 states and 203798 transitions. [2018-10-24 15:00:23,863 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 15:00:23,864 INFO L276 IsEmpty]: Start isEmpty. Operand 177281 states and 203798 transitions. [2018-10-24 15:00:23,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2018-10-24 15:00:23,949 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:00:23,949 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 15:00:23,950 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:00:23,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:00:23,950 INFO L82 PathProgramCache]: Analyzing trace with hash -1310769329, now seen corresponding path program 1 times [2018-10-24 15:00:23,950 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:00:23,950 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:00:23,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:00:23,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:00:23,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:00:24,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:00:25,952 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-10-24 15:00:25,952 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:00:25,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 15:00:25,953 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 15:00:25,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 15:00:25,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 15:00:25,954 INFO L87 Difference]: Start difference. First operand 177281 states and 203798 transitions. Second operand 3 states. [2018-10-24 15:00:28,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:00:28,166 INFO L93 Difference]: Finished difference Result 350124 states and 402284 transitions. [2018-10-24 15:00:28,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 15:00:28,166 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 332 [2018-10-24 15:00:28,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:00:28,343 INFO L225 Difference]: With dead ends: 350124 [2018-10-24 15:00:28,343 INFO L226 Difference]: Without dead ends: 172845 [2018-10-24 15:00:28,428 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 15:00:28,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172845 states. [2018-10-24 15:00:30,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172845 to 172845. [2018-10-24 15:00:30,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172845 states. [2018-10-24 15:00:36,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172845 states to 172845 states and 196910 transitions. [2018-10-24 15:00:36,641 INFO L78 Accepts]: Start accepts. Automaton has 172845 states and 196910 transitions. Word has length 332 [2018-10-24 15:00:36,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:00:36,642 INFO L481 AbstractCegarLoop]: Abstraction has 172845 states and 196910 transitions. [2018-10-24 15:00:36,642 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 15:00:36,642 INFO L276 IsEmpty]: Start isEmpty. Operand 172845 states and 196910 transitions. [2018-10-24 15:00:36,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2018-10-24 15:00:36,694 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:00:36,694 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 15:00:36,694 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:00:36,695 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:00:36,695 INFO L82 PathProgramCache]: Analyzing trace with hash 1850297527, now seen corresponding path program 1 times [2018-10-24 15:00:36,695 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:00:36,695 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:00:36,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:00:36,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:00:36,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:00:36,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:00:37,056 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 15:00:37,057 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:00:37,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 15:00:37,058 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 15:00:37,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 15:00:37,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 15:00:37,058 INFO L87 Difference]: Start difference. First operand 172845 states and 196910 transitions. Second operand 4 states. [2018-10-24 15:00:40,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:00:40,624 INFO L93 Difference]: Finished difference Result 659659 states and 751671 transitions. [2018-10-24 15:00:40,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 15:00:40,624 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 345 [2018-10-24 15:00:40,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:00:41,398 INFO L225 Difference]: With dead ends: 659659 [2018-10-24 15:00:41,398 INFO L226 Difference]: Without dead ends: 486816 [2018-10-24 15:00:41,560 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 15:00:41,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486816 states. [2018-10-24 15:00:47,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486816 to 322964. [2018-10-24 15:00:47,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322964 states. [2018-10-24 15:00:48,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322964 states to 322964 states and 368236 transitions. [2018-10-24 15:00:48,030 INFO L78 Accepts]: Start accepts. Automaton has 322964 states and 368236 transitions. Word has length 345 [2018-10-24 15:00:48,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:00:48,030 INFO L481 AbstractCegarLoop]: Abstraction has 322964 states and 368236 transitions. [2018-10-24 15:00:48,030 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 15:00:48,030 INFO L276 IsEmpty]: Start isEmpty. Operand 322964 states and 368236 transitions. [2018-10-24 15:00:48,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2018-10-24 15:00:48,093 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:00:48,093 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 15:00:48,094 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:00:48,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:00:48,094 INFO L82 PathProgramCache]: Analyzing trace with hash 972731471, now seen corresponding path program 1 times [2018-10-24 15:00:48,095 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:00:48,095 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:00:48,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:00:48,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:00:48,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:00:48,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:00:49,335 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-10-24 15:00:49,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:00:49,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 15:00:49,336 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 15:00:49,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 15:00:49,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 15:00:49,337 INFO L87 Difference]: Start difference. First operand 322964 states and 368236 transitions. Second operand 4 states. [2018-10-24 15:00:55,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:00:55,147 INFO L93 Difference]: Finished difference Result 663142 states and 756901 transitions. [2018-10-24 15:00:55,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 15:00:55,147 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 346 [2018-10-24 15:00:55,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:00:55,631 INFO L225 Difference]: With dead ends: 663142 [2018-10-24 15:00:55,632 INFO L226 Difference]: Without dead ends: 340180 [2018-10-24 15:00:55,759 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:56,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340180 states. [2018-10-24 15:01:00,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340180 to 340130. [2018-10-24 15:01:00,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340130 states. [2018-10-24 15:01:01,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340130 states to 340130 states and 387085 transitions. [2018-10-24 15:01:01,141 INFO L78 Accepts]: Start accepts. Automaton has 340130 states and 387085 transitions. Word has length 346 [2018-10-24 15:01:01,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:01:01,141 INFO L481 AbstractCegarLoop]: Abstraction has 340130 states and 387085 transitions. [2018-10-24 15:01:01,141 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 15:01:01,141 INFO L276 IsEmpty]: Start isEmpty. Operand 340130 states and 387085 transitions. [2018-10-24 15:01:01,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2018-10-24 15:01:01,199 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:01:01,199 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 15:01:01,199 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:01:01,199 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:01:01,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1494854117, now seen corresponding path program 1 times [2018-10-24 15:01:01,200 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:01:01,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:01:01,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:01,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:01:01,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:01,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:01:01,848 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-24 15:01:01,848 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:01:01,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 15:01:01,849 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 15:01:01,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 15:01:01,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 15:01:01,849 INFO L87 Difference]: Start difference. First operand 340130 states and 387085 transitions. Second operand 4 states. [2018-10-24 15:01:10,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:01:10,544 INFO L93 Difference]: Finished difference Result 696743 states and 795694 transitions. [2018-10-24 15:01:10,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 15:01:10,544 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 351 [2018-10-24 15:01:10,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:01:11,191 INFO L225 Difference]: With dead ends: 696743 [2018-10-24 15:01:11,191 INFO L226 Difference]: Without dead ends: 356615 [2018-10-24 15:01:11,430 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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:01:11,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356615 states. [2018-10-24 15:01:17,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356615 to 339463. [2018-10-24 15:01:17,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339463 states. [2018-10-24 15:01:17,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339463 states to 339463 states and 383111 transitions. [2018-10-24 15:01:17,681 INFO L78 Accepts]: Start accepts. Automaton has 339463 states and 383111 transitions. Word has length 351 [2018-10-24 15:01:17,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:01:17,682 INFO L481 AbstractCegarLoop]: Abstraction has 339463 states and 383111 transitions. [2018-10-24 15:01:17,682 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 15:01:17,682 INFO L276 IsEmpty]: Start isEmpty. Operand 339463 states and 383111 transitions. [2018-10-24 15:01:17,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2018-10-24 15:01:17,759 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:01:17,760 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 15:01:17,760 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:01:17,760 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:01:17,760 INFO L82 PathProgramCache]: Analyzing trace with hash -846916471, now seen corresponding path program 1 times [2018-10-24 15:01:17,760 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:01:17,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:01:17,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:17,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:01:17,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:17,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:01:18,047 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 232 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-10-24 15:01:18,047 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:01:18,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 15:01:18,048 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 15:01:18,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 15:01:18,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 15:01:18,048 INFO L87 Difference]: Start difference. First operand 339463 states and 383111 transitions. Second operand 3 states. [2018-10-24 15:01:22,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:01:22,323 INFO L93 Difference]: Finished difference Result 641129 states and 725196 transitions. [2018-10-24 15:01:22,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 15:01:22,323 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 368 [2018-10-24 15:01:22,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:01:22,746 INFO L225 Difference]: With dead ends: 641129 [2018-10-24 15:01:22,746 INFO L226 Difference]: Without dead ends: 301668 [2018-10-24 15:01:22,908 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 15:01:23,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301668 states. [2018-10-24 15:01:28,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301668 to 296960. [2018-10-24 15:01:28,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296960 states. [2018-10-24 15:01:29,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296960 states to 296960 states and 328199 transitions. [2018-10-24 15:01:29,159 INFO L78 Accepts]: Start accepts. Automaton has 296960 states and 328199 transitions. Word has length 368 [2018-10-24 15:01:29,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:01:29,159 INFO L481 AbstractCegarLoop]: Abstraction has 296960 states and 328199 transitions. [2018-10-24 15:01:29,159 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 15:01:29,159 INFO L276 IsEmpty]: Start isEmpty. Operand 296960 states and 328199 transitions. [2018-10-24 15:01:29,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2018-10-24 15:01:29,215 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:01:29,215 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 15:01:29,215 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:01:29,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:01:29,216 INFO L82 PathProgramCache]: Analyzing trace with hash -893696450, now seen corresponding path program 1 times [2018-10-24 15:01:29,216 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:01:29,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:01:29,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:29,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:01:29,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:29,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:01:29,667 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 183 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-10-24 15:01:29,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:01:29,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 15:01:29,668 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 15:01:29,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 15:01:29,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 15:01:29,669 INFO L87 Difference]: Start difference. First operand 296960 states and 328199 transitions. Second operand 4 states. [2018-10-24 15:01:35,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:01:35,922 INFO L93 Difference]: Finished difference Result 1111747 states and 1228016 transitions. [2018-10-24 15:01:35,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 15:01:35,923 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 374 [2018-10-24 15:01:35,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:01:37,119 INFO L225 Difference]: With dead ends: 1111747 [2018-10-24 15:01:37,120 INFO L226 Difference]: Without dead ends: 814789 [2018-10-24 15:01:44,983 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 15:01:45,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 814789 states. [2018-10-24 15:01:52,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 814789 to 524785. [2018-10-24 15:01:53,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 524785 states. [2018-10-24 15:01:53,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524785 states to 524785 states and 579152 transitions. [2018-10-24 15:01:53,621 INFO L78 Accepts]: Start accepts. Automaton has 524785 states and 579152 transitions. Word has length 374 [2018-10-24 15:01:53,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:01:53,621 INFO L481 AbstractCegarLoop]: Abstraction has 524785 states and 579152 transitions. [2018-10-24 15:01:53,622 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 15:01:53,622 INFO L276 IsEmpty]: Start isEmpty. Operand 524785 states and 579152 transitions. [2018-10-24 15:01:53,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 386 [2018-10-24 15:01:53,682 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:01:53,682 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 15:01:53,682 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:01:53,683 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:01:53,683 INFO L82 PathProgramCache]: Analyzing trace with hash -1326023536, now seen corresponding path program 1 times [2018-10-24 15:01:53,683 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:01:53,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:01:53,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:53,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:01:53,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:53,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:01:54,046 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 197 proven. 0 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2018-10-24 15:01:54,046 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:01:54,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 15:01:54,047 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 15:01:54,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 15:01:54,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 15:01:54,047 INFO L87 Difference]: Start difference. First operand 524785 states and 579152 transitions. Second operand 4 states. [2018-10-24 15:02:02,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:02:02,084 INFO L93 Difference]: Finished difference Result 1050464 states and 1158599 transitions. [2018-10-24 15:02:02,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 15:02:02,085 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 385 [2018-10-24 15:02:02,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:02:02,684 INFO L225 Difference]: With dead ends: 1050464 [2018-10-24 15:02:02,684 INFO L226 Difference]: Without dead ends: 525681 [2018-10-24 15:02:02,834 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 15:02:03,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525681 states. [2018-10-24 15:02:11,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525681 to 505523. [2018-10-24 15:02:11,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505523 states. [2018-10-24 15:02:11,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505523 states to 505523 states and 554820 transitions. [2018-10-24 15:02:11,812 INFO L78 Accepts]: Start accepts. Automaton has 505523 states and 554820 transitions. Word has length 385 [2018-10-24 15:02:11,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:02:11,812 INFO L481 AbstractCegarLoop]: Abstraction has 505523 states and 554820 transitions. [2018-10-24 15:02:11,812 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 15:02:11,813 INFO L276 IsEmpty]: Start isEmpty. Operand 505523 states and 554820 transitions. [2018-10-24 15:02:11,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2018-10-24 15:02:11,880 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:02:11,880 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 15:02:11,881 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:02:11,881 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:02:11,881 INFO L82 PathProgramCache]: Analyzing trace with hash -1912682089, now seen corresponding path program 1 times [2018-10-24 15:02:11,881 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:02:11,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:02:11,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:02:11,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:02:11,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:02:11,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:02:12,212 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 234 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-10-24 15:02:12,213 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:02:12,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 15:02:12,213 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 15:02:12,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 15:02:12,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 15:02:12,214 INFO L87 Difference]: Start difference. First operand 505523 states and 554820 transitions. Second operand 3 states. [2018-10-24 15:02:22,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:02:22,187 INFO L93 Difference]: Finished difference Result 921579 states and 1012002 transitions. [2018-10-24 15:02:22,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 15:02:22,187 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 391 [2018-10-24 15:02:22,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:02:22,734 INFO L225 Difference]: With dead ends: 921579 [2018-10-24 15:02:22,734 INFO L226 Difference]: Without dead ends: 416058 [2018-10-24 15:02:22,955 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 15:02:23,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416058 states. [2018-10-24 15:02:29,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416058 to 416042. [2018-10-24 15:02:29,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416042 states. [2018-10-24 15:02:30,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416042 states to 416042 states and 448273 transitions. [2018-10-24 15:02:30,216 INFO L78 Accepts]: Start accepts. Automaton has 416042 states and 448273 transitions. Word has length 391 [2018-10-24 15:02:30,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:02:30,216 INFO L481 AbstractCegarLoop]: Abstraction has 416042 states and 448273 transitions. [2018-10-24 15:02:30,217 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 15:02:30,217 INFO L276 IsEmpty]: Start isEmpty. Operand 416042 states and 448273 transitions. [2018-10-24 15:02:30,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2018-10-24 15:02:30,271 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:02:30,271 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 15:02:30,272 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:02:30,272 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:02:30,272 INFO L82 PathProgramCache]: Analyzing trace with hash -1913922487, now seen corresponding path program 1 times [2018-10-24 15:02:30,272 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:02:30,272 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:02:30,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:02:30,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:02:30,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:02:30,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:02:30,624 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 263 proven. 6 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-10-24 15:02:30,625 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 15:02:30,625 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 15:02:30,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:02:30,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:02:30,798 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 15:02:30,877 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 263 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-10-24 15:02:30,900 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 15:02:30,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2018-10-24 15:02:30,901 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 15:02:30,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 15:02:30,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 15:02:30,901 INFO L87 Difference]: Start difference. First operand 416042 states and 448273 transitions. Second operand 4 states. [2018-10-24 15:02:38,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:02:38,073 INFO L93 Difference]: Finished difference Result 1155885 states and 1237531 transitions. [2018-10-24 15:02:38,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 15:02:38,073 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 396 [2018-10-24 15:02:38,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:02:38,977 INFO L225 Difference]: With dead ends: 1155885 [2018-10-24 15:02:38,977 INFO L226 Difference]: Without dead ends: 739845 [2018-10-24 15:02:39,186 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 399 GetRequests, 397 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 15:02:39,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739845 states. [2018-10-24 15:02:50,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739845 to 588781. [2018-10-24 15:02:50,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588781 states. [2018-10-24 15:02:50,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588781 states to 588781 states and 627298 transitions. [2018-10-24 15:02:50,794 INFO L78 Accepts]: Start accepts. Automaton has 588781 states and 627298 transitions. Word has length 396 [2018-10-24 15:02:50,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:02:50,794 INFO L481 AbstractCegarLoop]: Abstraction has 588781 states and 627298 transitions. [2018-10-24 15:02:50,794 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 15:02:50,794 INFO L276 IsEmpty]: Start isEmpty. Operand 588781 states and 627298 transitions. [2018-10-24 15:02:50,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2018-10-24 15:02:50,849 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:02:50,849 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 15:02:50,849 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:02:50,850 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:02:50,850 INFO L82 PathProgramCache]: Analyzing trace with hash 301252508, now seen corresponding path program 1 times [2018-10-24 15:02:50,850 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:02:50,850 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:02:50,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:02:50,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:02:50,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:02:50,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2018-10-24 15:02:51,091 WARN L187 SmtUtils]: Removed 3 from assertion stack [2018-10-24 15:02:51,092 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-24 15:02:51,096 WARN L205 ceAbstractionStarter]: Timeout [2018-10-24 15:02:51,097 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 03:02:51 BoogieIcfgContainer [2018-10-24 15:02:51,097 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-24 15:02:51,098 INFO L168 Benchmark]: Toolchain (without parser) took 205434.71 ms. Allocated memory was 1.5 GB in the beginning and 5.8 GB in the end (delta: 4.3 GB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -410.5 MB). Peak memory consumption was 3.9 GB. Max. memory is 7.1 GB. [2018-10-24 15:02:51,099 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:02:51,100 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1210.16 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:02:51,100 INFO L168 Benchmark]: Boogie Procedure Inliner took 332.16 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 740.8 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -865.3 MB). Peak memory consumption was 40.3 MB. Max. memory is 7.1 GB. [2018-10-24 15:02:51,101 INFO L168 Benchmark]: Boogie Preprocessor took 163.53 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 14.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 7.1 GB. [2018-10-24 15:02:51,102 INFO L168 Benchmark]: RCFGBuilder took 5431.75 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 251.8 MB). Peak memory consumption was 251.8 MB. Max. memory is 7.1 GB. [2018-10-24 15:02:51,104 INFO L168 Benchmark]: TraceAbstraction took 198291.75 ms. Allocated memory was 2.3 GB in the beginning and 5.8 GB in the end (delta: 3.6 GB). Free memory was 1.9 GB in the beginning and 1.8 GB in the end (delta: 104.4 MB). Peak memory consumption was 3.7 GB. Max. memory is 7.1 GB. [2018-10-24 15:02:51,109 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 1210.16 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 332.16 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 740.8 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -865.3 MB). Peak memory consumption was 40.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 163.53 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 14.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 5431.75 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 251.8 MB). Peak memory consumption was 251.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 198291.75 ms. Allocated memory was 2.3 GB in the beginning and 5.8 GB in the end (delta: 3.6 GB). Free memory was 1.9 GB in the beginning and 1.8 GB in the end (delta: 104.4 MB). Peak memory consumption was 3.7 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1638]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1638). Cancelled while BasicCegarLoop was analyzing trace of length 397 with TraceHistMax 4,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 6. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 303 locations, 1 error locations. TIMEOUT Result, 198.2s OverallTime, 23 OverallIterations, 6 TraceHistogramMax, 107.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7238 SDtfs, 13509 SDslu, 6658 SDs, 0 SdLazy, 19145 SolverSat, 3804 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 40.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 981 GetRequests, 931 SyntacticMatches, 7 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=588781occurred in iteration=22, 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: 77.5s AutomataMinimizationTime, 22 MinimizatonAttempts, 727195 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 5.6s InterpolantComputationTime, 7371 NumberOfCodeBlocks, 7371 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 7346 ConstructedInterpolants, 0 QuantifiedInterpolants, 3741598 SizeOfPredicates, 1 NumberOfNonLiveVariables, 1684 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 25 InterpolantComputations, 22 PerfectInterpolantSequences, 3409/3429 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown