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/Problem11_label24_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-0fd1304 [2018-10-23 20:00:48,784 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-23 20:00:48,786 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-23 20:00:48,798 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-23 20:00:48,798 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-23 20:00:48,800 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-23 20:00:48,801 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-23 20:00:48,803 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-23 20:00:48,804 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-23 20:00:48,805 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-23 20:00:48,806 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-23 20:00:48,807 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-23 20:00:48,808 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-23 20:00:48,809 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-23 20:00:48,810 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-23 20:00:48,811 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-23 20:00:48,812 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-23 20:00:48,814 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-23 20:00:48,816 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-23 20:00:48,817 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-23 20:00:48,819 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-23 20:00:48,820 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-23 20:00:48,823 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-23 20:00:48,823 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-23 20:00:48,823 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-23 20:00:48,824 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-23 20:00:48,825 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-23 20:00:48,826 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-23 20:00:48,827 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-23 20:00:48,828 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-23 20:00:48,828 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-23 20:00:48,829 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-23 20:00:48,829 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-23 20:00:48,830 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-23 20:00:48,831 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-23 20:00:48,831 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-23 20:00:48,832 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 20:00:48,848 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-23 20:00:48,849 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-23 20:00:48,849 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-23 20:00:48,850 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-23 20:00:48,850 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-23 20:00:48,851 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-23 20:00:48,851 INFO L133 SettingsManager]: * Use SBE=true [2018-10-23 20:00:48,851 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-23 20:00:48,851 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-23 20:00:48,851 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-23 20:00:48,852 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-23 20:00:48,852 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-23 20:00:48,852 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-23 20:00:48,852 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-23 20:00:48,852 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-23 20:00:48,853 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-23 20:00:48,853 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-23 20:00:48,853 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-23 20:00:48,853 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-23 20:00:48,853 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-23 20:00:48,854 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-23 20:00:48,854 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-23 20:00:48,854 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-23 20:00:48,854 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-23 20:00:48,855 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-23 20:00:48,855 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-23 20:00:48,855 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-23 20:00:48,855 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-23 20:00:48,899 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-23 20:00:48,912 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-23 20:00:48,917 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-23 20:00:48,919 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-23 20:00:48,919 INFO L276 PluginConnector]: CDTParser initialized [2018-10-23 20:00:48,920 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem11_label24_true-unreach-call.c [2018-10-23 20:00:48,989 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/7bbbbce49/f438e25b137045cb98d4823c3fc9bd7e/FLAG44c6cb646 [2018-10-23 20:00:49,629 INFO L298 CDTParser]: Found 1 translation units. [2018-10-23 20:00:49,630 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem11_label24_true-unreach-call.c [2018-10-23 20:00:49,655 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/7bbbbce49/f438e25b137045cb98d4823c3fc9bd7e/FLAG44c6cb646 [2018-10-23 20:00:49,677 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/7bbbbce49/f438e25b137045cb98d4823c3fc9bd7e [2018-10-23 20:00:49,691 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-23 20:00:49,693 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-23 20:00:49,697 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-23 20:00:49,697 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-23 20:00:49,701 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-23 20:00:49,702 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 08:00:49" (1/1) ... [2018-10-23 20:00:49,706 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12b8561a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:00:49, skipping insertion in model container [2018-10-23 20:00:49,707 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 08:00:49" (1/1) ... [2018-10-23 20:00:49,718 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-23 20:00:49,809 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-23 20:00:50,550 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-23 20:00:50,555 INFO L189 MainTranslator]: Completed pre-run [2018-10-23 20:00:50,787 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-23 20:00:50,809 INFO L193 MainTranslator]: Completed translation [2018-10-23 20:00:50,810 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:00:50 WrapperNode [2018-10-23 20:00:50,810 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-23 20:00:50,814 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-23 20:00:50,814 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-23 20:00:50,815 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-23 20:00:50,825 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:00:50" (1/1) ... [2018-10-23 20:00:50,853 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:00:50" (1/1) ... [2018-10-23 20:00:51,096 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-23 20:00:51,097 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-23 20:00:51,097 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-23 20:00:51,097 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-23 20:00:51,109 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:00:50" (1/1) ... [2018-10-23 20:00:51,109 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:00:50" (1/1) ... [2018-10-23 20:00:51,118 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:00:50" (1/1) ... [2018-10-23 20:00:51,119 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:00:50" (1/1) ... [2018-10-23 20:00:51,163 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:00:50" (1/1) ... [2018-10-23 20:00:51,185 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:00:50" (1/1) ... [2018-10-23 20:00:51,212 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:00:50" (1/1) ... [2018-10-23 20:00:51,226 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-23 20:00:51,227 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-23 20:00:51,227 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-23 20:00:51,227 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-23 20:00:51,228 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:00:50" (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 20:00:51,286 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-23 20:00:51,286 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-23 20:00:51,286 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-23 20:00:56,695 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-23 20:00:56,698 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 08:00:56 BoogieIcfgContainer [2018-10-23 20:00:56,698 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-23 20:00:56,699 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-23 20:00:56,699 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-23 20:00:56,703 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-23 20:00:56,703 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.10 08:00:49" (1/3) ... [2018-10-23 20:00:56,704 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5590edd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 08:00:56, skipping insertion in model container [2018-10-23 20:00:56,704 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:00:50" (2/3) ... [2018-10-23 20:00:56,705 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5590edd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 08:00:56, skipping insertion in model container [2018-10-23 20:00:56,705 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 08:00:56" (3/3) ... [2018-10-23 20:00:56,707 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label24_true-unreach-call.c [2018-10-23 20:00:56,717 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-23 20:00:56,730 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-23 20:00:56,750 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-23 20:00:56,800 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-23 20:00:56,801 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-23 20:00:56,801 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-23 20:00:56,802 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-23 20:00:56,802 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-23 20:00:56,802 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-23 20:00:56,802 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-23 20:00:56,803 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-23 20:00:56,803 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-23 20:00:56,837 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states. [2018-10-23 20:00:56,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-10-23 20:00:56,851 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:00:56,853 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 20:00:56,855 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:00:56,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:00:56,863 INFO L82 PathProgramCache]: Analyzing trace with hash -2139005982, now seen corresponding path program 1 times [2018-10-23 20:00:56,865 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:00:56,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:00:56,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:00:56,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:00:56,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:00:57,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:00:57,354 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 6 DAG size of output: 3 [2018-10-23 20:00:57,376 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 20:00:57,381 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 20:00:57,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 20:00:57,388 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 20:00:57,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 20:00:57,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 20:00:57,408 INFO L87 Difference]: Start difference. First operand 284 states. Second operand 4 states. [2018-10-23 20:01:00,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:01:00,667 INFO L93 Difference]: Finished difference Result 958 states and 1725 transitions. [2018-10-23 20:01:00,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 20:01:00,669 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2018-10-23 20:01:00,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:01:00,717 INFO L225 Difference]: With dead ends: 958 [2018-10-23 20:01:00,718 INFO L226 Difference]: Without dead ends: 667 [2018-10-23 20:01:00,727 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 20:01:00,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2018-10-23 20:01:00,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 667. [2018-10-23 20:01:00,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 667 states. [2018-10-23 20:01:00,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 983 transitions. [2018-10-23 20:01:00,863 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 983 transitions. Word has length 52 [2018-10-23 20:01:00,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:01:00,864 INFO L481 AbstractCegarLoop]: Abstraction has 667 states and 983 transitions. [2018-10-23 20:01:00,864 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 20:01:00,864 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 983 transitions. [2018-10-23 20:01:00,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-10-23 20:01:00,874 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:01:00,874 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, 1, 1, 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 20:01:00,875 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:01:00,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:01:00,875 INFO L82 PathProgramCache]: Analyzing trace with hash 1246407004, now seen corresponding path program 1 times [2018-10-23 20:01:00,876 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:01:00,876 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:01:00,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:01:00,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:01:00,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:01:00,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:01:01,284 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 20:01:01,285 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 20:01:01,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-23 20:01:01,287 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-23 20:01:01,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-23 20:01:01,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-23 20:01:01,288 INFO L87 Difference]: Start difference. First operand 667 states and 983 transitions. Second operand 5 states. [2018-10-23 20:01:06,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:01:06,910 INFO L93 Difference]: Finished difference Result 2465 states and 3702 transitions. [2018-10-23 20:01:06,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-23 20:01:06,911 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 122 [2018-10-23 20:01:06,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:01:06,922 INFO L225 Difference]: With dead ends: 2465 [2018-10-23 20:01:06,922 INFO L226 Difference]: Without dead ends: 1800 [2018-10-23 20:01:06,926 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-23 20:01:06,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1800 states. [2018-10-23 20:01:06,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1800 to 1795. [2018-10-23 20:01:06,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1795 states. [2018-10-23 20:01:06,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1795 states to 1795 states and 2358 transitions. [2018-10-23 20:01:06,974 INFO L78 Accepts]: Start accepts. Automaton has 1795 states and 2358 transitions. Word has length 122 [2018-10-23 20:01:06,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:01:06,975 INFO L481 AbstractCegarLoop]: Abstraction has 1795 states and 2358 transitions. [2018-10-23 20:01:06,975 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-23 20:01:06,975 INFO L276 IsEmpty]: Start isEmpty. Operand 1795 states and 2358 transitions. [2018-10-23 20:01:06,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-10-23 20:01:06,981 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:01:06,981 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:01:06,981 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:01:06,982 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:01:06,982 INFO L82 PathProgramCache]: Analyzing trace with hash -2005591657, now seen corresponding path program 1 times [2018-10-23 20:01:06,982 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:01:06,982 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:01:06,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:01:06,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:01:06,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:01:07,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:01:07,255 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 20:01:07,256 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 20:01:07,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-23 20:01:07,256 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 20:01:07,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 20:01:07,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 20:01:07,258 INFO L87 Difference]: Start difference. First operand 1795 states and 2358 transitions. Second operand 4 states. [2018-10-23 20:01:09,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:01:09,817 INFO L93 Difference]: Finished difference Result 5096 states and 6939 transitions. [2018-10-23 20:01:09,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 20:01:09,818 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 180 [2018-10-23 20:01:09,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:01:09,833 INFO L225 Difference]: With dead ends: 5096 [2018-10-23 20:01:09,834 INFO L226 Difference]: Without dead ends: 2931 [2018-10-23 20:01:09,837 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 20:01:09,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2931 states. [2018-10-23 20:01:09,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2931 to 2349. [2018-10-23 20:01:09,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2349 states. [2018-10-23 20:01:09,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2349 states to 2349 states and 3022 transitions. [2018-10-23 20:01:09,889 INFO L78 Accepts]: Start accepts. Automaton has 2349 states and 3022 transitions. Word has length 180 [2018-10-23 20:01:09,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:01:09,890 INFO L481 AbstractCegarLoop]: Abstraction has 2349 states and 3022 transitions. [2018-10-23 20:01:09,890 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 20:01:09,890 INFO L276 IsEmpty]: Start isEmpty. Operand 2349 states and 3022 transitions. [2018-10-23 20:01:09,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-10-23 20:01:09,894 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:01:09,894 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-23 20:01:09,894 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:01:09,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:01:09,895 INFO L82 PathProgramCache]: Analyzing trace with hash 321074286, now seen corresponding path program 1 times [2018-10-23 20:01:09,895 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:01:09,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:01:09,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:01:09,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:01:09,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:01:09,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:01:10,180 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-10-23 20:01:10,180 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 20:01:10,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 20:01:10,181 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 20:01:10,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 20:01:10,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 20:01:10,182 INFO L87 Difference]: Start difference. First operand 2349 states and 3022 transitions. Second operand 4 states. [2018-10-23 20:01:15,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:01:15,019 INFO L93 Difference]: Finished difference Result 8597 states and 11197 transitions. [2018-10-23 20:01:15,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 20:01:15,019 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 198 [2018-10-23 20:01:15,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:01:15,048 INFO L225 Difference]: With dead ends: 8597 [2018-10-23 20:01:15,049 INFO L226 Difference]: Without dead ends: 6250 [2018-10-23 20:01:15,053 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 20:01:15,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6250 states. [2018-10-23 20:01:15,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6250 to 6233. [2018-10-23 20:01:15,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6233 states. [2018-10-23 20:01:15,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6233 states to 6233 states and 7686 transitions. [2018-10-23 20:01:15,173 INFO L78 Accepts]: Start accepts. Automaton has 6233 states and 7686 transitions. Word has length 198 [2018-10-23 20:01:15,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:01:15,174 INFO L481 AbstractCegarLoop]: Abstraction has 6233 states and 7686 transitions. [2018-10-23 20:01:15,174 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 20:01:15,174 INFO L276 IsEmpty]: Start isEmpty. Operand 6233 states and 7686 transitions. [2018-10-23 20:01:15,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-10-23 20:01:15,179 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:01:15,180 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:01:15,180 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:01:15,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:01:15,180 INFO L82 PathProgramCache]: Analyzing trace with hash 290347242, now seen corresponding path program 1 times [2018-10-23 20:01:15,181 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:01:15,181 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:01:15,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:01:15,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:01:15,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:01:15,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:01:15,633 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-10-23 20:01:15,633 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 20:01:15,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-23 20:01:15,634 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 20:01:15,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 20:01:15,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 20:01:15,636 INFO L87 Difference]: Start difference. First operand 6233 states and 7686 transitions. Second operand 4 states. [2018-10-23 20:01:18,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:01:18,655 INFO L93 Difference]: Finished difference Result 13956 states and 17375 transitions. [2018-10-23 20:01:18,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 20:01:18,656 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 242 [2018-10-23 20:01:18,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:01:18,688 INFO L225 Difference]: With dead ends: 13956 [2018-10-23 20:01:18,688 INFO L226 Difference]: Without dead ends: 7910 [2018-10-23 20:01:18,697 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 20:01:18,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7910 states. [2018-10-23 20:01:18,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7910 to 7525. [2018-10-23 20:01:18,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7525 states. [2018-10-23 20:01:18,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7525 states to 7525 states and 9053 transitions. [2018-10-23 20:01:18,838 INFO L78 Accepts]: Start accepts. Automaton has 7525 states and 9053 transitions. Word has length 242 [2018-10-23 20:01:18,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:01:18,839 INFO L481 AbstractCegarLoop]: Abstraction has 7525 states and 9053 transitions. [2018-10-23 20:01:18,839 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 20:01:18,839 INFO L276 IsEmpty]: Start isEmpty. Operand 7525 states and 9053 transitions. [2018-10-23 20:01:18,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-10-23 20:01:18,845 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:01:18,846 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-23 20:01:18,846 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:01:18,846 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:01:18,847 INFO L82 PathProgramCache]: Analyzing trace with hash -1874412645, now seen corresponding path program 1 times [2018-10-23 20:01:18,847 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:01:18,847 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:01:18,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:01:18,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:01:18,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:01:18,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:01:19,340 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 164 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 20:01:19,340 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 20:01:19,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-23 20:01:19,341 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-23 20:01:19,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-23 20:01:19,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-23 20:01:19,342 INFO L87 Difference]: Start difference. First operand 7525 states and 9053 transitions. Second operand 5 states. [2018-10-23 20:01:22,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:01:22,898 INFO L93 Difference]: Finished difference Result 25449 states and 31389 transitions. [2018-10-23 20:01:22,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-23 20:01:22,899 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 246 [2018-10-23 20:01:22,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:01:22,951 INFO L225 Difference]: With dead ends: 25449 [2018-10-23 20:01:22,951 INFO L226 Difference]: Without dead ends: 17926 [2018-10-23 20:01:22,961 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-23 20:01:22,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17926 states. [2018-10-23 20:01:23,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17926 to 14387. [2018-10-23 20:01:23,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14387 states. [2018-10-23 20:01:23,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14387 states to 14387 states and 17124 transitions. [2018-10-23 20:01:23,224 INFO L78 Accepts]: Start accepts. Automaton has 14387 states and 17124 transitions. Word has length 246 [2018-10-23 20:01:23,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:01:23,225 INFO L481 AbstractCegarLoop]: Abstraction has 14387 states and 17124 transitions. [2018-10-23 20:01:23,225 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-23 20:01:23,225 INFO L276 IsEmpty]: Start isEmpty. Operand 14387 states and 17124 transitions. [2018-10-23 20:01:23,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2018-10-23 20:01:23,240 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:01:23,240 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:01:23,240 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:01:23,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:01:23,241 INFO L82 PathProgramCache]: Analyzing trace with hash -627399339, now seen corresponding path program 1 times [2018-10-23 20:01:23,241 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:01:23,241 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:01:23,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:01:23,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:01:23,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:01:23,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:01:23,804 WARN L179 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-10-23 20:01:24,138 WARN L179 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 9 [2018-10-23 20:01:24,234 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 288 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2018-10-23 20:01:24,235 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 20:01:24,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-23 20:01:24,236 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-23 20:01:24,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-23 20:01:24,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-23 20:01:24,237 INFO L87 Difference]: Start difference. First operand 14387 states and 17124 transitions. Second operand 5 states. [2018-10-23 20:01:27,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:01:27,363 INFO L93 Difference]: Finished difference Result 30467 states and 36412 transitions. [2018-10-23 20:01:27,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-23 20:01:27,367 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 318 [2018-10-23 20:01:27,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:01:27,399 INFO L225 Difference]: With dead ends: 30467 [2018-10-23 20:01:27,399 INFO L226 Difference]: Without dead ends: 16452 [2018-10-23 20:01:27,413 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-23 20:01:27,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16452 states. [2018-10-23 20:01:27,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16452 to 15875. [2018-10-23 20:01:27,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15875 states. [2018-10-23 20:01:27,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15875 states to 15875 states and 18796 transitions. [2018-10-23 20:01:27,632 INFO L78 Accepts]: Start accepts. Automaton has 15875 states and 18796 transitions. Word has length 318 [2018-10-23 20:01:27,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:01:27,633 INFO L481 AbstractCegarLoop]: Abstraction has 15875 states and 18796 transitions. [2018-10-23 20:01:27,633 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-23 20:01:27,633 INFO L276 IsEmpty]: Start isEmpty. Operand 15875 states and 18796 transitions. [2018-10-23 20:01:27,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2018-10-23 20:01:27,651 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:01:27,651 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:01:27,651 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:01:27,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:01:27,652 INFO L82 PathProgramCache]: Analyzing trace with hash 898359251, now seen corresponding path program 1 times [2018-10-23 20:01:27,652 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:01:27,652 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:01:27,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:01:27,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:01:27,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:01:27,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:01:28,149 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2018-10-23 20:01:28,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 20:01:28,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-23 20:01:28,150 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 20:01:28,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 20:01:28,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 20:01:28,151 INFO L87 Difference]: Start difference. First operand 15875 states and 18796 transitions. Second operand 3 states. [2018-10-23 20:01:29,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:01:29,424 INFO L93 Difference]: Finished difference Result 31187 states and 36993 transitions. [2018-10-23 20:01:29,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 20:01:29,424 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 336 [2018-10-23 20:01:29,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:01:29,451 INFO L225 Difference]: With dead ends: 31187 [2018-10-23 20:01:29,452 INFO L226 Difference]: Without dead ends: 15684 [2018-10-23 20:01:29,466 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 20:01:29,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15684 states. [2018-10-23 20:01:29,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15684 to 15683. [2018-10-23 20:01:29,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15683 states. [2018-10-23 20:01:29,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15683 states to 15683 states and 18573 transitions. [2018-10-23 20:01:29,649 INFO L78 Accepts]: Start accepts. Automaton has 15683 states and 18573 transitions. Word has length 336 [2018-10-23 20:01:29,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:01:29,649 INFO L481 AbstractCegarLoop]: Abstraction has 15683 states and 18573 transitions. [2018-10-23 20:01:29,650 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 20:01:29,650 INFO L276 IsEmpty]: Start isEmpty. Operand 15683 states and 18573 transitions. [2018-10-23 20:01:29,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2018-10-23 20:01:29,671 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:01:29,671 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 20:01:29,671 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:01:29,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:01:29,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1154552847, now seen corresponding path program 1 times [2018-10-23 20:01:29,672 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:01:29,672 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:01:29,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:01:29,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:01:29,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:01:29,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:01:30,270 INFO L134 CoverageAnalysis]: Checked inductivity of 426 backedges. 294 proven. 82 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-10-23 20:01:30,271 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 20:01:30,271 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 20:01:30,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:01:30,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:01:30,491 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 20:01:30,887 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 21 [2018-10-23 20:01:31,656 INFO L134 CoverageAnalysis]: Checked inductivity of 426 backedges. 344 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2018-10-23 20:01:31,694 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-23 20:01:31,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2018-10-23 20:01:31,697 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-23 20:01:31,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-23 20:01:31,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-23 20:01:31,698 INFO L87 Difference]: Start difference. First operand 15683 states and 18573 transitions. Second operand 7 states. [2018-10-23 20:01:31,881 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-10-23 20:01:51,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:01:51,299 INFO L93 Difference]: Finished difference Result 45875 states and 55314 transitions. [2018-10-23 20:01:51,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-23 20:01:51,300 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 366 [2018-10-23 20:01:51,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:01:51,353 INFO L225 Difference]: With dead ends: 45875 [2018-10-23 20:01:51,353 INFO L226 Difference]: Without dead ends: 30564 [2018-10-23 20:01:51,372 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 364 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2018-10-23 20:01:51,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30564 states. [2018-10-23 20:01:51,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30564 to 25147. [2018-10-23 20:01:51,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25147 states. [2018-10-23 20:01:51,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25147 states to 25147 states and 29085 transitions. [2018-10-23 20:01:51,812 INFO L78 Accepts]: Start accepts. Automaton has 25147 states and 29085 transitions. Word has length 366 [2018-10-23 20:01:51,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:01:51,812 INFO L481 AbstractCegarLoop]: Abstraction has 25147 states and 29085 transitions. [2018-10-23 20:01:51,812 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-23 20:01:51,813 INFO L276 IsEmpty]: Start isEmpty. Operand 25147 states and 29085 transitions. [2018-10-23 20:01:51,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 414 [2018-10-23 20:01:51,849 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:01:51,850 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, 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, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 20:01:51,850 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:01:51,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:01:51,852 INFO L82 PathProgramCache]: Analyzing trace with hash -756777930, now seen corresponding path program 1 times [2018-10-23 20:01:51,852 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:01:51,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:01:51,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:01:51,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:01:51,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:01:51,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:01:52,418 WARN L179 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-10-23 20:01:52,519 INFO L134 CoverageAnalysis]: Checked inductivity of 661 backedges. 491 proven. 0 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2018-10-23 20:01:52,519 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 20:01:52,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-23 20:01:52,520 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 20:01:52,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 20:01:52,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 20:01:52,521 INFO L87 Difference]: Start difference. First operand 25147 states and 29085 transitions. Second operand 4 states. [2018-10-23 20:01:56,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:01:56,561 INFO L93 Difference]: Finished difference Result 53830 states and 62428 transitions. [2018-10-23 20:01:56,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 20:01:56,562 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 413 [2018-10-23 20:01:56,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:01:56,596 INFO L225 Difference]: With dead ends: 53830 [2018-10-23 20:01:56,597 INFO L226 Difference]: Without dead ends: 29055 [2018-10-23 20:01:56,614 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 20:01:56,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29055 states. [2018-10-23 20:01:56,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29055 to 27913. [2018-10-23 20:01:56,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27913 states. [2018-10-23 20:01:56,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27913 states to 27913 states and 31920 transitions. [2018-10-23 20:01:56,951 INFO L78 Accepts]: Start accepts. Automaton has 27913 states and 31920 transitions. Word has length 413 [2018-10-23 20:01:56,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:01:56,952 INFO L481 AbstractCegarLoop]: Abstraction has 27913 states and 31920 transitions. [2018-10-23 20:01:56,952 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 20:01:56,952 INFO L276 IsEmpty]: Start isEmpty. Operand 27913 states and 31920 transitions. [2018-10-23 20:01:56,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 419 [2018-10-23 20:01:56,991 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:01:56,991 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 20:01:56,992 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:01:56,992 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:01:56,992 INFO L82 PathProgramCache]: Analyzing trace with hash 74215194, now seen corresponding path program 1 times [2018-10-23 20:01:56,992 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:01:56,992 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:01:56,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:01:56,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:01:56,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:01:57,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:01:57,613 INFO L134 CoverageAnalysis]: Checked inductivity of 503 backedges. 334 proven. 119 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-10-23 20:01:57,613 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 20:01:57,614 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 20:01:57,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:01:57,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:01:57,751 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 20:01:58,020 INFO L134 CoverageAnalysis]: Checked inductivity of 503 backedges. 334 proven. 119 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-10-23 20:01:58,060 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-23 20:01:58,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 4 [2018-10-23 20:01:58,062 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-23 20:01:58,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-23 20:01:58,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-23 20:01:58,063 INFO L87 Difference]: Start difference. First operand 27913 states and 31920 transitions. Second operand 5 states. [2018-10-23 20:02:02,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:02:02,292 INFO L93 Difference]: Finished difference Result 60850 states and 69696 transitions. [2018-10-23 20:02:02,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-23 20:02:02,292 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 418 [2018-10-23 20:02:02,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:02:02,331 INFO L225 Difference]: With dead ends: 60850 [2018-10-23 20:02:02,331 INFO L226 Difference]: Without dead ends: 34789 [2018-10-23 20:02:02,344 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 417 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-23 20:02:02,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34789 states. [2018-10-23 20:02:02,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34789 to 29948. [2018-10-23 20:02:02,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29948 states. [2018-10-23 20:02:02,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29948 states to 29948 states and 34227 transitions. [2018-10-23 20:02:02,730 INFO L78 Accepts]: Start accepts. Automaton has 29948 states and 34227 transitions. Word has length 418 [2018-10-23 20:02:02,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:02:02,731 INFO L481 AbstractCegarLoop]: Abstraction has 29948 states and 34227 transitions. [2018-10-23 20:02:02,731 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-23 20:02:02,731 INFO L276 IsEmpty]: Start isEmpty. Operand 29948 states and 34227 transitions. [2018-10-23 20:02:02,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 428 [2018-10-23 20:02:02,765 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:02:02,765 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:02:02,766 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:02:02,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:02:02,766 INFO L82 PathProgramCache]: Analyzing trace with hash -1132935567, now seen corresponding path program 1 times [2018-10-23 20:02:02,766 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:02:02,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:02:02,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:02:02,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:02:02,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:02:02,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:02:03,646 INFO L134 CoverageAnalysis]: Checked inductivity of 671 backedges. 440 proven. 181 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-10-23 20:02:03,646 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 20:02:03,647 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-23 20:02:03,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:02:03,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:02:03,797 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 20:02:06,058 WARN L832 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_56 Int)) (let ((.cse0 (* 3 v_prenex_56))) (let ((.cse1 (div (+ .cse0 (- 554771)) 5))) (let ((.cse2 (+ .cse1 25349))) (and (<= v_prenex_56 245) (= 0 (mod (+ .cse0 4) 5)) (<= 0 (+ .cse1 25350)) (<= (+ (div .cse2 5) 110879) c_~a29~0) (<= 0 .cse2) (< 140 v_prenex_56)))))) (exists ((v_prenex_50 Int)) (let ((.cse5 (* 3 v_prenex_50))) (let ((.cse4 (div (+ .cse5 (- 554771)) 5))) (let ((.cse3 (+ .cse4 25349))) (and (<= (+ (div .cse3 5) 110880) c_~a29~0) (<= 0 (+ .cse4 25350)) (<= v_prenex_50 245) (< 140 v_prenex_50) (not (= (mod (+ .cse4 4) 5) 0)) (< .cse3 0) (<= 554771 .cse5)))))) (exists ((v_prenex_18 Int)) (let ((.cse7 (* 3 v_prenex_18))) (let ((.cse8 (div (+ .cse7 (- 554771)) 5))) (let ((.cse6 (+ .cse8 25350))) (and (<= (+ (div .cse6 5) 110879) c_~a29~0) (< .cse7 554771) (<= 0 .cse6) (not (= (mod (+ .cse7 4) 5) 0)) (<= v_prenex_18 245) (= (mod (+ .cse8 4) 5) 0) (< 140 v_prenex_18)))))) (exists ((v_prenex_12 Int)) (let ((.cse10 (* 3 v_prenex_12))) (let ((.cse9 (div (+ .cse10 (- 554771)) 5))) (let ((.cse11 (+ .cse9 25350))) (and (< 140 v_prenex_12) (not (= 0 (mod .cse9 5))) (< .cse10 554771) (<= v_prenex_12 245) (not (= (mod (+ .cse9 4) 5) 0)) (< .cse11 0) (not (= (mod (+ .cse10 4) 5) 0)) (<= (+ (div .cse11 5) 110880) c_~a29~0) (< (+ .cse9 25349) 0)))))) (exists ((v_prenex_26 Int)) (let ((.cse14 (* 3 v_prenex_26))) (let ((.cse12 (div (+ .cse14 (- 554771)) 5))) (let ((.cse13 (+ .cse12 25349))) (and (not (= 0 (mod (+ .cse12 4) 5))) (< .cse13 0) (<= (+ (div .cse13 5) 110880) c_~a29~0) (< 140 v_prenex_26) (= 0 (mod (+ .cse14 4) 5)) (<= v_prenex_26 245) (<= 0 (+ .cse12 25350))))))) (exists ((v_prenex_8 Int)) (let ((.cse15 (* 3 v_prenex_8))) (let ((.cse16 (div (+ .cse15 (- 554771)) 5))) (and (< 140 v_prenex_8) (= 0 (mod (+ .cse15 4) 5)) (<= 0 (+ .cse16 25350)) (= (mod (+ .cse16 4) 5) 0) (<= v_prenex_8 245) (<= (+ (div (+ .cse16 25349) 5) 110879) c_~a29~0))))) (exists ((v_prenex_24 Int)) (let ((.cse18 (* 3 v_prenex_24))) (let ((.cse17 (div (+ .cse18 (- 554771)) 5))) (and (< 140 v_prenex_24) (<= v_prenex_24 245) (not (= (mod .cse17 5) 0)) (= (mod (+ .cse17 4) 5) 0) (< (+ .cse17 25350) 0) (<= 554771 .cse18) (<= (+ (div (+ .cse17 25349) 5) 110879) c_~a29~0))))) (exists ((v_prenex_22 Int)) (let ((.cse19 (* 3 v_prenex_22))) (let ((.cse21 (div (+ .cse19 (- 554771)) 5))) (let ((.cse20 (+ .cse21 25350))) (and (< .cse19 554771) (<= 0 .cse20) (not (= 0 (mod (+ .cse19 4) 5))) (<= v_prenex_22 245) (<= (+ (div .cse20 5) 110879) c_~a29~0) (< 140 v_prenex_22) (<= 0 (+ .cse21 25349))))))) (exists ((v_prenex_16 Int)) (let ((.cse24 (* 3 v_prenex_16))) (let ((.cse23 (div (+ .cse24 (- 554771)) 5))) (let ((.cse22 (+ .cse23 25349))) (and (<= (+ (div .cse22 5) 110880) c_~a29~0) (< .cse22 0) (not (= (mod (+ .cse23 4) 5) 0)) (= 0 (mod (+ .cse24 4) 5)) (<= v_prenex_16 245) (= 0 (mod .cse23 5)) (< 140 v_prenex_16)))))) (exists ((v_prenex_32 Int)) (let ((.cse26 (* 3 v_prenex_32))) (let ((.cse25 (div (+ .cse26 (- 554771)) 5))) (and (= 0 (mod .cse25 5)) (not (= 0 (mod (+ .cse25 4) 5))) (< .cse26 554771) (not (= 0 (mod (+ .cse26 4) 5))) (<= v_prenex_32 245) (<= (+ (div (+ .cse25 25350) 5) 110879) c_~a29~0) (< 140 v_prenex_32) (< (+ .cse25 25349) 0))))) (exists ((v_prenex_36 Int)) (let ((.cse27 (* 3 v_prenex_36))) (let ((.cse29 (div (+ .cse27 (- 554771)) 5))) (let ((.cse28 (+ .cse29 25350))) (and (< .cse27 554771) (not (= (mod (+ .cse27 4) 5) 0)) (<= v_prenex_36 245) (<= (+ (div .cse28 5) 110880) c_~a29~0) (<= 0 (+ .cse29 25349)) (not (= (mod .cse29 5) 0)) (< 140 v_prenex_36) (< .cse28 0)))))) (exists ((v_prenex_28 Int)) (let ((.cse31 (* 3 v_prenex_28))) (let ((.cse30 (div (+ .cse31 (- 554771)) 5))) (and (<= (+ (div (+ .cse30 25350) 5) 110879) c_~a29~0) (< 140 v_prenex_28) (<= v_prenex_28 245) (<= 0 (+ .cse30 25349)) (not (= (mod (+ .cse31 4) 5) 0)) (< .cse31 554771) (= (mod .cse30 5) 0))))) (exists ((v_prenex_44 Int)) (let ((.cse33 (* 3 v_prenex_44))) (let ((.cse34 (div (+ .cse33 (- 554771)) 5))) (let ((.cse32 (+ .cse34 25349))) (and (<= 0 .cse32) (<= (+ (div .cse32 5) 110879) c_~a29~0) (<= v_prenex_44 245) (= (mod (+ .cse33 4) 5) 0) (not (= 0 (mod .cse34 5))) (< (+ .cse34 25350) 0) (< 140 v_prenex_44)))))) (exists ((v_prenex_34 Int)) (let ((.cse36 (* 3 v_prenex_34))) (let ((.cse37 (div (+ .cse36 (- 554771)) 5))) (let ((.cse35 (+ .cse37 25349))) (and (<= (+ (div .cse35 5) 110880) c_~a29~0) (<= 554771 .cse36) (not (= (mod (+ .cse37 4) 5) 0)) (< .cse35 0) (not (= (mod .cse37 5) 0)) (< (+ .cse37 25350) 0) (<= v_prenex_34 245) (< 140 v_prenex_34)))))) (exists ((v_prenex_46 Int)) (let ((.cse40 (* 3 v_prenex_46))) (let ((.cse38 (div (+ .cse40 (- 554771)) 5))) (let ((.cse39 (+ .cse38 25350))) (and (not (= (mod (+ .cse38 4) 5) 0)) (<= v_prenex_46 245) (<= (+ (div .cse39 5) 110879) c_~a29~0) (not (= 0 (mod (+ .cse40 4) 5))) (< 140 v_prenex_46) (<= 0 .cse39) (< .cse40 554771) (< (+ .cse38 25349) 0)))))) (exists ((v_~a29~0_501 Int)) (let ((.cse42 (* 3 v_~a29~0_501))) (let ((.cse41 (div (+ .cse42 (- 554771)) 5))) (and (< 140 v_~a29~0_501) (= 0 (mod .cse41 5)) (= 0 (mod (+ .cse41 4) 5)) (<= v_~a29~0_501 245) (= (mod (+ .cse42 4) 5) 0) (<= (+ (div (+ .cse41 25349) 5) 110879) c_~a29~0))))) (exists ((v_prenex_14 Int)) (let ((.cse43 (* 3 v_prenex_14))) (let ((.cse45 (div (+ .cse43 (- 554771)) 5))) (let ((.cse44 (+ .cse45 25349))) (and (<= 554771 .cse43) (<= v_prenex_14 245) (<= 0 .cse44) (< (+ .cse45 25350) 0) (<= (+ (div .cse44 5) 110879) c_~a29~0) (not (= (mod .cse45 5) 0)) (< 140 v_prenex_14)))))) (exists ((v_prenex_30 Int)) (let ((.cse47 (* 3 v_prenex_30))) (let ((.cse46 (div (+ .cse47 (- 554771)) 5))) (and (= 0 (mod .cse46 5)) (<= 554771 .cse47) (< 140 v_prenex_30) (<= v_prenex_30 245) (= 0 (mod (+ .cse46 4) 5)) (<= (+ (div (+ .cse46 25349) 5) 110879) c_~a29~0))))) (exists ((v_prenex_40 Int)) (let ((.cse49 (* 3 v_prenex_40))) (let ((.cse50 (div (+ .cse49 (- 554771)) 5))) (let ((.cse48 (+ .cse50 25349))) (and (< .cse48 0) (<= 554771 .cse49) (< 140 v_prenex_40) (<= v_prenex_40 245) (<= (+ (div .cse48 5) 110880) c_~a29~0) (not (= (mod (+ .cse50 4) 5) 0)) (= 0 (mod .cse50 5))))))) (exists ((v_prenex_38 Int)) (let ((.cse52 (* 3 v_prenex_38))) (let ((.cse51 (div (+ .cse52 (- 554771)) 5))) (and (not (= (mod .cse51 5) 0)) (<= (+ (div (+ .cse51 25349) 5) 110879) c_~a29~0) (< (+ .cse51 25350) 0) (= (mod (+ .cse51 4) 5) 0) (= 0 (mod (+ .cse52 4) 5)) (<= v_prenex_38 245) (< 140 v_prenex_38))))) (exists ((v_prenex_6 Int)) (let ((.cse55 (* 3 v_prenex_6))) (let ((.cse53 (div (+ .cse55 (- 554771)) 5))) (let ((.cse54 (+ .cse53 25349))) (and (not (= (mod (+ .cse53 4) 5) 0)) (< (+ .cse53 25350) 0) (< 140 v_prenex_6) (<= (+ (div .cse54 5) 110880) c_~a29~0) (<= v_prenex_6 245) (not (= (mod .cse53 5) 0)) (< .cse54 0) (= (mod (+ .cse55 4) 5) 0)))))) (exists ((v_prenex_20 Int)) (let ((.cse56 (* 3 v_prenex_20))) (let ((.cse57 (div (+ .cse56 (- 554771)) 5))) (and (< 140 v_prenex_20) (<= 554771 .cse56) (= 0 (mod (+ .cse57 4) 5)) (<= 0 (+ .cse57 25350)) (<= v_prenex_20 245) (<= (+ (div (+ .cse57 25349) 5) 110879) c_~a29~0))))) (exists ((v_prenex_54 Int)) (let ((.cse59 (* 3 v_prenex_54))) (let ((.cse58 (div (+ .cse59 (- 554771)) 5))) (and (= (mod (+ .cse58 4) 5) 0) (= 0 (mod .cse58 5)) (< .cse59 554771) (not (= 0 (mod (+ .cse59 4) 5))) (<= v_prenex_54 245) (<= (+ (div (+ .cse58 25350) 5) 110879) c_~a29~0) (< 140 v_prenex_54))))) (exists ((v_prenex_48 Int)) (let ((.cse61 (* 3 v_prenex_48))) (let ((.cse60 (div (+ .cse61 (- 554771)) 5))) (let ((.cse62 (+ .cse60 25349))) (and (= 0 (mod .cse60 5)) (= (mod (+ .cse61 4) 5) 0) (<= 0 .cse62) (<= v_prenex_48 245) (<= (+ (div .cse62 5) 110879) c_~a29~0) (< 140 v_prenex_48)))))) (exists ((v_prenex_42 Int)) (let ((.cse63 (* 3 v_prenex_42))) (let ((.cse64 (div (+ .cse63 (- 554771)) 5))) (let ((.cse65 (+ .cse64 25349))) (and (<= 554771 .cse63) (<= v_prenex_42 245) (= (mod .cse64 5) 0) (< 140 v_prenex_42) (<= 0 .cse65) (<= (+ (div .cse65 5) 110879) c_~a29~0)))))) (exists ((v_prenex_52 Int)) (let ((.cse67 (* 3 v_prenex_52))) (let ((.cse66 (div (+ .cse67 (- 554771)) 5))) (let ((.cse68 (+ .cse66 25350))) (and (<= v_prenex_52 245) (not (= 0 (mod .cse66 5))) (< .cse67 554771) (< .cse68 0) (< 140 v_prenex_52) (<= (+ (div .cse68 5) 110880) c_~a29~0) (= 0 (mod (+ .cse66 4) 5)) (not (= 0 (mod (+ .cse67 4) 5)))))))) (exists ((v_prenex_10 Int)) (let ((.cse71 (* 3 v_prenex_10))) (let ((.cse69 (div (+ .cse71 (- 554771)) 5))) (let ((.cse70 (+ .cse69 25349))) (and (< 140 v_prenex_10) (<= 0 (+ .cse69 25350)) (<= v_prenex_10 245) (<= (+ (div .cse70 5) 110879) c_~a29~0) (<= 554771 .cse71) (<= 0 .cse70))))))) is different from false [2018-10-23 20:02:12,997 INFO L134 CoverageAnalysis]: Checked inductivity of 671 backedges. 358 proven. 0 refuted. 0 times theorem prover too weak. 263 trivial. 50 not checked. [2018-10-23 20:02:13,017 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-23 20:02:13,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 8 [2018-10-23 20:02:13,018 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-23 20:02:13,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-23 20:02:13,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=29, Unknown=1, NotChecked=10, Total=56 [2018-10-23 20:02:13,019 INFO L87 Difference]: Start difference. First operand 29948 states and 34227 transitions. Second operand 8 states. [2018-10-23 20:02:52,560 WARN L179 SmtUtils]: Spent 24.69 s on a formula simplification. DAG size of input: 584 DAG size of output: 137 [2018-10-23 20:03:53,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:03:53,631 INFO L93 Difference]: Finished difference Result 76110 states and 87239 transitions. [2018-10-23 20:03:53,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-23 20:03:53,632 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 427 [2018-10-23 20:03:53,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:03:53,679 INFO L225 Difference]: With dead ends: 76110 [2018-10-23 20:03:53,679 INFO L226 Difference]: Without dead ends: 46904 [2018-10-23 20:03:53,701 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 427 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 37.5s TimeCoverageRelationStatistics Valid=23, Invalid=47, Unknown=6, NotChecked=14, Total=90 [2018-10-23 20:03:53,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46904 states. [2018-10-23 20:03:54,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46904 to 38708. [2018-10-23 20:03:54,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38708 states. [2018-10-23 20:03:54,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38708 states to 38708 states and 43701 transitions. [2018-10-23 20:03:54,215 INFO L78 Accepts]: Start accepts. Automaton has 38708 states and 43701 transitions. Word has length 427 [2018-10-23 20:03:54,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:03:54,216 INFO L481 AbstractCegarLoop]: Abstraction has 38708 states and 43701 transitions. [2018-10-23 20:03:54,216 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-23 20:03:54,216 INFO L276 IsEmpty]: Start isEmpty. Operand 38708 states and 43701 transitions. [2018-10-23 20:03:54,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2018-10-23 20:03:54,238 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:03:54,239 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-23 20:03:54,239 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:03:54,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:03:54,239 INFO L82 PathProgramCache]: Analyzing trace with hash 1516877591, now seen corresponding path program 1 times [2018-10-23 20:03:54,240 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:03:54,240 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:03:54,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:03:54,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:03:54,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:03:54,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:03:54,935 INFO L134 CoverageAnalysis]: Checked inductivity of 431 backedges. 219 proven. 212 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 20:03:54,935 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 20:03:54,935 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-23 20:03:54,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:03:55,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:03:55,058 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 20:03:58,221 WARN L179 SmtUtils]: Spent 1.50 s on a formula simplification. DAG size of input: 43 DAG size of output: 19 [2018-10-23 20:03:59,474 INFO L134 CoverageAnalysis]: Checked inductivity of 431 backedges. 219 proven. 212 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 20:03:59,496 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-23 20:03:59,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2018-10-23 20:03:59,497 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-23 20:03:59,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-23 20:03:59,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=41, Unknown=2, NotChecked=0, Total=72 [2018-10-23 20:03:59,498 INFO L87 Difference]: Start difference. First operand 38708 states and 43701 transitions. Second operand 9 states. [2018-10-23 20:04:00,945 WARN L179 SmtUtils]: Spent 740.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-10-23 20:04:21,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:04:21,322 INFO L93 Difference]: Finished difference Result 89035 states and 100856 transitions. [2018-10-23 20:04:21,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-23 20:04:21,323 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 429 [2018-10-23 20:04:21,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:04:21,370 INFO L225 Difference]: With dead ends: 89035 [2018-10-23 20:04:21,371 INFO L226 Difference]: Without dead ends: 49759 [2018-10-23 20:04:21,394 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 437 GetRequests, 426 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=50, Invalid=80, Unknown=2, NotChecked=0, Total=132 [2018-10-23 20:04:21,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49759 states. [2018-10-23 20:04:21,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49759 to 33875. [2018-10-23 20:04:21,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33875 states. [2018-10-23 20:04:21,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33875 states to 33875 states and 37381 transitions. [2018-10-23 20:04:21,784 INFO L78 Accepts]: Start accepts. Automaton has 33875 states and 37381 transitions. Word has length 429 [2018-10-23 20:04:21,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:04:21,785 INFO L481 AbstractCegarLoop]: Abstraction has 33875 states and 37381 transitions. [2018-10-23 20:04:21,785 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-23 20:04:21,785 INFO L276 IsEmpty]: Start isEmpty. Operand 33875 states and 37381 transitions. [2018-10-23 20:04:21,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 504 [2018-10-23 20:04:21,803 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:04:21,804 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, 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, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-23 20:04:21,804 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:04:21,804 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:04:21,805 INFO L82 PathProgramCache]: Analyzing trace with hash -168292779, now seen corresponding path program 1 times [2018-10-23 20:04:21,805 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:04:21,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:04:21,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:04:21,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:04:21,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:04:21,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:04:22,292 INFO L134 CoverageAnalysis]: Checked inductivity of 775 backedges. 588 proven. 4 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2018-10-23 20:04:22,292 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 20:04:22,293 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-23 20:04:22,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:04:22,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:04:22,618 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 20:04:22,826 INFO L134 CoverageAnalysis]: Checked inductivity of 775 backedges. 620 proven. 0 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2018-10-23 20:04:22,849 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-23 20:04:22,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2018-10-23 20:04:22,850 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-23 20:04:22,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-23 20:04:22,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-23 20:04:22,851 INFO L87 Difference]: Start difference. First operand 33875 states and 37381 transitions. Second operand 6 states. [2018-10-23 20:04:27,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:04:27,916 INFO L93 Difference]: Finished difference Result 68665 states and 75882 transitions. [2018-10-23 20:04:27,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-23 20:04:27,916 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 503 [2018-10-23 20:04:27,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:04:27,955 INFO L225 Difference]: With dead ends: 68665 [2018-10-23 20:04:27,956 INFO L226 Difference]: Without dead ends: 34414 [2018-10-23 20:04:27,977 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 508 GetRequests, 503 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-23 20:04:28,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34414 states. [2018-10-23 20:04:28,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34414 to 30886. [2018-10-23 20:04:28,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30886 states. [2018-10-23 20:04:28,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30886 states to 30886 states and 33422 transitions. [2018-10-23 20:04:28,306 INFO L78 Accepts]: Start accepts. Automaton has 30886 states and 33422 transitions. Word has length 503 [2018-10-23 20:04:28,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:04:28,307 INFO L481 AbstractCegarLoop]: Abstraction has 30886 states and 33422 transitions. [2018-10-23 20:04:28,307 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-23 20:04:28,307 INFO L276 IsEmpty]: Start isEmpty. Operand 30886 states and 33422 transitions. [2018-10-23 20:04:28,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 519 [2018-10-23 20:04:28,324 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:04:28,325 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 20:04:28,325 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:04:28,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:04:28,325 INFO L82 PathProgramCache]: Analyzing trace with hash 327811787, now seen corresponding path program 1 times [2018-10-23 20:04:28,325 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:04:28,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:04:28,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:04:28,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:04:28,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:04:28,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:04:28,845 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 358 proven. 239 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2018-10-23 20:04:28,845 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 20:04:28,845 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-23 20:04:28,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:04:28,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:04:28,999 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 20:04:29,194 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 358 proven. 239 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2018-10-23 20:04:29,216 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-23 20:04:29,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 4 [2018-10-23 20:04:29,217 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-23 20:04:29,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-23 20:04:29,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-23 20:04:29,218 INFO L87 Difference]: Start difference. First operand 30886 states and 33422 transitions. Second operand 5 states. [2018-10-23 20:04:32,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:04:32,236 INFO L93 Difference]: Finished difference Result 66785 states and 72170 transitions. [2018-10-23 20:04:32,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-23 20:04:32,236 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 518 [2018-10-23 20:04:32,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:04:32,258 INFO L225 Difference]: With dead ends: 66785 [2018-10-23 20:04:32,258 INFO L226 Difference]: Without dead ends: 23984 [2018-10-23 20:04:32,270 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 522 GetRequests, 517 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-23 20:04:32,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23984 states. [2018-10-23 20:04:32,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23984 to 18426. [2018-10-23 20:04:32,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18426 states. [2018-10-23 20:04:32,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18426 states to 18426 states and 19551 transitions. [2018-10-23 20:04:32,468 INFO L78 Accepts]: Start accepts. Automaton has 18426 states and 19551 transitions. Word has length 518 [2018-10-23 20:04:32,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:04:32,468 INFO L481 AbstractCegarLoop]: Abstraction has 18426 states and 19551 transitions. [2018-10-23 20:04:32,468 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-23 20:04:32,468 INFO L276 IsEmpty]: Start isEmpty. Operand 18426 states and 19551 transitions. [2018-10-23 20:04:32,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 553 [2018-10-23 20:04:32,479 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:04:32,480 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 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 20:04:32,480 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:04:32,480 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:04:32,481 INFO L82 PathProgramCache]: Analyzing trace with hash -1979576219, now seen corresponding path program 1 times [2018-10-23 20:04:32,481 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:04:32,481 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:04:32,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:04:32,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:04:32,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:04:32,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:04:32,979 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-10-23 20:04:33,219 INFO L134 CoverageAnalysis]: Checked inductivity of 774 backedges. 358 proven. 50 refuted. 0 times theorem prover too weak. 366 trivial. 0 not checked. [2018-10-23 20:04:33,219 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 20:04:33,219 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-23 20:04:33,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:04:33,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:04:33,377 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 20:04:33,930 INFO L134 CoverageAnalysis]: Checked inductivity of 774 backedges. 358 proven. 50 refuted. 0 times theorem prover too weak. 366 trivial. 0 not checked. [2018-10-23 20:04:33,971 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-23 20:04:33,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4] total 8 [2018-10-23 20:04:33,972 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-23 20:04:33,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-23 20:04:33,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-10-23 20:04:33,973 INFO L87 Difference]: Start difference. First operand 18426 states and 19551 transitions. Second operand 8 states. [2018-10-23 20:04:39,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:04:39,033 INFO L93 Difference]: Finished difference Result 40185 states and 42622 transitions. [2018-10-23 20:04:39,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-23 20:04:39,034 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 552 [2018-10-23 20:04:39,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:04:39,054 INFO L225 Difference]: With dead ends: 40185 [2018-10-23 20:04:39,055 INFO L226 Difference]: Without dead ends: 21578 [2018-10-23 20:04:39,067 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 564 GetRequests, 554 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2018-10-23 20:04:39,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21578 states. [2018-10-23 20:04:39,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21578 to 19716. [2018-10-23 20:04:39,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19716 states. [2018-10-23 20:04:39,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19716 states to 19716 states and 20741 transitions. [2018-10-23 20:04:39,296 INFO L78 Accepts]: Start accepts. Automaton has 19716 states and 20741 transitions. Word has length 552 [2018-10-23 20:04:39,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:04:39,297 INFO L481 AbstractCegarLoop]: Abstraction has 19716 states and 20741 transitions. [2018-10-23 20:04:39,297 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-23 20:04:39,297 INFO L276 IsEmpty]: Start isEmpty. Operand 19716 states and 20741 transitions. [2018-10-23 20:04:39,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 586 [2018-10-23 20:04:39,311 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:04:39,312 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-23 20:04:39,312 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:04:39,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:04:39,313 INFO L82 PathProgramCache]: Analyzing trace with hash -550474480, now seen corresponding path program 1 times [2018-10-23 20:04:39,313 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:04:39,313 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:04:39,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:04:39,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:04:39,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:04:39,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:04:39,809 WARN L179 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 11 [2018-10-23 20:04:40,058 INFO L134 CoverageAnalysis]: Checked inductivity of 1093 backedges. 843 proven. 0 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2018-10-23 20:04:40,059 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 20:04:40,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-23 20:04:40,059 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 20:04:40,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 20:04:40,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 20:04:40,060 INFO L87 Difference]: Start difference. First operand 19716 states and 20741 transitions. Second operand 4 states. [2018-10-23 20:04:41,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:04:41,584 INFO L93 Difference]: Finished difference Result 40735 states and 42825 transitions. [2018-10-23 20:04:41,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 20:04:41,585 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 585 [2018-10-23 20:04:41,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:04:41,603 INFO L225 Difference]: With dead ends: 40735 [2018-10-23 20:04:41,603 INFO L226 Difference]: Without dead ends: 21205 [2018-10-23 20:04:41,615 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 20:04:41,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21205 states. [2018-10-23 20:04:41,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21205 to 15456. [2018-10-23 20:04:41,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15456 states. [2018-10-23 20:04:41,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15456 states to 15456 states and 16228 transitions. [2018-10-23 20:04:41,797 INFO L78 Accepts]: Start accepts. Automaton has 15456 states and 16228 transitions. Word has length 585 [2018-10-23 20:04:41,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:04:41,798 INFO L481 AbstractCegarLoop]: Abstraction has 15456 states and 16228 transitions. [2018-10-23 20:04:41,798 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 20:04:41,798 INFO L276 IsEmpty]: Start isEmpty. Operand 15456 states and 16228 transitions. [2018-10-23 20:04:41,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 613 [2018-10-23 20:04:41,806 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:04:41,806 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 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, 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] [2018-10-23 20:04:41,807 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:04:41,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:04:41,807 INFO L82 PathProgramCache]: Analyzing trace with hash -1785928458, now seen corresponding path program 1 times [2018-10-23 20:04:41,807 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:04:41,807 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:04:41,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:04:41,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:04:41,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:04:41,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:04:42,580 INFO L134 CoverageAnalysis]: Checked inductivity of 1154 backedges. 881 proven. 176 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2018-10-23 20:04:42,580 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 20:04:42,581 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-23 20:04:42,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:04:42,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:04:42,760 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 20:04:43,638 INFO L134 CoverageAnalysis]: Checked inductivity of 1154 backedges. 881 proven. 176 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2018-10-23 20:04:43,661 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-23 20:04:43,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 10 [2018-10-23 20:04:43,662 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-23 20:04:43,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-23 20:04:43,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-10-23 20:04:43,663 INFO L87 Difference]: Start difference. First operand 15456 states and 16228 transitions. Second operand 10 states. [2018-10-23 20:04:49,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:04:49,224 INFO L93 Difference]: Finished difference Result 29432 states and 30889 transitions. [2018-10-23 20:04:49,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-23 20:04:49,225 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 612 [2018-10-23 20:04:49,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:04:49,237 INFO L225 Difference]: With dead ends: 29432 [2018-10-23 20:04:49,237 INFO L226 Difference]: Without dead ends: 15645 [2018-10-23 20:04:49,244 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 622 GetRequests, 611 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2018-10-23 20:04:49,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15645 states. [2018-10-23 20:04:49,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15645 to 13043. [2018-10-23 20:04:49,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13043 states. [2018-10-23 20:04:49,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13043 states to 13043 states and 13669 transitions. [2018-10-23 20:04:49,372 INFO L78 Accepts]: Start accepts. Automaton has 13043 states and 13669 transitions. Word has length 612 [2018-10-23 20:04:49,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:04:49,373 INFO L481 AbstractCegarLoop]: Abstraction has 13043 states and 13669 transitions. [2018-10-23 20:04:49,373 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-23 20:04:49,373 INFO L276 IsEmpty]: Start isEmpty. Operand 13043 states and 13669 transitions. [2018-10-23 20:04:49,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 618 [2018-10-23 20:04:49,381 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:04:49,381 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-23 20:04:49,381 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:04:49,382 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:04:49,382 INFO L82 PathProgramCache]: Analyzing trace with hash -703017106, now seen corresponding path program 1 times [2018-10-23 20:04:49,382 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:04:49,382 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:04:49,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:04:49,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:04:49,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:04:49,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:04:50,028 INFO L134 CoverageAnalysis]: Checked inductivity of 1203 backedges. 656 proven. 0 refuted. 0 times theorem prover too weak. 547 trivial. 0 not checked. [2018-10-23 20:04:50,029 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 20:04:50,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 20:04:50,030 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 20:04:50,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 20:04:50,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 20:04:50,030 INFO L87 Difference]: Start difference. First operand 13043 states and 13669 transitions. Second operand 3 states. [2018-10-23 20:04:51,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:04:51,888 INFO L93 Difference]: Finished difference Result 24229 states and 25391 transitions. [2018-10-23 20:04:51,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 20:04:51,888 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 617 [2018-10-23 20:04:51,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:04:51,898 INFO L225 Difference]: With dead ends: 24229 [2018-10-23 20:04:51,898 INFO L226 Difference]: Without dead ends: 10078 [2018-10-23 20:04:51,904 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 20:04:51,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10078 states. Received shutdown request... [2018-10-23 20:04:51,929 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-23 20:04:51,932 WARN L205 ceAbstractionStarter]: Timeout [2018-10-23 20:04:51,933 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.10 08:04:51 BoogieIcfgContainer [2018-10-23 20:04:51,933 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-23 20:04:51,934 INFO L168 Benchmark]: Toolchain (without parser) took 242241.97 ms. Allocated memory was 1.5 GB in the beginning and 4.1 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 2.8 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2018-10-23 20:04:51,934 INFO L168 Benchmark]: CDTParser took 0.23 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 20:04:51,935 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1113.72 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 52.9 MB). Peak memory consumption was 52.9 MB. Max. memory is 7.1 GB. [2018-10-23 20:04:51,935 INFO L168 Benchmark]: Boogie Procedure Inliner took 282.56 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 729.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -813.5 MB). Peak memory consumption was 24.2 MB. Max. memory is 7.1 GB. [2018-10-23 20:04:51,936 INFO L168 Benchmark]: Boogie Preprocessor took 129.20 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-23 20:04:51,937 INFO L168 Benchmark]: RCFGBuilder took 5471.26 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: 200.8 MB). Peak memory consumption was 200.8 MB. Max. memory is 7.1 GB. [2018-10-23 20:04:51,937 INFO L168 Benchmark]: TraceAbstraction took 235234.00 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.0 GB in the beginning and 2.8 GB in the end (delta: -809.4 MB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. [2018-10-23 20:04:51,942 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.23 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 1113.72 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 52.9 MB). Peak memory consumption was 52.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 282.56 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 729.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -813.5 MB). Peak memory consumption was 24.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 129.20 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 5471.26 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: 200.8 MB). Peak memory consumption was 200.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 235234.00 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.0 GB in the beginning and 2.8 GB in the end (delta: -809.4 MB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 159]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 159). Cancelled while executing MinimizeSevpa. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 284 locations, 1 error locations. TIMEOUT Result, 235.1s OverallTime, 19 OverallIterations, 6 TraceHistogramMax, 200.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3833 SDtfs, 15717 SDslu, 2825 SDs, 0 SdLazy, 38066 SolverSat, 7396 SolverUnsat, 39 SolverUnknown, 0 SolverNotchecked, 149.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3933 GetRequests, 3836 SyntacticMatches, 8 SemanticMatches, 89 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 47.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=38708occurred in iteration=12, 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: 4.2s AutomataMinimizationTime, 19 MinimizatonAttempts, 59885 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 24.1s InterpolantComputationTime, 10959 NumberOfCodeBlocks, 10959 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 10932 ConstructedInterpolants, 471 QuantifiedInterpolants, 54359899 SizeOfPredicates, 4 NumberOfNonLiveVariables, 5000 ConjunctsInSsa, 40 ConjunctsInUnsatCore, 27 InterpolantComputations, 13 PerfectInterpolantSequences, 13232/15141 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown