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/taipan/svcomp-Reach-64bit-Taipan_Default.epf -i ../../../trunk/examples/svcomp/loops/eureka_05_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 12:05:19,203 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 12:05:19,205 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 12:05:19,218 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 12:05:19,218 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 12:05:19,220 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 12:05:19,221 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 12:05:19,223 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 12:05:19,225 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 12:05:19,226 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 12:05:19,227 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 12:05:19,227 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 12:05:19,228 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 12:05:19,229 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 12:05:19,230 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 12:05:19,231 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 12:05:19,232 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 12:05:19,234 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 12:05:19,236 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 12:05:19,238 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 12:05:19,239 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 12:05:19,241 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 12:05:19,244 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 12:05:19,244 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 12:05:19,244 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 12:05:19,246 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 12:05:19,247 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 12:05:19,248 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 12:05:19,248 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 12:05:19,250 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 12:05:19,250 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 12:05:19,251 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 12:05:19,251 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 12:05:19,251 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 12:05:19,252 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 12:05:19,253 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 12:05:19,254 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default.epf [2018-10-24 12:05:19,270 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 12:05:19,271 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 12:05:19,272 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 12:05:19,272 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-24 12:05:19,272 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-24 12:05:19,272 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-24 12:05:19,273 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-24 12:05:19,273 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-24 12:05:19,273 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-24 12:05:19,273 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-24 12:05:19,273 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-24 12:05:19,274 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-24 12:05:19,275 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 12:05:19,275 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 12:05:19,275 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 12:05:19,275 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 12:05:19,275 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 12:05:19,276 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 12:05:19,276 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 12:05:19,276 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 12:05:19,276 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 12:05:19,277 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 12:05:19,277 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 12:05:19,277 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 12:05:19,277 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 12:05:19,277 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 12:05:19,278 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 12:05:19,278 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 12:05:19,278 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-24 12:05:19,278 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 12:05:19,278 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 12:05:19,279 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 12:05:19,279 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 12:05:19,279 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-24 12:05:19,331 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 12:05:19,345 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 12:05:19,350 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 12:05:19,352 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 12:05:19,352 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 12:05:19,353 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/loops/eureka_05_true-unreach-call_true-termination.i [2018-10-24 12:05:19,420 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/386268583/9bbed0a0f3184fb0affffc9938039264/FLAGe26386c42 [2018-10-24 12:05:19,956 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 12:05:19,956 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/eureka_05_true-unreach-call_true-termination.i [2018-10-24 12:05:19,964 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/386268583/9bbed0a0f3184fb0affffc9938039264/FLAGe26386c42 [2018-10-24 12:05:19,980 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/386268583/9bbed0a0f3184fb0affffc9938039264 [2018-10-24 12:05:19,994 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 12:05:19,996 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 12:05:19,997 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 12:05:19,997 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 12:05:20,001 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 12:05:20,003 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:05:19" (1/1) ... [2018-10-24 12:05:20,006 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cf5b06d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:05:20, skipping insertion in model container [2018-10-24 12:05:20,006 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:05:19" (1/1) ... [2018-10-24 12:05:20,017 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 12:05:20,046 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 12:05:20,276 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 12:05:20,289 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 12:05:20,318 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 12:05:20,345 INFO L193 MainTranslator]: Completed translation [2018-10-24 12:05:20,345 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:05:20 WrapperNode [2018-10-24 12:05:20,346 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 12:05:20,347 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 12:05:20,347 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 12:05:20,347 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 12:05:20,358 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:05:20" (1/1) ... [2018-10-24 12:05:20,369 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:05:20" (1/1) ... [2018-10-24 12:05:20,417 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 12:05:20,418 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 12:05:20,418 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 12:05:20,418 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 12:05:20,433 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:05:20" (1/1) ... [2018-10-24 12:05:20,434 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:05:20" (1/1) ... [2018-10-24 12:05:20,445 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:05:20" (1/1) ... [2018-10-24 12:05:20,445 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:05:20" (1/1) ... [2018-10-24 12:05:20,461 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:05:20" (1/1) ... [2018-10-24 12:05:20,471 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:05:20" (1/1) ... [2018-10-24 12:05:20,478 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:05:20" (1/1) ... [2018-10-24 12:05:20,487 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 12:05:20,488 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 12:05:20,488 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 12:05:20,489 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 12:05:20,492 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:05:20" (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 12:05:20,677 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-24 12:05:20,677 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-24 12:05:20,677 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 12:05:20,677 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 12:05:20,678 INFO L130 BoogieDeclarations]: Found specification of procedure SelectionSort [2018-10-24 12:05:20,678 INFO L138 BoogieDeclarations]: Found implementation of procedure SelectionSort [2018-10-24 12:05:20,678 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-24 12:05:20,678 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-24 12:05:20,678 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-10-24 12:05:20,678 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-10-24 12:05:21,329 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 12:05:21,330 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:05:21 BoogieIcfgContainer [2018-10-24 12:05:21,330 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 12:05:21,331 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 12:05:21,331 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 12:05:21,335 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 12:05:21,335 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 12:05:19" (1/3) ... [2018-10-24 12:05:21,336 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64f1e91c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:05:21, skipping insertion in model container [2018-10-24 12:05:21,336 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:05:20" (2/3) ... [2018-10-24 12:05:21,337 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64f1e91c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:05:21, skipping insertion in model container [2018-10-24 12:05:21,337 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:05:21" (3/3) ... [2018-10-24 12:05:21,339 INFO L112 eAbstractionObserver]: Analyzing ICFG eureka_05_true-unreach-call_true-termination.i [2018-10-24 12:05:21,351 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 12:05:21,363 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 12:05:21,383 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 12:05:21,422 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 12:05:21,422 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 12:05:21,423 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 12:05:21,423 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 12:05:21,423 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 12:05:21,424 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 12:05:21,424 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 12:05:21,425 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 12:05:21,447 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2018-10-24 12:05:21,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-24 12:05:21,456 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:05:21,457 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:05:21,460 INFO L424 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:05:21,467 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:05:21,467 INFO L82 PathProgramCache]: Analyzing trace with hash -82730588, now seen corresponding path program 1 times [2018-10-24 12:05:21,470 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:05:21,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:05:21,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:05:21,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:05:21,526 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:05:21,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:05:21,644 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 12:05:21,647 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 12:05:21,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 12:05:21,648 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 12:05:21,654 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-24 12:05:21,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-24 12:05:21,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-24 12:05:21,674 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 2 states. [2018-10-24 12:05:21,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:05:21,702 INFO L93 Difference]: Finished difference Result 67 states and 85 transitions. [2018-10-24 12:05:21,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-24 12:05:21,703 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2018-10-24 12:05:21,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:05:21,712 INFO L225 Difference]: With dead ends: 67 [2018-10-24 12:05:21,712 INFO L226 Difference]: Without dead ends: 33 [2018-10-24 12:05:21,717 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-24 12:05:21,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-24 12:05:21,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-10-24 12:05:21,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-10-24 12:05:21,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-10-24 12:05:21,756 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 19 [2018-10-24 12:05:21,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:05:21,756 INFO L481 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-10-24 12:05:21,756 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-24 12:05:21,756 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-10-24 12:05:21,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-24 12:05:21,758 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:05:21,758 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] [2018-10-24 12:05:21,758 INFO L424 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:05:21,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:05:21,759 INFO L82 PathProgramCache]: Analyzing trace with hash -802136646, now seen corresponding path program 1 times [2018-10-24 12:05:21,759 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:05:21,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:05:21,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:05:21,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:05:21,761 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:05:21,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:05:21,881 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 12:05:21,881 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 12:05:21,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 12:05:21,882 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 12:05:21,884 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 12:05:21,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 12:05:21,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 12:05:21,885 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 3 states. [2018-10-24 12:05:21,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:05:21,970 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2018-10-24 12:05:21,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 12:05:21,971 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-10-24 12:05:21,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:05:21,973 INFO L225 Difference]: With dead ends: 60 [2018-10-24 12:05:21,973 INFO L226 Difference]: Without dead ends: 36 [2018-10-24 12:05:21,974 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 12:05:21,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-10-24 12:05:21,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2018-10-24 12:05:21,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-10-24 12:05:21,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2018-10-24 12:05:21,982 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 21 [2018-10-24 12:05:21,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:05:21,982 INFO L481 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2018-10-24 12:05:21,982 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 12:05:21,983 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2018-10-24 12:05:21,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-24 12:05:21,984 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:05:21,984 INFO L375 BasicCegarLoop]: trace histogram [2, 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 12:05:21,984 INFO L424 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:05:21,984 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:05:21,985 INFO L82 PathProgramCache]: Analyzing trace with hash 306624109, now seen corresponding path program 1 times [2018-10-24 12:05:21,985 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:05:21,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:05:21,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:05:21,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:05:21,989 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:05:22,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:05:22,109 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:05:22,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:05:22,110 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:05:22,111 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-10-24 12:05:22,113 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [40], [41], [45], [48], [50], [52], [57], [61], [66], [76], [79], [81], [87], [88], [89], [91], [92], [93] [2018-10-24 12:05:22,164 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-24 12:05:22,165 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 12:05:22,842 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-24 12:05:22,844 INFO L272 AbstractInterpreter]: Visited 14 different actions 34 times. Merged at 3 different actions 15 times. Widened at 1 different actions 1 times. Found 1 fixpoints after 1 different actions. Largest state had 35 variables. [2018-10-24 12:05:22,867 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:05:22,868 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-24 12:05:23,119 INFO L232 lantSequenceWeakener]: Weakened 14 states. On average, predicates are now at 86.03% of their original sizes. [2018-10-24 12:05:23,120 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-24 12:05:23,516 INFO L413 sIntCurrentIteration]: We have 23 unified AI predicates [2018-10-24 12:05:23,516 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-24 12:05:23,517 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 12:05:23,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [4] total 9 [2018-10-24 12:05:23,518 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 12:05:23,519 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-24 12:05:23,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-24 12:05:23,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-24 12:05:23,520 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 7 states. [2018-10-24 12:05:24,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:05:24,902 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2018-10-24 12:05:24,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 12:05:24,902 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-10-24 12:05:24,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:05:24,905 INFO L225 Difference]: With dead ends: 62 [2018-10-24 12:05:24,906 INFO L226 Difference]: Without dead ends: 48 [2018-10-24 12:05:24,907 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-24 12:05:24,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-10-24 12:05:24,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 37. [2018-10-24 12:05:24,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-10-24 12:05:24,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2018-10-24 12:05:24,922 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 24 [2018-10-24 12:05:24,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:05:24,923 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-10-24 12:05:24,923 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-24 12:05:24,923 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-10-24 12:05:24,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-24 12:05:24,924 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:05:24,925 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:05:24,925 INFO L424 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:05:24,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:05:24,926 INFO L82 PathProgramCache]: Analyzing trace with hash -1567947773, now seen corresponding path program 1 times [2018-10-24 12:05:24,926 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:05:24,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:05:24,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:05:24,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:05:24,928 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:05:24,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:05:25,042 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-24 12:05:25,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:05:25,043 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:05:25,043 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 31 with the following transitions: [2018-10-24 12:05:25,043 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [18], [21], [34], [36], [40], [41], [45], [48], [50], [52], [57], [61], [66], [76], [79], [81], [87], [88], [89], [91], [92], [93] [2018-10-24 12:05:25,047 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-24 12:05:25,047 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 12:05:25,347 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-24 12:05:25,347 INFO L272 AbstractInterpreter]: Visited 17 different actions 37 times. Merged at 3 different actions 15 times. Widened at 1 different actions 1 times. Found 1 fixpoints after 1 different actions. Largest state had 35 variables. [2018-10-24 12:05:25,380 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:05:25,380 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-24 12:05:25,535 INFO L232 lantSequenceWeakener]: Weakened 18 states. On average, predicates are now at 69.64% of their original sizes. [2018-10-24 12:05:25,535 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-24 12:05:25,951 INFO L413 sIntCurrentIteration]: We have 29 unified AI predicates [2018-10-24 12:05:25,952 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-24 12:05:25,953 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 12:05:25,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [4] total 11 [2018-10-24 12:05:25,953 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 12:05:25,954 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-24 12:05:25,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-24 12:05:25,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-10-24 12:05:25,957 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 9 states. [2018-10-24 12:05:27,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:05:27,560 INFO L93 Difference]: Finished difference Result 74 states and 86 transitions. [2018-10-24 12:05:27,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-24 12:05:27,560 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2018-10-24 12:05:27,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:05:27,562 INFO L225 Difference]: With dead ends: 74 [2018-10-24 12:05:27,562 INFO L226 Difference]: Without dead ends: 52 [2018-10-24 12:05:27,563 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-10-24 12:05:27,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-10-24 12:05:27,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 39. [2018-10-24 12:05:27,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-10-24 12:05:27,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2018-10-24 12:05:27,576 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 30 [2018-10-24 12:05:27,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:05:27,576 INFO L481 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2018-10-24 12:05:27,577 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-24 12:05:27,577 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-10-24 12:05:27,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-24 12:05:27,578 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:05:27,578 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-24 12:05:27,579 INFO L424 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:05:27,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:05:27,579 INFO L82 PathProgramCache]: Analyzing trace with hash -78169958, now seen corresponding path program 1 times [2018-10-24 12:05:27,579 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:05:27,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:05:27,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:05:27,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:05:27,581 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:05:27,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:05:27,812 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-24 12:05:27,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:05:27,812 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:05:27,813 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 35 with the following transitions: [2018-10-24 12:05:27,814 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [18], [21], [23], [26], [30], [34], [36], [40], [41], [45], [48], [50], [52], [57], [61], [66], [76], [79], [81], [87], [88], [89], [91], [92], [93] [2018-10-24 12:05:27,816 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-24 12:05:27,816 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 12:05:28,889 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-24 12:05:28,889 INFO L272 AbstractInterpreter]: Visited 31 different actions 133 times. Merged at 12 different actions 79 times. Widened at 4 different actions 11 times. Found 10 fixpoints after 5 different actions. Largest state had 35 variables. [2018-10-24 12:05:28,932 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:05:28,934 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-24 12:05:28,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:05:28,934 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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 12:05:28,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:05:28,950 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 12:05:29,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:05:29,029 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:05:29,068 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-24 12:05:29,069 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:05:29,401 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-24 12:05:29,434 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:05:29,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-10-24 12:05:29,435 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:05:29,435 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 12:05:29,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 12:05:29,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-10-24 12:05:29,439 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 4 states. [2018-10-24 12:05:29,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:05:29,648 INFO L93 Difference]: Finished difference Result 71 states and 79 transitions. [2018-10-24 12:05:29,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 12:05:29,649 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-10-24 12:05:29,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:05:29,650 INFO L225 Difference]: With dead ends: 71 [2018-10-24 12:05:29,650 INFO L226 Difference]: Without dead ends: 43 [2018-10-24 12:05:29,651 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-10-24 12:05:29,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-24 12:05:29,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2018-10-24 12:05:29,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-10-24 12:05:29,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2018-10-24 12:05:29,675 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 34 [2018-10-24 12:05:29,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:05:29,675 INFO L481 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2018-10-24 12:05:29,675 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 12:05:29,675 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2018-10-24 12:05:29,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-24 12:05:29,680 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:05:29,680 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-24 12:05:29,680 INFO L424 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:05:29,680 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:05:29,682 INFO L82 PathProgramCache]: Analyzing trace with hash 2019809991, now seen corresponding path program 2 times [2018-10-24 12:05:29,682 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:05:29,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:05:29,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:05:29,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:05:29,687 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:05:29,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:05:29,990 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-24 12:05:29,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:05:29,990 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:05:29,991 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:05:29,991 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:05:29,991 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:05:29,992 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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 12:05:30,007 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-24 12:05:30,007 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-24 12:05:30,054 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-10-24 12:05:30,054 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:05:30,061 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:05:30,293 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-24 12:05:30,294 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:05:30,684 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-10-24 12:05:31,382 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-24 12:05:31,419 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:05:31,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6] total 12 [2018-10-24 12:05:31,420 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:05:31,420 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-24 12:05:31,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-24 12:05:31,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-10-24 12:05:31,423 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 8 states. [2018-10-24 12:05:32,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:05:32,234 INFO L93 Difference]: Finished difference Result 88 states and 102 transitions. [2018-10-24 12:05:32,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-24 12:05:32,234 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 37 [2018-10-24 12:05:32,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:05:32,235 INFO L225 Difference]: With dead ends: 88 [2018-10-24 12:05:32,236 INFO L226 Difference]: Without dead ends: 60 [2018-10-24 12:05:32,236 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 66 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2018-10-24 12:05:32,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-10-24 12:05:32,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 53. [2018-10-24 12:05:32,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-10-24 12:05:32,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2018-10-24 12:05:32,248 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 37 [2018-10-24 12:05:32,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:05:32,248 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2018-10-24 12:05:32,249 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-24 12:05:32,249 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2018-10-24 12:05:32,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-10-24 12:05:32,250 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:05:32,250 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 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] [2018-10-24 12:05:32,251 INFO L424 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:05:32,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:05:32,251 INFO L82 PathProgramCache]: Analyzing trace with hash 320896336, now seen corresponding path program 3 times [2018-10-24 12:05:32,251 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:05:32,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:05:32,252 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:05:32,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:05:32,252 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:05:32,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:05:32,425 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-10-24 12:05:32,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:05:32,426 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:05:32,426 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:05:32,426 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:05:32,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:05:32,426 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:05:32,444 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-24 12:05:32,444 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-24 12:05:32,497 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-24 12:05:32,498 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:05:32,501 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:05:32,512 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-10-24 12:05:32,512 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:05:32,630 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-10-24 12:05:32,652 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:05:32,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 7 [2018-10-24 12:05:32,653 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:05:32,653 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 12:05:32,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 12:05:32,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-10-24 12:05:32,654 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand 6 states. [2018-10-24 12:05:32,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:05:32,737 INFO L93 Difference]: Finished difference Result 93 states and 105 transitions. [2018-10-24 12:05:32,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-24 12:05:32,738 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2018-10-24 12:05:32,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:05:32,739 INFO L225 Difference]: With dead ends: 93 [2018-10-24 12:05:32,739 INFO L226 Difference]: Without dead ends: 57 [2018-10-24 12:05:32,740 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 89 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-10-24 12:05:32,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-24 12:05:32,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2018-10-24 12:05:32,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-10-24 12:05:32,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 62 transitions. [2018-10-24 12:05:32,752 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 62 transitions. Word has length 46 [2018-10-24 12:05:32,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:05:32,752 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 62 transitions. [2018-10-24 12:05:32,752 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 12:05:32,752 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions. [2018-10-24 12:05:32,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-10-24 12:05:32,753 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:05:32,753 INFO L375 BasicCegarLoop]: trace histogram [5, 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] [2018-10-24 12:05:32,754 INFO L424 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:05:32,754 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:05:32,754 INFO L82 PathProgramCache]: Analyzing trace with hash 894583805, now seen corresponding path program 4 times [2018-10-24 12:05:32,754 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:05:32,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:05:32,755 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:05:32,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:05:32,755 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:05:32,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:05:32,900 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-10-24 12:05:32,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:05:32,900 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:05:32,900 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:05:32,901 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:05:32,901 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:05:32,901 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:05:32,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:05:32,911 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 12:05:32,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:05:32,965 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:05:32,981 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-10-24 12:05:32,984 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:05:33,245 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-10-24 12:05:33,265 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:05:33,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 7 [2018-10-24 12:05:33,266 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:05:33,266 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-24 12:05:33,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-24 12:05:33,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-10-24 12:05:33,267 INFO L87 Difference]: Start difference. First operand 56 states and 62 transitions. Second operand 7 states. [2018-10-24 12:05:33,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:05:33,639 INFO L93 Difference]: Finished difference Result 115 states and 131 transitions. [2018-10-24 12:05:33,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 12:05:33,639 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 49 [2018-10-24 12:05:33,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:05:33,641 INFO L225 Difference]: With dead ends: 115 [2018-10-24 12:05:33,641 INFO L226 Difference]: Without dead ends: 79 [2018-10-24 12:05:33,642 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 95 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-10-24 12:05:33,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-10-24 12:05:33,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 59. [2018-10-24 12:05:33,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-10-24 12:05:33,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 65 transitions. [2018-10-24 12:05:33,656 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 65 transitions. Word has length 49 [2018-10-24 12:05:33,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:05:33,656 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 65 transitions. [2018-10-24 12:05:33,656 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-24 12:05:33,656 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 65 transitions. [2018-10-24 12:05:33,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-10-24 12:05:33,657 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:05:33,658 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 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] [2018-10-24 12:05:33,658 INFO L424 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:05:33,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:05:33,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1943102000, now seen corresponding path program 5 times [2018-10-24 12:05:33,658 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:05:33,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:05:33,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:05:33,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:05:33,660 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:05:33,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:05:33,966 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-10-24 12:05:33,966 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:05:33,967 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:05:33,967 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:05:33,967 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:05:33,967 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:05:33,967 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:05:33,976 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-24 12:05:33,976 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-24 12:05:34,052 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-10-24 12:05:34,052 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:05:34,059 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:05:34,269 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-10-24 12:05:34,270 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:05:34,390 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-10-24 12:05:34,412 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:05:34,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 7] total 15 [2018-10-24 12:05:34,413 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:05:34,413 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-24 12:05:34,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-24 12:05:34,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2018-10-24 12:05:34,414 INFO L87 Difference]: Start difference. First operand 59 states and 65 transitions. Second operand 11 states. [2018-10-24 12:05:34,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:05:34,679 INFO L93 Difference]: Finished difference Result 101 states and 117 transitions. [2018-10-24 12:05:34,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-24 12:05:34,680 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 52 [2018-10-24 12:05:34,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:05:34,682 INFO L225 Difference]: With dead ends: 101 [2018-10-24 12:05:34,682 INFO L226 Difference]: Without dead ends: 75 [2018-10-24 12:05:34,683 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 96 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2018-10-24 12:05:34,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-10-24 12:05:34,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 65. [2018-10-24 12:05:34,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-10-24 12:05:34,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 72 transitions. [2018-10-24 12:05:34,699 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 72 transitions. Word has length 52 [2018-10-24 12:05:34,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:05:34,700 INFO L481 AbstractCegarLoop]: Abstraction has 65 states and 72 transitions. [2018-10-24 12:05:34,703 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-24 12:05:34,703 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 72 transitions. [2018-10-24 12:05:34,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-10-24 12:05:34,704 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:05:34,704 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 3, 3, 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] [2018-10-24 12:05:34,704 INFO L424 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:05:34,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:05:34,705 INFO L82 PathProgramCache]: Analyzing trace with hash 212252830, now seen corresponding path program 6 times [2018-10-24 12:05:34,705 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:05:34,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:05:34,708 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:05:34,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:05:34,708 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:05:34,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:05:34,948 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 22 proven. 2 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-10-24 12:05:34,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:05:34,949 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:05:34,949 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:05:34,949 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:05:34,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:05:34,949 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:05:34,958 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-24 12:05:34,958 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-24 12:05:35,013 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-24 12:05:35,013 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:05:35,020 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:05:35,075 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 6 proven. 26 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-10-24 12:05:35,076 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:05:35,155 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 6 proven. 26 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-10-24 12:05:35,177 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:05:35,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 7 [2018-10-24 12:05:35,178 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:05:35,178 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-24 12:05:35,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-24 12:05:35,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-24 12:05:35,179 INFO L87 Difference]: Start difference. First operand 65 states and 72 transitions. Second operand 7 states. [2018-10-24 12:05:35,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:05:35,338 INFO L93 Difference]: Finished difference Result 95 states and 108 transitions. [2018-10-24 12:05:35,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-24 12:05:35,339 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 60 [2018-10-24 12:05:35,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:05:35,340 INFO L225 Difference]: With dead ends: 95 [2018-10-24 12:05:35,340 INFO L226 Difference]: Without dead ends: 81 [2018-10-24 12:05:35,341 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 116 SyntacticMatches, 5 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2018-10-24 12:05:35,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-10-24 12:05:35,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-10-24 12:05:35,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-10-24 12:05:35,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 92 transitions. [2018-10-24 12:05:35,356 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 92 transitions. Word has length 60 [2018-10-24 12:05:35,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:05:35,356 INFO L481 AbstractCegarLoop]: Abstraction has 81 states and 92 transitions. [2018-10-24 12:05:35,356 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-24 12:05:35,356 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 92 transitions. [2018-10-24 12:05:35,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-10-24 12:05:35,358 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:05:35,358 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:05:35,358 INFO L424 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:05:35,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:05:35,358 INFO L82 PathProgramCache]: Analyzing trace with hash 1098046836, now seen corresponding path program 7 times [2018-10-24 12:05:35,359 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:05:35,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:05:35,359 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:05:35,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:05:35,360 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:05:35,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:05:35,683 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-10-24 12:05:35,684 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:05:35,684 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:05:35,684 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:05:35,684 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:05:35,684 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:05:35,685 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:05:35,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:05:35,695 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 12:05:35,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:05:35,750 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:05:35,820 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 28 proven. 8 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-10-24 12:05:35,821 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:05:36,322 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 28 proven. 8 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-10-24 12:05:36,344 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:05:36,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 8] total 18 [2018-10-24 12:05:36,344 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:05:36,344 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-24 12:05:36,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-24 12:05:36,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2018-10-24 12:05:36,345 INFO L87 Difference]: Start difference. First operand 81 states and 92 transitions. Second operand 13 states. [2018-10-24 12:05:36,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:05:36,599 INFO L93 Difference]: Finished difference Result 131 states and 152 transitions. [2018-10-24 12:05:36,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 12:05:36,600 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 66 [2018-10-24 12:05:36,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:05:36,602 INFO L225 Difference]: With dead ends: 131 [2018-10-24 12:05:36,602 INFO L226 Difference]: Without dead ends: 87 [2018-10-24 12:05:36,603 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 122 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2018-10-24 12:05:36,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-10-24 12:05:36,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2018-10-24 12:05:36,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-10-24 12:05:36,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 97 transitions. [2018-10-24 12:05:36,617 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 97 transitions. Word has length 66 [2018-10-24 12:05:36,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:05:36,618 INFO L481 AbstractCegarLoop]: Abstraction has 85 states and 97 transitions. [2018-10-24 12:05:36,618 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-24 12:05:36,618 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 97 transitions. [2018-10-24 12:05:36,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-10-24 12:05:36,619 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:05:36,619 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:05:36,620 INFO L424 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:05:36,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:05:36,620 INFO L82 PathProgramCache]: Analyzing trace with hash 1838783755, now seen corresponding path program 8 times [2018-10-24 12:05:36,620 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:05:36,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:05:36,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:05:36,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:05:36,621 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:05:36,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:05:37,361 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 34 proven. 34 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-10-24 12:05:37,361 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:05:37,361 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:05:37,362 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:05:37,362 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:05:37,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:05:37,362 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:05:37,381 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-24 12:05:37,381 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-24 12:05:37,491 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-10-24 12:05:37,491 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:05:37,495 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:05:37,592 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 10 proven. 42 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-10-24 12:05:37,592 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:05:37,743 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 10 proven. 42 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-10-24 12:05:37,766 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:05:37,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 8] total 20 [2018-10-24 12:05:37,766 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:05:37,767 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-24 12:05:37,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-24 12:05:37,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2018-10-24 12:05:37,768 INFO L87 Difference]: Start difference. First operand 85 states and 97 transitions. Second operand 14 states. [2018-10-24 12:05:38,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:05:38,481 INFO L93 Difference]: Finished difference Result 173 states and 209 transitions. [2018-10-24 12:05:38,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-24 12:05:38,481 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 70 [2018-10-24 12:05:38,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:05:38,483 INFO L225 Difference]: With dead ends: 173 [2018-10-24 12:05:38,484 INFO L226 Difference]: Without dead ends: 135 [2018-10-24 12:05:38,485 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 133 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 460 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=527, Invalid=1365, Unknown=0, NotChecked=0, Total=1892 [2018-10-24 12:05:38,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-10-24 12:05:38,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 103. [2018-10-24 12:05:38,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-10-24 12:05:38,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 119 transitions. [2018-10-24 12:05:38,501 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 119 transitions. Word has length 70 [2018-10-24 12:05:38,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:05:38,502 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 119 transitions. [2018-10-24 12:05:38,502 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-24 12:05:38,502 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 119 transitions. [2018-10-24 12:05:38,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-10-24 12:05:38,503 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:05:38,504 INFO L375 BasicCegarLoop]: trace histogram [12, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:05:38,504 INFO L424 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:05:38,504 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:05:38,504 INFO L82 PathProgramCache]: Analyzing trace with hash -1182324676, now seen corresponding path program 9 times [2018-10-24 12:05:38,504 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:05:38,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:05:38,505 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:05:38,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:05:38,506 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:05:38,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:05:38,643 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-10-24 12:05:38,643 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 12:05:38,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-24 12:05:38,644 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 12:05:38,644 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 12:05:38,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 12:05:38,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-24 12:05:38,645 INFO L87 Difference]: Start difference. First operand 103 states and 119 transitions. Second operand 5 states. [2018-10-24 12:05:38,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:05:38,834 INFO L93 Difference]: Finished difference Result 159 states and 185 transitions. [2018-10-24 12:05:38,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 12:05:38,835 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-10-24 12:05:38,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:05:38,836 INFO L225 Difference]: With dead ends: 159 [2018-10-24 12:05:38,836 INFO L226 Difference]: Without dead ends: 103 [2018-10-24 12:05:38,837 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-24 12:05:38,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-10-24 12:05:38,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-10-24 12:05:38,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-10-24 12:05:38,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 117 transitions. [2018-10-24 12:05:38,852 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 117 transitions. Word has length 94 [2018-10-24 12:05:38,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:05:38,853 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 117 transitions. [2018-10-24 12:05:38,853 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 12:05:38,853 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 117 transitions. [2018-10-24 12:05:38,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-10-24 12:05:38,855 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:05:38,855 INFO L375 BasicCegarLoop]: trace histogram [13, 8, 8, 8, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:05:38,855 INFO L424 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:05:38,855 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:05:38,855 INFO L82 PathProgramCache]: Analyzing trace with hash -628161005, now seen corresponding path program 10 times [2018-10-24 12:05:38,855 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:05:38,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:05:38,856 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:05:38,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:05:38,857 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:05:38,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:05:39,191 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 192 proven. 24 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-10-24 12:05:39,192 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:05:39,192 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:05:39,192 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:05:39,193 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:05:39,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:05:39,193 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:05:39,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:05:39,206 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 12:05:39,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:05:39,291 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:05:39,432 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 112 proven. 18 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2018-10-24 12:05:39,432 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:05:39,591 WARN L179 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-10-24 12:05:39,747 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 112 proven. 18 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2018-10-24 12:05:39,768 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:05:39,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 21 [2018-10-24 12:05:39,768 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:05:39,769 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-24 12:05:39,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-24 12:05:39,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2018-10-24 12:05:39,770 INFO L87 Difference]: Start difference. First operand 103 states and 117 transitions. Second operand 15 states. [2018-10-24 12:05:40,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:05:40,383 INFO L93 Difference]: Finished difference Result 187 states and 217 transitions. [2018-10-24 12:05:40,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-24 12:05:40,384 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 98 [2018-10-24 12:05:40,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:05:40,386 INFO L225 Difference]: With dead ends: 187 [2018-10-24 12:05:40,386 INFO L226 Difference]: Without dead ends: 115 [2018-10-24 12:05:40,387 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 191 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=217, Invalid=905, Unknown=0, NotChecked=0, Total=1122 [2018-10-24 12:05:40,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-10-24 12:05:40,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 111. [2018-10-24 12:05:40,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-10-24 12:05:40,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 125 transitions. [2018-10-24 12:05:40,401 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 125 transitions. Word has length 98 [2018-10-24 12:05:40,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:05:40,401 INFO L481 AbstractCegarLoop]: Abstraction has 111 states and 125 transitions. [2018-10-24 12:05:40,402 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-24 12:05:40,402 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 125 transitions. [2018-10-24 12:05:40,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-10-24 12:05:40,403 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:05:40,403 INFO L375 BasicCegarLoop]: trace histogram [15, 10, 10, 10, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:05:40,403 INFO L424 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:05:40,404 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:05:40,404 INFO L82 PathProgramCache]: Analyzing trace with hash -740258815, now seen corresponding path program 11 times [2018-10-24 12:05:40,404 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:05:40,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:05:40,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:05:40,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:05:40,405 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:05:40,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:05:41,477 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 0 proven. 184 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2018-10-24 12:05:41,478 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:05:41,478 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:05:41,478 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:05:41,478 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:05:41,478 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:05:41,479 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-10-24 12:05:41,493 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-24 12:05:41,493 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:05:41,620 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-10-24 12:05:41,620 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:05:41,629 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:05:41,688 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-24 12:05:41,689 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-24 12:05:41,709 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 28 [2018-10-24 12:05:41,712 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 31 [2018-10-24 12:05:41,718 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:05:41,719 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 39 [2018-10-24 12:05:41,752 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:05:41,778 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:05:41,799 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:05:41,801 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 55 [2018-10-24 12:05:41,824 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:05:41,826 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:05:41,830 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:05:41,832 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:05:41,834 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:05:41,836 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:05:41,837 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 79 [2018-10-24 12:05:41,859 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:05:41,860 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:05:41,862 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:05:41,864 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:05:41,866 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:05:41,869 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:05:41,870 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:05:41,870 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:05:41,871 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:05:41,872 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:05:41,879 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 116 [2018-10-24 12:05:41,880 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-10-24 12:05:41,921 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:05:41,966 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:05:41,977 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:05:41,988 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:05:41,998 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:05:42,012 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:05:42,013 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:41, output treesize:43 [2018-10-24 12:05:42,085 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:05:42,109 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:05:42,111 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-24 12:05:42,111 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-24 12:05:42,219 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:05:42,220 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:54, output treesize:48 [2018-10-24 12:05:42,261 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 49 [2018-10-24 12:05:42,263 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-24 12:05:42,263 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:05:42,276 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:05:42,294 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:05:42,294 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:58, output treesize:45 [2018-10-24 12:05:42,347 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 47 [2018-10-24 12:05:42,350 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-24 12:05:42,351 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:05:42,365 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:05:42,383 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:05:42,383 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:56, output treesize:45 [2018-10-24 12:05:42,393 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 47 [2018-10-24 12:05:42,396 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-24 12:05:42,397 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:05:42,409 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:05:42,424 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:05:42,425 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:56, output treesize:45 [2018-10-24 12:05:42,436 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 51 [2018-10-24 12:05:42,440 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-10-24 12:05:42,440 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:05:42,450 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:05:42,465 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:05:42,466 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:60, output treesize:45 [2018-10-24 12:05:42,480 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 49 [2018-10-24 12:05:42,497 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-24 12:05:42,497 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:05:42,509 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:05:42,526 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:05:42,527 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:58, output treesize:45 [2018-10-24 12:05:42,631 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2018-10-24 12:05:42,636 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:05:42,637 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:05:42,637 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:05:42,638 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:05:42,638 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:05:42,639 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:05:42,640 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2018-10-24 12:05:42,641 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:05:42,643 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:05:42,646 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:05:42,648 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:7 [2018-10-24 12:05:42,784 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-10-24 12:05:42,785 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-24 12:05:42,801 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:05:42,801 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:46, output treesize:1 [2018-10-24 12:05:42,848 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 321 trivial. 0 not checked. [2018-10-24 12:05:42,848 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:06:12,509 WARN L179 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2018-10-24 12:06:12,677 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 47 proven. 30 refuted. 10 times theorem prover too weak. 303 trivial. 0 not checked. [2018-10-24 12:06:12,713 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:06:12,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 17] total 41 [2018-10-24 12:06:12,713 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:06:12,714 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-24 12:06:12,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-24 12:06:12,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=1414, Unknown=13, NotChecked=0, Total=1640 [2018-10-24 12:06:12,716 INFO L87 Difference]: Start difference. First operand 111 states and 125 transitions. Second operand 26 states. [2018-10-24 12:06:14,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:06:14,156 INFO L93 Difference]: Finished difference Result 201 states and 228 transitions. [2018-10-24 12:06:14,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-24 12:06:14,156 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 106 [2018-10-24 12:06:14,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:06:14,158 INFO L225 Difference]: With dead ends: 201 [2018-10-24 12:06:14,158 INFO L226 Difference]: Without dead ends: 120 [2018-10-24 12:06:14,161 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 188 SyntacticMatches, 5 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 768 ImplicationChecksByTransitivity, 31.1s TimeCoverageRelationStatistics Valid=522, Invalid=3005, Unknown=13, NotChecked=0, Total=3540 [2018-10-24 12:06:14,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-10-24 12:06:14,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 118. [2018-10-24 12:06:14,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-10-24 12:06:14,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 131 transitions. [2018-10-24 12:06:14,184 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 131 transitions. Word has length 106 [2018-10-24 12:06:14,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:06:14,184 INFO L481 AbstractCegarLoop]: Abstraction has 118 states and 131 transitions. [2018-10-24 12:06:14,184 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-24 12:06:14,185 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 131 transitions. [2018-10-24 12:06:14,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-10-24 12:06:14,186 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:06:14,186 INFO L375 BasicCegarLoop]: trace histogram [15, 10, 10, 9, 6, 6, 5, 5, 5, 5, 5, 5, 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] [2018-10-24 12:06:14,187 INFO L424 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:06:14,187 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:06:14,187 INFO L82 PathProgramCache]: Analyzing trace with hash -885417485, now seen corresponding path program 1 times [2018-10-24 12:06:14,187 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:06:14,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:06:14,188 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:06:14,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:06:14,188 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:06:14,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:06:15,001 WARN L179 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 30 [2018-10-24 12:06:15,622 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 194 proven. 32 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2018-10-24 12:06:15,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:06:15,623 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:06:15,623 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 116 with the following transitions: [2018-10-24 12:06:15,623 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [18], [21], [23], [26], [28], [30], [34], [36], [40], [41], [45], [48], [50], [52], [57], [61], [66], [68], [70], [76], [79], [81], [84], [86], [87], [88], [89], [91], [92], [93], [94] [2018-10-24 12:06:15,626 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-24 12:06:15,626 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 12:06:16,898 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-24 12:06:16,898 INFO L272 AbstractInterpreter]: Visited 37 different actions 234 times. Merged at 18 different actions 129 times. Widened at 5 different actions 14 times. Found 23 fixpoints after 8 different actions. Largest state had 36 variables. [2018-10-24 12:06:16,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:06:16,936 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-24 12:06:16,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:06:16,936 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:06:16,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:06:16,947 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 12:06:17,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:06:17,051 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:06:17,353 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 48 [2018-10-24 12:06:17,358 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:06:17,360 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:06:17,363 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 62 [2018-10-24 12:06:17,368 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:06:17,369 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:06:17,369 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:06:17,374 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:06:17,376 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 91 [2018-10-24 12:06:17,377 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-24 12:06:17,392 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:06:17,401 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:06:17,411 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:06:17,412 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:60, output treesize:27 [2018-10-24 12:06:17,794 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 41 [2018-10-24 12:06:17,796 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:06:17,796 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:06:17,797 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:06:17,799 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:06:17,800 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:06:17,802 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:06:17,803 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2018-10-24 12:06:17,805 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:06:17,812 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:06:17,813 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:06:17,814 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:5 [2018-10-24 12:06:17,862 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 143 proven. 150 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2018-10-24 12:06:17,862 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:06:18,666 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 139 treesize of output 125 [2018-10-24 12:06:18,674 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:06:18,684 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:06:18,728 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 125 treesize of output 181 [2018-10-24 12:06:19,441 WARN L179 SmtUtils]: Spent 700.00 ms on a formula simplification. DAG size of input: 202 DAG size of output: 131 [2018-10-24 12:06:19,470 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:06:19,530 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:06:19,536 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:06:19,536 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:06:19,538 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:06:19,538 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:06:19,540 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:06:19,540 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:06:19,552 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:06:19,553 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:06:19,553 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:06:19,554 INFO L303 Elim1Store]: Index analysis took 108 ms [2018-10-24 12:06:19,569 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 96 treesize of output 186 [2018-10-24 12:06:19,574 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-10-24 12:06:19,600 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:06:19,615 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:06:19,629 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:06:19,638 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:06:19,650 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:06:19,665 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:06:19,788 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:06:19,788 INFO L303 Elim1Store]: Index analysis took 213 ms [2018-10-24 12:06:19,790 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 125 [2018-10-24 12:06:19,792 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-24 12:06:19,820 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:06:19,869 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:06:19,870 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:06:19,871 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:06:19,871 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:06:19,874 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:06:19,874 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:06:19,876 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:06:19,887 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:06:19,888 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:06:19,891 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:06:19,905 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 93 treesize of output 190 [2018-10-24 12:06:19,908 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 3 xjuncts. [2018-10-24 12:06:20,439 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:06:20,440 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:06:20,448 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:06:20,450 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:06:20,450 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:06:20,451 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:06:20,451 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:06:20,465 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:06:20,465 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:06:20,489 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 165 [2018-10-24 12:06:20,495 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 6 xjuncts. [2018-10-24 12:06:20,529 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:06:20,529 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:06:20,531 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:06:20,533 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:06:20,538 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:06:20,539 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:06:20,539 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:06:20,543 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:06:20,546 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:06:20,561 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:06:20,565 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:06:20,568 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:06:20,571 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:06:20,611 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 13 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 91 treesize of output 263 [2018-10-24 12:06:20,612 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-10-24 12:06:20,654 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 18 xjuncts. [2018-10-24 12:06:20,681 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:06:20,693 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:06:20,706 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:06:20,719 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:06:20,732 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:06:20,744 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:06:20,757 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:06:20,758 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:06:20,770 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:06:20,771 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:06:20,772 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:06:20,772 INFO L303 Elim1Store]: Index analysis took 117 ms [2018-10-24 12:06:20,774 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 136 [2018-10-24 12:06:20,777 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-24 12:06:21,076 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:06:21,077 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:06:21,078 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:06:21,081 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:06:21,082 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 66 [2018-10-24 12:06:21,083 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-10-24 12:06:21,194 INFO L267 ElimStorePlain]: Start of recursive call 3: 5 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-24 12:06:21,215 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-24 12:06:21,237 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-24 12:06:21,237 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:139, output treesize:80 [2018-10-24 12:06:21,346 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 251 proven. 42 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2018-10-24 12:06:21,368 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:06:21,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 15] total 46 [2018-10-24 12:06:21,368 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:06:21,369 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-24 12:06:21,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-24 12:06:21,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=1874, Unknown=0, NotChecked=0, Total=2070 [2018-10-24 12:06:21,370 INFO L87 Difference]: Start difference. First operand 118 states and 131 transitions. Second operand 33 states. [2018-10-24 12:06:22,256 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 28 [2018-10-24 12:06:23,136 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 31 [2018-10-24 12:06:23,782 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 37 [2018-10-24 12:06:24,100 WARN L179 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 32 [2018-10-24 12:06:24,762 WARN L179 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 32 [2018-10-24 12:06:25,193 WARN L179 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 39 [2018-10-24 12:06:26,095 WARN L179 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 43 [2018-10-24 12:06:26,633 WARN L179 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 51 [2018-10-24 12:06:26,791 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 39 [2018-10-24 12:06:26,974 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 45 [2018-10-24 12:06:27,298 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 29 [2018-10-24 12:06:27,974 WARN L179 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 24 [2018-10-24 12:06:28,193 WARN L179 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 33 [2018-10-24 12:06:28,413 WARN L179 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 43 [2018-10-24 12:06:28,869 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 41 [2018-10-24 12:06:29,101 WARN L179 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 34 [2018-10-24 12:06:29,292 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 43 [2018-10-24 12:06:29,689 WARN L179 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 46 [2018-10-24 12:06:29,981 WARN L179 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 60 [2018-10-24 12:06:30,349 WARN L179 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 44 [2018-10-24 12:06:30,625 WARN L179 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 41 [2018-10-24 12:06:30,813 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 42 [2018-10-24 12:06:31,491 WARN L179 SmtUtils]: Spent 414.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 28 [2018-10-24 12:06:31,993 WARN L179 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 57 [2018-10-24 12:06:32,179 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 42 [2018-10-24 12:06:32,561 WARN L179 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 50 [2018-10-24 12:06:32,861 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 38 [2018-10-24 12:06:33,101 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 39 [2018-10-24 12:06:33,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:06:33,465 INFO L93 Difference]: Finished difference Result 292 states and 341 transitions. [2018-10-24 12:06:33,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-10-24 12:06:33,465 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 115 [2018-10-24 12:06:33,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:06:33,468 INFO L225 Difference]: With dead ends: 292 [2018-10-24 12:06:33,468 INFO L226 Difference]: Without dead ends: 230 [2018-10-24 12:06:33,473 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3917 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=1691, Invalid=12115, Unknown=0, NotChecked=0, Total=13806 [2018-10-24 12:06:33,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-10-24 12:06:33,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 178. [2018-10-24 12:06:33,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-10-24 12:06:33,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 206 transitions. [2018-10-24 12:06:33,504 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 206 transitions. Word has length 115 [2018-10-24 12:06:33,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:06:33,505 INFO L481 AbstractCegarLoop]: Abstraction has 178 states and 206 transitions. [2018-10-24 12:06:33,505 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-24 12:06:33,505 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 206 transitions. [2018-10-24 12:06:33,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-10-24 12:06:33,506 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:06:33,506 INFO L375 BasicCegarLoop]: trace histogram [15, 10, 10, 8, 6, 6, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:06:33,507 INFO L424 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:06:33,507 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:06:33,507 INFO L82 PathProgramCache]: Analyzing trace with hash -637270991, now seen corresponding path program 2 times [2018-10-24 12:06:33,507 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:06:33,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:06:33,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:06:33,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:06:33,508 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:06:33,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:06:33,821 WARN L179 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-10-24 12:06:33,997 WARN L179 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-10-24 12:06:35,792 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 10 proven. 247 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2018-10-24 12:06:35,792 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:06:35,792 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:06:35,792 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:06:35,792 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:06:35,792 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:06:35,793 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:06:35,800 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-24 12:06:35,800 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-24 12:06:36,177 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-10-24 12:06:36,177 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:06:36,184 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:06:36,191 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-24 12:06:36,192 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-24 12:06:36,217 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 26 [2018-10-24 12:06:36,246 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2018-10-24 12:06:36,279 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:06:36,280 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 37 [2018-10-24 12:06:36,310 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:06:36,321 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:06:36,323 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:06:36,324 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 53 [2018-10-24 12:06:36,330 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:06:36,331 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:06:36,332 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:06:36,332 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:06:36,333 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:06:36,334 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:06:36,335 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2018-10-24 12:06:36,340 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:06:36,341 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:06:36,343 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:06:36,344 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:06:36,345 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:06:36,346 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:06:36,347 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:06:36,349 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:06:36,350 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:06:36,351 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:06:36,372 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 106 [2018-10-24 12:06:36,372 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-10-24 12:06:36,401 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:06:36,417 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:06:36,431 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:06:36,442 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:06:36,454 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:06:36,475 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:06:36,475 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:47, output treesize:46 [2018-10-24 12:06:36,548 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:06:36,549 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:06:36,550 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-24 12:06:36,551 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-24 12:06:36,568 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:06:36,568 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:54, output treesize:48 [2018-10-24 12:06:36,670 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 47 [2018-10-24 12:06:36,677 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-24 12:06:36,677 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:06:36,690 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:06:36,711 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:06:36,711 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:59, output treesize:48 [2018-10-24 12:06:36,722 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 47 [2018-10-24 12:06:36,737 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-24 12:06:36,737 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:06:36,749 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:06:36,773 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:06:36,773 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:59, output treesize:48 [2018-10-24 12:06:36,819 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 51 [2018-10-24 12:06:36,830 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-10-24 12:06:36,831 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:06:36,846 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:06:36,869 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:06:36,869 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:63, output treesize:48 [2018-10-24 12:06:36,886 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 47 [2018-10-24 12:06:36,892 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-24 12:06:36,892 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:06:36,906 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:06:36,927 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:06:36,927 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:59, output treesize:48 [2018-10-24 12:06:36,937 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 49 [2018-10-24 12:06:36,940 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-24 12:06:36,941 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:06:36,954 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:06:36,977 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:06:36,978 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:61, output treesize:44 [2018-10-24 12:06:37,175 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2018-10-24 12:06:37,178 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:06:37,178 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:06:37,180 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:06:37,181 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:06:37,182 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:06:37,183 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:06:37,184 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2018-10-24 12:06:37,185 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:06:37,188 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:06:37,194 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:06:37,194 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:44, output treesize:10 [2018-10-24 12:06:38,171 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 77 proven. 107 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2018-10-24 12:06:38,172 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:07:40,214 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 68 proven. 172 refuted. 5 times theorem prover too weak. 150 trivial. 0 not checked. [2018-10-24 12:07:40,254 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:07:40,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 21, 27] total 71 [2018-10-24 12:07:40,254 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:07:40,255 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-10-24 12:07:40,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-10-24 12:07:40,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=402, Invalid=4539, Unknown=29, NotChecked=0, Total=4970 [2018-10-24 12:07:40,258 INFO L87 Difference]: Start difference. First operand 178 states and 206 transitions. Second operand 46 states. [2018-10-24 12:07:41,931 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 52 [2018-10-24 12:07:42,200 WARN L179 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 61 [2018-10-24 12:07:42,413 WARN L179 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 57 [2018-10-24 12:07:42,753 WARN L179 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 53 [2018-10-24 12:07:43,196 WARN L179 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 46 [2018-10-24 12:07:43,633 WARN L179 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 56 [2018-10-24 12:07:43,860 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 57 [2018-10-24 12:07:44,248 WARN L179 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 54 [2018-10-24 12:07:44,469 WARN L179 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 59 [2018-10-24 12:07:45,014 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 50 [2018-10-24 12:07:45,428 WARN L179 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 57 [2018-10-24 12:07:45,693 WARN L179 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 55 [2018-10-24 12:07:45,930 WARN L179 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 61 [2018-10-24 12:07:46,165 WARN L179 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 63 [2018-10-24 12:07:46,398 WARN L179 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 60 [2018-10-24 12:07:46,687 WARN L179 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 58 [2018-10-24 12:07:46,922 WARN L179 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 60 [2018-10-24 12:07:47,263 WARN L179 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 60 [2018-10-24 12:07:47,501 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 51 [2018-10-24 12:07:48,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:07:48,307 INFO L93 Difference]: Finished difference Result 358 states and 423 transitions. [2018-10-24 12:07:48,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-24 12:07:48,308 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 115 [2018-10-24 12:07:48,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:07:48,311 INFO L225 Difference]: With dead ends: 358 [2018-10-24 12:07:48,311 INFO L226 Difference]: Without dead ends: 214 [2018-10-24 12:07:48,315 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 189 SyntacticMatches, 8 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2536 ImplicationChecksByTransitivity, 71.1s TimeCoverageRelationStatistics Valid=1570, Invalid=9957, Unknown=29, NotChecked=0, Total=11556 [2018-10-24 12:07:48,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-10-24 12:07:48,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 196. [2018-10-24 12:07:48,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-10-24 12:07:48,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 228 transitions. [2018-10-24 12:07:48,343 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 228 transitions. Word has length 115 [2018-10-24 12:07:48,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:07:48,343 INFO L481 AbstractCegarLoop]: Abstraction has 196 states and 228 transitions. [2018-10-24 12:07:48,343 INFO L482 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-10-24 12:07:48,343 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 228 transitions. [2018-10-24 12:07:48,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-10-24 12:07:48,344 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:07:48,345 INFO L375 BasicCegarLoop]: trace histogram [15, 10, 10, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:07:48,345 INFO L424 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:07:48,345 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:07:48,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1768520621, now seen corresponding path program 3 times [2018-10-24 12:07:48,345 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:07:48,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:07:48,346 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:07:48,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:07:48,346 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:07:48,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:07:48,638 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-10-24 12:07:49,639 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 34 proven. 224 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2018-10-24 12:07:49,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:07:49,640 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:07:49,640 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:07:49,640 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:07:49,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:07:49,640 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:07:49,652 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-24 12:07:49,652 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-24 12:07:49,724 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-24 12:07:49,725 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:07:49,729 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:07:49,911 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-10-24 12:07:49,912 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-10-24 12:07:49,913 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:07:49,915 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:07:49,920 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:07:49,921 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:3 [2018-10-24 12:07:50,326 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 48 [2018-10-24 12:07:50,329 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:07:50,331 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:07:50,336 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 62 [2018-10-24 12:07:50,340 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:07:50,341 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:07:50,345 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:07:50,348 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:07:50,349 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 91 [2018-10-24 12:07:50,350 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-24 12:07:50,365 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:07:50,373 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:07:50,381 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:07:50,382 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:60, output treesize:27 [2018-10-24 12:07:50,611 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 43 [2018-10-24 12:07:50,614 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:50,615 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:07:50,616 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:07:50,622 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 62 [2018-10-24 12:07:50,629 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:07:50,631 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:07:50,632 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:07:50,636 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:07:50,637 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 79 [2018-10-24 12:07:50,638 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-24 12:07:50,653 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:07:50,661 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:07:50,671 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:07:50,672 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:55, output treesize:24 [2018-10-24 12:07:50,809 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2018-10-24 12:07:50,811 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:07:50,812 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:07:50,813 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2018-10-24 12:07:50,814 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:07:50,818 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:07:50,821 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:07:50,821 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:5 [2018-10-24 12:07:50,880 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 89 proven. 253 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-10-24 12:07:50,880 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:07:57,101 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 230 proven. 79 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-10-24 12:07:57,122 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:07:57,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 27, 16] total 62 [2018-10-24 12:07:57,122 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:07:57,123 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-24 12:07:57,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-24 12:07:57,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=245, Invalid=3535, Unknown=2, NotChecked=0, Total=3782 [2018-10-24 12:07:57,125 INFO L87 Difference]: Start difference. First operand 196 states and 228 transitions. Second operand 48 states. [2018-10-24 12:07:59,248 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2018-10-24 12:08:04,811 WARN L179 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2018-10-24 12:08:05,722 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 42 [2018-10-24 12:08:06,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:08:06,038 INFO L93 Difference]: Finished difference Result 560 states and 662 transitions. [2018-10-24 12:08:06,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-10-24 12:08:06,039 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 115 [2018-10-24 12:08:06,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:08:06,041 INFO L225 Difference]: With dead ends: 560 [2018-10-24 12:08:06,042 INFO L226 Difference]: Without dead ends: 293 [2018-10-24 12:08:06,048 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 195 SyntacticMatches, 6 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4297 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=1001, Invalid=14249, Unknown=2, NotChecked=0, Total=15252 [2018-10-24 12:08:06,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2018-10-24 12:08:06,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 219. [2018-10-24 12:08:06,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-10-24 12:08:06,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 254 transitions. [2018-10-24 12:08:06,081 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 254 transitions. Word has length 115 [2018-10-24 12:08:06,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:08:06,082 INFO L481 AbstractCegarLoop]: Abstraction has 219 states and 254 transitions. [2018-10-24 12:08:06,082 INFO L482 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-24 12:08:06,082 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 254 transitions. [2018-10-24 12:08:06,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-10-24 12:08:06,083 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:08:06,083 INFO L375 BasicCegarLoop]: trace histogram [15, 10, 10, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:08:06,084 INFO L424 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:08:06,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:08:06,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1364464215, now seen corresponding path program 4 times [2018-10-24 12:08:06,084 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:08:06,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:08:06,085 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:08:06,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:08:06,085 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:08:06,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:08:06,692 WARN L179 SmtUtils]: Spent 392.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 24 [2018-10-24 12:08:07,054 WARN L179 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 25 [2018-10-24 12:08:09,036 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 49 [2018-10-24 12:08:09,265 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 50 [2018-10-24 12:08:09,490 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 51 [2018-10-24 12:08:09,797 WARN L179 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 47 [2018-10-24 12:08:10,063 WARN L179 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 51 [2018-10-24 12:08:10,300 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 42 [2018-10-24 12:08:10,527 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 10 proven. 299 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-10-24 12:08:10,527 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:08:10,527 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:08:10,528 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:08:10,528 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:08:10,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:08:10,528 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:08:10,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:08:10,536 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 12:08:10,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:08:10,629 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:08:10,632 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-24 12:08:10,632 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-24 12:08:10,636 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:08:10,636 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-10-24 12:08:10,689 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:08:10,690 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:08:10,691 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-24 12:08:10,691 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-24 12:08:10,695 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:08:10,695 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-10-24 12:08:10,853 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-10-24 12:08:10,856 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-10-24 12:08:10,856 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:08:10,857 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:08:10,863 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:08:10,864 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-10-24 12:08:10,967 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-10-24 12:08:10,969 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:08:10,970 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-10-24 12:08:10,971 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:08:10,976 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:08:10,988 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:08:10,988 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:35, output treesize:14 [2018-10-24 12:08:11,035 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2018-10-24 12:08:11,039 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-10-24 12:08:11,039 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:08:11,042 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:08:11,046 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:08:11,046 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:3 [2018-10-24 12:08:11,051 WARN L854 $PredicateComparison]: unable to prove that (exists ((SelectionSort_~lh~0 Int) (|SelectionSort_read~int_#value| Int) (|SelectionSort_write~int_#ptr.offset| Int) (|SelectionSort_write~int_#value| Int)) (= (store |c_old(#memory_int)| |c_~#array~0.base| (store (store (select |c_old(#memory_int)| |c_~#array~0.base|) (+ (* 4 SelectionSort_~lh~0) |c_~#array~0.offset|) |SelectionSort_read~int_#value|) |SelectionSort_write~int_#ptr.offset| |SelectionSort_write~int_#value|)) |c_#memory_int|)) is different from true [2018-10-24 12:08:11,074 WARN L854 $PredicateComparison]: unable to prove that (exists ((v_prenex_6 Int) (v_prenex_7 Int) (SelectionSort_~lh~0 Int) (|SelectionSort_read~int_#value| Int) (v_prenex_5 Int) (|SelectionSort_write~int_#ptr.offset| Int) (|SelectionSort_write~int_#value| Int) (v_prenex_8 Int)) (= (store |c_old(#memory_int)| |c_~#array~0.base| (store (store (store (store (select |c_old(#memory_int)| |c_~#array~0.base|) (+ (* 4 v_prenex_5) |c_~#array~0.offset|) v_prenex_6) v_prenex_7 v_prenex_8) (+ (* 4 SelectionSort_~lh~0) |c_~#array~0.offset|) |SelectionSort_read~int_#value|) |SelectionSort_write~int_#ptr.offset| |SelectionSort_write~int_#value|)) |c_#memory_int|)) is different from true [2018-10-24 12:08:11,121 WARN L854 $PredicateComparison]: unable to prove that (exists ((v_prenex_6 Int) (v_prenex_7 Int) (SelectionSort_~lh~0 Int) (|SelectionSort_read~int_#value| Int) (v_prenex_5 Int) (|SelectionSort_write~int_#ptr.offset| Int) (v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_10 Int) (|SelectionSort_write~int_#value| Int) (v_prenex_8 Int) (v_prenex_9 Int)) (= |c_#memory_int| (store |c_old(#memory_int)| |c_~#array~0.base| (store (store (store (store (store (store (select |c_old(#memory_int)| |c_~#array~0.base|) (+ (* 4 v_prenex_5) |c_~#array~0.offset|) v_prenex_6) v_prenex_7 v_prenex_8) (+ |c_~#array~0.offset| (* 4 v_prenex_9)) v_prenex_10) v_prenex_11 v_prenex_12) (+ (* 4 SelectionSort_~lh~0) |c_~#array~0.offset|) |SelectionSort_read~int_#value|) |SelectionSort_write~int_#ptr.offset| |SelectionSort_write~int_#value|)))) is different from true [2018-10-24 12:08:11,166 WARN L854 $PredicateComparison]: unable to prove that (exists ((v_prenex_16 Int) (v_prenex_15 Int) (SelectionSort_~lh~0 Int) (|SelectionSort_read~int_#value| Int) (|SelectionSort_write~int_#ptr.offset| Int) (v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_14 Int) (v_prenex_13 Int) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_9 Int) (v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_5 Int) (|SelectionSort_write~int_#value| Int)) (= (store |c_old(#memory_int)| |c_~#array~0.base| (store (store (store (store (store (store (store (store (select |c_old(#memory_int)| |c_~#array~0.base|) (+ (* 4 v_prenex_5) |c_~#array~0.offset|) v_prenex_6) v_prenex_7 v_prenex_8) (+ |c_~#array~0.offset| (* 4 v_prenex_9)) v_prenex_10) v_prenex_11 v_prenex_12) (+ |c_~#array~0.offset| (* 4 v_prenex_13)) v_prenex_14) v_prenex_15 v_prenex_16) (+ (* 4 SelectionSort_~lh~0) |c_~#array~0.offset|) |SelectionSort_read~int_#value|) |SelectionSort_write~int_#ptr.offset| |SelectionSort_write~int_#value|)) |c_#memory_int|)) is different from true [2018-10-24 12:08:11,203 WARN L854 $PredicateComparison]: unable to prove that (exists ((v_prenex_16 Int) (v_prenex_15 Int) (SelectionSort_~lh~0 Int) (|SelectionSort_read~int_#value| Int) (v_prenex_18 Int) (v_prenex_17 Int) (|SelectionSort_write~int_#ptr.offset| Int) (v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_14 Int) (v_prenex_13 Int) (v_prenex_10 Int) (v_prenex_20 Int) (v_prenex_8 Int) (v_prenex_9 Int) (v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_5 Int) (v_prenex_19 Int) (|SelectionSort_write~int_#value| Int)) (= |c_#memory_int| (store |c_old(#memory_int)| |c_~#array~0.base| (store (store (store (store (store (store (store (store (store (store (select |c_old(#memory_int)| |c_~#array~0.base|) (+ (* 4 v_prenex_5) |c_~#array~0.offset|) v_prenex_6) v_prenex_7 v_prenex_8) (+ |c_~#array~0.offset| (* 4 v_prenex_9)) v_prenex_10) v_prenex_11 v_prenex_12) (+ |c_~#array~0.offset| (* 4 v_prenex_13)) v_prenex_14) v_prenex_15 v_prenex_16) (+ (* 4 v_prenex_17) |c_~#array~0.offset|) v_prenex_18) v_prenex_19 v_prenex_20) (+ (* 4 SelectionSort_~lh~0) |c_~#array~0.offset|) |SelectionSort_read~int_#value|) |SelectionSort_write~int_#ptr.offset| |SelectionSort_write~int_#value|)))) is different from true [2018-10-24 12:08:11,253 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 69 [2018-10-24 12:08:11,258 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 58 [2018-10-24 12:08:11,297 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 68 [2018-10-24 12:08:11,322 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 76 [2018-10-24 12:08:11,349 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 76 [2018-10-24 12:08:11,371 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 84 [2018-10-24 12:08:11,427 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 72 treesize of output 106 [2018-10-24 12:08:11,452 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 73 treesize of output 91 [2018-10-24 12:08:11,493 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 79 treesize of output 113 [2018-10-24 12:08:11,515 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 80 treesize of output 98 [2018-10-24 12:08:11,534 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 88 treesize of output 97 [2018-10-24 12:08:11,535 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2018-10-24 12:08:11,697 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 86 treesize of output 121 [2018-10-24 12:08:11,699 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 8 xjuncts. [2018-10-24 12:08:12,125 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-10-24 12:08:13,174 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 82 treesize of output 128 [2018-10-24 12:08:13,194 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-10-24 12:08:13,195 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-10-24 12:08:13,523 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:08:13,553 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 102 treesize of output 133 [2018-10-24 12:08:13,555 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 4 xjuncts. [2018-10-24 12:08:14,014 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 93 treesize of output 128 [2018-10-24 12:08:14,017 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 8 xjuncts. [2018-10-24 12:08:14,507 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:08:14,537 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 102 treesize of output 133 [2018-10-24 12:08:14,539 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 4 xjuncts. [2018-10-24 12:08:15,065 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 95 treesize of output 104 [2018-10-24 12:08:15,066 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 2 xjuncts. [2018-10-24 12:08:15,944 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:08:16,006 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 100 treesize of output 161 [2018-10-24 12:08:16,013 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 32 xjuncts. [2018-10-24 12:08:16,856 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 9 case distinctions, treesize of input 88 treesize of output 165 [2018-10-24 12:08:16,857 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-10-24 12:08:16,869 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 64 xjuncts. [2018-10-24 12:08:18,011 INFO L267 ElimStorePlain]: Start of recursive call 14: 8 dim-1 vars, End of recursive call: and 13 xjuncts. [2018-10-24 12:08:18,897 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:18,955 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 84 treesize of output 142 [2018-10-24 12:08:18,977 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:19,028 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 91 treesize of output 144 [2018-10-24 12:08:19,033 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 16 xjuncts. [2018-10-24 12:08:21,303 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 93 treesize of output 128 [2018-10-24 12:08:21,305 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 8 xjuncts. [2018-10-24 12:08:22,467 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 93 treesize of output 128 [2018-10-24 12:08:22,469 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 8 xjuncts. [2018-10-24 12:08:23,795 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 93 treesize of output 120 [2018-10-24 12:08:23,797 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 8 xjuncts. [2018-10-24 12:08:25,081 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:08:25,087 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:08:25,132 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 104 treesize of output 157 [2018-10-24 12:08:25,134 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 8 xjuncts. [2018-10-24 12:08:26,579 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:26,656 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 11 case distinctions, treesize of input 89 treesize of output 168 [2018-10-24 12:08:26,657 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-10-24 12:08:26,663 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 32 xjuncts. [2018-10-24 12:08:30,580 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 95 treesize of output 104 [2018-10-24 12:08:30,581 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 2 xjuncts. [2018-10-24 12:08:34,064 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:08:34,119 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 7 case distinctions, treesize of input 104 treesize of output 153 [2018-10-24 12:08:34,124 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 16 xjuncts. [2018-10-24 12:08:38,095 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:08:38,124 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 98 treesize of output 121 [2018-10-24 12:08:38,125 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 4 xjuncts. [2018-10-24 12:08:40,075 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 13 case distinctions, treesize of input 86 treesize of output 189 [2018-10-24 12:08:40,075 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-10-24 12:08:40,107 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 128 xjuncts. [2018-10-24 12:08:43,899 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:43,953 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 91 treesize of output 144 [2018-10-24 12:08:43,957 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 16 xjuncts. [2018-10-24 12:08:46,010 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:08:46,071 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 96 treesize of output 157 [2018-10-24 12:08:46,077 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 32 xjuncts. [2018-10-24 12:08:48,027 INFO L267 ElimStorePlain]: Start of recursive call 22: 16 dim-1 vars, End of recursive call: and 35 xjuncts. [2018-10-24 12:08:50,382 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 82 treesize of output 128 [2018-10-24 12:08:50,389 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:08:50,421 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 102 treesize of output 133 [2018-10-24 12:08:50,423 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 4 xjuncts. [2018-10-24 12:08:50,894 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 93 treesize of output 128 [2018-10-24 12:08:50,897 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 8 xjuncts. [2018-10-24 12:08:51,439 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:08:51,505 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 100 treesize of output 161 [2018-10-24 12:08:51,512 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 32 xjuncts. [2018-10-24 12:08:52,523 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 9 case distinctions, treesize of input 88 treesize of output 165 [2018-10-24 12:08:52,524 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-10-24 12:08:52,534 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 64 xjuncts. [2018-10-24 12:08:53,722 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:08:53,756 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 102 treesize of output 133 [2018-10-24 12:08:53,758 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 4 xjuncts. [2018-10-24 12:08:54,370 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 95 treesize of output 104 [2018-10-24 12:08:54,371 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 2 xjuncts. [2018-10-24 12:08:55,937 INFO L267 ElimStorePlain]: Start of recursive call 35: 8 dim-1 vars, End of recursive call: and 13 xjuncts. [2018-10-24 12:08:58,405 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 9 case distinctions, treesize of input 81 treesize of output 155 [2018-10-24 12:08:58,405 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-10-24 12:08:58,421 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:08:58,432 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:58,478 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 7 case distinctions, treesize of input 99 treesize of output 156 [2018-10-24 12:08:58,482 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 16 xjuncts. [2018-10-24 12:09:13,043 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:09:13,113 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 96 treesize of output 169 [2018-10-24 12:09:13,118 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 32 xjuncts. [2018-10-24 12:09:22,801 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 93 treesize of output 128 [2018-10-24 12:09:22,803 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 8 xjuncts. [2018-10-24 12:09:27,170 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:09:27,222 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 99 treesize of output 155 [2018-10-24 12:09:27,225 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 16 xjuncts. Received shutdown request... [2018-10-24 12:09:36,790 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2018-10-24 12:09:36,991 WARN L522 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:09:36,992 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-24 12:09:36,997 WARN L205 ceAbstractionStarter]: Timeout [2018-10-24 12:09:36,998 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 12:09:36 BoogieIcfgContainer [2018-10-24 12:09:36,998 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-24 12:09:36,998 INFO L168 Benchmark]: Toolchain (without parser) took 257003.63 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 1.0 GB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -392.5 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2018-10-24 12:09:36,999 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 12:09:36,999 INFO L168 Benchmark]: CACSL2BoogieTranslator took 349.12 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: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-10-24 12:09:36,999 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.89 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 12:09:36,999 INFO L168 Benchmark]: Boogie Preprocessor took 69.76 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 12:09:37,000 INFO L168 Benchmark]: RCFGBuilder took 841.84 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 723.5 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -740.1 MB). Peak memory consumption was 15.7 MB. Max. memory is 7.1 GB. [2018-10-24 12:09:37,000 INFO L168 Benchmark]: TraceAbstraction took 255666.73 ms. Allocated memory was 2.2 GB in the beginning and 2.5 GB in the end (delta: 291.0 MB). Free memory was 2.1 GB in the beginning and 1.8 GB in the end (delta: 337.1 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2018-10-24 12:09:37,002 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.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 349.12 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: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 70.89 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 69.76 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 841.84 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 723.5 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -740.1 MB). Peak memory consumption was 15.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 255666.73 ms. Allocated memory was 2.2 GB in the beginning and 2.5 GB in the end (delta: 291.0 MB). Free memory was 2.1 GB in the beginning and 1.8 GB in the end (delta: 337.1 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 5]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 5). Cancelled while BasicCegarLoop was analyzing trace of length 116 with TraceHistMax 15,while TraceCheckSpWp was constructing forward predicates,while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations,while SimplifyDDAWithTimeout was simplifying term of DAG size 442. - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 38 locations, 1 error locations. TIMEOUT Result, 255.5s OverallTime, 19 OverallIterations, 15 TraceHistogramMax, 37.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 610 SDtfs, 1611 SDslu, 3714 SDs, 0 SdLazy, 5806 SolverSat, 872 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.7s Time, PredicateUnifierStatistics: 4 DeclaredPredicates, 2407 GetRequests, 1798 SyntacticMatches, 42 SemanticMatches, 567 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12470 ImplicationChecksByTransitivity, 135.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=219occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 3.5s AbstIntTime, 4 AbstIntIterations, 2 AbstIntStrong, 0.9549741124260354 AbsIntWeakeningRatio, 1.8653846153846154 AbsIntAvgWeakeningVarsNumRemoved, 121.5576923076923 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 18 MinimizatonAttempts, 248 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 119.3s InterpolantComputationTime, 2114 NumberOfCodeBlocks, 2024 NumberOfCodeBlocksAsserted, 54 NumberOfCheckSat, 3033 ConstructedInterpolants, 78 QuantifiedInterpolants, 3370365 SizeOfPredicates, 187 NumberOfNonLiveVariables, 4307 ConjunctsInSsa, 374 ConjunctsInUnsatCore, 44 InterpolantComputations, 3 PerfectInterpolantSequences, 5101/7161 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown