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_label24_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 14:57:14,166 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 14:57:14,169 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 14:57:14,181 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 14:57:14,182 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 14:57:14,183 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 14:57:14,185 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 14:57:14,186 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 14:57:14,188 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 14:57:14,189 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 14:57:14,190 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 14:57:14,191 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 14:57:14,192 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 14:57:14,193 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 14:57:14,194 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 14:57:14,195 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 14:57:14,196 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 14:57:14,198 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 14:57:14,199 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 14:57:14,201 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 14:57:14,202 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 14:57:14,204 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 14:57:14,206 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 14:57:14,207 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 14:57:14,207 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 14:57:14,208 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 14:57:14,209 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 14:57:14,210 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 14:57:14,211 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 14:57:14,212 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 14:57:14,212 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 14:57:14,213 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 14:57:14,213 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 14:57:14,213 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 14:57:14,214 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 14:57:14,215 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 14:57:14,216 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:57:14,232 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 14:57:14,232 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 14:57:14,233 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 14:57:14,233 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-24 14:57:14,234 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-24 14:57:14,234 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-24 14:57:14,234 INFO L133 SettingsManager]: * Use SBE=true [2018-10-24 14:57:14,235 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 14:57:14,235 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 14:57:14,235 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 14:57:14,235 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 14:57:14,236 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 14:57:14,236 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 14:57:14,236 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 14:57:14,236 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 14:57:14,236 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 14:57:14,237 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 14:57:14,237 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 14:57:14,237 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 14:57:14,237 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 14:57:14,238 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 14:57:14,238 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 14:57:14,238 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 14:57:14,238 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-24 14:57:14,238 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 14:57:14,239 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 14:57:14,239 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 14:57:14,239 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 14:57:14,284 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 14:57:14,298 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 14:57:14,301 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 14:57:14,303 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 14:57:14,304 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 14:57:14,304 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label24_true-unreach-call.c [2018-10-24 14:57:14,373 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/b7de23bdf/b35f33dcc03645039ea2e8d90861ead0/FLAGfdab07755 [2018-10-24 14:57:15,028 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 14:57:15,032 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label24_true-unreach-call.c [2018-10-24 14:57:15,054 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/b7de23bdf/b35f33dcc03645039ea2e8d90861ead0/FLAGfdab07755 [2018-10-24 14:57:15,073 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/b7de23bdf/b35f33dcc03645039ea2e8d90861ead0 [2018-10-24 14:57:15,085 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 14:57:15,086 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 14:57:15,087 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 14:57:15,088 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 14:57:15,091 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 14:57:15,093 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:57:15" (1/1) ... [2018-10-24 14:57:15,096 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b2e66ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:57:15, skipping insertion in model container [2018-10-24 14:57:15,096 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:57:15" (1/1) ... [2018-10-24 14:57:15,106 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 14:57:15,202 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 14:57:15,971 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 14:57:15,977 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 14:57:16,240 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 14:57:16,266 INFO L193 MainTranslator]: Completed translation [2018-10-24 14:57:16,267 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:57:16 WrapperNode [2018-10-24 14:57:16,268 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 14:57:16,269 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 14:57:16,269 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 14:57:16,269 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 14:57:16,282 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:16" (1/1) ... [2018-10-24 14:57:16,322 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:16" (1/1) ... [2018-10-24 14:57:16,584 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 14:57:16,585 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 14:57:16,585 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 14:57:16,585 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 14:57:16,599 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:16" (1/1) ... [2018-10-24 14:57:16,600 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:16" (1/1) ... [2018-10-24 14:57:16,607 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:16" (1/1) ... [2018-10-24 14:57:16,609 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:16" (1/1) ... [2018-10-24 14:57:16,670 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:16" (1/1) ... [2018-10-24 14:57:16,692 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:16" (1/1) ... [2018-10-24 14:57:16,714 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:16" (1/1) ... [2018-10-24 14:57:16,727 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 14:57:16,728 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 14:57:16,728 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 14:57:16,728 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 14:57:16,729 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:57:16" (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:16,797 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-24 14:57:16,797 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 14:57:16,798 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 14:57:22,211 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 14:57:22,212 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:57:22 BoogieIcfgContainer [2018-10-24 14:57:22,212 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 14:57:22,214 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 14:57:22,214 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 14:57:22,217 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 14:57:22,218 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 02:57:15" (1/3) ... [2018-10-24 14:57:22,219 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4862146d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:57:22, skipping insertion in model container [2018-10-24 14:57:22,219 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:57:16" (2/3) ... [2018-10-24 14:57:22,219 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4862146d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:57:22, skipping insertion in model container [2018-10-24 14:57:22,220 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:57:22" (3/3) ... [2018-10-24 14:57:22,221 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label24_true-unreach-call.c [2018-10-24 14:57:22,232 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 14:57:22,246 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 14:57:22,264 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 14:57:22,302 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-24 14:57:22,303 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 14:57:22,303 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 14:57:22,303 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 14:57:22,304 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 14:57:22,304 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 14:57:22,305 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 14:57:22,305 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 14:57:22,305 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 14:57:22,341 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states. [2018-10-24 14:57:22,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-10-24 14:57:22,368 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:57:22,369 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:57:22,371 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:57:22,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:57:22,376 INFO L82 PathProgramCache]: Analyzing trace with hash -835830156, now seen corresponding path program 1 times [2018-10-24 14:57:22,378 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:57:22,379 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:57:22,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:22,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:57:22,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:22,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:57:23,246 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-10-24 14:57:23,337 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:23,340 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:57:23,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:57:23,347 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:57:23,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:57:23,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:57:23,366 INFO L87 Difference]: Start difference. First operand 303 states. Second operand 4 states. [2018-10-24 14:57:27,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:57:27,055 INFO L93 Difference]: Finished difference Result 1027 states and 1865 transitions. [2018-10-24 14:57:27,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:57:27,058 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 192 [2018-10-24 14:57:27,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:57:27,084 INFO L225 Difference]: With dead ends: 1027 [2018-10-24 14:57:27,084 INFO L226 Difference]: Without dead ends: 717 [2018-10-24 14:57:27,089 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:57:27,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2018-10-24 14:57:27,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 715. [2018-10-24 14:57:27,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 715 states. [2018-10-24 14:57:27,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 1145 transitions. [2018-10-24 14:57:27,178 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 1145 transitions. Word has length 192 [2018-10-24 14:57:27,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:57:27,180 INFO L481 AbstractCegarLoop]: Abstraction has 715 states and 1145 transitions. [2018-10-24 14:57:27,180 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:57:27,180 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1145 transitions. [2018-10-24 14:57:27,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-10-24 14:57:27,188 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:57:27,188 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:57:27,188 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:57:27,189 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:57:27,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1798362483, now seen corresponding path program 1 times [2018-10-24 14:57:27,189 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:57:27,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:57:27,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:27,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:57:27,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:27,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:57:27,327 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:27,327 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:57:27,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:57:27,330 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:57:27,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:57:27,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:57:27,331 INFO L87 Difference]: Start difference. First operand 715 states and 1145 transitions. Second operand 3 states. [2018-10-24 14:57:29,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:57:29,168 INFO L93 Difference]: Finished difference Result 2058 states and 3347 transitions. [2018-10-24 14:57:29,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:57:29,168 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 201 [2018-10-24 14:57:29,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:57:29,177 INFO L225 Difference]: With dead ends: 2058 [2018-10-24 14:57:29,177 INFO L226 Difference]: Without dead ends: 1345 [2018-10-24 14:57:29,181 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:29,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1345 states. [2018-10-24 14:57:29,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1345 to 1331. [2018-10-24 14:57:29,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1331 states. [2018-10-24 14:57:29,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1331 states to 1331 states and 2076 transitions. [2018-10-24 14:57:29,235 INFO L78 Accepts]: Start accepts. Automaton has 1331 states and 2076 transitions. Word has length 201 [2018-10-24 14:57:29,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:57:29,235 INFO L481 AbstractCegarLoop]: Abstraction has 1331 states and 2076 transitions. [2018-10-24 14:57:29,236 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:57:29,236 INFO L276 IsEmpty]: Start isEmpty. Operand 1331 states and 2076 transitions. [2018-10-24 14:57:29,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-10-24 14:57:29,241 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:57:29,242 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, 1, 1, 1, 1] [2018-10-24 14:57:29,242 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:57:29,242 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:57:29,243 INFO L82 PathProgramCache]: Analyzing trace with hash -1616061113, now seen corresponding path program 1 times [2018-10-24 14:57:29,243 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:57:29,243 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:57:29,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:29,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:57:29,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:29,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:57:29,549 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:29,549 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:57:29,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:57:29,550 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:57:29,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:57:29,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:57:29,551 INFO L87 Difference]: Start difference. First operand 1331 states and 2076 transitions. Second operand 3 states. [2018-10-24 14:57:32,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:57:32,845 INFO L93 Difference]: Finished difference Result 3896 states and 6120 transitions. [2018-10-24 14:57:32,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:57:32,846 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 209 [2018-10-24 14:57:32,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:57:32,860 INFO L225 Difference]: With dead ends: 3896 [2018-10-24 14:57:32,860 INFO L226 Difference]: Without dead ends: 2567 [2018-10-24 14:57:32,863 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:32,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2567 states. [2018-10-24 14:57:32,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2567 to 2565. [2018-10-24 14:57:32,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2565 states. [2018-10-24 14:57:32,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2565 states to 2565 states and 3748 transitions. [2018-10-24 14:57:32,916 INFO L78 Accepts]: Start accepts. Automaton has 2565 states and 3748 transitions. Word has length 209 [2018-10-24 14:57:32,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:57:32,916 INFO L481 AbstractCegarLoop]: Abstraction has 2565 states and 3748 transitions. [2018-10-24 14:57:32,917 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:57:32,917 INFO L276 IsEmpty]: Start isEmpty. Operand 2565 states and 3748 transitions. [2018-10-24 14:57:32,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-10-24 14:57:32,924 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:57:32,924 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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, 1, 1, 1] [2018-10-24 14:57:32,925 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:57:32,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:57:32,925 INFO L82 PathProgramCache]: Analyzing trace with hash 1010119963, now seen corresponding path program 1 times [2018-10-24 14:57:32,925 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:57:32,926 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:57:32,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:32,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:57:32,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:32,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:57:33,149 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-24 14:57:33,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:57:33,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:57:33,150 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:57:33,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:57:33,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:57:33,151 INFO L87 Difference]: Start difference. First operand 2565 states and 3748 transitions. Second operand 4 states. [2018-10-24 14:57:34,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:57:34,668 INFO L93 Difference]: Finished difference Result 5099 states and 7455 transitions. [2018-10-24 14:57:34,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:57:34,668 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 220 [2018-10-24 14:57:34,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:57:34,682 INFO L225 Difference]: With dead ends: 5099 [2018-10-24 14:57:34,683 INFO L226 Difference]: Without dead ends: 2536 [2018-10-24 14:57:34,687 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:57:34,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2536 states. [2018-10-24 14:57:34,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2536 to 2536. [2018-10-24 14:57:34,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2536 states. [2018-10-24 14:57:34,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2536 states to 2536 states and 3609 transitions. [2018-10-24 14:57:34,743 INFO L78 Accepts]: Start accepts. Automaton has 2536 states and 3609 transitions. Word has length 220 [2018-10-24 14:57:34,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:57:34,744 INFO L481 AbstractCegarLoop]: Abstraction has 2536 states and 3609 transitions. [2018-10-24 14:57:34,744 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:57:34,745 INFO L276 IsEmpty]: Start isEmpty. Operand 2536 states and 3609 transitions. [2018-10-24 14:57:34,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-10-24 14:57:34,753 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:57:34,753 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:57:34,753 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:57:34,753 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:57:34,754 INFO L82 PathProgramCache]: Analyzing trace with hash 326840886, now seen corresponding path program 1 times [2018-10-24 14:57:34,754 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:57:34,754 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:57:34,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:34,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:57:34,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:34,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:57:35,189 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-24 14:57:35,190 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:57:35,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:57:35,191 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:57:35,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:57:35,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:57:35,191 INFO L87 Difference]: Start difference. First operand 2536 states and 3609 transitions. Second operand 4 states. [2018-10-24 14:57:38,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:57:38,332 INFO L93 Difference]: Finished difference Result 10131 states and 14422 transitions. [2018-10-24 14:57:38,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:57:38,334 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 222 [2018-10-24 14:57:38,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:57:38,367 INFO L225 Difference]: With dead ends: 10131 [2018-10-24 14:57:38,367 INFO L226 Difference]: Without dead ends: 7597 [2018-10-24 14:57:38,373 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:57:38,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7597 states. [2018-10-24 14:57:38,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7597 to 7593. [2018-10-24 14:57:38,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7593 states. [2018-10-24 14:57:38,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7593 states to 7593 states and 10758 transitions. [2018-10-24 14:57:38,516 INFO L78 Accepts]: Start accepts. Automaton has 7593 states and 10758 transitions. Word has length 222 [2018-10-24 14:57:38,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:57:38,517 INFO L481 AbstractCegarLoop]: Abstraction has 7593 states and 10758 transitions. [2018-10-24 14:57:38,517 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:57:38,517 INFO L276 IsEmpty]: Start isEmpty. Operand 7593 states and 10758 transitions. [2018-10-24 14:57:38,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-10-24 14:57:38,529 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:57:38,529 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1] [2018-10-24 14:57:38,530 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:57:38,530 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:57:38,530 INFO L82 PathProgramCache]: Analyzing trace with hash -2017837485, now seen corresponding path program 1 times [2018-10-24 14:57:38,530 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:57:38,531 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:57:38,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:38,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:57:38,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:38,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:57:38,695 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-24 14:57:38,696 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:57:38,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:57:38,696 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:57:38,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:57:38,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:57:38,697 INFO L87 Difference]: Start difference. First operand 7593 states and 10758 transitions. Second operand 3 states. [2018-10-24 14:57:40,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:57:40,145 INFO L93 Difference]: Finished difference Result 15190 states and 21526 transitions. [2018-10-24 14:57:40,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:57:40,146 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 227 [2018-10-24 14:57:40,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:57:40,171 INFO L225 Difference]: With dead ends: 15190 [2018-10-24 14:57:40,171 INFO L226 Difference]: Without dead ends: 7599 [2018-10-24 14:57:40,182 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:40,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7599 states. [2018-10-24 14:57:40,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7599 to 7593. [2018-10-24 14:57:40,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7593 states. [2018-10-24 14:57:40,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7593 states to 7593 states and 9699 transitions. [2018-10-24 14:57:40,312 INFO L78 Accepts]: Start accepts. Automaton has 7593 states and 9699 transitions. Word has length 227 [2018-10-24 14:57:40,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:57:40,312 INFO L481 AbstractCegarLoop]: Abstraction has 7593 states and 9699 transitions. [2018-10-24 14:57:40,313 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:57:40,313 INFO L276 IsEmpty]: Start isEmpty. Operand 7593 states and 9699 transitions. [2018-10-24 14:57:40,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-10-24 14:57:40,320 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:57:40,321 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40,321 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:57:40,321 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:57:40,322 INFO L82 PathProgramCache]: Analyzing trace with hash -1789625224, now seen corresponding path program 1 times [2018-10-24 14:57:40,322 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:57:40,322 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:57:40,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:40,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:57:40,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:40,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:57:40,475 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-24 14:57:40,475 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:57:40,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:57:40,476 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:57:40,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:57:40,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:57:40,477 INFO L87 Difference]: Start difference. First operand 7593 states and 9699 transitions. Second operand 3 states. [2018-10-24 14:57:42,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:57:42,187 INFO L93 Difference]: Finished difference Result 22543 states and 28853 transitions. [2018-10-24 14:57:42,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:57:42,194 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 244 [2018-10-24 14:57:42,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:57:42,233 INFO L225 Difference]: With dead ends: 22543 [2018-10-24 14:57:42,233 INFO L226 Difference]: Without dead ends: 14952 [2018-10-24 14:57:42,243 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:42,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14952 states. [2018-10-24 14:57:42,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14952 to 14943. [2018-10-24 14:57:42,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14943 states. [2018-10-24 14:57:42,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14943 states to 14943 states and 18430 transitions. [2018-10-24 14:57:42,459 INFO L78 Accepts]: Start accepts. Automaton has 14943 states and 18430 transitions. Word has length 244 [2018-10-24 14:57:42,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:57:42,459 INFO L481 AbstractCegarLoop]: Abstraction has 14943 states and 18430 transitions. [2018-10-24 14:57:42,459 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:57:42,459 INFO L276 IsEmpty]: Start isEmpty. Operand 14943 states and 18430 transitions. [2018-10-24 14:57:42,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2018-10-24 14:57:42,472 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:57:42,472 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,472 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:57:42,472 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:57:42,473 INFO L82 PathProgramCache]: Analyzing trace with hash 644216978, now seen corresponding path program 1 times [2018-10-24 14:57:42,473 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:57:42,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:57:42,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:42,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:57:42,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:42,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:57:42,777 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:57:42,777 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:57:42,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:57:42,778 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:57:42,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:57:42,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:57:42,778 INFO L87 Difference]: Start difference. First operand 14943 states and 18430 transitions. Second operand 4 states. [2018-10-24 14:57:44,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:57:44,082 INFO L93 Difference]: Finished difference Result 29884 states and 36858 transitions. [2018-10-24 14:57:44,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:57:44,083 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 247 [2018-10-24 14:57:44,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:57:44,109 INFO L225 Difference]: With dead ends: 29884 [2018-10-24 14:57:44,109 INFO L226 Difference]: Without dead ends: 14943 [2018-10-24 14:57:44,124 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:44,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14943 states. [2018-10-24 14:57:44,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14943 to 14943. [2018-10-24 14:57:44,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14943 states. [2018-10-24 14:57:44,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14943 states to 14943 states and 17684 transitions. [2018-10-24 14:57:44,339 INFO L78 Accepts]: Start accepts. Automaton has 14943 states and 17684 transitions. Word has length 247 [2018-10-24 14:57:44,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:57:44,339 INFO L481 AbstractCegarLoop]: Abstraction has 14943 states and 17684 transitions. [2018-10-24 14:57:44,339 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:57:44,339 INFO L276 IsEmpty]: Start isEmpty. Operand 14943 states and 17684 transitions. [2018-10-24 14:57:44,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-10-24 14:57:44,353 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:57:44,354 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-24 14:57:44,354 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:57:44,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:57:44,354 INFO L82 PathProgramCache]: Analyzing trace with hash 1376182373, now seen corresponding path program 1 times [2018-10-24 14:57:44,355 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:57:44,355 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:57:44,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:44,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:57:44,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:44,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:57:44,562 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-10-24 14:57:44,563 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:57:44,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:57:44,564 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:57:44,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:57:44,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:57:44,564 INFO L87 Difference]: Start difference. First operand 14943 states and 17684 transitions. Second operand 3 states. [2018-10-24 14:57:46,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:57:46,145 INFO L93 Difference]: Finished difference Result 37363 states and 44044 transitions. [2018-10-24 14:57:46,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:57:46,146 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 256 [2018-10-24 14:57:46,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:57:46,176 INFO L225 Difference]: With dead ends: 37363 [2018-10-24 14:57:46,176 INFO L226 Difference]: Without dead ends: 22422 [2018-10-24 14:57:46,192 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:46,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22422 states. [2018-10-24 14:57:46,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22422 to 22417. [2018-10-24 14:57:46,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22417 states. [2018-10-24 14:57:46,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22417 states to 22417 states and 26323 transitions. [2018-10-24 14:57:46,600 INFO L78 Accepts]: Start accepts. Automaton has 22417 states and 26323 transitions. Word has length 256 [2018-10-24 14:57:46,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:57:46,601 INFO L481 AbstractCegarLoop]: Abstraction has 22417 states and 26323 transitions. [2018-10-24 14:57:46,601 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:57:46,601 INFO L276 IsEmpty]: Start isEmpty. Operand 22417 states and 26323 transitions. [2018-10-24 14:57:46,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2018-10-24 14:57:46,622 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:57:46,622 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46,622 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:57:46,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:57:46,623 INFO L82 PathProgramCache]: Analyzing trace with hash 1061919249, now seen corresponding path program 1 times [2018-10-24 14:57:46,623 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:57:46,623 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:57:46,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:46,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:57:46,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:46,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:57:46,979 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-24 14:57:47,163 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 75 proven. 4 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-10-24 14:57:47,164 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 14:57:47,164 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:47,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:57:47,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:57:47,367 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 14:57:47,570 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2018-10-24 14:57:47,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 14:57:47,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2018-10-24 14:57:47,598 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 14:57:47,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 14:57:47,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-24 14:57:47,599 INFO L87 Difference]: Start difference. First operand 22417 states and 26323 transitions. Second operand 6 states. [2018-10-24 14:57:53,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:57:53,072 INFO L93 Difference]: Finished difference Result 82311 states and 96881 transitions. [2018-10-24 14:57:53,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 14:57:53,073 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 264 [2018-10-24 14:57:53,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:57:53,165 INFO L225 Difference]: With dead ends: 82311 [2018-10-24 14:57:53,165 INFO L226 Difference]: Without dead ends: 59896 [2018-10-24 14:57:53,200 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 263 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-10-24 14:57:53,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59896 states. [2018-10-24 14:57:54,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59896 to 58625. [2018-10-24 14:57:54,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58625 states. [2018-10-24 14:57:54,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58625 states to 58625 states and 66514 transitions. [2018-10-24 14:57:54,443 INFO L78 Accepts]: Start accepts. Automaton has 58625 states and 66514 transitions. Word has length 264 [2018-10-24 14:57:54,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:57:54,444 INFO L481 AbstractCegarLoop]: Abstraction has 58625 states and 66514 transitions. [2018-10-24 14:57:54,444 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 14:57:54,444 INFO L276 IsEmpty]: Start isEmpty. Operand 58625 states and 66514 transitions. [2018-10-24 14:57:54,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2018-10-24 14:57:54,469 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:57:54,469 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54,469 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:57:54,470 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:57:54,470 INFO L82 PathProgramCache]: Analyzing trace with hash 2050018051, now seen corresponding path program 1 times [2018-10-24 14:57:54,470 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:57:54,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:57:54,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:54,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:57:54,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:54,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:57:55,025 WARN L179 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 8 [2018-10-24 14:57:55,179 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-24 14:57:55,180 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:57:55,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 14:57:55,181 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 14:57:55,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 14:57:55,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 14:57:55,181 INFO L87 Difference]: Start difference. First operand 58625 states and 66514 transitions. Second operand 5 states. [2018-10-24 14:57:57,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:57:57,991 INFO L93 Difference]: Finished difference Result 180112 states and 202357 transitions. [2018-10-24 14:57:57,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 14:57:57,992 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 275 [2018-10-24 14:57:57,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:57:58,150 INFO L225 Difference]: With dead ends: 180112 [2018-10-24 14:57:58,150 INFO L226 Difference]: Without dead ends: 121489 [2018-10-24 14:57:58,214 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 14:57:58,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121489 states. [2018-10-24 14:57:59,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121489 to 118983. [2018-10-24 14:57:59,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118983 states. [2018-10-24 14:58:00,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118983 states to 118983 states and 133148 transitions. [2018-10-24 14:58:00,127 INFO L78 Accepts]: Start accepts. Automaton has 118983 states and 133148 transitions. Word has length 275 [2018-10-24 14:58:00,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:58:00,128 INFO L481 AbstractCegarLoop]: Abstraction has 118983 states and 133148 transitions. [2018-10-24 14:58:00,128 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 14:58:00,128 INFO L276 IsEmpty]: Start isEmpty. Operand 118983 states and 133148 transitions. [2018-10-24 14:58:00,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2018-10-24 14:58:00,160 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:58:00,161 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 14:58:00,161 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:58:00,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:58:00,161 INFO L82 PathProgramCache]: Analyzing trace with hash -788828282, now seen corresponding path program 1 times [2018-10-24 14:58:00,162 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:58:00,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:58:00,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:58:00,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:58:00,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:58:00,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:58:00,537 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-10-24 14:58:00,538 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:58:00,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:58:00,538 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:58:00,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:58:00,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:58:00,539 INFO L87 Difference]: Start difference. First operand 118983 states and 133148 transitions. Second operand 4 states. [2018-10-24 14:58:04,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:58:04,259 INFO L93 Difference]: Finished difference Result 369405 states and 412155 transitions. [2018-10-24 14:58:04,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:58:04,260 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 286 [2018-10-24 14:58:04,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:58:04,670 INFO L225 Difference]: With dead ends: 369405 [2018-10-24 14:58:04,670 INFO L226 Difference]: Without dead ends: 250424 [2018-10-24 14:58:04,807 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:58:05,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250424 states. [2018-10-24 14:58:08,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250424 to 194005. [2018-10-24 14:58:08,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194005 states. [2018-10-24 14:58:09,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194005 states to 194005 states and 215162 transitions. [2018-10-24 14:58:09,262 INFO L78 Accepts]: Start accepts. Automaton has 194005 states and 215162 transitions. Word has length 286 [2018-10-24 14:58:09,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:58:09,263 INFO L481 AbstractCegarLoop]: Abstraction has 194005 states and 215162 transitions. [2018-10-24 14:58:09,263 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:58:09,263 INFO L276 IsEmpty]: Start isEmpty. Operand 194005 states and 215162 transitions. [2018-10-24 14:58:09,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2018-10-24 14:58:09,284 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:58:09,284 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09,285 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:58:09,285 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:58:09,285 INFO L82 PathProgramCache]: Analyzing trace with hash -450250301, now seen corresponding path program 1 times [2018-10-24 14:58:09,285 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:58:09,285 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:58:09,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:58:09,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:58:09,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:58:09,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:58:10,728 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-10-24 14:58:10,971 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 108 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:58:10,971 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 14:58:10,972 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:10,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:58:11,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:58:11,111 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 14:58:11,245 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-10-24 14:58:11,267 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 14:58:11,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2018-10-24 14:58:11,268 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-24 14:58:11,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-24 14:58:11,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-10-24 14:58:11,270 INFO L87 Difference]: Start difference. First operand 194005 states and 215162 transitions. Second operand 8 states. [2018-10-24 14:58:24,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:58:24,457 INFO L93 Difference]: Finished difference Result 1123775 states and 1243131 transitions. [2018-10-24 14:58:24,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-24 14:58:24,458 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 288 [2018-10-24 14:58:24,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:58:25,798 INFO L225 Difference]: With dead ends: 1123775 [2018-10-24 14:58:25,798 INFO L226 Difference]: Without dead ends: 929772 [2018-10-24 14:58:26,044 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 298 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=117, Invalid=225, Unknown=0, NotChecked=0, Total=342 [2018-10-24 14:58:26,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929772 states. [2018-10-24 14:58:45,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929772 to 563939. [2018-10-24 14:58:45,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 563939 states. [2018-10-24 14:58:46,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563939 states to 563939 states and 619743 transitions. [2018-10-24 14:58:46,708 INFO L78 Accepts]: Start accepts. Automaton has 563939 states and 619743 transitions. Word has length 288 [2018-10-24 14:58:46,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:58:46,709 INFO L481 AbstractCegarLoop]: Abstraction has 563939 states and 619743 transitions. [2018-10-24 14:58:46,709 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-24 14:58:46,709 INFO L276 IsEmpty]: Start isEmpty. Operand 563939 states and 619743 transitions. [2018-10-24 14:58:46,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2018-10-24 14:58:46,733 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:58:46,734 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 14:58:46,734 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:58:46,734 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:58:46,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1859485173, now seen corresponding path program 1 times [2018-10-24 14:58:46,735 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:58:46,735 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:58:46,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:58:46,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:58:46,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:58:46,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:58:46,959 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-10-24 14:58:46,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:58:46,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:58:46,961 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:58:46,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:58:46,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:58:46,961 INFO L87 Difference]: Start difference. First operand 563939 states and 619743 transitions. Second operand 3 states. [2018-10-24 14:58:54,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:58:54,009 INFO L93 Difference]: Finished difference Result 1126613 states and 1237974 transitions. [2018-10-24 14:58:54,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:58:54,009 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 307 [2018-10-24 14:58:54,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:58:54,735 INFO L225 Difference]: With dead ends: 1126613 [2018-10-24 14:58:54,736 INFO L226 Difference]: Without dead ends: 562676 [2018-10-24 14:58:54,889 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:58:55,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562676 states. [2018-10-24 14:59:12,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562676 to 562676. [2018-10-24 14:59:12,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562676 states. [2018-10-24 14:59:13,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562676 states to 562676 states and 618181 transitions. [2018-10-24 14:59:13,067 INFO L78 Accepts]: Start accepts. Automaton has 562676 states and 618181 transitions. Word has length 307 [2018-10-24 14:59:13,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:59:13,067 INFO L481 AbstractCegarLoop]: Abstraction has 562676 states and 618181 transitions. [2018-10-24 14:59:13,067 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:59:13,067 INFO L276 IsEmpty]: Start isEmpty. Operand 562676 states and 618181 transitions. [2018-10-24 14:59:13,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2018-10-24 14:59:13,100 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:59:13,100 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 14:59:13,101 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:59:13,101 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:59:13,101 INFO L82 PathProgramCache]: Analyzing trace with hash 418511263, now seen corresponding path program 1 times [2018-10-24 14:59:13,101 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:59:13,101 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:59:13,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:59:13,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:59:13,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:59:13,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:59:13,490 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-10-24 14:59:13,490 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:59:13,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:59:13,491 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:59:13,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:59:13,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:59:13,492 INFO L87 Difference]: Start difference. First operand 562676 states and 618181 transitions. Second operand 4 states. [2018-10-24 14:59:21,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:59:21,883 INFO L93 Difference]: Finished difference Result 1145499 states and 1258669 transitions. [2018-10-24 14:59:21,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:59:21,884 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 323 [2018-10-24 14:59:21,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:59:22,813 INFO L225 Difference]: With dead ends: 1145499 [2018-10-24 14:59:22,813 INFO L226 Difference]: Without dead ends: 582825 [2018-10-24 14:59:23,079 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:59:23,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582825 states. [2018-10-24 14:59:32,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582825 to 540914. [2018-10-24 14:59:32,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 540914 states. [2018-10-24 14:59:33,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540914 states to 540914 states and 594379 transitions. [2018-10-24 14:59:33,507 INFO L78 Accepts]: Start accepts. Automaton has 540914 states and 594379 transitions. Word has length 323 [2018-10-24 14:59:33,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:59:33,507 INFO L481 AbstractCegarLoop]: Abstraction has 540914 states and 594379 transitions. [2018-10-24 14:59:33,507 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:59:33,507 INFO L276 IsEmpty]: Start isEmpty. Operand 540914 states and 594379 transitions. [2018-10-24 14:59:33,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2018-10-24 14:59:33,541 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:59:33,542 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 14:59:33,542 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:59:33,542 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:59:33,543 INFO L82 PathProgramCache]: Analyzing trace with hash 1159608046, now seen corresponding path program 1 times [2018-10-24 14:59:33,543 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:59:33,543 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:59:33,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:59:33,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:59:33,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:59:33,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:59:33,857 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 184 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-24 14:59:33,857 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:59:33,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:59:33,858 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:59:33,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:59:33,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:59:33,859 INFO L87 Difference]: Start difference. First operand 540914 states and 594379 transitions. Second operand 3 states. [2018-10-24 14:59:46,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:59:46,265 INFO L93 Difference]: Finished difference Result 1241891 states and 1358969 transitions. [2018-10-24 14:59:46,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:59:46,266 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 334 [2018-10-24 14:59:46,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:59:47,428 INFO L225 Difference]: With dead ends: 1241891 [2018-10-24 14:59:47,428 INFO L226 Difference]: Without dead ends: 700979 [2018-10-24 14:59:47,633 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:59:48,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700979 states. [2018-10-24 14:59:57,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700979 to 694364. [2018-10-24 14:59:57,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 694364 states. [2018-10-24 15:00:00,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694364 states to 694364 states and 743804 transitions. [2018-10-24 15:00:00,420 INFO L78 Accepts]: Start accepts. Automaton has 694364 states and 743804 transitions. Word has length 334 [2018-10-24 15:00:00,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:00:00,420 INFO L481 AbstractCegarLoop]: Abstraction has 694364 states and 743804 transitions. [2018-10-24 15:00:00,420 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 15:00:00,420 INFO L276 IsEmpty]: Start isEmpty. Operand 694364 states and 743804 transitions. [2018-10-24 15:00:00,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2018-10-24 15:00:00,444 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:00:00,444 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00,444 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:00:00,445 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:00:00,445 INFO L82 PathProgramCache]: Analyzing trace with hash 944680678, now seen corresponding path program 1 times [2018-10-24 15:00:00,445 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:00:00,445 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:00:00,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:00:00,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:00:00,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:00:00,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:00:00,804 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-24 15:00:00,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:00:00,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 15:00:00,806 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 15:00:00,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 15:00:00,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 15:00:00,806 INFO L87 Difference]: Start difference. First operand 694364 states and 743804 transitions. Second operand 4 states. [2018-10-24 15:00:09,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:00:09,797 INFO L93 Difference]: Finished difference Result 1366589 states and 1462924 transitions. [2018-10-24 15:00:09,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 15:00:09,797 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 335 [2018-10-24 15:00:09,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:00:10,643 INFO L225 Difference]: With dead ends: 1366589 [2018-10-24 15:00:10,643 INFO L226 Difference]: Without dead ends: 672227 [2018-10-24 15:00:10,848 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 15:00:11,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672227 states. [2018-10-24 15:00:30,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672227 to 599051. [2018-10-24 15:00:30,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599051 states. Received shutdown request... [2018-10-24 15:00:31,595 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-24 15:00:31,601 WARN L205 ceAbstractionStarter]: Timeout [2018-10-24 15:00:31,601 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 03:00:31 BoogieIcfgContainer [2018-10-24 15:00:31,601 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-24 15:00:31,602 INFO L168 Benchmark]: Toolchain (without parser) took 196517.27 ms. Allocated memory was 1.5 GB in the beginning and 6.8 GB in the end (delta: 5.3 GB). Free memory was 1.4 GB in the beginning and 4.1 GB in the end (delta: -2.7 GB). Peak memory consumption was 4.9 GB. Max. memory is 7.1 GB. [2018-10-24 15:00:31,604 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 15:00:31,604 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1180.84 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 74.0 MB). Peak memory consumption was 74.0 MB. Max. memory is 7.1 GB. [2018-10-24 15:00:31,605 INFO L168 Benchmark]: Boogie Procedure Inliner took 315.70 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 752.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -848.7 MB). Peak memory consumption was 40.4 MB. Max. memory is 7.1 GB. [2018-10-24 15:00:31,606 INFO L168 Benchmark]: Boogie Preprocessor took 142.32 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 7.1 GB. [2018-10-24 15:00:31,606 INFO L168 Benchmark]: RCFGBuilder took 5485.19 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 254.8 MB). Peak memory consumption was 254.8 MB. Max. memory is 7.1 GB. [2018-10-24 15:00:31,608 INFO L168 Benchmark]: TraceAbstraction took 189387.63 ms. Allocated memory was 2.3 GB in the beginning and 6.8 GB in the end (delta: 4.6 GB). Free memory was 1.9 GB in the beginning and 4.1 GB in the end (delta: -2.2 GB). Peak memory consumption was 4.7 GB. Max. memory is 7.1 GB. [2018-10-24 15:00:31,617 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1180.84 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 74.0 MB). Peak memory consumption was 74.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 315.70 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 752.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -848.7 MB). Peak memory consumption was 40.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 142.32 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 5485.19 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 254.8 MB). Peak memory consumption was 254.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 189387.63 ms. Allocated memory was 2.3 GB in the beginning and 6.8 GB in the end (delta: 4.6 GB). Free memory was 1.9 GB in the beginning and 4.1 GB in the end (delta: -2.2 GB). Peak memory consumption was 4.7 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1608]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1608). Cancelled while ReachableStatesComputation was computing reachable states (227719 states constructedinput type DoubleDeckerAutomaton). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 303 locations, 1 error locations. TIMEOUT Result, 189.3s OverallTime, 17 OverallIterations, 5 TraceHistogramMax, 88.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3822 SDtfs, 13905 SDslu, 3065 SDs, 0 SdLazy, 19810 SolverSat, 4229 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 38.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 633 GetRequests, 580 SyntacticMatches, 5 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=694364occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 91.7s AutomataMinimizationTime, 17 MinimizatonAttempts, 474597 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 5.9s InterpolantComputationTime, 4982 NumberOfCodeBlocks, 4982 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 4963 ConstructedInterpolants, 0 QuantifiedInterpolants, 2697338 SizeOfPredicates, 2 NumberOfNonLiveVariables, 996 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 19 InterpolantComputations, 17 PerfectInterpolantSequences, 1782/1796 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown