java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem03_label41_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-06 19:59:11,838 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-06 19:59:11,840 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-06 19:59:11,855 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-06 19:59:11,855 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-06 19:59:11,856 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-06 19:59:11,858 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-06 19:59:11,860 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-06 19:59:11,861 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-06 19:59:11,862 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-06 19:59:11,863 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-06 19:59:11,863 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-06 19:59:11,864 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-06 19:59:11,865 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-06 19:59:11,866 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-06 19:59:11,867 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-06 19:59:11,868 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-06 19:59:11,870 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-06 19:59:11,872 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-06 19:59:11,874 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-06 19:59:11,875 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-06 19:59:11,876 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-06 19:59:11,879 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-06 19:59:11,879 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-06 19:59:11,879 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-06 19:59:11,880 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-06 19:59:11,881 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-06 19:59:11,882 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-06 19:59:11,883 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-06 19:59:11,884 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-06 19:59:11,884 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-06 19:59:11,885 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-06 19:59:11,885 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-06 19:59:11,886 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-06 19:59:11,887 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-06 19:59:11,887 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-06 19:59:11,888 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-11-06 19:59:11,916 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-06 19:59:11,917 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-06 19:59:11,918 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-06 19:59:11,918 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-06 19:59:11,918 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-06 19:59:11,919 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-06 19:59:11,919 INFO L133 SettingsManager]: * Use SBE=true [2018-11-06 19:59:11,919 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-06 19:59:11,919 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-06 19:59:11,919 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-06 19:59:11,921 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-06 19:59:11,921 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-06 19:59:11,921 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-06 19:59:11,921 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-06 19:59:11,921 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-06 19:59:11,922 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-06 19:59:11,922 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-06 19:59:11,922 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-06 19:59:11,922 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-06 19:59:11,923 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 19:59:11,923 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-06 19:59:11,923 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-06 19:59:11,923 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-06 19:59:11,923 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-06 19:59:11,924 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-06 19:59:11,924 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-06 19:59:11,924 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-06 19:59:11,925 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-06 19:59:11,992 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-06 19:59:12,009 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-06 19:59:12,013 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-06 19:59:12,014 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-06 19:59:12,015 INFO L276 PluginConnector]: CDTParser initialized [2018-11-06 19:59:12,016 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label41_true-unreach-call.c [2018-11-06 19:59:12,073 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbb51b43c/c817cdc999834d72b6536b8536cf3f46/FLAGcd6040ef2 [2018-11-06 19:59:12,717 INFO L298 CDTParser]: Found 1 translation units. [2018-11-06 19:59:12,718 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label41_true-unreach-call.c [2018-11-06 19:59:12,741 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbb51b43c/c817cdc999834d72b6536b8536cf3f46/FLAGcd6040ef2 [2018-11-06 19:59:12,763 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbb51b43c/c817cdc999834d72b6536b8536cf3f46 [2018-11-06 19:59:12,776 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-06 19:59:12,778 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-06 19:59:12,779 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-06 19:59:12,780 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-06 19:59:12,786 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-06 19:59:12,787 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:59:12" (1/1) ... [2018-11-06 19:59:12,790 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2228132a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:59:12, skipping insertion in model container [2018-11-06 19:59:12,790 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:59:12" (1/1) ... [2018-11-06 19:59:12,799 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-06 19:59:12,893 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-06 19:59:13,706 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 19:59:13,713 INFO L189 MainTranslator]: Completed pre-run [2018-11-06 19:59:13,999 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 19:59:14,026 INFO L193 MainTranslator]: Completed translation [2018-11-06 19:59:14,027 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:59:14 WrapperNode [2018-11-06 19:59:14,027 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-06 19:59:14,028 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-06 19:59:14,031 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-06 19:59:14,031 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-06 19:59:14,042 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:59:14" (1/1) ... [2018-11-06 19:59:14,251 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:59:14" (1/1) ... [2018-11-06 19:59:14,363 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-06 19:59:14,364 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-06 19:59:14,364 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-06 19:59:14,364 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-06 19:59:14,376 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:59:14" (1/1) ... [2018-11-06 19:59:14,376 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:59:14" (1/1) ... [2018-11-06 19:59:14,390 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:59:14" (1/1) ... [2018-11-06 19:59:14,390 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:59:14" (1/1) ... [2018-11-06 19:59:14,456 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:59:14" (1/1) ... [2018-11-06 19:59:14,487 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:59:14" (1/1) ... [2018-11-06 19:59:14,511 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:59:14" (1/1) ... [2018-11-06 19:59:14,540 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-06 19:59:14,544 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-06 19:59:14,544 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-06 19:59:14,545 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-06 19:59:14,548 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:59:14" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-11-06 19:59:14,624 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-06 19:59:14,624 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-06 19:59:14,625 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-06 19:59:20,092 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-06 19:59:20,093 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:59:20 BoogieIcfgContainer [2018-11-06 19:59:20,093 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-06 19:59:20,095 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-06 19:59:20,095 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-06 19:59:20,098 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-06 19:59:20,099 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 07:59:12" (1/3) ... [2018-11-06 19:59:20,099 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a32a11d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:59:20, skipping insertion in model container [2018-11-06 19:59:20,100 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:59:14" (2/3) ... [2018-11-06 19:59:20,100 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a32a11d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:59:20, skipping insertion in model container [2018-11-06 19:59:20,100 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:59:20" (3/3) ... [2018-11-06 19:59:20,102 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label41_true-unreach-call.c [2018-11-06 19:59:20,113 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-06 19:59:20,122 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-06 19:59:20,140 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-06 19:59:20,179 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-06 19:59:20,180 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-06 19:59:20,180 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-06 19:59:20,180 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-06 19:59:20,181 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-06 19:59:20,181 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-06 19:59:20,181 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-06 19:59:20,181 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-06 19:59:20,181 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-06 19:59:20,208 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states. [2018-11-06 19:59:20,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-11-06 19:59:20,228 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:59:20,229 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:59:20,232 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:59:20,238 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:59:20,239 INFO L82 PathProgramCache]: Analyzing trace with hash 1542586394, now seen corresponding path program 1 times [2018-11-06 19:59:20,241 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:59:20,242 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:59:20,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:59:20,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:59:20,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:59:20,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:59:21,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:59:21,213 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:59:21,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:59:21,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:59:21,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:59:21,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:59:21,239 INFO L87 Difference]: Start difference. First operand 303 states. Second operand 4 states. [2018-11-06 19:59:24,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:59:24,963 INFO L93 Difference]: Finished difference Result 1072 states and 1917 transitions. [2018-11-06 19:59:24,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:59:24,965 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 183 [2018-11-06 19:59:24,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:59:24,990 INFO L225 Difference]: With dead ends: 1072 [2018-11-06 19:59:24,990 INFO L226 Difference]: Without dead ends: 762 [2018-11-06 19:59:24,996 INFO L604 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-11-06 19:59:25,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2018-11-06 19:59:25,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 518. [2018-11-06 19:59:25,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 518 states. [2018-11-06 19:59:25,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 855 transitions. [2018-11-06 19:59:25,091 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 855 transitions. Word has length 183 [2018-11-06 19:59:25,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:59:25,092 INFO L480 AbstractCegarLoop]: Abstraction has 518 states and 855 transitions. [2018-11-06 19:59:25,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:59:25,092 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 855 transitions. [2018-11-06 19:59:25,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-11-06 19:59:25,099 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:59:25,099 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:59:25,100 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:59:25,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:59:25,100 INFO L82 PathProgramCache]: Analyzing trace with hash 1845542153, now seen corresponding path program 1 times [2018-11-06 19:59:25,101 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:59:25,101 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:59:25,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:59:25,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:59:25,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:59:25,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:59:25,418 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:59:25,418 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:59:25,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:59:25,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:59:25,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:59:25,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:59:25,424 INFO L87 Difference]: Start difference. First operand 518 states and 855 transitions. Second operand 4 states. [2018-11-06 19:59:28,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:59:28,538 INFO L93 Difference]: Finished difference Result 1917 states and 3253 transitions. [2018-11-06 19:59:28,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:59:28,538 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 189 [2018-11-06 19:59:28,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:59:28,548 INFO L225 Difference]: With dead ends: 1917 [2018-11-06 19:59:28,548 INFO L226 Difference]: Without dead ends: 1401 [2018-11-06 19:59:28,555 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:59:28,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1401 states. [2018-11-06 19:59:28,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1401 to 933. [2018-11-06 19:59:28,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 933 states. [2018-11-06 19:59:28,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 1472 transitions. [2018-11-06 19:59:28,617 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 1472 transitions. Word has length 189 [2018-11-06 19:59:28,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:59:28,618 INFO L480 AbstractCegarLoop]: Abstraction has 933 states and 1472 transitions. [2018-11-06 19:59:28,618 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:59:28,618 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1472 transitions. [2018-11-06 19:59:28,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-11-06 19:59:28,626 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:59:28,626 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:59:28,628 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:59:28,628 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:59:28,628 INFO L82 PathProgramCache]: Analyzing trace with hash -40059333, now seen corresponding path program 1 times [2018-11-06 19:59:28,628 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:59:28,628 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:59:28,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:59:28,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:59:28,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:59:28,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:59:28,752 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:59:28,752 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:59:28,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 19:59:28,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:59:28,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:59:28,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:59:28,754 INFO L87 Difference]: Start difference. First operand 933 states and 1472 transitions. Second operand 3 states. [2018-11-06 19:59:31,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:59:31,286 INFO L93 Difference]: Finished difference Result 2699 states and 4315 transitions. [2018-11-06 19:59:31,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:59:31,286 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 192 [2018-11-06 19:59:31,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:59:31,297 INFO L225 Difference]: With dead ends: 2699 [2018-11-06 19:59:31,297 INFO L226 Difference]: Without dead ends: 1768 [2018-11-06 19:59:31,299 INFO L604 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-11-06 19:59:31,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1768 states. [2018-11-06 19:59:31,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1768 to 1751. [2018-11-06 19:59:31,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1751 states. [2018-11-06 19:59:31,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1751 states to 1751 states and 2699 transitions. [2018-11-06 19:59:31,339 INFO L78 Accepts]: Start accepts. Automaton has 1751 states and 2699 transitions. Word has length 192 [2018-11-06 19:59:31,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:59:31,339 INFO L480 AbstractCegarLoop]: Abstraction has 1751 states and 2699 transitions. [2018-11-06 19:59:31,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:59:31,339 INFO L276 IsEmpty]: Start isEmpty. Operand 1751 states and 2699 transitions. [2018-11-06 19:59:31,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-11-06 19:59:31,344 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:59:31,345 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:59:31,345 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:59:31,345 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:59:31,345 INFO L82 PathProgramCache]: Analyzing trace with hash -1107131409, now seen corresponding path program 1 times [2018-11-06 19:59:31,346 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:59:31,346 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:59:31,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:59:31,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:59:31,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:59:31,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:59:31,479 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-06 19:59:31,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:59:31,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 19:59:31,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:59:31,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:59:31,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:59:31,481 INFO L87 Difference]: Start difference. First operand 1751 states and 2699 transitions. Second operand 3 states. [2018-11-06 19:59:33,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:59:33,056 INFO L93 Difference]: Finished difference Result 4329 states and 6639 transitions. [2018-11-06 19:59:33,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:59:33,057 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 200 [2018-11-06 19:59:33,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:59:33,072 INFO L225 Difference]: With dead ends: 4329 [2018-11-06 19:59:33,072 INFO L226 Difference]: Without dead ends: 2580 [2018-11-06 19:59:33,075 INFO L604 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-11-06 19:59:33,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2580 states. [2018-11-06 19:59:33,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2580 to 2579. [2018-11-06 19:59:33,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2579 states. [2018-11-06 19:59:33,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2579 states to 2579 states and 3884 transitions. [2018-11-06 19:59:33,192 INFO L78 Accepts]: Start accepts. Automaton has 2579 states and 3884 transitions. Word has length 200 [2018-11-06 19:59:33,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:59:33,192 INFO L480 AbstractCegarLoop]: Abstraction has 2579 states and 3884 transitions. [2018-11-06 19:59:33,192 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:59:33,192 INFO L276 IsEmpty]: Start isEmpty. Operand 2579 states and 3884 transitions. [2018-11-06 19:59:33,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-11-06 19:59:33,199 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:59:33,199 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:59:33,200 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:59:33,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:59:33,200 INFO L82 PathProgramCache]: Analyzing trace with hash -1875654890, now seen corresponding path program 1 times [2018-11-06 19:59:33,200 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:59:33,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:59:33,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:59:33,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:59:33,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:59:33,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:59:33,339 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-06 19:59:33,339 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:59:33,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 19:59:33,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:59:33,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:59:33,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:59:33,340 INFO L87 Difference]: Start difference. First operand 2579 states and 3884 transitions. Second operand 3 states. [2018-11-06 19:59:33,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:59:33,826 INFO L93 Difference]: Finished difference Result 7713 states and 11623 transitions. [2018-11-06 19:59:33,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:59:33,827 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 206 [2018-11-06 19:59:33,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:59:33,853 INFO L225 Difference]: With dead ends: 7713 [2018-11-06 19:59:33,854 INFO L226 Difference]: Without dead ends: 5136 [2018-11-06 19:59:33,859 INFO L604 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-11-06 19:59:33,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5136 states. [2018-11-06 19:59:33,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5136 to 5133. [2018-11-06 19:59:33,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5133 states. [2018-11-06 19:59:33,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5133 states to 5133 states and 7720 transitions. [2018-11-06 19:59:33,975 INFO L78 Accepts]: Start accepts. Automaton has 5133 states and 7720 transitions. Word has length 206 [2018-11-06 19:59:33,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:59:33,975 INFO L480 AbstractCegarLoop]: Abstraction has 5133 states and 7720 transitions. [2018-11-06 19:59:33,976 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:59:33,976 INFO L276 IsEmpty]: Start isEmpty. Operand 5133 states and 7720 transitions. [2018-11-06 19:59:33,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-11-06 19:59:33,987 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:59:33,987 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:59:33,988 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:59:33,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:59:33,988 INFO L82 PathProgramCache]: Analyzing trace with hash 1741862557, now seen corresponding path program 1 times [2018-11-06 19:59:33,988 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:59:33,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:59:33,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:59:33,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:59:33,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:59:34,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:59:34,346 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 31 proven. 10 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-06 19:59:34,346 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 19:59:34,346 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-11-06 19:59:34,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:59:34,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:59:34,490 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 19:59:34,553 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-06 19:59:34,584 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 19:59:34,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 3 [2018-11-06 19:59:34,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:59:34,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:59:34,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:59:34,586 INFO L87 Difference]: Start difference. First operand 5133 states and 7720 transitions. Second operand 4 states. [2018-11-06 19:59:37,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:59:37,268 INFO L93 Difference]: Finished difference Result 20487 states and 30826 transitions. [2018-11-06 19:59:37,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:59:37,268 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 215 [2018-11-06 19:59:37,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:59:37,339 INFO L225 Difference]: With dead ends: 20487 [2018-11-06 19:59:37,339 INFO L226 Difference]: Without dead ends: 15356 [2018-11-06 19:59:37,350 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 215 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-11-06 19:59:37,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15356 states. [2018-11-06 19:59:37,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15356 to 10229. [2018-11-06 19:59:37,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10229 states. [2018-11-06 19:59:37,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10229 states to 10229 states and 15363 transitions. [2018-11-06 19:59:37,596 INFO L78 Accepts]: Start accepts. Automaton has 10229 states and 15363 transitions. Word has length 215 [2018-11-06 19:59:37,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:59:37,596 INFO L480 AbstractCegarLoop]: Abstraction has 10229 states and 15363 transitions. [2018-11-06 19:59:37,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:59:37,598 INFO L276 IsEmpty]: Start isEmpty. Operand 10229 states and 15363 transitions. [2018-11-06 19:59:37,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2018-11-06 19:59:37,615 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:59:37,615 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:59:37,615 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:59:37,615 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:59:37,616 INFO L82 PathProgramCache]: Analyzing trace with hash -239700322, now seen corresponding path program 1 times [2018-11-06 19:59:37,616 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:59:37,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:59:37,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:59:37,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:59:37,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:59:37,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:59:37,879 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:59:37,880 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:59:37,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:59:37,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 19:59:37,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 19:59:37,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 19:59:37,881 INFO L87 Difference]: Start difference. First operand 10229 states and 15363 transitions. Second operand 5 states. [2018-11-06 19:59:40,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:59:40,650 INFO L93 Difference]: Finished difference Result 23029 states and 35010 transitions. [2018-11-06 19:59:40,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 19:59:40,651 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 223 [2018-11-06 19:59:40,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:59:40,683 INFO L225 Difference]: With dead ends: 23029 [2018-11-06 19:59:40,683 INFO L226 Difference]: Without dead ends: 12802 [2018-11-06 19:59:40,695 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 19:59:40,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12802 states. [2018-11-06 19:59:40,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12802 to 11045. [2018-11-06 19:59:40,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11045 states. [2018-11-06 19:59:40,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11045 states to 11045 states and 16559 transitions. [2018-11-06 19:59:40,889 INFO L78 Accepts]: Start accepts. Automaton has 11045 states and 16559 transitions. Word has length 223 [2018-11-06 19:59:40,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:59:40,889 INFO L480 AbstractCegarLoop]: Abstraction has 11045 states and 16559 transitions. [2018-11-06 19:59:40,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 19:59:40,890 INFO L276 IsEmpty]: Start isEmpty. Operand 11045 states and 16559 transitions. [2018-11-06 19:59:40,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2018-11-06 19:59:40,910 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:59:40,910 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:59:40,910 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:59:40,911 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:59:40,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1949917310, now seen corresponding path program 1 times [2018-11-06 19:59:40,911 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:59:40,911 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:59:40,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:59:40,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:59:40,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:59:40,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:59:41,400 WARN L179 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 10 [2018-11-06 19:59:41,644 WARN L179 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2018-11-06 19:59:41,918 WARN L179 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 9 [2018-11-06 19:59:41,963 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 52 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:59:41,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 19:59:41,964 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-11-06 19:59:41,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:59:42,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:59:42,077 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 19:59:42,186 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-06 19:59:42,210 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 19:59:42,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2018-11-06 19:59:42,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-06 19:59:42,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-06 19:59:42,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-06 19:59:42,212 INFO L87 Difference]: Start difference. First operand 11045 states and 16559 transitions. Second operand 7 states. [2018-11-06 19:59:48,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:59:48,699 INFO L93 Difference]: Finished difference Result 58087 states and 84611 transitions. [2018-11-06 19:59:48,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-06 19:59:48,699 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 233 [2018-11-06 19:59:48,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:59:48,777 INFO L225 Difference]: With dead ends: 58087 [2018-11-06 19:59:48,778 INFO L226 Difference]: Without dead ends: 47044 [2018-11-06 19:59:48,803 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2018-11-06 19:59:48,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47044 states. [2018-11-06 19:59:49,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47044 to 45800. [2018-11-06 19:59:49,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45800 states. [2018-11-06 19:59:49,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45800 states to 45800 states and 56726 transitions. [2018-11-06 19:59:49,497 INFO L78 Accepts]: Start accepts. Automaton has 45800 states and 56726 transitions. Word has length 233 [2018-11-06 19:59:49,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:59:49,498 INFO L480 AbstractCegarLoop]: Abstraction has 45800 states and 56726 transitions. [2018-11-06 19:59:49,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-06 19:59:49,498 INFO L276 IsEmpty]: Start isEmpty. Operand 45800 states and 56726 transitions. [2018-11-06 19:59:49,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2018-11-06 19:59:49,549 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:59:49,549 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:59:49,550 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:59:49,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:59:49,550 INFO L82 PathProgramCache]: Analyzing trace with hash 838847358, now seen corresponding path program 1 times [2018-11-06 19:59:49,550 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:59:49,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:59:49,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:59:49,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:59:49,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:59:49,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:59:49,697 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2018-11-06 19:59:49,697 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:59:49,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:59:49,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:59:49,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:59:49,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:59:49,699 INFO L87 Difference]: Start difference. First operand 45800 states and 56726 transitions. Second operand 3 states. [2018-11-06 19:59:51,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:59:51,598 INFO L93 Difference]: Finished difference Result 105274 states and 132479 transitions. [2018-11-06 19:59:51,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:59:51,599 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 245 [2018-11-06 19:59:51,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:59:51,698 INFO L225 Difference]: With dead ends: 105274 [2018-11-06 19:59:51,698 INFO L226 Difference]: Without dead ends: 59476 [2018-11-06 19:59:51,753 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:59:51,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59476 states. [2018-11-06 19:59:52,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59476 to 59468. [2018-11-06 19:59:52,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59468 states. [2018-11-06 19:59:52,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59468 states to 59468 states and 70978 transitions. [2018-11-06 19:59:52,982 INFO L78 Accepts]: Start accepts. Automaton has 59468 states and 70978 transitions. Word has length 245 [2018-11-06 19:59:52,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:59:52,983 INFO L480 AbstractCegarLoop]: Abstraction has 59468 states and 70978 transitions. [2018-11-06 19:59:52,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:59:52,983 INFO L276 IsEmpty]: Start isEmpty. Operand 59468 states and 70978 transitions. [2018-11-06 19:59:53,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2018-11-06 19:59:53,032 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:59:53,032 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 19:59:53,033 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:59:53,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:59:53,033 INFO L82 PathProgramCache]: Analyzing trace with hash -557160164, now seen corresponding path program 1 times [2018-11-06 19:59:53,033 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:59:53,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:59:53,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:59:53,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:59:53,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:59:53,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:59:53,251 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-11-06 19:59:53,251 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:59:53,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 19:59:53,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:59:53,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:59:53,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:59:53,253 INFO L87 Difference]: Start difference. First operand 59468 states and 70978 transitions. Second operand 3 states. [2018-11-06 19:59:54,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:59:54,371 INFO L93 Difference]: Finished difference Result 116380 states and 139034 transitions. [2018-11-06 19:59:54,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:59:54,371 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 287 [2018-11-06 19:59:54,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:59:54,445 INFO L225 Difference]: With dead ends: 116380 [2018-11-06 19:59:54,445 INFO L226 Difference]: Without dead ends: 56914 [2018-11-06 19:59:54,489 INFO L604 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-11-06 19:59:54,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56914 states. [2018-11-06 19:59:55,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56914 to 56914. [2018-11-06 19:59:55,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56914 states. [2018-11-06 19:59:55,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56914 states to 56914 states and 66991 transitions. [2018-11-06 19:59:55,109 INFO L78 Accepts]: Start accepts. Automaton has 56914 states and 66991 transitions. Word has length 287 [2018-11-06 19:59:55,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:59:55,110 INFO L480 AbstractCegarLoop]: Abstraction has 56914 states and 66991 transitions. [2018-11-06 19:59:55,110 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:59:55,110 INFO L276 IsEmpty]: Start isEmpty. Operand 56914 states and 66991 transitions. [2018-11-06 19:59:55,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2018-11-06 19:59:55,141 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:59:55,142 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 19:59:55,142 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:59:55,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:59:55,142 INFO L82 PathProgramCache]: Analyzing trace with hash 1619691015, now seen corresponding path program 1 times [2018-11-06 19:59:55,143 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:59:55,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:59:55,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:59:55,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:59:55,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:59:55,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:59:55,447 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-06 19:59:55,448 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:59:55,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 19:59:55,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:59:55,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:59:55,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:59:55,449 INFO L87 Difference]: Start difference. First operand 56914 states and 66991 transitions. Second operand 3 states. [2018-11-06 19:59:56,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:59:56,894 INFO L93 Difference]: Finished difference Result 159633 states and 188339 transitions. [2018-11-06 19:59:56,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:59:56,894 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 337 [2018-11-06 19:59:56,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:59:57,010 INFO L225 Difference]: With dead ends: 159633 [2018-11-06 19:59:57,011 INFO L226 Difference]: Without dead ends: 102721 [2018-11-06 19:59:57,053 INFO L604 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-11-06 19:59:57,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102721 states. [2018-11-06 19:59:58,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102721 to 102717. [2018-11-06 19:59:58,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102717 states. [2018-11-06 19:59:58,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102717 states to 102717 states and 121291 transitions. [2018-11-06 19:59:58,108 INFO L78 Accepts]: Start accepts. Automaton has 102717 states and 121291 transitions. Word has length 337 [2018-11-06 19:59:58,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:59:58,108 INFO L480 AbstractCegarLoop]: Abstraction has 102717 states and 121291 transitions. [2018-11-06 19:59:58,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:59:58,108 INFO L276 IsEmpty]: Start isEmpty. Operand 102717 states and 121291 transitions. [2018-11-06 19:59:58,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2018-11-06 19:59:58,167 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:59:58,167 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 19:59:58,168 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:59:58,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:59:58,168 INFO L82 PathProgramCache]: Analyzing trace with hash 15499286, now seen corresponding path program 1 times [2018-11-06 19:59:58,168 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:59:58,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:59:58,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:59:58,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:59:58,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:59:58,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:59:58,591 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 281 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-11-06 19:59:58,591 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:59:58,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:59:58,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:59:58,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:59:58,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:59:58,593 INFO L87 Difference]: Start difference. First operand 102717 states and 121291 transitions. Second operand 4 states. [2018-11-06 20:00:03,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 20:00:03,294 INFO L93 Difference]: Finished difference Result 257684 states and 302483 transitions. [2018-11-06 20:00:03,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 20:00:03,294 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 381 [2018-11-06 20:00:03,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 20:00:03,519 INFO L225 Difference]: With dead ends: 257684 [2018-11-06 20:00:03,519 INFO L226 Difference]: Without dead ends: 154969 [2018-11-06 20:00:03,598 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 20:00:03,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154969 states. [2018-11-06 20:00:04,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154969 to 139365. [2018-11-06 20:00:04,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139365 states. [2018-11-06 20:00:05,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139365 states to 139365 states and 161240 transitions. [2018-11-06 20:00:05,157 INFO L78 Accepts]: Start accepts. Automaton has 139365 states and 161240 transitions. Word has length 381 [2018-11-06 20:00:05,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 20:00:05,157 INFO L480 AbstractCegarLoop]: Abstraction has 139365 states and 161240 transitions. [2018-11-06 20:00:05,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 20:00:05,158 INFO L276 IsEmpty]: Start isEmpty. Operand 139365 states and 161240 transitions. [2018-11-06 20:00:05,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2018-11-06 20:00:05,224 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 20:00:05,225 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 6, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 20:00:05,225 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 20:00:05,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 20:00:05,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1554796466, now seen corresponding path program 1 times [2018-11-06 20:00:05,226 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 20:00:05,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 20:00:05,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 20:00:05,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 20:00:05,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 20:00:05,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 20:00:05,700 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 379 proven. 6 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2018-11-06 20:00:05,701 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 20:00:05,701 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-11-06 20:00:06,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 20:00:06,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 20:00:07,007 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 20:00:07,148 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 219 proven. 0 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2018-11-06 20:00:07,169 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 20:00:07,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2018-11-06 20:00:07,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 20:00:07,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 20:00:07,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-06 20:00:07,171 INFO L87 Difference]: Start difference. First operand 139365 states and 161240 transitions. Second operand 5 states. [2018-11-06 20:00:12,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 20:00:12,148 INFO L93 Difference]: Finished difference Result 800926 states and 921990 transitions. [2018-11-06 20:00:12,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-06 20:00:12,148 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 405 [2018-11-06 20:00:12,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 20:00:13,183 INFO L225 Difference]: With dead ends: 800926 [2018-11-06 20:00:13,183 INFO L226 Difference]: Without dead ends: 661563 [2018-11-06 20:00:15,086 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 407 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-06 20:00:15,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661563 states. [2018-11-06 20:00:31,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661563 to 453574. [2018-11-06 20:00:31,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 453574 states. [2018-11-06 20:00:32,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453574 states to 453574 states and 520341 transitions. [2018-11-06 20:00:32,280 INFO L78 Accepts]: Start accepts. Automaton has 453574 states and 520341 transitions. Word has length 405 [2018-11-06 20:00:32,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 20:00:32,281 INFO L480 AbstractCegarLoop]: Abstraction has 453574 states and 520341 transitions. [2018-11-06 20:00:32,281 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 20:00:32,281 INFO L276 IsEmpty]: Start isEmpty. Operand 453574 states and 520341 transitions. [2018-11-06 20:00:32,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2018-11-06 20:00:32,398 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 20:00:32,398 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 20:00:32,399 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 20:00:32,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 20:00:32,399 INFO L82 PathProgramCache]: Analyzing trace with hash -536930713, now seen corresponding path program 1 times [2018-11-06 20:00:32,399 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 20:00:32,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 20:00:32,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 20:00:32,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 20:00:32,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 20:00:32,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 20:00:33,075 WARN L179 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-11-06 20:00:33,694 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 1 proven. 200 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2018-11-06 20:00:33,695 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 20:00:33,695 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-11-06 20:00:33,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 20:00:33,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 20:00:33,864 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 20:00:34,245 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2018-11-06 20:00:34,280 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 20:00:34,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 10 [2018-11-06 20:00:34,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-06 20:00:34,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-06 20:00:34,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-11-06 20:00:34,283 INFO L87 Difference]: Start difference. First operand 453574 states and 520341 transitions. Second operand 10 states. [2018-11-06 20:00:51,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 20:00:51,076 INFO L93 Difference]: Finished difference Result 1228680 states and 1440338 transitions. [2018-11-06 20:00:51,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-06 20:00:51,076 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 412 [2018-11-06 20:00:51,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 20:00:52,180 INFO L225 Difference]: With dead ends: 1228680 [2018-11-06 20:00:52,180 INFO L226 Difference]: Without dead ends: 775108 [2018-11-06 20:00:52,432 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 441 GetRequests, 420 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=132, Invalid=210, Unknown=0, NotChecked=0, Total=342 [2018-11-06 20:00:53,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775108 states. [2018-11-06 20:01:01,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775108 to 614930. [2018-11-06 20:01:01,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 614930 states. [2018-11-06 20:01:03,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614930 states to 614930 states and 699958 transitions. [2018-11-06 20:01:03,808 INFO L78 Accepts]: Start accepts. Automaton has 614930 states and 699958 transitions. Word has length 412 [2018-11-06 20:01:03,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 20:01:03,809 INFO L480 AbstractCegarLoop]: Abstraction has 614930 states and 699958 transitions. [2018-11-06 20:01:03,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-06 20:01:03,809 INFO L276 IsEmpty]: Start isEmpty. Operand 614930 states and 699958 transitions. [2018-11-06 20:01:03,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 424 [2018-11-06 20:01:03,916 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 20:01:03,916 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 20:01:03,917 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 20:01:03,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 20:01:03,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1998143988, now seen corresponding path program 1 times [2018-11-06 20:01:03,917 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 20:01:03,917 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 20:01:03,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 20:01:03,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 20:01:03,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 20:01:03,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 20:01:04,277 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 220 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2018-11-06 20:01:04,277 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 20:01:04,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 20:01:04,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 20:01:04,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 20:01:04,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 20:01:04,279 INFO L87 Difference]: Start difference. First operand 614930 states and 699958 transitions. Second operand 4 states. [2018-11-06 20:01:18,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 20:01:18,326 INFO L93 Difference]: Finished difference Result 1605907 states and 1821245 transitions. [2018-11-06 20:01:18,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 20:01:18,327 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 423 [2018-11-06 20:01:18,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 20:01:21,464 INFO L225 Difference]: With dead ends: 1605907 [2018-11-06 20:01:21,464 INFO L226 Difference]: Without dead ends: 991798 [2018-11-06 20:01:21,797 INFO L604 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-11-06 20:01:22,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 991798 states. [2018-11-06 20:01:35,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 991798 to 987270. [2018-11-06 20:01:35,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 987270 states. [2018-11-06 20:01:38,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 987270 states to 987270 states and 1116482 transitions. [2018-11-06 20:01:38,909 INFO L78 Accepts]: Start accepts. Automaton has 987270 states and 1116482 transitions. Word has length 423 [2018-11-06 20:01:38,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 20:01:38,909 INFO L480 AbstractCegarLoop]: Abstraction has 987270 states and 1116482 transitions. [2018-11-06 20:01:38,909 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 20:01:38,909 INFO L276 IsEmpty]: Start isEmpty. Operand 987270 states and 1116482 transitions. [2018-11-06 20:01:39,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 441 [2018-11-06 20:01:39,096 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 20:01:39,096 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 20:01:39,096 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 20:01:39,096 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 20:01:39,096 INFO L82 PathProgramCache]: Analyzing trace with hash -962808791, now seen corresponding path program 1 times [2018-11-06 20:01:39,097 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 20:01:39,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 20:01:39,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 20:01:39,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 20:01:39,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 20:01:39,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 20:01:39,385 INFO L134 CoverageAnalysis]: Checked inductivity of 447 backedges. 225 proven. 0 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2018-11-06 20:01:39,386 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 20:01:39,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 20:01:39,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 20:01:39,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 20:01:39,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 20:01:39,387 INFO L87 Difference]: Start difference. First operand 987270 states and 1116482 transitions. Second operand 3 states. [2018-11-06 20:02:00,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 20:02:00,842 INFO L93 Difference]: Finished difference Result 2494727 states and 2808160 transitions. [2018-11-06 20:02:00,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 20:02:00,843 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 440 [2018-11-06 20:02:00,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 20:02:03,359 INFO L225 Difference]: With dead ends: 2494727 [2018-11-06 20:02:03,360 INFO L226 Difference]: Without dead ends: 1507459 [2018-11-06 20:02:03,988 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 20:02:05,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1507459 states.