java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem03_label19_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 14:56:58,032 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 14:56:58,034 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 14:56:58,047 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 14:56:58,047 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 14:56:58,049 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 14:56:58,050 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 14:56:58,052 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 14:56:58,053 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 14:56:58,054 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 14:56:58,055 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 14:56:58,056 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 14:56:58,057 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 14:56:58,058 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 14:56:58,059 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 14:56:58,060 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 14:56:58,061 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 14:56:58,063 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 14:56:58,065 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 14:56:58,067 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 14:56:58,068 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 14:56:58,069 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 14:56:58,072 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 14:56:58,072 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 14:56:58,072 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 14:56:58,073 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 14:56:58,074 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 14:56:58,075 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 14:56:58,076 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 14:56:58,077 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 14:56:58,077 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 14:56:58,078 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 14:56:58,078 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 14:56:58,078 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 14:56:58,079 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 14:56:58,080 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 14:56:58,080 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-10-24 14:56:58,096 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 14:56:58,096 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 14:56:58,097 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 14:56:58,097 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-24 14:56:58,098 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-24 14:56:58,098 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-24 14:56:58,098 INFO L133 SettingsManager]: * Use SBE=true [2018-10-24 14:56:58,099 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 14:56:58,099 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 14:56:58,099 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 14:56:58,099 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 14:56:58,100 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 14:56:58,100 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 14:56:58,100 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 14:56:58,100 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 14:56:58,101 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 14:56:58,101 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 14:56:58,101 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 14:56:58,101 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 14:56:58,101 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 14:56:58,102 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 14:56:58,102 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 14:56:58,102 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 14:56:58,102 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-24 14:56:58,102 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 14:56:58,103 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 14:56:58,103 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 14:56:58,103 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 14:56:58,147 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 14:56:58,161 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 14:56:58,165 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 14:56:58,166 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 14:56:58,167 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 14:56:58,168 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label19_true-unreach-call.c [2018-10-24 14:56:58,236 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/7e8bed872/aaf1514344594e319802de5a11554bfa/FLAG3d55c1ece [2018-10-24 14:56:58,932 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 14:56:58,933 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label19_true-unreach-call.c [2018-10-24 14:56:58,956 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/7e8bed872/aaf1514344594e319802de5a11554bfa/FLAG3d55c1ece [2018-10-24 14:56:58,977 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/7e8bed872/aaf1514344594e319802de5a11554bfa [2018-10-24 14:56:58,991 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 14:56:58,993 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 14:56:58,994 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 14:56:58,995 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 14:56:58,999 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 14:56:59,000 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:56:58" (1/1) ... [2018-10-24 14:56:59,003 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f77a5a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:56:59, skipping insertion in model container [2018-10-24 14:56:59,004 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:56:58" (1/1) ... [2018-10-24 14:56:59,015 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 14:56:59,109 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 14:56:59,783 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 14:56:59,788 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 14:57:00,026 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 14:57:00,049 INFO L193 MainTranslator]: Completed translation [2018-10-24 14:57:00,050 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:57:00 WrapperNode [2018-10-24 14:57:00,050 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 14:57:00,051 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 14:57:00,051 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 14:57:00,051 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 14:57:00,062 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:57:00" (1/1) ... [2018-10-24 14:57:00,095 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:57:00" (1/1) ... [2018-10-24 14:57:00,344 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 14:57:00,345 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 14:57:00,345 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 14:57:00,345 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 14:57:00,357 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:57:00" (1/1) ... [2018-10-24 14:57:00,357 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:57:00" (1/1) ... [2018-10-24 14:57:00,364 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:57:00" (1/1) ... [2018-10-24 14:57:00,365 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:57:00" (1/1) ... [2018-10-24 14:57:00,409 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:57:00" (1/1) ... [2018-10-24 14:57:00,436 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:57:00" (1/1) ... [2018-10-24 14:57:00,450 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:57:00" (1/1) ... [2018-10-24 14:57:00,466 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 14:57:00,467 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 14:57:00,467 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 14:57:00,467 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 14:57:00,468 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:57:00" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 14:57:00,521 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-24 14:57:00,521 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 14:57:00,521 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 14:57:06,010 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 14:57:06,011 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:57:06 BoogieIcfgContainer [2018-10-24 14:57:06,011 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 14:57:06,012 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 14:57:06,012 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 14:57:06,016 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 14:57:06,016 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 02:56:58" (1/3) ... [2018-10-24 14:57:06,017 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@176e3b9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:57:06, skipping insertion in model container [2018-10-24 14:57:06,017 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:57:00" (2/3) ... [2018-10-24 14:57:06,018 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@176e3b9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:57:06, skipping insertion in model container [2018-10-24 14:57:06,018 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:57:06" (3/3) ... [2018-10-24 14:57:06,020 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label19_true-unreach-call.c [2018-10-24 14:57:06,031 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 14:57:06,042 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 14:57:06,063 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 14:57:06,102 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-24 14:57:06,103 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 14:57:06,104 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 14:57:06,104 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 14:57:06,104 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 14:57:06,104 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 14:57:06,104 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 14:57:06,104 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 14:57:06,105 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 14:57:06,132 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states. [2018-10-24 14:57:06,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-10-24 14:57:06,153 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:57:06,155 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:57:06,157 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:57:06,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:57:06,164 INFO L82 PathProgramCache]: Analyzing trace with hash -1651979548, now seen corresponding path program 1 times [2018-10-24 14:57:06,166 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:57:06,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:57:06,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:06,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:57:06,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:06,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:57:07,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:57:07,153 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:57:07,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:57:07,160 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:57:07,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:57:07,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:57:07,182 INFO L87 Difference]: Start difference. First operand 303 states. Second operand 4 states. [2018-10-24 14:57:10,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:57:10,799 INFO L93 Difference]: Finished difference Result 1075 states and 1921 transitions. [2018-10-24 14:57:10,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:57:10,801 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 188 [2018-10-24 14:57:10,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:57:10,828 INFO L225 Difference]: With dead ends: 1075 [2018-10-24 14:57:10,828 INFO L226 Difference]: Without dead ends: 765 [2018-10-24 14:57:10,833 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:57:10,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2018-10-24 14:57:10,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 520. [2018-10-24 14:57:10,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2018-10-24 14:57:10,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 853 transitions. [2018-10-24 14:57:10,916 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 853 transitions. Word has length 188 [2018-10-24 14:57:10,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:57:10,917 INFO L481 AbstractCegarLoop]: Abstraction has 520 states and 853 transitions. [2018-10-24 14:57:10,917 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:57:10,917 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 853 transitions. [2018-10-24 14:57:10,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-10-24 14:57:10,923 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:57:10,923 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:57:10,923 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:57:10,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:57:10,924 INFO L82 PathProgramCache]: Analyzing trace with hash -415975069, now seen corresponding path program 1 times [2018-10-24 14:57:10,924 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:57:10,924 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:57:10,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:10,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:57:10,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:10,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:57:11,112 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:57:11,113 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:57:11,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:57:11,118 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:57:11,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:57:11,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:57:11,119 INFO L87 Difference]: Start difference. First operand 520 states and 853 transitions. Second operand 3 states. [2018-10-24 14:57:13,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:57:13,409 INFO L93 Difference]: Finished difference Result 1465 states and 2463 transitions. [2018-10-24 14:57:13,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:57:13,410 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 197 [2018-10-24 14:57:13,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:57:13,417 INFO L225 Difference]: With dead ends: 1465 [2018-10-24 14:57:13,417 INFO L226 Difference]: Without dead ends: 947 [2018-10-24 14:57:13,421 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:57:13,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2018-10-24 14:57:13,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 931. [2018-10-24 14:57:13,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 931 states. [2018-10-24 14:57:13,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 1508 transitions. [2018-10-24 14:57:13,467 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 1508 transitions. Word has length 197 [2018-10-24 14:57:13,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:57:13,467 INFO L481 AbstractCegarLoop]: Abstraction has 931 states and 1508 transitions. [2018-10-24 14:57:13,467 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:57:13,467 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1508 transitions. [2018-10-24 14:57:13,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-10-24 14:57:13,473 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:57:13,474 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:57:13,474 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:57:13,474 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:57:13,474 INFO L82 PathProgramCache]: Analyzing trace with hash -386544841, now seen corresponding path program 1 times [2018-10-24 14:57:13,475 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:57:13,475 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:57:13,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:13,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:57:13,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:13,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:57:13,833 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-24 14:57:13,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:57:13,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:57:13,834 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:57:13,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:57:13,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:57:13,837 INFO L87 Difference]: Start difference. First operand 931 states and 1508 transitions. Second operand 3 states. [2018-10-24 14:57:20,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:57:20,320 INFO L93 Difference]: Finished difference Result 2683 states and 4400 transitions. [2018-10-24 14:57:20,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:57:20,322 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 205 [2018-10-24 14:57:20,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:57:20,335 INFO L225 Difference]: With dead ends: 2683 [2018-10-24 14:57:20,335 INFO L226 Difference]: Without dead ends: 1754 [2018-10-24 14:57:20,338 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:57:20,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1754 states. [2018-10-24 14:57:20,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1754 to 1753. [2018-10-24 14:57:20,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1753 states. [2018-10-24 14:57:20,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1753 states to 1753 states and 2648 transitions. [2018-10-24 14:57:20,397 INFO L78 Accepts]: Start accepts. Automaton has 1753 states and 2648 transitions. Word has length 205 [2018-10-24 14:57:20,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:57:20,398 INFO L481 AbstractCegarLoop]: Abstraction has 1753 states and 2648 transitions. [2018-10-24 14:57:20,398 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:57:20,398 INFO L276 IsEmpty]: Start isEmpty. Operand 1753 states and 2648 transitions. [2018-10-24 14:57:20,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-10-24 14:57:20,407 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:57:20,408 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:57:20,408 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:57:20,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:57:20,410 INFO L82 PathProgramCache]: Analyzing trace with hash -151169027, now seen corresponding path program 1 times [2018-10-24 14:57:20,410 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:57:20,410 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:57:20,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:20,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:57:20,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:20,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:57:20,604 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-24 14:57:20,604 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:57:20,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:57:20,605 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:57:20,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:57:20,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:57:20,606 INFO L87 Difference]: Start difference. First operand 1753 states and 2648 transitions. Second operand 3 states. [2018-10-24 14:57:22,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:57:22,943 INFO L93 Difference]: Finished difference Result 5139 states and 7808 transitions. [2018-10-24 14:57:22,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:57:22,944 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 212 [2018-10-24 14:57:22,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:57:22,964 INFO L225 Difference]: With dead ends: 5139 [2018-10-24 14:57:22,964 INFO L226 Difference]: Without dead ends: 3388 [2018-10-24 14:57:22,968 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:57:22,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3388 states. [2018-10-24 14:57:23,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3388 to 3385. [2018-10-24 14:57:23,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3385 states. [2018-10-24 14:57:23,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3385 states to 3385 states and 4616 transitions. [2018-10-24 14:57:23,090 INFO L78 Accepts]: Start accepts. Automaton has 3385 states and 4616 transitions. Word has length 212 [2018-10-24 14:57:23,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:57:23,090 INFO L481 AbstractCegarLoop]: Abstraction has 3385 states and 4616 transitions. [2018-10-24 14:57:23,090 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:57:23,090 INFO L276 IsEmpty]: Start isEmpty. Operand 3385 states and 4616 transitions. [2018-10-24 14:57:23,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-10-24 14:57:23,099 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:57:23,100 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:57:23,100 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:57:23,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:57:23,100 INFO L82 PathProgramCache]: Analyzing trace with hash 1536549167, now seen corresponding path program 1 times [2018-10-24 14:57:23,101 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:57:23,101 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:57:23,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:23,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:57:23,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:23,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:57:23,404 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:57:23,404 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:57:23,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:57:23,405 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:57:23,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:57:23,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:57:23,406 INFO L87 Difference]: Start difference. First operand 3385 states and 4616 transitions. Second operand 4 states. [2018-10-24 14:57:25,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:57:25,594 INFO L93 Difference]: Finished difference Result 13364 states and 18287 transitions. [2018-10-24 14:57:25,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:57:25,595 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 215 [2018-10-24 14:57:25,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:57:25,638 INFO L225 Difference]: With dead ends: 13364 [2018-10-24 14:57:25,639 INFO L226 Difference]: Without dead ends: 9981 [2018-10-24 14:57:25,646 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:57:25,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9981 states. [2018-10-24 14:57:25,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9981 to 6649. [2018-10-24 14:57:25,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6649 states. [2018-10-24 14:57:25,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6649 states to 6649 states and 8879 transitions. [2018-10-24 14:57:25,792 INFO L78 Accepts]: Start accepts. Automaton has 6649 states and 8879 transitions. Word has length 215 [2018-10-24 14:57:25,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:57:25,792 INFO L481 AbstractCegarLoop]: Abstraction has 6649 states and 8879 transitions. [2018-10-24 14:57:25,792 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:57:25,792 INFO L276 IsEmpty]: Start isEmpty. Operand 6649 states and 8879 transitions. [2018-10-24 14:57:25,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-10-24 14:57:25,808 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:57:25,808 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:57:25,809 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:57:25,809 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:57:25,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1248571006, now seen corresponding path program 1 times [2018-10-24 14:57:25,809 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:57:25,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:57:25,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:25,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:57:25,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:25,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:57:26,069 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:57:26,069 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:57:26,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:57:26,070 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:57:26,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:57:26,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:57:26,071 INFO L87 Difference]: Start difference. First operand 6649 states and 8879 transitions. Second operand 4 states. [2018-10-24 14:57:28,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:57:28,150 INFO L93 Difference]: Finished difference Result 16563 states and 22621 transitions. [2018-10-24 14:57:28,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:57:28,151 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 216 [2018-10-24 14:57:28,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:57:28,185 INFO L225 Difference]: With dead ends: 16563 [2018-10-24 14:57:28,186 INFO L226 Difference]: Without dead ends: 9916 [2018-10-24 14:57:28,196 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:57:28,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9916 states. [2018-10-24 14:57:28,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9916 to 9913. [2018-10-24 14:57:28,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9913 states. [2018-10-24 14:57:28,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9913 states to 9913 states and 12603 transitions. [2018-10-24 14:57:28,352 INFO L78 Accepts]: Start accepts. Automaton has 9913 states and 12603 transitions. Word has length 216 [2018-10-24 14:57:28,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:57:28,352 INFO L481 AbstractCegarLoop]: Abstraction has 9913 states and 12603 transitions. [2018-10-24 14:57:28,352 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:57:28,353 INFO L276 IsEmpty]: Start isEmpty. Operand 9913 states and 12603 transitions. [2018-10-24 14:57:28,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-10-24 14:57:28,370 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:57:28,370 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:57:28,371 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:57:28,371 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:57:28,371 INFO L82 PathProgramCache]: Analyzing trace with hash 20567018, now seen corresponding path program 1 times [2018-10-24 14:57:28,371 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:57:28,372 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:57:28,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:28,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:57:28,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:28,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:57:28,610 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:57:28,611 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:57:28,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:57:28,612 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:57:28,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:57:28,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:57:28,613 INFO L87 Difference]: Start difference. First operand 9913 states and 12603 transitions. Second operand 3 states. [2018-10-24 14:57:30,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:57:30,656 INFO L93 Difference]: Finished difference Result 24787 states and 31363 transitions. [2018-10-24 14:57:30,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:57:30,657 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 217 [2018-10-24 14:57:30,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:57:30,696 INFO L225 Difference]: With dead ends: 24787 [2018-10-24 14:57:30,697 INFO L226 Difference]: Without dead ends: 14876 [2018-10-24 14:57:30,709 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:57:30,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14876 states. [2018-10-24 14:57:30,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14876 to 14871. [2018-10-24 14:57:30,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14871 states. [2018-10-24 14:57:30,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14871 states to 14871 states and 18725 transitions. [2018-10-24 14:57:30,914 INFO L78 Accepts]: Start accepts. Automaton has 14871 states and 18725 transitions. Word has length 217 [2018-10-24 14:57:30,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:57:30,915 INFO L481 AbstractCegarLoop]: Abstraction has 14871 states and 18725 transitions. [2018-10-24 14:57:30,915 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:57:30,915 INFO L276 IsEmpty]: Start isEmpty. Operand 14871 states and 18725 transitions. [2018-10-24 14:57:30,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2018-10-24 14:57:30,940 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:57:30,941 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:57:30,941 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:57:30,941 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:57:30,941 INFO L82 PathProgramCache]: Analyzing trace with hash 796111806, now seen corresponding path program 1 times [2018-10-24 14:57:30,942 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:57:30,942 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:57:30,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:30,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:57:30,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:30,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:57:31,426 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 39 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:57:31,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 14:57:31,426 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 14:57:31,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:57:31,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:57:31,593 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 14:57:31,743 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:57:31,776 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 14:57:31,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2018-10-24 14:57:31,777 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-24 14:57:31,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-24 14:57:31,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-24 14:57:31,778 INFO L87 Difference]: Start difference. First operand 14871 states and 18725 transitions. Second operand 7 states. [2018-10-24 14:57:32,645 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-10-24 14:57:41,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:57:41,057 INFO L93 Difference]: Finished difference Result 85717 states and 107159 transitions. [2018-10-24 14:57:41,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-24 14:57:41,058 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 225 [2018-10-24 14:57:41,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:57:41,183 INFO L225 Difference]: With dead ends: 85717 [2018-10-24 14:57:41,183 INFO L226 Difference]: Without dead ends: 70847 [2018-10-24 14:57:41,213 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2018-10-24 14:57:41,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70847 states. [2018-10-24 14:57:42,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70847 to 70816. [2018-10-24 14:57:42,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70816 states. [2018-10-24 14:57:42,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70816 states to 70816 states and 83436 transitions. [2018-10-24 14:57:42,438 INFO L78 Accepts]: Start accepts. Automaton has 70816 states and 83436 transitions. Word has length 225 [2018-10-24 14:57:42,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:57:42,438 INFO L481 AbstractCegarLoop]: Abstraction has 70816 states and 83436 transitions. [2018-10-24 14:57:42,438 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-24 14:57:42,438 INFO L276 IsEmpty]: Start isEmpty. Operand 70816 states and 83436 transitions. [2018-10-24 14:57:42,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2018-10-24 14:57:42,524 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:57:42,524 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:57:42,525 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:57:42,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:57:42,525 INFO L82 PathProgramCache]: Analyzing trace with hash 314218943, now seen corresponding path program 1 times [2018-10-24 14:57:42,525 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:57:42,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:57:42,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:42,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:57:42,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:42,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:57:42,700 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-10-24 14:57:42,701 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:57:42,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:57:42,702 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:57:42,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:57:42,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:57:42,702 INFO L87 Difference]: Start difference. First operand 70816 states and 83436 transitions. Second operand 3 states. [2018-10-24 14:57:44,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:57:44,249 INFO L93 Difference]: Finished difference Result 133770 states and 157213 transitions. [2018-10-24 14:57:44,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:57:44,256 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 233 [2018-10-24 14:57:44,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:57:44,384 INFO L225 Difference]: With dead ends: 133770 [2018-10-24 14:57:44,385 INFO L226 Difference]: Without dead ends: 62956 [2018-10-24 14:57:44,449 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:57:44,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62956 states. [2018-10-24 14:57:45,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62956 to 62956. [2018-10-24 14:57:45,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62956 states. [2018-10-24 14:57:45,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62956 states to 62956 states and 72561 transitions. [2018-10-24 14:57:45,329 INFO L78 Accepts]: Start accepts. Automaton has 62956 states and 72561 transitions. Word has length 233 [2018-10-24 14:57:45,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:57:45,330 INFO L481 AbstractCegarLoop]: Abstraction has 62956 states and 72561 transitions. [2018-10-24 14:57:45,330 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:57:45,330 INFO L276 IsEmpty]: Start isEmpty. Operand 62956 states and 72561 transitions. [2018-10-24 14:57:45,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-10-24 14:57:45,349 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:57:45,349 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:57:45,349 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:57:45,350 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:57:45,350 INFO L82 PathProgramCache]: Analyzing trace with hash 919990258, now seen corresponding path program 1 times [2018-10-24 14:57:45,350 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:57:45,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:57:45,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:45,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:57:45,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:45,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:57:45,526 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-24 14:57:45,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:57:45,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:57:45,527 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:57:45,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:57:45,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:57:45,528 INFO L87 Difference]: Start difference. First operand 62956 states and 72561 transitions. Second operand 3 states. [2018-10-24 14:57:47,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:57:47,007 INFO L93 Difference]: Finished difference Result 125920 states and 145137 transitions. [2018-10-24 14:57:47,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:57:47,007 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 236 [2018-10-24 14:57:47,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:57:47,083 INFO L225 Difference]: With dead ends: 125920 [2018-10-24 14:57:47,083 INFO L226 Difference]: Without dead ends: 62966 [2018-10-24 14:57:47,596 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:57:47,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62966 states. [2018-10-24 14:57:48,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62966 to 62956. [2018-10-24 14:57:48,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62956 states. [2018-10-24 14:57:48,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62956 states to 62956 states and 70389 transitions. [2018-10-24 14:57:48,346 INFO L78 Accepts]: Start accepts. Automaton has 62956 states and 70389 transitions. Word has length 236 [2018-10-24 14:57:48,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:57:48,346 INFO L481 AbstractCegarLoop]: Abstraction has 62956 states and 70389 transitions. [2018-10-24 14:57:48,346 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:57:48,346 INFO L276 IsEmpty]: Start isEmpty. Operand 62956 states and 70389 transitions. [2018-10-24 14:57:48,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2018-10-24 14:57:48,360 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:57:48,360 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:57:48,361 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:57:48,361 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:57:48,361 INFO L82 PathProgramCache]: Analyzing trace with hash 746073851, now seen corresponding path program 1 times [2018-10-24 14:57:48,361 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:57:48,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:57:48,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:48,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:57:48,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:48,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:57:48,566 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2018-10-24 14:57:48,567 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:57:48,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:57:48,567 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:57:48,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:57:48,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:57:48,568 INFO L87 Difference]: Start difference. First operand 62956 states and 70389 transitions. Second operand 4 states. [2018-10-24 14:57:50,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:57:50,080 INFO L93 Difference]: Finished difference Result 125910 states and 140776 transitions. [2018-10-24 14:57:50,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:57:50,081 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 268 [2018-10-24 14:57:50,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:57:50,146 INFO L225 Difference]: With dead ends: 125910 [2018-10-24 14:57:50,146 INFO L226 Difference]: Without dead ends: 62956 [2018-10-24 14:57:50,185 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:57:50,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62956 states. [2018-10-24 14:57:50,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62956 to 62956. [2018-10-24 14:57:50,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62956 states. [2018-10-24 14:57:50,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62956 states to 62956 states and 69803 transitions. [2018-10-24 14:57:50,908 INFO L78 Accepts]: Start accepts. Automaton has 62956 states and 69803 transitions. Word has length 268 [2018-10-24 14:57:50,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:57:50,909 INFO L481 AbstractCegarLoop]: Abstraction has 62956 states and 69803 transitions. [2018-10-24 14:57:50,909 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:57:50,909 INFO L276 IsEmpty]: Start isEmpty. Operand 62956 states and 69803 transitions. [2018-10-24 14:57:50,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2018-10-24 14:57:50,927 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:57:50,927 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:57:50,928 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:57:50,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:57:50,928 INFO L82 PathProgramCache]: Analyzing trace with hash 1304177161, now seen corresponding path program 1 times [2018-10-24 14:57:50,928 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:57:50,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:57:50,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:50,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:57:50,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:50,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:57:52,117 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:57:52,117 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:57:52,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-24 14:57:52,117 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 14:57:52,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 14:57:52,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-10-24 14:57:52,118 INFO L87 Difference]: Start difference. First operand 62956 states and 69803 transitions. Second operand 6 states. [2018-10-24 14:57:55,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:57:55,728 INFO L93 Difference]: Finished difference Result 247568 states and 271778 transitions. [2018-10-24 14:57:55,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-24 14:57:55,729 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 269 [2018-10-24 14:57:55,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:57:55,918 INFO L225 Difference]: With dead ends: 247568 [2018-10-24 14:57:55,918 INFO L226 Difference]: Without dead ends: 184614 [2018-10-24 14:57:55,978 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-10-24 14:57:56,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184614 states. [2018-10-24 14:57:58,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184614 to 184601. [2018-10-24 14:57:58,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184601 states. [2018-10-24 14:57:58,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184601 states to 184601 states and 201709 transitions. [2018-10-24 14:57:58,758 INFO L78 Accepts]: Start accepts. Automaton has 184601 states and 201709 transitions. Word has length 269 [2018-10-24 14:57:58,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:57:58,758 INFO L481 AbstractCegarLoop]: Abstraction has 184601 states and 201709 transitions. [2018-10-24 14:57:58,758 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 14:57:58,758 INFO L276 IsEmpty]: Start isEmpty. Operand 184601 states and 201709 transitions. [2018-10-24 14:57:58,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2018-10-24 14:57:58,782 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:57:58,783 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:57:58,783 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:57:58,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:57:58,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1987275286, now seen corresponding path program 1 times [2018-10-24 14:57:58,784 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:57:58,784 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:57:58,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:58,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:57:58,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:58,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:57:59,153 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2018-10-24 14:57:59,153 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:57:59,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:57:59,154 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:57:59,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:57:59,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:57:59,155 INFO L87 Difference]: Start difference. First operand 184601 states and 201709 transitions. Second operand 4 states. [2018-10-24 14:58:05,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:58:05,382 INFO L93 Difference]: Finished difference Result 676072 states and 737797 transitions. [2018-10-24 14:58:05,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:58:05,383 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 270 [2018-10-24 14:58:05,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:58:06,191 INFO L225 Difference]: With dead ends: 676072 [2018-10-24 14:58:06,191 INFO L226 Difference]: Without dead ends: 491473 [2018-10-24 14:58:06,364 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:58:06,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491473 states. [2018-10-24 14:58:13,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491473 to 491469. [2018-10-24 14:58:13,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 491469 states. [2018-10-24 14:58:14,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491469 states to 491469 states and 535446 transitions. [2018-10-24 14:58:14,142 INFO L78 Accepts]: Start accepts. Automaton has 491469 states and 535446 transitions. Word has length 270 [2018-10-24 14:58:14,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:58:14,142 INFO L481 AbstractCegarLoop]: Abstraction has 491469 states and 535446 transitions. [2018-10-24 14:58:14,142 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:58:14,142 INFO L276 IsEmpty]: Start isEmpty. Operand 491469 states and 535446 transitions. [2018-10-24 14:58:14,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-10-24 14:58:14,162 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:58:14,162 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:58:14,162 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:58:14,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:58:14,163 INFO L82 PathProgramCache]: Analyzing trace with hash -1412233061, now seen corresponding path program 1 times [2018-10-24 14:58:14,163 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:58:14,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:58:14,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:58:14,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:58:14,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:58:14,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:58:14,374 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:58:14,374 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:58:14,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:58:14,375 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:58:14,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:58:14,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:58:14,376 INFO L87 Difference]: Start difference. First operand 491469 states and 535446 transitions. Second operand 4 states. [2018-10-24 14:58:26,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:58:26,009 INFO L93 Difference]: Finished difference Result 1033233 states and 1126792 transitions. [2018-10-24 14:58:26,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:58:26,010 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 292 [2018-10-24 14:58:26,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:58:26,677 INFO L225 Difference]: With dead ends: 1033233 [2018-10-24 14:58:26,678 INFO L226 Difference]: Without dead ends: 541766 [2018-10-24 14:58:26,941 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:58:27,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541766 states. [2018-10-24 14:58:34,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541766 to 535109. [2018-10-24 14:58:34,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 535109 states. [2018-10-24 14:58:36,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535109 states to 535109 states and 577854 transitions. [2018-10-24 14:58:36,316 INFO L78 Accepts]: Start accepts. Automaton has 535109 states and 577854 transitions. Word has length 292 [2018-10-24 14:58:36,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:58:36,316 INFO L481 AbstractCegarLoop]: Abstraction has 535109 states and 577854 transitions. [2018-10-24 14:58:36,317 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:58:36,317 INFO L276 IsEmpty]: Start isEmpty. Operand 535109 states and 577854 transitions. [2018-10-24 14:58:36,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2018-10-24 14:58:36,353 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:58:36,353 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 14:58:36,354 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:58:36,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:58:36,354 INFO L82 PathProgramCache]: Analyzing trace with hash 19981777, now seen corresponding path program 1 times [2018-10-24 14:58:36,354 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:58:36,354 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:58:36,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:58:36,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:58:36,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:58:36,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:58:37,152 WARN L179 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 8 [2018-10-24 14:58:37,345 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 156 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:58:37,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 14:58:37,345 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 14:58:37,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:58:37,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:58:37,540 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 14:58:37,766 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 157 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-24 14:58:37,797 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 14:58:37,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2018-10-24 14:58:37,801 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-24 14:58:37,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-24 14:58:37,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-24 14:58:37,802 INFO L87 Difference]: Start difference. First operand 535109 states and 577854 transitions. Second operand 7 states. [2018-10-24 14:58:54,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:58:54,271 INFO L93 Difference]: Finished difference Result 1321746 states and 1433809 transitions. [2018-10-24 14:58:54,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-24 14:58:54,271 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 344 [2018-10-24 14:58:54,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:58:55,505 INFO L225 Difference]: With dead ends: 1321746 [2018-10-24 14:58:55,506 INFO L226 Difference]: Without dead ends: 786639 [2018-10-24 14:58:55,842 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 351 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2018-10-24 14:58:56,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 786639 states. [2018-10-24 14:59:15,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 786639 to 712980. [2018-10-24 14:59:15,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 712980 states. [2018-10-24 14:59:17,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712980 states to 712980 states and 761918 transitions. [2018-10-24 14:59:17,826 INFO L78 Accepts]: Start accepts. Automaton has 712980 states and 761918 transitions. Word has length 344 [2018-10-24 14:59:17,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:59:17,826 INFO L481 AbstractCegarLoop]: Abstraction has 712980 states and 761918 transitions. [2018-10-24 14:59:17,826 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-24 14:59:17,826 INFO L276 IsEmpty]: Start isEmpty. Operand 712980 states and 761918 transitions. [2018-10-24 14:59:17,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2018-10-24 14:59:17,897 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:59:17,898 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 14:59:17,898 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:59:17,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:59:17,898 INFO L82 PathProgramCache]: Analyzing trace with hash 221744449, now seen corresponding path program 1 times [2018-10-24 14:59:17,898 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:59:17,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:59:17,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:59:17,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:59:17,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:59:17,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:59:18,234 INFO L134 CoverageAnalysis]: Checked inductivity of 501 backedges. 294 proven. 0 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2018-10-24 14:59:18,234 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:59:18,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:59:18,235 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:59:18,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:59:18,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:59:18,236 INFO L87 Difference]: Start difference. First operand 712980 states and 761918 transitions. Second operand 3 states. [2018-10-24 14:59:26,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:59:26,828 INFO L93 Difference]: Finished difference Result 1745912 states and 1861654 transitions. [2018-10-24 14:59:28,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:59:28,545 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 437 [2018-10-24 14:59:28,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:59:30,081 INFO L225 Difference]: With dead ends: 1745912 [2018-10-24 14:59:30,082 INFO L226 Difference]: Without dead ends: 1032934 [2018-10-24 14:59:30,307 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:59:31,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1032934 states. [2018-10-24 14:59:57,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1032934 to 1030429. [2018-10-24 14:59:57,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1030429 states. [2018-10-24 15:00:01,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1030429 states to 1030429 states and 1097027 transitions. [2018-10-24 15:00:01,173 INFO L78 Accepts]: Start accepts. Automaton has 1030429 states and 1097027 transitions. Word has length 437 [2018-10-24 15:00:01,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:00:01,173 INFO L481 AbstractCegarLoop]: Abstraction has 1030429 states and 1097027 transitions. [2018-10-24 15:00:01,173 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 15:00:01,173 INFO L276 IsEmpty]: Start isEmpty. Operand 1030429 states and 1097027 transitions. [2018-10-24 15:00:01,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2018-10-24 15:00:01,308 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:00:01,308 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 15:00:01,309 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:00:01,309 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:00:01,309 INFO L82 PathProgramCache]: Analyzing trace with hash 310016055, now seen corresponding path program 1 times [2018-10-24 15:00:01,309 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:00:01,310 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:00:01,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:00:01,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:00:01,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:00:01,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:00:01,689 INFO L134 CoverageAnalysis]: Checked inductivity of 587 backedges. 434 proven. 0 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2018-10-24 15:00:01,689 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:00:01,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 15:00:01,690 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 15:00:01,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 15:00:01,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 15:00:01,691 INFO L87 Difference]: Start difference. First operand 1030429 states and 1097027 transitions. Second operand 3 states. [2018-10-24 15:00:11,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:00:11,255 INFO L93 Difference]: Finished difference Result 1821846 states and 1939170 transitions. [2018-10-24 15:00:11,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 15:00:11,256 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 476 [2018-10-24 15:00:11,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:00:12,297 INFO L225 Difference]: With dead ends: 1821846 [2018-10-24 15:00:12,297 INFO L226 Difference]: Without dead ends: 791419 [2018-10-24 15:00:12,590 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 15:00:13,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791419 states.