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_label21_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-0fd1304 [2018-10-23 18:53:23,618 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-23 18:53:23,620 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-23 18:53:23,638 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-23 18:53:23,638 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-23 18:53:23,640 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-23 18:53:23,643 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-23 18:53:23,645 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-23 18:53:23,648 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-23 18:53:23,649 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-23 18:53:23,651 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-23 18:53:23,651 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-23 18:53:23,652 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-23 18:53:23,654 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-23 18:53:23,655 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-23 18:53:23,663 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-23 18:53:23,664 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-23 18:53:23,666 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-23 18:53:23,672 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-23 18:53:23,677 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-23 18:53:23,680 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-23 18:53:23,681 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-23 18:53:23,685 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-23 18:53:23,685 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-23 18:53:23,685 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-23 18:53:23,687 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-23 18:53:23,690 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-23 18:53:23,691 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-23 18:53:23,695 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-23 18:53:23,696 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-23 18:53:23,696 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-23 18:53:23,698 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-23 18:53:23,698 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-23 18:53:23,698 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-23 18:53:23,699 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-23 18:53:23,700 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-23 18:53:23,700 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-10-23 18:53:23,733 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-23 18:53:23,735 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-23 18:53:23,736 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-23 18:53:23,736 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-23 18:53:23,737 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-23 18:53:23,737 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-23 18:53:23,737 INFO L133 SettingsManager]: * Use SBE=true [2018-10-23 18:53:23,737 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-23 18:53:23,738 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-23 18:53:23,738 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-23 18:53:23,738 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-23 18:53:23,739 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-23 18:53:23,739 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-23 18:53:23,739 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-23 18:53:23,739 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-23 18:53:23,739 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-23 18:53:23,740 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-23 18:53:23,740 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-23 18:53:23,740 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-23 18:53:23,740 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-23 18:53:23,740 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-23 18:53:23,741 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-23 18:53:23,742 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-23 18:53:23,742 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-23 18:53:23,743 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-23 18:53:23,743 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-23 18:53:23,743 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-23 18:53:23,743 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-23 18:53:23,788 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-23 18:53:23,801 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-23 18:53:23,805 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-23 18:53:23,806 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-23 18:53:23,807 INFO L276 PluginConnector]: CDTParser initialized [2018-10-23 18:53:23,807 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label21_true-unreach-call.c [2018-10-23 18:53:23,866 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/2e3fee842/653e2fb82e7a4618a5663b2346c0672a/FLAG78c4a9655 [2018-10-23 18:53:24,583 INFO L298 CDTParser]: Found 1 translation units. [2018-10-23 18:53:24,584 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label21_true-unreach-call.c [2018-10-23 18:53:24,606 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/2e3fee842/653e2fb82e7a4618a5663b2346c0672a/FLAG78c4a9655 [2018-10-23 18:53:24,624 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/2e3fee842/653e2fb82e7a4618a5663b2346c0672a [2018-10-23 18:53:24,637 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-23 18:53:24,640 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-23 18:53:24,642 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-23 18:53:24,642 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-23 18:53:24,647 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-23 18:53:24,648 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 06:53:24" (1/1) ... [2018-10-23 18:53:24,652 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7dd46912 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:53:24, skipping insertion in model container [2018-10-23 18:53:24,653 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 06:53:24" (1/1) ... [2018-10-23 18:53:24,664 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-23 18:53:24,769 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-23 18:53:25,460 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-23 18:53:25,466 INFO L189 MainTranslator]: Completed pre-run [2018-10-23 18:53:25,757 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-23 18:53:25,781 INFO L193 MainTranslator]: Completed translation [2018-10-23 18:53:25,782 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:53:25 WrapperNode [2018-10-23 18:53:25,782 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-23 18:53:25,783 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-23 18:53:25,783 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-23 18:53:25,784 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-23 18:53:25,794 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:53:25" (1/1) ... [2018-10-23 18:53:25,848 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:53:25" (1/1) ... [2018-10-23 18:53:26,104 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-23 18:53:26,104 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-23 18:53:26,104 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-23 18:53:26,105 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-23 18:53:26,117 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:53:25" (1/1) ... [2018-10-23 18:53:26,117 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:53:25" (1/1) ... [2018-10-23 18:53:26,126 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:53:25" (1/1) ... [2018-10-23 18:53:26,127 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:53:25" (1/1) ... [2018-10-23 18:53:26,174 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:53:25" (1/1) ... [2018-10-23 18:53:26,202 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:53:25" (1/1) ... [2018-10-23 18:53:26,218 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:53:25" (1/1) ... [2018-10-23 18:53:26,230 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-23 18:53:26,230 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-23 18:53:26,230 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-23 18:53:26,231 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-23 18:53:26,232 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:53:25" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-23 18:53:26,310 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-23 18:53:26,310 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-23 18:53:26,310 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-23 18:53:31,813 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-23 18:53:31,814 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 06:53:31 BoogieIcfgContainer [2018-10-23 18:53:31,814 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-23 18:53:31,815 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-23 18:53:31,816 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-23 18:53:31,819 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-23 18:53:31,819 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.10 06:53:24" (1/3) ... [2018-10-23 18:53:31,820 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ea89f80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 06:53:31, skipping insertion in model container [2018-10-23 18:53:31,821 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:53:25" (2/3) ... [2018-10-23 18:53:31,821 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ea89f80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 06:53:31, skipping insertion in model container [2018-10-23 18:53:31,821 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 06:53:31" (3/3) ... [2018-10-23 18:53:31,823 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label21_true-unreach-call.c [2018-10-23 18:53:31,836 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-23 18:53:31,845 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-23 18:53:31,864 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-23 18:53:31,904 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-23 18:53:31,905 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-23 18:53:31,905 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-23 18:53:31,905 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-23 18:53:31,906 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-23 18:53:31,906 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-23 18:53:31,906 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-23 18:53:31,906 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-23 18:53:31,906 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-23 18:53:31,933 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states. [2018-10-23 18:53:31,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-10-23 18:53:31,955 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:53:31,958 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:53:31,961 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:53:31,967 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:53:31,968 INFO L82 PathProgramCache]: Analyzing trace with hash -1515972374, now seen corresponding path program 1 times [2018-10-23 18:53:31,970 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:53:31,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:53:32,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:53:32,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:53:32,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:53:32,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:53:32,882 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-10-23 18:53:32,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 18:53:32,971 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:53:32,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:53:32,977 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:53:32,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:53:32,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:53:32,995 INFO L87 Difference]: Start difference. First operand 303 states. Second operand 4 states. [2018-10-23 18:53:36,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:53:36,987 INFO L93 Difference]: Finished difference Result 1027 states and 1865 transitions. [2018-10-23 18:53:36,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:53:36,990 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 203 [2018-10-23 18:53:36,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:53:37,016 INFO L225 Difference]: With dead ends: 1027 [2018-10-23 18:53:37,017 INFO L226 Difference]: Without dead ends: 717 [2018-10-23 18:53:37,022 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:53:37,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2018-10-23 18:53:37,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 715. [2018-10-23 18:53:37,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 715 states. [2018-10-23 18:53:37,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 1145 transitions. [2018-10-23 18:53:37,118 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 1145 transitions. Word has length 203 [2018-10-23 18:53:37,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:53:37,120 INFO L481 AbstractCegarLoop]: Abstraction has 715 states and 1145 transitions. [2018-10-23 18:53:37,120 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:53:37,120 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1145 transitions. [2018-10-23 18:53:37,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-10-23 18:53:37,127 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:53:37,128 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:53:37,128 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:53:37,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:53:37,129 INFO L82 PathProgramCache]: Analyzing trace with hash -197428085, now seen corresponding path program 1 times [2018-10-23 18:53:37,129 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:53:37,129 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:53:37,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:53:37,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:53:37,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:53:37,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:53:37,316 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 18:53:37,317 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:53:37,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-23 18:53:37,321 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:53:37,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:53:37,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:53:37,322 INFO L87 Difference]: Start difference. First operand 715 states and 1145 transitions. Second operand 3 states. [2018-10-23 18:53:39,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:53:39,496 INFO L93 Difference]: Finished difference Result 2058 states and 3347 transitions. [2018-10-23 18:53:39,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:53:39,497 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 212 [2018-10-23 18:53:39,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:53:39,506 INFO L225 Difference]: With dead ends: 2058 [2018-10-23 18:53:39,506 INFO L226 Difference]: Without dead ends: 1345 [2018-10-23 18:53:39,510 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:53:39,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1345 states. [2018-10-23 18:53:39,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1345 to 1331. [2018-10-23 18:53:39,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1331 states. [2018-10-23 18:53:39,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1331 states to 1331 states and 2076 transitions. [2018-10-23 18:53:39,590 INFO L78 Accepts]: Start accepts. Automaton has 1331 states and 2076 transitions. Word has length 212 [2018-10-23 18:53:39,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:53:39,591 INFO L481 AbstractCegarLoop]: Abstraction has 1331 states and 2076 transitions. [2018-10-23 18:53:39,591 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:53:39,591 INFO L276 IsEmpty]: Start isEmpty. Operand 1331 states and 2076 transitions. [2018-10-23 18:53:39,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-10-23 18:53:39,596 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:53:39,596 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:53:39,599 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:53:39,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:53:39,600 INFO L82 PathProgramCache]: Analyzing trace with hash -472348186, now seen corresponding path program 1 times [2018-10-23 18:53:39,600 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:53:39,600 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:53:39,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:53:39,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:53:39,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:53:39,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:53:39,793 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-23 18:53:39,794 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:53:39,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-23 18:53:39,795 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:53:39,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:53:39,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:53:39,795 INFO L87 Difference]: Start difference. First operand 1331 states and 2076 transitions. Second operand 3 states. [2018-10-23 18:53:41,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:53:41,445 INFO L93 Difference]: Finished difference Result 3977 states and 6209 transitions. [2018-10-23 18:53:41,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:53:41,445 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 226 [2018-10-23 18:53:41,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:53:41,460 INFO L225 Difference]: With dead ends: 3977 [2018-10-23 18:53:41,460 INFO L226 Difference]: Without dead ends: 2648 [2018-10-23 18:53:41,463 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:53:41,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2648 states. [2018-10-23 18:53:41,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2648 to 2645. [2018-10-23 18:53:41,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2645 states. [2018-10-23 18:53:41,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2645 states to 2645 states and 4120 transitions. [2018-10-23 18:53:41,521 INFO L78 Accepts]: Start accepts. Automaton has 2645 states and 4120 transitions. Word has length 226 [2018-10-23 18:53:41,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:53:41,521 INFO L481 AbstractCegarLoop]: Abstraction has 2645 states and 4120 transitions. [2018-10-23 18:53:41,522 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:53:41,523 INFO L276 IsEmpty]: Start isEmpty. Operand 2645 states and 4120 transitions. [2018-10-23 18:53:41,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-10-23 18:53:41,531 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:53:41,531 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:53:41,532 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:53:41,532 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:53:41,532 INFO L82 PathProgramCache]: Analyzing trace with hash -494435718, now seen corresponding path program 1 times [2018-10-23 18:53:41,532 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:53:41,533 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:53:41,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:53:41,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:53:41,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:53:41,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:53:41,735 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-10-23 18:53:41,735 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:53:41,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-23 18:53:41,736 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:53:41,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:53:41,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:53:41,737 INFO L87 Difference]: Start difference. First operand 2645 states and 4120 transitions. Second operand 3 states. [2018-10-23 18:53:42,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:53:42,882 INFO L93 Difference]: Finished difference Result 5250 states and 8186 transitions. [2018-10-23 18:53:42,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:53:42,883 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 234 [2018-10-23 18:53:42,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:53:42,897 INFO L225 Difference]: With dead ends: 5250 [2018-10-23 18:53:42,897 INFO L226 Difference]: Without dead ends: 2607 [2018-10-23 18:53:42,902 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:53:42,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2607 states. [2018-10-23 18:53:42,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2607 to 2607. [2018-10-23 18:53:42,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2607 states. [2018-10-23 18:53:42,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2607 states to 2607 states and 3992 transitions. [2018-10-23 18:53:42,974 INFO L78 Accepts]: Start accepts. Automaton has 2607 states and 3992 transitions. Word has length 234 [2018-10-23 18:53:42,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:53:42,976 INFO L481 AbstractCegarLoop]: Abstraction has 2607 states and 3992 transitions. [2018-10-23 18:53:42,976 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:53:42,976 INFO L276 IsEmpty]: Start isEmpty. Operand 2607 states and 3992 transitions. [2018-10-23 18:53:42,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2018-10-23 18:53:42,984 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:53:42,984 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:53:42,985 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:53:42,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:53:42,985 INFO L82 PathProgramCache]: Analyzing trace with hash -1318050450, now seen corresponding path program 1 times [2018-10-23 18:53:42,985 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:53:42,986 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:53:42,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:53:42,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:53:42,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:53:43,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:53:43,542 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 18:53:43,543 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:53:43,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-23 18:53:43,544 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-23 18:53:43,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-23 18:53:43,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-23 18:53:43,545 INFO L87 Difference]: Start difference. First operand 2607 states and 3992 transitions. Second operand 5 states. [2018-10-23 18:53:47,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:53:47,460 INFO L93 Difference]: Finished difference Result 6279 states and 9778 transitions. [2018-10-23 18:53:47,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-23 18:53:47,462 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 243 [2018-10-23 18:53:47,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:53:47,480 INFO L225 Difference]: With dead ends: 6279 [2018-10-23 18:53:47,481 INFO L226 Difference]: Without dead ends: 3674 [2018-10-23 18:53:47,485 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-23 18:53:47,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3674 states. [2018-10-23 18:53:47,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3674 to 3015. [2018-10-23 18:53:47,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3015 states. [2018-10-23 18:53:47,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3015 states to 3015 states and 4612 transitions. [2018-10-23 18:53:47,542 INFO L78 Accepts]: Start accepts. Automaton has 3015 states and 4612 transitions. Word has length 243 [2018-10-23 18:53:47,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:53:47,542 INFO L481 AbstractCegarLoop]: Abstraction has 3015 states and 4612 transitions. [2018-10-23 18:53:47,543 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-23 18:53:47,543 INFO L276 IsEmpty]: Start isEmpty. Operand 3015 states and 4612 transitions. [2018-10-23 18:53:47,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2018-10-23 18:53:47,552 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:53:47,553 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:53:47,553 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:53:47,553 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:53:47,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1744395106, now seen corresponding path program 1 times [2018-10-23 18:53:47,554 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:53:47,554 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:53:47,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:53:47,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:53:47,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:53:47,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:53:47,808 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 62 proven. 10 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-10-23 18:53:47,808 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 18:53:47,808 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-23 18:53:47,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:53:47,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:53:47,991 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 18:53:48,078 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-10-23 18:53:48,103 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-23 18:53:48,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 3 [2018-10-23 18:53:48,104 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:53:48,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:53:48,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:53:48,104 INFO L87 Difference]: Start difference. First operand 3015 states and 4612 transitions. Second operand 4 states. [2018-10-23 18:53:51,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:53:51,180 INFO L93 Difference]: Finished difference Result 12048 states and 18435 transitions. [2018-10-23 18:53:51,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:53:51,181 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 279 [2018-10-23 18:53:51,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:53:51,221 INFO L225 Difference]: With dead ends: 12048 [2018-10-23 18:53:51,221 INFO L226 Difference]: Without dead ends: 9035 [2018-10-23 18:53:51,228 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 279 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-23 18:53:51,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9035 states. [2018-10-23 18:53:51,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9035 to 6022. [2018-10-23 18:53:51,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6022 states. [2018-10-23 18:53:51,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6022 states to 6022 states and 9192 transitions. [2018-10-23 18:53:51,384 INFO L78 Accepts]: Start accepts. Automaton has 6022 states and 9192 transitions. Word has length 279 [2018-10-23 18:53:51,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:53:51,384 INFO L481 AbstractCegarLoop]: Abstraction has 6022 states and 9192 transitions. [2018-10-23 18:53:51,385 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:53:51,385 INFO L276 IsEmpty]: Start isEmpty. Operand 6022 states and 9192 transitions. [2018-10-23 18:53:51,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2018-10-23 18:53:51,396 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:53:51,397 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:53:51,397 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:53:51,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:53:51,397 INFO L82 PathProgramCache]: Analyzing trace with hash -1003075031, now seen corresponding path program 1 times [2018-10-23 18:53:51,397 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:53:51,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:53:51,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:53:51,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:53:51,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:53:51,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:53:51,662 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-23 18:53:51,662 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:53:51,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:53:51,663 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:53:51,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:53:51,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:53:51,668 INFO L87 Difference]: Start difference. First operand 6022 states and 9192 transitions. Second operand 3 states. [2018-10-23 18:53:53,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:53:53,262 INFO L93 Difference]: Finished difference Result 17361 states and 26560 transitions. [2018-10-23 18:53:53,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:53:53,263 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 279 [2018-10-23 18:53:53,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:53:53,307 INFO L225 Difference]: With dead ends: 17361 [2018-10-23 18:53:53,307 INFO L226 Difference]: Without dead ends: 11341 [2018-10-23 18:53:53,318 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:53:53,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11341 states. [2018-10-23 18:53:53,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11341 to 11337. [2018-10-23 18:53:53,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11337 states. [2018-10-23 18:53:53,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11337 states to 11337 states and 15999 transitions. [2018-10-23 18:53:53,493 INFO L78 Accepts]: Start accepts. Automaton has 11337 states and 15999 transitions. Word has length 279 [2018-10-23 18:53:53,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:53:53,494 INFO L481 AbstractCegarLoop]: Abstraction has 11337 states and 15999 transitions. [2018-10-23 18:53:53,494 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:53:53,494 INFO L276 IsEmpty]: Start isEmpty. Operand 11337 states and 15999 transitions. [2018-10-23 18:53:53,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2018-10-23 18:53:53,511 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:53:53,512 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:53:53,512 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:53:53,512 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:53:53,513 INFO L82 PathProgramCache]: Analyzing trace with hash 949743912, now seen corresponding path program 1 times [2018-10-23 18:53:53,513 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:53:53,513 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:53:53,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:53:53,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:53:53,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:53:53,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:53:53,808 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 18:53:53,809 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:53:53,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:53:53,809 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:53:53,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:53:53,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:53:53,810 INFO L87 Difference]: Start difference. First operand 11337 states and 15999 transitions. Second operand 4 states. [2018-10-23 18:53:56,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:53:56,113 INFO L93 Difference]: Finished difference Result 41586 states and 58258 transitions. [2018-10-23 18:53:56,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:53:56,113 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 282 [2018-10-23 18:53:56,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:53:56,183 INFO L225 Difference]: With dead ends: 41586 [2018-10-23 18:53:56,183 INFO L226 Difference]: Without dead ends: 30251 [2018-10-23 18:53:56,204 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:53:56,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30251 states. [2018-10-23 18:53:56,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30251 to 21129. [2018-10-23 18:53:56,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21129 states. [2018-10-23 18:53:56,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21129 states to 21129 states and 28285 transitions. [2018-10-23 18:53:56,563 INFO L78 Accepts]: Start accepts. Automaton has 21129 states and 28285 transitions. Word has length 282 [2018-10-23 18:53:56,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:53:56,564 INFO L481 AbstractCegarLoop]: Abstraction has 21129 states and 28285 transitions. [2018-10-23 18:53:56,564 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:53:56,564 INFO L276 IsEmpty]: Start isEmpty. Operand 21129 states and 28285 transitions. [2018-10-23 18:53:56,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2018-10-23 18:53:56,594 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:53:56,594 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:53:56,594 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:53:56,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:53:56,595 INFO L82 PathProgramCache]: Analyzing trace with hash 1216779258, now seen corresponding path program 1 times [2018-10-23 18:53:56,595 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:53:56,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:53:56,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:53:56,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:53:56,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:53:56,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:53:56,746 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-10-23 18:53:56,747 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:53:56,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:53:56,747 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:53:56,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:53:56,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:53:56,748 INFO L87 Difference]: Start difference. First operand 21129 states and 28285 transitions. Second operand 3 states. [2018-10-23 18:53:58,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:53:58,540 INFO L93 Difference]: Finished difference Result 42264 states and 56582 transitions. [2018-10-23 18:53:58,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:53:58,548 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 289 [2018-10-23 18:53:58,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:53:58,596 INFO L225 Difference]: With dead ends: 42264 [2018-10-23 18:53:58,597 INFO L226 Difference]: Without dead ends: 21137 [2018-10-23 18:53:58,626 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:53:58,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21137 states. [2018-10-23 18:53:58,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21137 to 21129. [2018-10-23 18:53:58,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21129 states. [2018-10-23 18:53:58,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21129 states to 21129 states and 25984 transitions. [2018-10-23 18:53:58,931 INFO L78 Accepts]: Start accepts. Automaton has 21129 states and 25984 transitions. Word has length 289 [2018-10-23 18:53:58,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:53:58,931 INFO L481 AbstractCegarLoop]: Abstraction has 21129 states and 25984 transitions. [2018-10-23 18:53:58,932 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:53:58,933 INFO L276 IsEmpty]: Start isEmpty. Operand 21129 states and 25984 transitions. [2018-10-23 18:53:58,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2018-10-23 18:53:58,963 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:53:58,964 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:53:58,964 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:53:58,964 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:53:58,965 INFO L82 PathProgramCache]: Analyzing trace with hash 287123333, now seen corresponding path program 1 times [2018-10-23 18:53:58,965 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:53:58,965 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:53:58,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:53:58,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:53:58,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:53:58,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:53:59,257 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2018-10-23 18:53:59,257 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:53:59,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:53:59,258 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:53:59,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:53:59,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:53:59,259 INFO L87 Difference]: Start difference. First operand 21129 states and 25984 transitions. Second operand 4 states. [2018-10-23 18:54:00,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:54:00,670 INFO L93 Difference]: Finished difference Result 41848 states and 51444 transitions. [2018-10-23 18:54:00,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:54:00,670 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 306 [2018-10-23 18:54:00,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:54:00,696 INFO L225 Difference]: With dead ends: 41848 [2018-10-23 18:54:00,697 INFO L226 Difference]: Without dead ends: 20721 [2018-10-23 18:54:00,719 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:54:00,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20721 states. [2018-10-23 18:54:00,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20721 to 20721. [2018-10-23 18:54:00,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20721 states. [2018-10-23 18:54:00,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20721 states to 20721 states and 24096 transitions. [2018-10-23 18:54:00,976 INFO L78 Accepts]: Start accepts. Automaton has 20721 states and 24096 transitions. Word has length 306 [2018-10-23 18:54:00,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:54:00,976 INFO L481 AbstractCegarLoop]: Abstraction has 20721 states and 24096 transitions. [2018-10-23 18:54:00,976 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:54:00,977 INFO L276 IsEmpty]: Start isEmpty. Operand 20721 states and 24096 transitions. [2018-10-23 18:54:00,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2018-10-23 18:54:00,999 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:54:00,999 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:54:01,000 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:54:01,000 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:54:01,000 INFO L82 PathProgramCache]: Analyzing trace with hash 1928214112, now seen corresponding path program 1 times [2018-10-23 18:54:01,000 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:54:01,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:54:01,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:54:01,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:54:01,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:54:01,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:54:01,319 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2018-10-23 18:54:01,319 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:54:01,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:54:01,320 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:54:01,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:54:01,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:54:01,320 INFO L87 Difference]: Start difference. First operand 20721 states and 24096 transitions. Second operand 4 states. [2018-10-23 18:54:03,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:54:03,856 INFO L93 Difference]: Finished difference Result 81406 states and 94708 transitions. [2018-10-23 18:54:03,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:54:03,857 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 308 [2018-10-23 18:54:03,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:54:03,934 INFO L225 Difference]: With dead ends: 81406 [2018-10-23 18:54:03,934 INFO L226 Difference]: Without dead ends: 60687 [2018-10-23 18:54:03,958 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:54:04,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60687 states. [2018-10-23 18:54:04,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60687 to 60685. [2018-10-23 18:54:04,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60685 states. [2018-10-23 18:54:04,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60685 states to 60685 states and 70476 transitions. [2018-10-23 18:54:04,720 INFO L78 Accepts]: Start accepts. Automaton has 60685 states and 70476 transitions. Word has length 308 [2018-10-23 18:54:04,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:54:04,720 INFO L481 AbstractCegarLoop]: Abstraction has 60685 states and 70476 transitions. [2018-10-23 18:54:04,720 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:54:04,721 INFO L276 IsEmpty]: Start isEmpty. Operand 60685 states and 70476 transitions. [2018-10-23 18:54:04,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2018-10-23 18:54:04,751 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:54:04,751 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:54:04,752 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:54:04,752 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:54:04,752 INFO L82 PathProgramCache]: Analyzing trace with hash -458556812, now seen corresponding path program 1 times [2018-10-23 18:54:04,752 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:54:04,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:54:04,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:54:04,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:54:04,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:54:04,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:54:04,965 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2018-10-23 18:54:04,966 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:54:04,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:54:04,967 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:54:04,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:54:04,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:54:04,967 INFO L87 Difference]: Start difference. First operand 60685 states and 70476 transitions. Second operand 3 states. [2018-10-23 18:54:07,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:54:07,177 INFO L93 Difference]: Finished difference Result 165657 states and 191383 transitions. [2018-10-23 18:54:07,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:54:07,177 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 341 [2018-10-23 18:54:07,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:54:07,305 INFO L225 Difference]: With dead ends: 165657 [2018-10-23 18:54:07,305 INFO L226 Difference]: Without dead ends: 104974 [2018-10-23 18:54:07,347 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:54:07,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104974 states. [2018-10-23 18:54:08,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104974 to 104938. [2018-10-23 18:54:08,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104938 states. [2018-10-23 18:54:08,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104938 states to 104938 states and 118157 transitions. [2018-10-23 18:54:08,498 INFO L78 Accepts]: Start accepts. Automaton has 104938 states and 118157 transitions. Word has length 341 [2018-10-23 18:54:08,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:54:08,498 INFO L481 AbstractCegarLoop]: Abstraction has 104938 states and 118157 transitions. [2018-10-23 18:54:08,498 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:54:08,498 INFO L276 IsEmpty]: Start isEmpty. Operand 104938 states and 118157 transitions. [2018-10-23 18:54:08,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2018-10-23 18:54:08,517 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:54:08,517 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:54:08,518 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:54:08,518 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:54:08,518 INFO L82 PathProgramCache]: Analyzing trace with hash -1480618161, now seen corresponding path program 1 times [2018-10-23 18:54:08,518 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:54:08,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:54:08,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:54:08,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:54:08,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:54:08,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:54:08,726 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-10-23 18:54:08,726 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:54:08,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-23 18:54:08,727 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:54:08,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:54:08,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:54:08,728 INFO L87 Difference]: Start difference. First operand 104938 states and 118157 transitions. Second operand 3 states. [2018-10-23 18:54:11,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:54:11,229 INFO L93 Difference]: Finished difference Result 263416 states and 296388 transitions. [2018-10-23 18:54:11,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:54:11,230 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 342 [2018-10-23 18:54:11,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:54:11,423 INFO L225 Difference]: With dead ends: 263416 [2018-10-23 18:54:11,424 INFO L226 Difference]: Without dead ends: 158480 [2018-10-23 18:54:11,493 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:54:11,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158480 states. [2018-10-23 18:54:13,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158480 to 158462. [2018-10-23 18:54:13,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158462 states. [2018-10-23 18:54:13,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158462 states to 158462 states and 178052 transitions. [2018-10-23 18:54:13,328 INFO L78 Accepts]: Start accepts. Automaton has 158462 states and 178052 transitions. Word has length 342 [2018-10-23 18:54:13,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:54:13,328 INFO L481 AbstractCegarLoop]: Abstraction has 158462 states and 178052 transitions. [2018-10-23 18:54:13,328 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:54:13,328 INFO L276 IsEmpty]: Start isEmpty. Operand 158462 states and 178052 transitions. [2018-10-23 18:54:13,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2018-10-23 18:54:13,364 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:54:13,364 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:54:13,364 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:54:13,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:54:13,365 INFO L82 PathProgramCache]: Analyzing trace with hash 1211834363, now seen corresponding path program 1 times [2018-10-23 18:54:13,365 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:54:13,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:54:13,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:54:13,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:54:13,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:54:14,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:54:14,443 WARN L179 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-23 18:54:14,664 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 111 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-10-23 18:54:14,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 18:54:14,665 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-23 18:54:14,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:54:14,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:54:14,848 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 18:54:15,111 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-10-23 18:54:15,133 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-23 18:54:15,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2018-10-23 18:54:15,135 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-23 18:54:15,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-23 18:54:15,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-23 18:54:15,136 INFO L87 Difference]: Start difference. First operand 158462 states and 178052 transitions. Second operand 7 states. [2018-10-23 18:54:22,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:54:22,393 INFO L93 Difference]: Finished difference Result 490832 states and 552463 transitions. [2018-10-23 18:54:22,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-23 18:54:22,394 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 350 [2018-10-23 18:54:22,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:54:24,094 INFO L225 Difference]: With dead ends: 490832 [2018-10-23 18:54:24,095 INFO L226 Difference]: Without dead ends: 332366 [2018-10-23 18:54:24,227 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 348 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2018-10-23 18:54:24,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332366 states. [2018-10-23 18:54:28,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332366 to 331100. [2018-10-23 18:54:28,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331100 states. [2018-10-23 18:54:29,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331100 states to 331100 states and 362711 transitions. [2018-10-23 18:54:29,131 INFO L78 Accepts]: Start accepts. Automaton has 331100 states and 362711 transitions. Word has length 350 [2018-10-23 18:54:29,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:54:29,132 INFO L481 AbstractCegarLoop]: Abstraction has 331100 states and 362711 transitions. [2018-10-23 18:54:29,132 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-23 18:54:29,132 INFO L276 IsEmpty]: Start isEmpty. Operand 331100 states and 362711 transitions. [2018-10-23 18:54:29,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2018-10-23 18:54:29,192 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:54:29,193 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2018-10-23 18:54:29,193 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:54:29,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:54:29,193 INFO L82 PathProgramCache]: Analyzing trace with hash -1657524425, now seen corresponding path program 1 times [2018-10-23 18:54:29,194 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:54:29,194 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:54:29,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:54:29,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:54:29,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:54:29,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:54:29,850 WARN L179 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 12 [2018-10-23 18:54:30,328 WARN L179 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2018-10-23 18:54:30,553 INFO L134 CoverageAnalysis]: Checked inductivity of 439 backedges. 254 proven. 0 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2018-10-23 18:54:30,554 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:54:30,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-23 18:54:30,554 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-23 18:54:30,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-23 18:54:30,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-10-23 18:54:30,555 INFO L87 Difference]: Start difference. First operand 331100 states and 362711 transitions. Second operand 6 states. [2018-10-23 18:54:38,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:54:38,777 INFO L93 Difference]: Finished difference Result 1202642 states and 1309094 transitions. [2018-10-23 18:54:38,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-23 18:54:38,777 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 414 [2018-10-23 18:54:38,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:54:40,128 INFO L225 Difference]: With dead ends: 1202642 [2018-10-23 18:54:40,128 INFO L226 Difference]: Without dead ends: 871544 [2018-10-23 18:54:40,374 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-10-23 18:54:40,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871544 states. [2018-10-23 18:55:02,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871544 to 870676. [2018-10-23 18:55:02,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 870676 states. [2018-10-23 18:55:03,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870676 states to 870676 states and 944357 transitions. [2018-10-23 18:55:03,231 INFO L78 Accepts]: Start accepts. Automaton has 870676 states and 944357 transitions. Word has length 414 [2018-10-23 18:55:03,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:55:03,231 INFO L481 AbstractCegarLoop]: Abstraction has 870676 states and 944357 transitions. [2018-10-23 18:55:03,231 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-23 18:55:03,231 INFO L276 IsEmpty]: Start isEmpty. Operand 870676 states and 944357 transitions. [2018-10-23 18:55:03,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 417 [2018-10-23 18:55:03,315 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:55:03,315 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:55:03,315 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:55:03,315 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:55:03,316 INFO L82 PathProgramCache]: Analyzing trace with hash 1681683295, now seen corresponding path program 1 times [2018-10-23 18:55:03,316 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:55:03,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:55:03,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:55:03,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:55:03,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:55:03,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:55:03,864 WARN L179 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 8 [2018-10-23 18:55:04,075 INFO L134 CoverageAnalysis]: Checked inductivity of 501 backedges. 256 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2018-10-23 18:55:04,076 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:55:04,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-23 18:55:04,077 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-23 18:55:04,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-23 18:55:04,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-23 18:55:04,077 INFO L87 Difference]: Start difference. First operand 870676 states and 944357 transitions. Second operand 5 states. [2018-10-23 18:55:28,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:55:28,829 INFO L93 Difference]: Finished difference Result 2249398 states and 2431434 transitions. [2018-10-23 18:55:28,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-23 18:55:28,829 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 416 [2018-10-23 18:55:28,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:55:30,886 INFO L225 Difference]: With dead ends: 2249398 [2018-10-23 18:55:30,886 INFO L226 Difference]: Without dead ends: 1378724 [2018-10-23 18:55:31,278 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-23 18:55:32,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1378724 states. [2018-10-23 18:55:50,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1378724 to 1269242. [2018-10-23 18:55:50,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1269242 states. [2018-10-23 18:55:55,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1269242 states to 1269242 states and 1370861 transitions. [2018-10-23 18:55:55,145 INFO L78 Accepts]: Start accepts. Automaton has 1269242 states and 1370861 transitions. Word has length 416 [2018-10-23 18:55:55,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:55:55,145 INFO L481 AbstractCegarLoop]: Abstraction has 1269242 states and 1370861 transitions. [2018-10-23 18:55:55,145 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-23 18:55:55,145 INFO L276 IsEmpty]: Start isEmpty. Operand 1269242 states and 1370861 transitions. [2018-10-23 18:55:55,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 453 [2018-10-23 18:55:55,312 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:55:55,313 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2018-10-23 18:55:55,313 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:55:55,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:55:55,313 INFO L82 PathProgramCache]: Analyzing trace with hash 893198241, now seen corresponding path program 1 times [2018-10-23 18:55:55,313 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:55:55,313 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:55:55,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:55:55,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:55:55,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:55:55,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:55:55,796 INFO L134 CoverageAnalysis]: Checked inductivity of 550 backedges. 245 proven. 0 refuted. 0 times theorem prover too weak. 305 trivial. 0 not checked. [2018-10-23 18:55:55,796 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:55:55,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:55:55,797 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:55:55,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:55:55,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:55:55,798 INFO L87 Difference]: Start difference. First operand 1269242 states and 1370861 transitions. Second operand 4 states. [2018-10-23 18:56:25,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:56:25,359 INFO L93 Difference]: Finished difference Result 3659012 states and 3938065 transitions. [2018-10-23 18:56:25,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:56:25,360 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 452 [2018-10-23 18:56:25,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:56:30,752 INFO L225 Difference]: With dead ends: 3659012 [2018-10-23 18:56:30,752 INFO L226 Difference]: Without dead ends: 2389772 [2018-10-23 18:56:31,362 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:56:32,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2389772 states. Received shutdown request... [2018-10-23 18:56:44,454 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-23 18:56:44,458 WARN L205 ceAbstractionStarter]: Timeout [2018-10-23 18:56:44,458 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.10 06:56:44 BoogieIcfgContainer [2018-10-23 18:56:44,458 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-23 18:56:44,459 INFO L168 Benchmark]: Toolchain (without parser) took 199821.96 ms. Allocated memory was 1.5 GB in the beginning and 6.9 GB in the end (delta: 5.3 GB). Free memory was 1.4 GB in the beginning and 2.5 GB in the end (delta: -1.1 GB). Peak memory consumption was 5.6 GB. Max. memory is 7.1 GB. [2018-10-23 18:56:44,461 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-23 18:56:44,461 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1141.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-23 18:56:44,462 INFO L168 Benchmark]: Boogie Procedure Inliner took 320.84 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 772.8 MB). Free memory was 1.3 GB in the beginning and 2.3 GB in the end (delta: -904.4 MB). Peak memory consumption was 40.2 MB. Max. memory is 7.1 GB. [2018-10-23 18:56:44,466 INFO L168 Benchmark]: Boogie Preprocessor took 125.66 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 7.1 GB. [2018-10-23 18:56:44,466 INFO L168 Benchmark]: RCFGBuilder took 5584.05 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 254.8 MB). Peak memory consumption was 254.8 MB. Max. memory is 7.1 GB. [2018-10-23 18:56:44,468 INFO L168 Benchmark]: TraceAbstraction took 192643.12 ms. Allocated memory was 2.3 GB in the beginning and 6.9 GB in the end (delta: 4.5 GB). Free memory was 2.0 GB in the beginning and 2.5 GB in the end (delta: -533.1 MB). Peak memory consumption was 5.4 GB. Max. memory is 7.1 GB. [2018-10-23 18:56:44,475 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.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1141.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 320.84 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 772.8 MB). Free memory was 1.3 GB in the beginning and 2.3 GB in the end (delta: -904.4 MB). Peak memory consumption was 40.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 125.66 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 5584.05 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 254.8 MB). Peak memory consumption was 254.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 192643.12 ms. Allocated memory was 2.3 GB in the beginning and 6.9 GB in the end (delta: 4.5 GB). Free memory was 2.0 GB in the beginning and 2.5 GB in the end (delta: -533.1 MB). Peak memory consumption was 5.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1641]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1641). Cancelled while executing MinimizeSevpa. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 303 locations, 1 error locations. TIMEOUT Result, 192.5s OverallTime, 17 OverallIterations, 7 TraceHistogramMax, 112.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4397 SDtfs, 12994 SDslu, 4755 SDs, 0 SdLazy, 17193 SolverSat, 3636 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 45.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 692 GetRequests, 646 SyntacticMatches, 8 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 3.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1269242occurred in iteration=16, 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: 70.0s AutomataMinimizationTime, 17 MinimizatonAttempts, 124497 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 5.5s InterpolantComputationTime, 5805 NumberOfCodeBlocks, 5805 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 5786 ConstructedInterpolants, 0 QuantifiedInterpolants, 3106999 SizeOfPredicates, 7 NumberOfNonLiveVariables, 1158 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 19 InterpolantComputations, 17 PerfectInterpolantSequences, 3483/3497 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown