java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf -i ../../../trunk/examples/svcomp/loops/insertion_sort_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 22:01:19,172 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 22:01:19,175 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 22:01:19,197 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 22:01:19,197 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 22:01:19,199 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 22:01:19,200 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 22:01:19,203 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 22:01:19,205 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 22:01:19,213 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 22:01:19,214 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 22:01:19,214 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 22:01:19,219 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 22:01:19,222 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 22:01:19,225 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 22:01:19,226 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 22:01:19,227 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 22:01:19,230 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 22:01:19,235 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 22:01:19,239 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 22:01:19,241 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 22:01:19,242 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 22:01:19,248 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 22:01:19,248 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 22:01:19,248 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 22:01:19,250 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 22:01:19,250 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 22:01:19,252 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 22:01:19,253 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 22:01:19,254 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 22:01:19,254 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 22:01:19,255 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 22:01:19,255 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 22:01:19,255 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 22:01:19,259 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 22:01:19,260 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 22:01:19,260 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf [2018-11-07 22:01:19,290 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 22:01:19,290 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 22:01:19,292 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 22:01:19,292 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 22:01:19,292 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 22:01:19,293 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 22:01:19,293 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-07 22:01:19,293 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 22:01:19,293 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 22:01:19,294 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 22:01:19,294 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 22:01:19,294 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 22:01:19,294 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 22:01:19,295 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 22:01:19,296 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 22:01:19,296 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 22:01:19,296 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 22:01:19,296 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 22:01:19,296 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 22:01:19,297 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 22:01:19,297 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 22:01:19,297 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 22:01:19,297 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 22:01:19,297 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 22:01:19,298 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 22:01:19,298 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 22:01:19,298 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 22:01:19,298 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 22:01:19,298 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 22:01:19,298 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 22:01:19,299 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 22:01:19,299 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 22:01:19,299 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 22:01:19,299 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 22:01:19,300 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 22:01:19,354 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 22:01:19,367 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 22:01:19,371 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 22:01:19,373 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 22:01:19,374 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 22:01:19,374 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/insertion_sort_true-unreach-call_true-termination.i [2018-11-07 22:01:19,440 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0227e063/5132233b893142fd8d2257d14f445e86/FLAG270c107b2 [2018-11-07 22:01:19,886 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 22:01:19,886 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/insertion_sort_true-unreach-call_true-termination.i [2018-11-07 22:01:19,894 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0227e063/5132233b893142fd8d2257d14f445e86/FLAG270c107b2 [2018-11-07 22:01:19,911 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0227e063/5132233b893142fd8d2257d14f445e86 [2018-11-07 22:01:19,924 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 22:01:19,926 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 22:01:19,927 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 22:01:19,927 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 22:01:19,931 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 22:01:19,932 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:01:19" (1/1) ... [2018-11-07 22:01:19,935 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c988de2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:01:19, skipping insertion in model container [2018-11-07 22:01:19,936 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:01:19" (1/1) ... [2018-11-07 22:01:19,947 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 22:01:19,971 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 22:01:20,220 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 22:01:20,226 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 22:01:20,265 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 22:01:20,296 INFO L193 MainTranslator]: Completed translation [2018-11-07 22:01:20,296 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:01:20 WrapperNode [2018-11-07 22:01:20,296 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 22:01:20,297 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 22:01:20,298 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 22:01:20,298 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 22:01:20,309 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:01:20" (1/1) ... [2018-11-07 22:01:20,321 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:01:20" (1/1) ... [2018-11-07 22:01:20,330 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 22:01:20,331 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 22:01:20,331 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 22:01:20,331 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 22:01:20,342 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:01:20" (1/1) ... [2018-11-07 22:01:20,342 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:01:20" (1/1) ... [2018-11-07 22:01:20,345 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:01:20" (1/1) ... [2018-11-07 22:01:20,345 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:01:20" (1/1) ... [2018-11-07 22:01:20,354 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:01:20" (1/1) ... [2018-11-07 22:01:20,362 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:01:20" (1/1) ... [2018-11-07 22:01:20,365 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:01:20" (1/1) ... [2018-11-07 22:01:20,376 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 22:01:20,377 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 22:01:20,377 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 22:01:20,381 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 22:01:20,382 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:01:20" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 22:01:20,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-07 22:01:20,528 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 22:01:20,528 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 22:01:20,528 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-07 22:01:20,528 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 22:01:20,528 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 22:01:20,528 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 22:01:20,529 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 22:01:20,529 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-07 22:01:20,529 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-07 22:01:20,529 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-07 22:01:20,529 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-07 22:01:21,046 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 22:01:21,047 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:01:21 BoogieIcfgContainer [2018-11-07 22:01:21,047 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 22:01:21,048 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 22:01:21,048 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 22:01:21,051 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 22:01:21,051 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:01:19" (1/3) ... [2018-11-07 22:01:21,052 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3764af13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:01:21, skipping insertion in model container [2018-11-07 22:01:21,052 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:01:20" (2/3) ... [2018-11-07 22:01:21,053 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3764af13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:01:21, skipping insertion in model container [2018-11-07 22:01:21,053 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:01:21" (3/3) ... [2018-11-07 22:01:21,055 INFO L112 eAbstractionObserver]: Analyzing ICFG insertion_sort_true-unreach-call_true-termination.i [2018-11-07 22:01:21,065 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 22:01:21,074 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 22:01:21,093 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 22:01:21,128 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 22:01:21,128 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 22:01:21,128 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 22:01:21,129 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 22:01:21,129 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 22:01:21,129 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 22:01:21,129 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 22:01:21,129 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 22:01:21,150 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2018-11-07 22:01:21,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-07 22:01:21,158 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:01:21,159 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:01:21,161 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:01:21,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:01:21,167 INFO L82 PathProgramCache]: Analyzing trace with hash 369743628, now seen corresponding path program 1 times [2018-11-07 22:01:21,170 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:01:21,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:01:21,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:01:21,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:01:21,227 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:01:21,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:01:21,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:01:21,317 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 22:01:21,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-07 22:01:21,318 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 22:01:21,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-07 22:01:21,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-07 22:01:21,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 22:01:21,339 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 2 states. [2018-11-07 22:01:21,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:01:21,363 INFO L93 Difference]: Finished difference Result 80 states and 95 transitions. [2018-11-07 22:01:21,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-07 22:01:21,365 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2018-11-07 22:01:21,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:01:21,373 INFO L225 Difference]: With dead ends: 80 [2018-11-07 22:01:21,373 INFO L226 Difference]: Without dead ends: 37 [2018-11-07 22:01:21,376 INFO L604 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-11-07 22:01:21,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-07 22:01:21,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-11-07 22:01:21,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-07 22:01:21,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2018-11-07 22:01:21,416 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 18 [2018-11-07 22:01:21,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:01:21,417 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2018-11-07 22:01:21,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-07 22:01:21,417 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2018-11-07 22:01:21,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-07 22:01:21,419 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:01:21,419 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-11-07 22:01:21,419 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:01:21,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:01:21,420 INFO L82 PathProgramCache]: Analyzing trace with hash 994502583, now seen corresponding path program 1 times [2018-11-07 22:01:21,420 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:01:21,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:01:21,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:01:21,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:01:21,422 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:01:21,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:01:21,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:01:21,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 22:01:21,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 22:01:21,656 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 22:01:21,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 22:01:21,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 22:01:21,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-07 22:01:21,658 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand 5 states. [2018-11-07 22:01:21,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:01:21,846 INFO L93 Difference]: Finished difference Result 68 states and 74 transitions. [2018-11-07 22:01:21,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 22:01:21,847 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-11-07 22:01:21,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:01:21,848 INFO L225 Difference]: With dead ends: 68 [2018-11-07 22:01:21,848 INFO L226 Difference]: Without dead ends: 52 [2018-11-07 22:01:21,849 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-07 22:01:21,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-07 22:01:21,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 39. [2018-11-07 22:01:21,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-07 22:01:21,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2018-11-07 22:01:21,857 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 19 [2018-11-07 22:01:21,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:01:21,858 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2018-11-07 22:01:21,858 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 22:01:21,858 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2018-11-07 22:01:21,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-07 22:01:21,859 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:01:21,860 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, 1, 1, 1, 1, 1] [2018-11-07 22:01:21,860 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:01:21,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:01:21,860 INFO L82 PathProgramCache]: Analyzing trace with hash 385502281, now seen corresponding path program 1 times [2018-11-07 22:01:21,861 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:01:21,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:01:21,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:01:21,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:01:21,862 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:01:21,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:01:22,125 WARN L179 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 5 [2018-11-07 22:01:22,137 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:01:22,138 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 22:01:22,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 22:01:22,138 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 22:01:22,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 22:01:22,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 22:01:22,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 22:01:22,140 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 5 states. [2018-11-07 22:01:22,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:01:22,359 INFO L93 Difference]: Finished difference Result 92 states and 102 transitions. [2018-11-07 22:01:22,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-07 22:01:22,361 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-11-07 22:01:22,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:01:22,362 INFO L225 Difference]: With dead ends: 92 [2018-11-07 22:01:22,363 INFO L226 Difference]: Without dead ends: 63 [2018-11-07 22:01:22,364 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-11-07 22:01:22,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-11-07 22:01:22,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 44. [2018-11-07 22:01:22,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-07 22:01:22,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2018-11-07 22:01:22,373 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 29 [2018-11-07 22:01:22,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:01:22,373 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2018-11-07 22:01:22,373 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 22:01:22,373 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2018-11-07 22:01:22,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-07 22:01:22,375 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:01:22,375 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, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:01:22,375 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:01:22,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:01:22,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1987166342, now seen corresponding path program 1 times [2018-11-07 22:01:22,376 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:01:22,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:01:22,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:01:22,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:01:22,378 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:01:22,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:01:22,835 WARN L179 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 14 [2018-11-07 22:01:23,616 WARN L179 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 19 [2018-11-07 22:01:23,867 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:01:23,867 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:01:23,867 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:01:23,869 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 32 with the following transitions: [2018-11-07 22:01:23,871 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [6], [7], [11], [14], [16], [17], [18], [22], [24], [27], [28], [29], [35], [44], [46], [50], [54], [59], [60], [61], [73], [76], [78], [84], [85], [86], [88] [2018-11-07 22:01:23,915 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 22:01:23,915 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 22:01:24,063 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 22:01:24,401 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 22:01:24,403 INFO L272 AbstractInterpreter]: Visited 30 different actions 154 times. Merged at 18 different actions 103 times. Widened at 3 different actions 5 times. Found 2 fixpoints after 2 different actions. Largest state had 24 variables. [2018-11-07 22:01:24,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:01:24,451 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 22:01:24,451 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:01:24,451 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:01:24,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:01:24,461 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:01:24,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:01:24,493 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:01:25,057 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 28 treesize of output 23 [2018-11-07 22:01:25,078 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:01:25,081 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 23 treesize of output 37 [2018-11-07 22:01:25,082 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 22:01:25,095 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:01:25,111 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-07 22:01:25,112 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:30 [2018-11-07 22:01:25,291 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 26 treesize of output 18 [2018-11-07 22:01:25,333 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-07 22:01:25,335 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 22:01:25,346 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:01:25,371 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:01:25,372 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-11-07 22:01:25,447 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:01:25,448 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:01:27,869 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 43 treesize of output 37 [2018-11-07 22:01:27,936 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:01:27,938 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2018-11-07 22:01:27,940 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 22:01:27,945 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:01:27,946 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:01:27,948 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:01:27,955 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 43 [2018-11-07 22:01:27,958 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-07 22:01:27,960 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:01:27,961 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:01:27,962 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:01:27,974 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 45 [2018-11-07 22:01:27,976 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-07 22:01:28,043 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-07 22:01:28,048 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:01:28,048 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:43, output treesize:7 [2018-11-07 22:01:28,230 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:01:28,257 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:01:28,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 15] total 36 [2018-11-07 22:01:28,258 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:01:28,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-07 22:01:28,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-07 22:01:28,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=1071, Unknown=1, NotChecked=0, Total=1260 [2018-11-07 22:01:28,260 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand 24 states. [2018-11-07 22:01:29,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:01:29,501 INFO L93 Difference]: Finished difference Result 104 states and 116 transitions. [2018-11-07 22:01:29,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-07 22:01:29,502 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 31 [2018-11-07 22:01:29,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:01:29,506 INFO L225 Difference]: With dead ends: 104 [2018-11-07 22:01:29,506 INFO L226 Difference]: Without dead ends: 102 [2018-11-07 22:01:29,508 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 40 SyntacticMatches, 4 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 690 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=380, Invalid=1781, Unknown=1, NotChecked=0, Total=2162 [2018-11-07 22:01:29,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-11-07 22:01:29,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 68. [2018-11-07 22:01:29,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-07 22:01:29,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 75 transitions. [2018-11-07 22:01:29,525 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 75 transitions. Word has length 31 [2018-11-07 22:01:29,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:01:29,525 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 75 transitions. [2018-11-07 22:01:29,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-07 22:01:29,526 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 75 transitions. [2018-11-07 22:01:29,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-07 22:01:29,527 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:01:29,527 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, 1, 1, 1, 1] [2018-11-07 22:01:29,528 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:01:29,528 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:01:29,528 INFO L82 PathProgramCache]: Analyzing trace with hash -456310597, now seen corresponding path program 1 times [2018-11-07 22:01:29,528 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:01:29,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:01:29,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:01:29,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:01:29,530 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:01:29,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:01:30,541 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:01:30,541 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:01:30,542 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:01:30,542 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 39 with the following transitions: [2018-11-07 22:01:30,542 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [6], [7], [11], [14], [16], [17], [18], [22], [24], [27], [28], [29], [31], [35], [37], [38], [39], [40], [44], [46], [50], [54], [59], [60], [61], [73], [76], [78], [84], [85], [86], [88] [2018-11-07 22:01:30,545 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 22:01:30,545 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 22:01:30,557 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 22:01:30,785 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 22:01:30,785 INFO L272 AbstractInterpreter]: Visited 35 different actions 185 times. Merged at 23 different actions 115 times. Widened at 4 different actions 5 times. Found 17 fixpoints after 8 different actions. Largest state had 25 variables. [2018-11-07 22:01:30,801 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:01:30,801 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 22:01:30,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:01:30,801 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:01:30,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:01:30,814 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:01:30,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:01:30,863 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:01:31,112 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 41 treesize of output 34 [2018-11-07 22:01:31,116 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:01:31,119 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 34 treesize of output 50 [2018-11-07 22:01:31,120 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 22:01:31,130 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:01:31,142 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:01:31,142 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:40 [2018-11-07 22:01:31,528 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:01:31,529 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 50 treesize of output 52 [2018-11-07 22:01:31,560 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:01:31,561 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:01:31,565 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:01:31,566 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 71 [2018-11-07 22:01:31,568 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 22:01:31,582 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:01:31,597 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-07 22:01:31,598 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:64, output treesize:29 [2018-11-07 22:01:31,930 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 39 treesize of output 31 [2018-11-07 22:01:31,938 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:01:31,942 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:01:31,943 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:01:31,943 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:01:31,944 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:01:31,946 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 49 [2018-11-07 22:01:31,948 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 22:01:31,991 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:01:32,006 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:01:32,007 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:45, output treesize:5 [2018-11-07 22:01:32,067 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:01:32,068 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:01:41,527 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 72 treesize of output 64 [2018-11-07 22:01:41,557 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:01:41,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 71 [2018-11-07 22:01:41,683 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2018-11-07 22:01:41,687 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:01:41,688 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:01:41,688 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:01:41,689 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:01:41,690 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:01:41,693 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:01:41,725 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 85 [2018-11-07 22:01:41,727 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-07 22:01:41,730 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-07 22:01:41,730 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-07 22:01:41,732 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:01:41,732 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:01:41,733 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:01:41,734 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:01:41,736 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:01:41,736 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:01:41,737 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:01:41,738 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:01:41,749 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 92 [2018-11-07 22:01:41,752 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-11-07 22:01:41,776 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:01:41,790 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:01:41,799 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:01:41,799 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:01:41,804 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:01:41,805 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:01:41,818 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 85 [2018-11-07 22:01:41,820 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-11-07 22:01:41,823 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:01:41,823 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:01:41,823 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:01:41,824 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:01:41,824 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:01:41,829 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 64 [2018-11-07 22:01:41,830 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-07 22:01:41,832 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:01:41,846 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:01:41,847 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:01:41,848 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:01:41,849 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:01:41,853 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:01:41,853 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:01:41,854 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:01:41,864 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 89 [2018-11-07 22:01:41,867 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-11-07 22:01:41,893 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:01:41,896 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:01:41,896 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:01:41,898 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:01:41,900 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:01:41,902 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:01:41,902 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:01:41,903 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:01:41,910 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 89 [2018-11-07 22:01:41,914 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-11-07 22:01:41,991 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:01:41,996 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:01:42,005 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-07 22:01:42,005 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 6 variables, input treesize:80, output treesize:14 [2018-11-07 22:01:44,125 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:01:44,148 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:01:44,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20, 18] total 50 [2018-11-07 22:01:44,149 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:01:44,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-07 22:01:44,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-07 22:01:44,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=2167, Unknown=4, NotChecked=0, Total=2450 [2018-11-07 22:01:44,151 INFO L87 Difference]: Start difference. First operand 68 states and 75 transitions. Second operand 35 states. [2018-11-07 22:01:46,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:01:46,259 INFO L93 Difference]: Finished difference Result 204 states and 234 transitions. [2018-11-07 22:01:46,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-07 22:01:46,260 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 38 [2018-11-07 22:01:46,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:01:46,265 INFO L225 Difference]: With dead ends: 204 [2018-11-07 22:01:46,265 INFO L226 Difference]: Without dead ends: 151 [2018-11-07 22:01:46,268 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1689 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=612, Invalid=4214, Unknown=4, NotChecked=0, Total=4830 [2018-11-07 22:01:46,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-11-07 22:01:46,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 78. [2018-11-07 22:01:46,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-11-07 22:01:46,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 86 transitions. [2018-11-07 22:01:46,283 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 86 transitions. Word has length 38 [2018-11-07 22:01:46,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:01:46,283 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 86 transitions. [2018-11-07 22:01:46,283 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-07 22:01:46,283 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 86 transitions. [2018-11-07 22:01:46,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-07 22:01:46,285 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:01:46,285 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:01:46,285 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:01:46,285 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:01:46,285 INFO L82 PathProgramCache]: Analyzing trace with hash 1097051736, now seen corresponding path program 1 times [2018-11-07 22:01:46,286 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:01:46,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:01:46,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:01:46,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:01:46,287 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:01:46,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:01:46,378 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:01:46,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:01:46,378 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:01:46,378 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 42 with the following transitions: [2018-11-07 22:01:46,379 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [6], [7], [11], [14], [16], [17], [18], [22], [24], [27], [28], [29], [31], [35], [44], [46], [50], [54], [59], [60], [61], [73], [76], [78], [84], [85], [86], [88] [2018-11-07 22:01:46,381 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 22:01:46,382 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 22:01:46,388 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 22:01:46,479 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 22:01:46,479 INFO L272 AbstractInterpreter]: Visited 31 different actions 164 times. Merged at 19 different actions 106 times. Widened at 3 different actions 5 times. Found 4 fixpoints after 3 different actions. Largest state had 24 variables. [2018-11-07 22:01:46,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:01:46,520 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 22:01:46,520 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:01:46,520 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:01:46,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:01:46,538 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:01:46,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:01:46,573 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:01:46,579 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:01:46,580 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:01:46,670 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:01:46,700 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:01:46,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 10 [2018-11-07 22:01:46,700 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:01:46,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-07 22:01:46,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-07 22:01:46,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-07 22:01:46,702 INFO L87 Difference]: Start difference. First operand 78 states and 86 transitions. Second operand 8 states. [2018-11-07 22:01:46,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:01:46,975 INFO L93 Difference]: Finished difference Result 170 states and 189 transitions. [2018-11-07 22:01:46,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-07 22:01:46,976 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2018-11-07 22:01:46,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:01:46,977 INFO L225 Difference]: With dead ends: 170 [2018-11-07 22:01:46,978 INFO L226 Difference]: Without dead ends: 110 [2018-11-07 22:01:46,978 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=158, Unknown=0, NotChecked=0, Total=240 [2018-11-07 22:01:46,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-11-07 22:01:46,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 81. [2018-11-07 22:01:46,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-11-07 22:01:46,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 89 transitions. [2018-11-07 22:01:46,989 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 89 transitions. Word has length 41 [2018-11-07 22:01:46,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:01:46,990 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 89 transitions. [2018-11-07 22:01:46,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-07 22:01:46,990 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2018-11-07 22:01:46,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-07 22:01:46,991 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:01:46,991 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:01:46,992 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:01:46,992 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:01:46,992 INFO L82 PathProgramCache]: Analyzing trace with hash -429526962, now seen corresponding path program 1 times [2018-11-07 22:01:46,992 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:01:46,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:01:46,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:01:46,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:01:46,993 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:01:47,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:01:47,315 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:01:47,315 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:01:47,315 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:01:47,315 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 43 with the following transitions: [2018-11-07 22:01:47,316 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [6], [7], [11], [14], [16], [17], [18], [22], [24], [27], [28], [29], [35], [44], [46], [50], [54], [59], [60], [61], [63], [65], [73], [76], [78], [81], [83], [84], [85], [86], [88], [89] [2018-11-07 22:01:47,318 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 22:01:47,318 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 22:01:47,324 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 22:01:47,529 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 22:01:47,529 INFO L272 AbstractInterpreter]: Visited 35 different actions 236 times. Merged at 21 different actions 141 times. Widened at 4 different actions 8 times. Found 8 fixpoints after 3 different actions. Largest state had 25 variables. [2018-11-07 22:01:47,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:01:47,535 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 22:01:47,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:01:47,535 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:01:47,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:01:47,544 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:01:47,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:01:47,576 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:01:47,727 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:01:47,728 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:01:47,849 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:01:47,869 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:01:47,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2018-11-07 22:01:47,869 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:01:47,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 22:01:47,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 22:01:47,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-11-07 22:01:47,870 INFO L87 Difference]: Start difference. First operand 81 states and 89 transitions. Second operand 9 states. [2018-11-07 22:01:48,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:01:48,067 INFO L93 Difference]: Finished difference Result 150 states and 165 transitions. [2018-11-07 22:01:48,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 22:01:48,068 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 42 [2018-11-07 22:01:48,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:01:48,069 INFO L225 Difference]: With dead ends: 150 [2018-11-07 22:01:48,070 INFO L226 Difference]: Without dead ends: 127 [2018-11-07 22:01:48,070 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 77 SyntacticMatches, 8 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2018-11-07 22:01:48,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-11-07 22:01:48,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 92. [2018-11-07 22:01:48,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-11-07 22:01:48,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 100 transitions. [2018-11-07 22:01:48,083 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 100 transitions. Word has length 42 [2018-11-07 22:01:48,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:01:48,084 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 100 transitions. [2018-11-07 22:01:48,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 22:01:48,084 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 100 transitions. [2018-11-07 22:01:48,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-07 22:01:48,085 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:01:48,085 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:01:48,085 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:01:48,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:01:48,086 INFO L82 PathProgramCache]: Analyzing trace with hash -1408574763, now seen corresponding path program 2 times [2018-11-07 22:01:48,086 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:01:48,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:01:48,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:01:48,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:01:48,087 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:01:48,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:01:48,665 WARN L179 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 10 [2018-11-07 22:01:48,790 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 13 [2018-11-07 22:01:49,289 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:01:49,289 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:01:49,289 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:01:49,289 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:01:49,289 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:01:49,289 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:01:49,290 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-11-07 22:01:49,298 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:01:49,299 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:01:49,361 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-07 22:01:49,361 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:01:49,367 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:01:49,728 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 28 treesize of output 23 [2018-11-07 22:01:49,761 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:01:49,784 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 23 treesize of output 37 [2018-11-07 22:01:49,785 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 22:01:49,802 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:01:49,810 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:01:49,810 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:27 [2018-11-07 22:01:49,969 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 33 treesize of output 24 [2018-11-07 22:01:49,972 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:01:49,974 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:01:49,975 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:01:49,983 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 43 [2018-11-07 22:01:49,983 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 22:01:49,989 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:01:49,995 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:01:49,996 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:17 [2018-11-07 22:01:50,057 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 26 treesize of output 18 [2018-11-07 22:01:50,060 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-07 22:01:50,060 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 22:01:50,063 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:01:50,065 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:01:50,066 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-11-07 22:01:50,094 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:01:50,095 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:01:50,888 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 93 treesize of output 83 [2018-11-07 22:01:50,926 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:01:50,927 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:01:50,942 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 94 [2018-11-07 22:01:51,013 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:01:51,015 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:01:51,015 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:01:51,017 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:01:51,017 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:01:51,038 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 73 [2018-11-07 22:01:51,042 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-11-07 22:01:51,103 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:01:51,106 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:01:51,109 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 61 treesize of output 68 [2018-11-07 22:01:51,178 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:01:51,179 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:01:51,181 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:01:51,181 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:01:51,182 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:01:51,183 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:01:51,200 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 68 [2018-11-07 22:01:51,201 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-11-07 22:01:51,223 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:01:51,274 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:01:51,296 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 110 treesize of output 113 [2018-11-07 22:01:51,593 WARN L179 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 50 [2018-11-07 22:01:51,595 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:01:51,596 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:01:51,597 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:01:51,598 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:01:51,598 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:01:51,599 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:01:51,600 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:01:51,602 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:01:51,603 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:01:51,611 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 87 [2018-11-07 22:01:51,614 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-11-07 22:01:51,620 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:01:51,621 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:01:51,623 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:01:51,624 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:01:51,624 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:01:51,644 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 85 [2018-11-07 22:01:51,647 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 4 xjuncts. [2018-11-07 22:01:51,649 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:01:51,649 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:01:51,651 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:01:51,652 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:01:51,652 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:01:51,653 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:01:51,671 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 86 [2018-11-07 22:01:51,674 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 4 xjuncts. [2018-11-07 22:01:51,699 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:01:51,700 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:01:51,701 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:01:51,702 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:01:51,702 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:01:51,703 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:01:51,707 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:01:51,707 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:01:51,716 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 86 [2018-11-07 22:01:51,719 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-11-07 22:01:51,814 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-07 22:01:51,826 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:01:51,835 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:01:51,835 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 3 variables, input treesize:96, output treesize:14 [2018-11-07 22:01:51,950 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:01:51,970 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:01:51,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 21, 21] total 45 [2018-11-07 22:01:51,971 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:01:51,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-07 22:01:51,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-07 22:01:51,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=261, Invalid=1719, Unknown=0, NotChecked=0, Total=1980 [2018-11-07 22:01:51,973 INFO L87 Difference]: Start difference. First operand 92 states and 100 transitions. Second operand 27 states. [2018-11-07 22:01:53,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:01:53,486 INFO L93 Difference]: Finished difference Result 188 states and 209 transitions. [2018-11-07 22:01:53,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-07 22:01:53,487 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 43 [2018-11-07 22:01:53,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:01:53,489 INFO L225 Difference]: With dead ends: 188 [2018-11-07 22:01:53,489 INFO L226 Difference]: Without dead ends: 186 [2018-11-07 22:01:53,491 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 54 SyntacticMatches, 8 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1232 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=585, Invalid=3075, Unknown=0, NotChecked=0, Total=3660 [2018-11-07 22:01:53,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-11-07 22:01:53,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 108. [2018-11-07 22:01:53,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-11-07 22:01:53,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 118 transitions. [2018-11-07 22:01:53,505 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 118 transitions. Word has length 43 [2018-11-07 22:01:53,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:01:53,506 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 118 transitions. [2018-11-07 22:01:53,506 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-07 22:01:53,506 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 118 transitions. [2018-11-07 22:01:53,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-07 22:01:53,507 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:01:53,507 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:01:53,508 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:01:53,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:01:53,508 INFO L82 PathProgramCache]: Analyzing trace with hash -836780148, now seen corresponding path program 2 times [2018-11-07 22:01:53,508 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:01:53,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:01:53,509 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:01:53,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:01:53,509 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:01:53,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:01:53,766 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:01:53,766 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:01:53,766 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:01:53,767 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:01:53,767 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:01:53,767 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:01:53,767 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-11-07 22:01:53,775 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:01:53,776 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:01:53,811 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-07 22:01:53,812 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:01:53,814 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:01:53,820 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:01:53,820 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:01:53,853 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:01:53,874 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:01:53,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 9 [2018-11-07 22:01:53,874 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:01:53,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 22:01:53,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 22:01:53,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-07 22:01:53,875 INFO L87 Difference]: Start difference. First operand 108 states and 118 transitions. Second operand 9 states. [2018-11-07 22:01:54,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:01:54,155 INFO L93 Difference]: Finished difference Result 222 states and 247 transitions. [2018-11-07 22:01:54,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-07 22:01:54,155 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 50 [2018-11-07 22:01:54,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:01:54,157 INFO L225 Difference]: With dead ends: 222 [2018-11-07 22:01:54,157 INFO L226 Difference]: Without dead ends: 159 [2018-11-07 22:01:54,158 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 101 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=197, Unknown=0, NotChecked=0, Total=306 [2018-11-07 22:01:54,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-11-07 22:01:54,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 117. [2018-11-07 22:01:54,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-11-07 22:01:54,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 128 transitions. [2018-11-07 22:01:54,172 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 128 transitions. Word has length 50 [2018-11-07 22:01:54,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:01:54,173 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 128 transitions. [2018-11-07 22:01:54,173 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 22:01:54,173 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 128 transitions. [2018-11-07 22:01:54,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-07 22:01:54,174 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:01:54,174 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:01:54,174 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:01:54,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:01:54,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1313256330, now seen corresponding path program 3 times [2018-11-07 22:01:54,175 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:01:54,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:01:54,176 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:01:54,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:01:54,176 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:01:54,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:01:55,263 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:01:55,264 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:01:55,264 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:01:55,264 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:01:55,264 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:01:55,264 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:01:55,264 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-11-07 22:01:55,273 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:01:55,273 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:01:55,289 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:01:55,289 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:01:55,299 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:01:55,552 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 41 treesize of output 34 [2018-11-07 22:01:55,559 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:01:55,561 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 34 treesize of output 50 [2018-11-07 22:01:55,562 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 22:01:55,578 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:01:55,597 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:01:55,597 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:45 [2018-11-07 22:01:55,926 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:01:55,927 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 50 treesize of output 52 [2018-11-07 22:01:55,933 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:01:55,935 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:01:55,937 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:01:55,942 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:01:55,943 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 86 [2018-11-07 22:01:55,944 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 22:01:55,966 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:01:56,031 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-07 22:01:56,031 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:69, output treesize:38 [2018-11-07 22:01:56,245 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 37 treesize of output 30 [2018-11-07 22:01:56,253 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:01:56,255 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:01:56,257 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:01:56,260 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:01:56,263 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 30 treesize of output 91 [2018-11-07 22:01:56,264 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 22:01:56,276 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:01:56,289 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-07 22:01:56,289 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:48, output treesize:35 [2018-11-07 22:01:56,830 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 40 treesize of output 32 [2018-11-07 22:01:56,833 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:01:56,834 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:01:56,835 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:01:56,836 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:01:56,837 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:01:56,839 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 51 [2018-11-07 22:01:56,840 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 22:01:56,848 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:01:56,856 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:01:56,856 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:51, output treesize:5 [2018-11-07 22:01:56,908 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:01:56,909 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:02:04,256 WARN L179 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 17 [2018-11-07 22:02:06,284 WARN L832 $PredicateComparison]: unable to prove that (forall ((main_~key~0 Int)) (let ((.cse0 (store (select |c_#memory_int| |c_main_~#v~0.base|) (+ |c_main_~#v~0.offset| (* 4 c_main_~j~0)) main_~key~0))) (< (select .cse0 |c_main_~#v~0.offset|) (+ (select .cse0 (+ |c_main_~#v~0.offset| 4)) 1)))) is different from false [2018-11-07 22:02:14,437 WARN L179 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 17 [2018-11-07 22:02:22,641 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 24 [2018-11-07 22:02:26,747 WARN L179 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 25 [2018-11-07 22:02:40,860 WARN L179 SmtUtils]: Spent 233.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-11-07 22:02:43,350 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 88 treesize of output 80 [2018-11-07 22:02:43,356 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:43,358 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 80 treesize of output 87 [2018-11-07 22:02:43,392 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:43,469 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:43,485 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:43,485 INFO L303 Elim1Store]: Index analysis took 125 ms [2018-11-07 22:02:43,749 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 75 treesize of output 115 [2018-11-07 22:02:45,012 WARN L179 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 118 DAG size of output: 91 [2018-11-07 22:02:45,046 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:45,083 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:45,092 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:45,107 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:45,116 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:45,129 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:45,138 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:45,153 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:45,162 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:45,206 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:45,208 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:45,208 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:45,216 INFO L303 Elim1Store]: Index analysis took 201 ms [2018-11-07 22:02:45,262 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 132 [2018-11-07 22:02:45,265 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-07 22:02:45,278 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:45,281 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:45,281 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:45,284 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:45,284 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:45,285 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:45,288 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:45,291 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:45,291 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:45,295 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:45,295 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:45,296 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:45,311 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 134 [2018-11-07 22:02:45,313 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-11-07 22:02:45,339 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:45,374 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:45,383 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:45,396 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:45,404 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:45,419 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:45,428 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:45,446 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:45,455 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:45,496 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:45,505 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:45,518 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:45,642 INFO L303 Elim1Store]: Index analysis took 327 ms [2018-11-07 22:02:45,708 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 135 [2018-11-07 22:02:45,710 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-11-07 22:02:45,729 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:45,763 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:45,775 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:45,788 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:45,802 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:45,811 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:45,820 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:45,833 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:45,842 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:45,905 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:45,918 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:45,931 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:46,030 INFO L303 Elim1Store]: Index analysis took 318 ms [2018-11-07 22:02:46,107 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 132 [2018-11-07 22:02:46,109 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-11-07 22:02:46,137 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:46,171 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:46,184 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:46,197 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:46,209 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:46,222 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:46,234 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:46,247 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:46,262 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:46,320 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:46,333 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:46,346 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:46,470 INFO L303 Elim1Store]: Index analysis took 359 ms [2018-11-07 22:02:46,545 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 134 [2018-11-07 22:02:46,547 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-11-07 22:02:46,602 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:46,611 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:46,624 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:46,637 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:46,650 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:46,657 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:46,658 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:46,663 INFO L303 Elim1Store]: Index analysis took 114 ms [2018-11-07 22:02:46,668 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 91 [2018-11-07 22:02:46,671 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-11-07 22:02:46,674 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:46,674 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:46,675 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:46,676 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:46,677 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:46,677 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:46,681 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:46,682 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:46,690 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 99 [2018-11-07 22:02:46,691 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-07 22:02:47,063 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:47,067 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:47,067 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:47,069 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:47,078 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:47,078 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:47,104 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 93 [2018-11-07 22:02:47,106 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 3 xjuncts. [2018-11-07 22:02:47,109 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:47,111 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:47,115 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:47,129 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 60 [2018-11-07 22:02:47,130 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-11-07 22:02:47,137 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:47,141 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:47,160 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 59 [2018-11-07 22:02:47,161 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 3 xjuncts. [2018-11-07 22:02:47,455 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:47,455 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:47,458 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:47,468 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 55 [2018-11-07 22:02:47,470 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 2 xjuncts. [2018-11-07 22:02:47,473 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:47,474 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:47,475 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:47,478 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:47,481 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 49 treesize of output 56 [2018-11-07 22:02:47,483 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-07 22:02:47,487 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:47,489 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:47,489 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:47,490 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:47,491 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:47,497 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:47,498 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:02:47,510 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 1 case distinctions, treesize of input 55 treesize of output 88 [2018-11-07 22:02:47,512 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 2 xjuncts. [2018-11-07 22:02:47,637 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-11-07 22:02:47,724 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-11-07 22:02:47,770 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-11-07 22:02:47,828 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 5 xjuncts. [2018-11-07 22:02:47,828 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 7 variables, input treesize:96, output treesize:63 [2018-11-07 22:03:02,936 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 11 refuted. 5 times theorem prover too weak. 0 trivial. 2 not checked. [2018-11-07 22:03:02,957 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:03:02,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23, 22] total 63 [2018-11-07 22:03:02,957 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:03:02,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-11-07 22:03:02,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-11-07 22:03:02,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=409, Invalid=3356, Unknown=21, NotChecked=120, Total=3906 [2018-11-07 22:03:02,960 INFO L87 Difference]: Start difference. First operand 117 states and 128 transitions. Second operand 44 states. [2018-11-07 22:03:05,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:03:05,773 INFO L93 Difference]: Finished difference Result 173 states and 189 transitions. [2018-11-07 22:03:05,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-07 22:03:05,774 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 50 [2018-11-07 22:03:05,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:03:05,776 INFO L225 Difference]: With dead ends: 173 [2018-11-07 22:03:05,776 INFO L226 Difference]: Without dead ends: 171 [2018-11-07 22:03:05,779 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 61 SyntacticMatches, 4 SemanticMatches, 81 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2352 ImplicationChecksByTransitivity, 65.0s TimeCoverageRelationStatistics Valid=825, Invalid=5800, Unknown=21, NotChecked=160, Total=6806 [2018-11-07 22:03:05,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-11-07 22:03:05,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 125. [2018-11-07 22:03:05,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-11-07 22:03:05,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 137 transitions. [2018-11-07 22:03:05,795 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 137 transitions. Word has length 50 [2018-11-07 22:03:05,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:03:05,795 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 137 transitions. [2018-11-07 22:03:05,795 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-11-07 22:03:05,796 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 137 transitions. [2018-11-07 22:03:05,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-07 22:03:05,801 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:03:05,801 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:03:05,802 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:03:05,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:03:05,802 INFO L82 PathProgramCache]: Analyzing trace with hash -100176119, now seen corresponding path program 1 times [2018-11-07 22:03:05,802 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:03:05,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:05,803 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:03:05,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:05,803 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:03:05,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:06,352 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:06,352 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:06,353 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:03:06,353 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 53 with the following transitions: [2018-11-07 22:03:06,353 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [6], [7], [11], [14], [16], [17], [18], [22], [24], [27], [28], [29], [35], [37], [38], [39], [40], [44], [46], [50], [54], [59], [60], [61], [73], [76], [78], [84], [85], [86], [88] [2018-11-07 22:03:06,355 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 22:03:06,355 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 22:03:06,363 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 22:03:06,454 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 22:03:06,454 INFO L272 AbstractInterpreter]: Visited 34 different actions 185 times. Merged at 22 different actions 124 times. Widened at 4 different actions 6 times. Found 9 fixpoints after 5 different actions. Largest state had 25 variables. [2018-11-07 22:03:06,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:03:06,480 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 22:03:06,480 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:06,480 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-11-07 22:03:06,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:03:06,496 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:03:06,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:06,527 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:03:06,694 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 28 treesize of output 23 [2018-11-07 22:03:06,697 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:03:06,698 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 23 treesize of output 37 [2018-11-07 22:03:06,699 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 22:03:06,705 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:03:06,713 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-07 22:03:06,714 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:31 [2018-11-07 22:03:06,775 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 26 treesize of output 18 [2018-11-07 22:03:06,778 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-07 22:03:06,778 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 22:03:06,780 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:03:06,781 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:03:06,781 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-11-07 22:03:06,797 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:06,797 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:03:06,936 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 43 treesize of output 37 [2018-11-07 22:03:06,980 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:03:06,982 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2018-11-07 22:03:06,983 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 22:03:06,986 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:03:06,988 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:03:06,988 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:03:06,996 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 45 [2018-11-07 22:03:06,997 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-07 22:03:07,004 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:03:07,006 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:03:07,006 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:03:07,014 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 43 [2018-11-07 22:03:07,016 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-07 22:03:07,042 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-07 22:03:07,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-11-07 22:03:07,047 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:43, output treesize:7 [2018-11-07 22:03:07,206 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:07,226 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:03:07,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18, 17] total 34 [2018-11-07 22:03:07,226 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:03:07,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-07 22:03:07,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-07 22:03:07,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=978, Unknown=0, NotChecked=0, Total=1122 [2018-11-07 22:03:07,227 INFO L87 Difference]: Start difference. First operand 125 states and 137 transitions. Second operand 20 states. [2018-11-07 22:03:09,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:03:09,167 INFO L93 Difference]: Finished difference Result 288 states and 320 transitions. [2018-11-07 22:03:09,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-07 22:03:09,168 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 52 [2018-11-07 22:03:09,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:03:09,171 INFO L225 Difference]: With dead ends: 288 [2018-11-07 22:03:09,171 INFO L226 Difference]: Without dead ends: 286 [2018-11-07 22:03:09,172 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 80 SyntacticMatches, 12 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 968 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=656, Invalid=3504, Unknown=0, NotChecked=0, Total=4160 [2018-11-07 22:03:09,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-11-07 22:03:09,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 158. [2018-11-07 22:03:09,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-11-07 22:03:09,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 176 transitions. [2018-11-07 22:03:09,188 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 176 transitions. Word has length 52 [2018-11-07 22:03:09,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:03:09,188 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 176 transitions. [2018-11-07 22:03:09,188 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-07 22:03:09,189 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 176 transitions. [2018-11-07 22:03:09,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-07 22:03:09,190 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:03:09,190 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:03:09,190 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:03:09,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:03:09,191 INFO L82 PathProgramCache]: Analyzing trace with hash -775250273, now seen corresponding path program 2 times [2018-11-07 22:03:09,191 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:03:09,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:09,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:03:09,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:09,192 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:03:09,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:09,509 WARN L179 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 7 [2018-11-07 22:03:09,957 WARN L179 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 16 [2018-11-07 22:03:10,496 WARN L179 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 19 [2018-11-07 22:03:10,675 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:10,675 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:10,675 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:03:10,675 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:03:10,675 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:03:10,675 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:10,675 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-11-07 22:03:10,691 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:03:10,691 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:03:10,716 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-07 22:03:10,716 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:03:10,719 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:03:10,896 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 23 treesize of output 18 [2018-11-07 22:03:10,904 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:03:10,905 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 18 treesize of output 27 [2018-11-07 22:03:10,905 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 22:03:10,911 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:03:10,919 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:03:10,919 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-11-07 22:03:11,220 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 26 treesize of output 18 [2018-11-07 22:03:11,224 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-07 22:03:11,224 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 22:03:11,226 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:03:11,227 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:03:11,227 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-11-07 22:03:11,281 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:11,282 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:03:11,490 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 47 treesize of output 41 [2018-11-07 22:03:11,531 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:03:11,532 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:03:11,533 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:03:11,541 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 53 [2018-11-07 22:03:11,542 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-07 22:03:11,545 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:03:11,546 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2018-11-07 22:03:11,547 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-07 22:03:11,548 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:03:11,550 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:03:11,560 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:03:11,566 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 51 [2018-11-07 22:03:11,568 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-07 22:03:11,582 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:03:11,583 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:03:11,583 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:47, output treesize:11 [2018-11-07 22:03:11,620 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:11,643 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:03:11,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19, 15] total 39 [2018-11-07 22:03:11,643 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:03:11,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-07 22:03:11,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-07 22:03:11,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1341, Unknown=0, NotChecked=0, Total=1482 [2018-11-07 22:03:11,645 INFO L87 Difference]: Start difference. First operand 158 states and 176 transitions. Second operand 34 states. [2018-11-07 22:03:28,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:03:28,553 INFO L93 Difference]: Finished difference Result 235 states and 257 transitions. [2018-11-07 22:03:28,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-07 22:03:28,553 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 54 [2018-11-07 22:03:28,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:03:28,555 INFO L225 Difference]: With dead ends: 235 [2018-11-07 22:03:28,555 INFO L226 Difference]: Without dead ends: 233 [2018-11-07 22:03:28,557 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 82 SyntacticMatches, 14 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1029 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=417, Invalid=3243, Unknown=0, NotChecked=0, Total=3660 [2018-11-07 22:03:28,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-11-07 22:03:28,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 178. [2018-11-07 22:03:28,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-11-07 22:03:28,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 198 transitions. [2018-11-07 22:03:28,572 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 198 transitions. Word has length 54 [2018-11-07 22:03:28,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:03:28,572 INFO L480 AbstractCegarLoop]: Abstraction has 178 states and 198 transitions. [2018-11-07 22:03:28,572 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-07 22:03:28,572 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 198 transitions. [2018-11-07 22:03:28,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-07 22:03:28,573 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:03:28,573 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:03:28,573 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:03:28,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:03:28,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1414645976, now seen corresponding path program 4 times [2018-11-07 22:03:28,574 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:03:28,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:28,575 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:03:28,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:28,575 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:03:28,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:29,248 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 2 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:29,249 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:29,249 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:03:29,249 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:03:29,249 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:03:29,249 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:29,249 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:03:29,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:03:29,259 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:03:29,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:29,281 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:03:29,498 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 41 treesize of output 34 [2018-11-07 22:03:29,501 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:03:29,503 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 34 treesize of output 50 [2018-11-07 22:03:29,504 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 22:03:29,512 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:03:29,523 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:03:29,524 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:40 [2018-11-07 22:03:29,679 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:03:29,680 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 50 treesize of output 52 [2018-11-07 22:03:29,684 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:03:29,687 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:03:29,690 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:03:29,692 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 73 [2018-11-07 22:03:29,693 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 22:03:29,702 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:03:29,713 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-07 22:03:29,713 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:64, output treesize:35 [2018-11-07 22:03:29,835 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 40 treesize of output 32 [2018-11-07 22:03:29,839 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:03:29,840 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:03:29,840 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:03:29,841 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:03:29,843 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:03:29,844 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 51 [2018-11-07 22:03:29,844 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 22:03:29,870 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:03:29,878 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:03:29,878 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:51, output treesize:5 [2018-11-07 22:03:29,905 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 10 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:29,905 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:03:34,959 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 72 treesize of output 64 [2018-11-07 22:03:34,976 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:03:34,978 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 64 treesize of output 71 [2018-11-07 22:03:35,049 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-07 22:03:35,049 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-07 22:03:35,051 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-07 22:03:35,051 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-07 22:03:35,054 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:03:35,054 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:03:35,055 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:03:35,055 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:03:35,057 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:03:35,057 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:03:35,057 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:03:35,058 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:03:35,068 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 89 [2018-11-07 22:03:35,070 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-11-07 22:03:35,072 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:03:35,072 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:03:35,073 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:03:35,074 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:03:35,076 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:03:35,076 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:03:35,077 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:03:35,078 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:03:35,087 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 89 [2018-11-07 22:03:35,089 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-11-07 22:03:35,100 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:03:35,101 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:03:35,101 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:03:35,102 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:03:35,103 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:03:35,103 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:03:35,116 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 85 [2018-11-07 22:03:35,117 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-11-07 22:03:35,119 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:03:35,120 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:03:35,120 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:03:35,121 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:03:35,121 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:03:35,124 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 59 [2018-11-07 22:03:35,125 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-07 22:03:35,128 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:03:35,128 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:03:35,129 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:03:35,129 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:03:35,131 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:03:35,132 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:03:35,145 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 85 [2018-11-07 22:03:35,146 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-11-07 22:03:35,177 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:03:35,182 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:03:35,190 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-07 22:03:35,191 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 6 variables, input treesize:80, output treesize:14 [2018-11-07 22:03:39,295 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 27 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-07 22:03:39,316 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:03:39,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22, 18] total 54 [2018-11-07 22:03:39,316 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:03:39,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-11-07 22:03:39,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-07 22:03:39,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=308, Invalid=2550, Unknown=4, NotChecked=0, Total=2862 [2018-11-07 22:03:39,318 INFO L87 Difference]: Start difference. First operand 178 states and 198 transitions. Second operand 38 states. [2018-11-07 22:03:43,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:03:43,001 INFO L93 Difference]: Finished difference Result 395 states and 442 transitions. [2018-11-07 22:03:43,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-11-07 22:03:43,007 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 59 [2018-11-07 22:03:43,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:03:43,009 INFO L225 Difference]: With dead ends: 395 [2018-11-07 22:03:43,009 INFO L226 Difference]: Without dead ends: 304 [2018-11-07 22:03:43,012 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 84 SyntacticMatches, 5 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2690 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=1282, Invalid=8416, Unknown=4, NotChecked=0, Total=9702 [2018-11-07 22:03:43,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2018-11-07 22:03:43,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 162. [2018-11-07 22:03:43,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-11-07 22:03:43,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 178 transitions. [2018-11-07 22:03:43,034 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 178 transitions. Word has length 59 [2018-11-07 22:03:43,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:03:43,035 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 178 transitions. [2018-11-07 22:03:43,035 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-11-07 22:03:43,035 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 178 transitions. [2018-11-07 22:03:43,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-07 22:03:43,036 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:03:43,036 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:03:43,036 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:03:43,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:03:43,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1912545771, now seen corresponding path program 1 times [2018-11-07 22:03:43,037 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:03:43,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:43,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:03:43,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:43,038 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:03:43,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:43,674 WARN L179 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 9 [2018-11-07 22:03:44,076 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 1 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:44,077 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:44,077 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:03:44,077 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 64 with the following transitions: [2018-11-07 22:03:44,077 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [6], [7], [11], [14], [16], [17], [18], [22], [24], [27], [28], [29], [35], [37], [38], [39], [40], [44], [46], [50], [54], [59], [60], [61], [63], [65], [73], [76], [78], [81], [83], [84], [85], [86], [88], [89] [2018-11-07 22:03:44,079 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 22:03:44,079 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 22:03:44,085 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 22:03:44,221 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 22:03:44,221 INFO L272 AbstractInterpreter]: Visited 39 different actions 267 times. Merged at 25 different actions 162 times. Widened at 5 different actions 9 times. Found 15 fixpoints after 6 different actions. Largest state had 26 variables. [2018-11-07 22:03:44,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:03:44,250 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 22:03:44,250 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:44,250 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-11-07 22:03:44,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:03:44,259 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:03:44,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:44,279 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:03:44,488 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 41 treesize of output 34 [2018-11-07 22:03:44,490 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:03:44,492 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 34 treesize of output 50 [2018-11-07 22:03:44,492 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 22:03:44,500 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:03:44,510 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:03:44,511 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:40 [2018-11-07 22:03:44,681 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:03:44,682 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 43 treesize of output 45 [2018-11-07 22:03:44,684 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:03:44,685 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:03:44,689 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:03:44,690 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 59 [2018-11-07 22:03:44,691 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 22:03:44,700 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:03:44,710 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-07 22:03:44,711 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:30 [2018-11-07 22:03:45,119 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 32 treesize of output 24 [2018-11-07 22:03:45,122 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:03:45,123 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:03:45,124 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:03:45,125 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 31 [2018-11-07 22:03:45,126 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 22:03:45,131 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:03:45,138 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:03:45,139 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:5 [2018-11-07 22:03:45,228 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:45,228 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:03:48,740 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 74 treesize of output 66 [2018-11-07 22:03:48,763 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:03:48,786 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 66 treesize of output 73 [2018-11-07 22:03:48,929 WARN L179 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2018-11-07 22:03:48,932 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:03:48,933 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:03:48,933 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:03:48,933 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:03:48,934 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:03:48,934 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:03:48,935 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:03:48,938 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:03:48,939 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:03:48,941 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 91 [2018-11-07 22:03:48,942 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-07 22:03:48,968 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:03:48,980 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:03:48,980 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:03:48,984 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 51 [2018-11-07 22:03:48,985 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-07 22:03:48,990 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:03:48,991 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:03:48,991 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:03:48,992 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:03:48,992 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:03:48,994 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 62 [2018-11-07 22:03:48,995 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-07 22:03:49,009 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:03:49,010 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:03:49,010 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:03:49,011 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:03:49,011 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:03:49,012 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:03:49,012 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:03:49,019 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 55 treesize of output 84 [2018-11-07 22:03:49,020 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-07 22:03:49,024 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:03:49,024 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:03:49,025 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:03:49,026 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:03:49,027 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:03:49,027 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:03:49,028 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:03:49,034 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:03:49,035 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:03:49,039 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 90 [2018-11-07 22:03:49,040 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-07 22:03:49,044 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:03:49,044 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:03:49,044 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:03:49,046 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:03:49,046 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:03:49,047 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:03:49,060 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 89 [2018-11-07 22:03:49,061 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-11-07 22:03:49,064 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:03:49,064 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:03:49,065 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:03:49,065 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:03:49,066 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:03:49,066 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:03:49,067 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:03:49,070 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:03:49,071 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:03:49,073 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 90 [2018-11-07 22:03:49,074 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-07 22:03:49,117 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-07 22:03:49,130 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-07 22:03:49,151 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-07 22:03:49,151 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:82, output treesize:27 [2018-11-07 22:03:51,271 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:51,291 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:03:51,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 24, 20] total 57 [2018-11-07 22:03:51,291 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:03:51,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-07 22:03:51,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-07 22:03:51,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=2912, Unknown=1, NotChecked=0, Total=3192 [2018-11-07 22:03:51,293 INFO L87 Difference]: Start difference. First operand 162 states and 178 transitions. Second operand 42 states. [2018-11-07 22:03:52,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:03:52,962 INFO L93 Difference]: Finished difference Result 240 states and 260 transitions. [2018-11-07 22:03:52,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-07 22:03:52,962 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 63 [2018-11-07 22:03:52,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:03:52,965 INFO L225 Difference]: With dead ends: 240 [2018-11-07 22:03:52,965 INFO L226 Difference]: Without dead ends: 238 [2018-11-07 22:03:52,967 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 89 SyntacticMatches, 8 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1719 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=542, Invalid=5157, Unknown=1, NotChecked=0, Total=5700 [2018-11-07 22:03:52,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-11-07 22:03:52,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 162. [2018-11-07 22:03:52,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-11-07 22:03:52,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 178 transitions. [2018-11-07 22:03:52,989 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 178 transitions. Word has length 63 [2018-11-07 22:03:52,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:03:52,989 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 178 transitions. [2018-11-07 22:03:52,989 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-07 22:03:52,990 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 178 transitions. [2018-11-07 22:03:52,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-07 22:03:52,990 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:03:52,990 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 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, 1, 1, 1, 1] [2018-11-07 22:03:52,991 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:03:52,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:03:52,991 INFO L82 PathProgramCache]: Analyzing trace with hash 2132240345, now seen corresponding path program 5 times [2018-11-07 22:03:52,991 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:03:52,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:52,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:03:52,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:52,992 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:03:53,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:54,502 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:54,502 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:54,502 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:03:54,502 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:03:54,503 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:03:54,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:54,503 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-11-07 22:03:54,530 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:03:54,530 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:03:54,566 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-07 22:03:54,567 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:03:54,570 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:03:54,746 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 41 treesize of output 34 [2018-11-07 22:03:54,763 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:03:54,764 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:03:54,766 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 0 case distinctions, treesize of input 34 treesize of output 74 [2018-11-07 22:03:54,767 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 22:03:54,777 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:03:54,790 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:03:54,790 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:45 [2018-11-07 22:03:54,994 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:03:54,995 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 51 treesize of output 53 [2018-11-07 22:03:55,000 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:03:55,002 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:03:55,003 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:03:55,007 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:03:55,008 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 84 [2018-11-07 22:03:55,009 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 22:03:55,030 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:03:55,043 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:03:55,043 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:65, output treesize:32 [2018-11-07 22:03:55,161 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:03:55,162 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 41 treesize of output 47 [2018-11-07 22:03:55,165 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:03:55,166 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:03:55,167 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:03:55,168 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:03:55,173 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:03:55,177 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 84 [2018-11-07 22:03:55,178 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 22:03:55,186 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:03:55,194 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:03:55,194 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:58, output treesize:35 [2018-11-07 22:03:55,315 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 34 treesize of output 27 [2018-11-07 22:03:55,318 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:03:55,319 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:03:55,320 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:03:55,321 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:03:55,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, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 76 [2018-11-07 22:03:55,324 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 22:03:55,336 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:03:55,347 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:03:55,347 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:49, output treesize:21 [2018-11-07 22:03:55,409 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 28 treesize of output 20 [2018-11-07 22:03:55,412 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:03:55,413 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 20 treesize of output 16 [2018-11-07 22:03:55,413 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 22:03:55,414 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:03:55,415 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:03:55,415 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:5 [2018-11-07 22:03:55,473 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 3 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:55,473 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:03:59,701 WARN L179 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 17 [2018-11-07 22:04:01,904 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 20 [2018-11-07 22:04:10,131 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 23 [2018-11-07 22:04:23,673 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 88 treesize of output 80 [2018-11-07 22:04:23,676 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:04:23,679 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 80 treesize of output 87 [2018-11-07 22:04:23,682 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:04:23,686 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:04:23,687 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:04:23,710 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 75 treesize of output 115 [2018-11-07 22:04:23,962 WARN L179 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 91 [2018-11-07 22:04:23,967 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:04:23,968 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:04:23,970 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:04:23,976 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 70 [2018-11-07 22:04:23,978 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-07 22:04:23,980 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:04:23,980 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:04:23,981 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:04:23,981 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:04:23,983 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:04:23,983 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:04:23,989 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:04:24,016 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 1 case distinctions, treesize of input 67 treesize of output 94 [2018-11-07 22:04:24,017 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-11-07 22:04:24,019 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:04:24,020 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:04:24,020 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:04:24,021 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:04:24,023 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:04:24,023 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:04:24,029 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:04:24,041 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 1 case distinctions, treesize of input 63 treesize of output 96 [2018-11-07 22:04:24,042 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-11-07 22:04:24,044 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-07 22:04:24,044 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-07 22:04:24,047 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:04:24,049 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:04:24,049 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:04:24,054 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:04:24,058 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:04:24,060 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:04:24,068 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:04:24,075 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 1 case distinctions, treesize of input 65 treesize of output 96 [2018-11-07 22:04:24,076 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-11-07 22:04:24,081 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:04:24,083 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:04:24,083 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:04:24,086 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:04:24,089 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:04:24,092 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:04:24,100 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:04:24,111 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 1 case distinctions, treesize of input 65 treesize of output 94 [2018-11-07 22:04:24,112 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-11-07 22:04:24,116 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:04:24,117 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:04:24,117 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:04:24,120 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:04:24,122 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:04:24,124 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:04:24,132 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:04:24,143 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 1 case distinctions, treesize of input 62 treesize of output 95 [2018-11-07 22:04:24,144 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-11-07 22:04:24,448 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:04:24,450 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:04:24,450 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:04:24,452 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:04:24,452 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:04:24,457 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:04:24,458 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:04:24,465 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 91 [2018-11-07 22:04:24,466 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2018-11-07 22:04:24,469 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:04:24,469 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:04:24,470 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:04:24,470 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:04:24,474 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:04:24,474 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:04:24,476 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:04:24,476 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:04:24,477 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:04:24,478 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:04:24,489 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:04:24,490 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:04:24,498 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 127 [2018-11-07 22:04:24,500 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-11-07 22:04:24,638 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:04:24,639 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:04:24,639 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:04:24,643 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:04:24,644 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:04:24,650 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:04:24,663 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 86 [2018-11-07 22:04:24,665 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 3 xjuncts. [2018-11-07 22:04:24,670 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:04:24,674 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:04:24,687 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 59 [2018-11-07 22:04:24,689 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 3 xjuncts. [2018-11-07 22:04:24,784 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-11-07 22:04:24,821 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-07 22:04:24,855 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-07 22:04:24,899 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-07 22:04:24,899 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 7 variables, input treesize:104, output treesize:50 [2018-11-07 22:04:27,079 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:04:27,099 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:04:27,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 26, 26] total 65 [2018-11-07 22:04:27,099 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:04:27,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-07 22:04:27,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-07 22:04:27,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=480, Invalid=3670, Unknown=10, NotChecked=0, Total=4160 [2018-11-07 22:04:27,101 INFO L87 Difference]: Start difference. First operand 162 states and 178 transitions. Second operand 42 states. [2018-11-07 22:04:30,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:04:30,235 INFO L93 Difference]: Finished difference Result 282 states and 312 transitions. [2018-11-07 22:04:30,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-11-07 22:04:30,236 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 62 [2018-11-07 22:04:30,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:04:30,238 INFO L225 Difference]: With dead ends: 282 [2018-11-07 22:04:30,238 INFO L226 Difference]: Without dead ends: 280 [2018-11-07 22:04:30,242 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 81 SyntacticMatches, 10 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3325 ImplicationChecksByTransitivity, 34.0s TimeCoverageRelationStatistics Valid=1364, Invalid=8328, Unknown=10, NotChecked=0, Total=9702 [2018-11-07 22:04:30,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2018-11-07 22:04:30,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 187. [2018-11-07 22:04:30,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-11-07 22:04:30,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 207 transitions. [2018-11-07 22:04:30,270 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 207 transitions. Word has length 62 [2018-11-07 22:04:30,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:04:30,270 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 207 transitions. [2018-11-07 22:04:30,270 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-07 22:04:30,270 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 207 transitions. [2018-11-07 22:04:30,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-07 22:04:30,271 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:04:30,271 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:04:30,271 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:04:30,272 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:04:30,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1372551317, now seen corresponding path program 3 times [2018-11-07 22:04:30,272 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:04:30,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:04:30,273 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:04:30,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:04:30,273 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:04:30,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:04:31,448 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 10 proven. 27 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-07 22:04:31,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:04:31,448 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:04:31,448 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:04:31,448 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:04:31,449 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:04:31,449 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-11-07 22:04:31,495 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:04:31,495 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:04:31,543 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:04:31,544 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:04:31,546 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:04:31,682 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 10 proven. 27 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-07 22:04:31,682 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:04:31,892 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 10 proven. 27 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-07 22:04:31,912 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:04:31,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-11-07 22:04:31,912 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:04:31,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 22:04:31,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 22:04:31,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2018-11-07 22:04:31,913 INFO L87 Difference]: Start difference. First operand 187 states and 207 transitions. Second operand 11 states. [2018-11-07 22:04:32,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:04:32,121 INFO L93 Difference]: Finished difference Result 306 states and 339 transitions. [2018-11-07 22:04:32,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-07 22:04:32,121 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2018-11-07 22:04:32,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:04:32,123 INFO L225 Difference]: With dead ends: 306 [2018-11-07 22:04:32,123 INFO L226 Difference]: Without dead ends: 272 [2018-11-07 22:04:32,123 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 120 SyntacticMatches, 6 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2018-11-07 22:04:32,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2018-11-07 22:04:32,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 199. [2018-11-07 22:04:32,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-11-07 22:04:32,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 218 transitions. [2018-11-07 22:04:32,155 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 218 transitions. Word has length 65 [2018-11-07 22:04:32,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:04:32,155 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 218 transitions. [2018-11-07 22:04:32,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 22:04:32,156 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 218 transitions. [2018-11-07 22:04:32,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-07 22:04:32,157 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:04:32,158 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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, 1, 1, 1] [2018-11-07 22:04:32,158 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:04:32,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:04:32,158 INFO L82 PathProgramCache]: Analyzing trace with hash -2042156006, now seen corresponding path program 2 times [2018-11-07 22:04:32,158 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:04:32,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:04:32,159 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:04:32,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:04:32,159 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:04:32,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:04:32,991 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:04:32,991 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:04:32,991 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:04:32,991 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:04:32,991 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:04:32,991 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:04:32,991 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-11-07 22:04:33,001 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:04:33,001 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:04:33,032 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-07 22:04:33,032 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:04:33,035 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:04:33,137 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 28 treesize of output 23 [2018-11-07 22:04:33,139 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:04:33,141 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 23 treesize of output 37 [2018-11-07 22:04:33,142 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 22:04:33,148 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:04:33,159 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-07 22:04:33,159 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:34 [2018-11-07 22:04:33,270 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 30 treesize of output 23 [2018-11-07 22:04:33,272 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:04:33,273 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:04:33,274 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:04:33,279 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 52 [2018-11-07 22:04:33,279 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 22:04:33,288 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:04:33,298 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:04:33,299 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:20 [2018-11-07 22:04:33,352 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 30 treesize of output 23 [2018-11-07 22:04:33,354 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:04:33,356 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:04:33,357 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:04:33,366 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 52 [2018-11-07 22:04:33,367 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 22:04:33,375 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:04:33,382 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:04:33,382 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:20 [2018-11-07 22:04:33,458 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 30 treesize of output 23 [2018-11-07 22:04:33,460 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:04:33,461 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:04:33,462 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:04:33,466 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 52 [2018-11-07 22:04:33,467 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 22:04:33,475 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:04:33,484 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:04:33,484 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:17 [2018-11-07 22:04:33,568 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 26 treesize of output 18 [2018-11-07 22:04:33,574 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-07 22:04:33,575 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 22:04:33,576 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:04:33,577 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:04:33,577 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-11-07 22:04:33,601 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 4 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:04:33,601 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:04:35,822 WARN L179 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 19 [2018-11-07 22:05:05,715 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 57 treesize of output 51 [2018-11-07 22:05:05,718 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:05:05,720 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 51 treesize of output 58 [2018-11-07 22:05:05,787 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:05:05,789 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:05:05,789 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:05:05,790 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:05:05,791 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:05:05,810 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 83 [2018-11-07 22:05:05,813 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-11-07 22:05:05,815 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:05:05,816 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:05:05,817 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:05:05,818 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:05:05,818 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:05:05,837 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 83 [2018-11-07 22:05:05,839 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 4 xjuncts. [2018-11-07 22:05:05,840 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-07 22:05:05,840 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-07 22:05:05,842 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:05:05,843 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:05:05,844 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:05:05,845 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:05:05,846 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:05:05,865 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 83 [2018-11-07 22:05:05,868 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 4 xjuncts. [2018-11-07 22:05:05,870 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:05:05,871 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:05:05,871 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:05:05,873 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:05:05,873 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:05:05,892 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 83 [2018-11-07 22:05:05,895 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 4 xjuncts. [2018-11-07 22:05:05,896 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-07 22:05:05,896 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-07 22:05:05,900 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:05:05,916 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 52 [2018-11-07 22:05:05,917 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 4 xjuncts. [2018-11-07 22:05:05,980 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-07 22:05:05,998 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-07 22:05:06,022 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-07 22:05:06,022 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:65, output treesize:33 [2018-11-07 22:05:06,283 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 5 proven. 52 refuted. 3 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:05:06,302 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:05:06,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 23, 25] total 53 [2018-11-07 22:05:06,303 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:05:06,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-07 22:05:06,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-07 22:05:06,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=333, Invalid=2414, Unknown=9, NotChecked=0, Total=2756 [2018-11-07 22:05:06,305 INFO L87 Difference]: Start difference. First operand 199 states and 218 transitions. Second operand 31 states. [2018-11-07 22:05:09,054 WARN L179 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 29 [2018-11-07 22:05:09,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:05:09,460 INFO L93 Difference]: Finished difference Result 373 states and 414 transitions. [2018-11-07 22:05:09,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-07 22:05:09,461 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 64 [2018-11-07 22:05:09,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:05:09,464 INFO L225 Difference]: With dead ends: 373 [2018-11-07 22:05:09,464 INFO L226 Difference]: Without dead ends: 371 [2018-11-07 22:05:09,465 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 89 SyntacticMatches, 14 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2309 ImplicationChecksByTransitivity, 35.3s TimeCoverageRelationStatistics Valid=1066, Invalid=5405, Unknown=9, NotChecked=0, Total=6480 [2018-11-07 22:05:09,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2018-11-07 22:05:09,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 218. [2018-11-07 22:05:09,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-11-07 22:05:09,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 238 transitions. [2018-11-07 22:05:09,504 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 238 transitions. Word has length 64 [2018-11-07 22:05:09,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:05:09,504 INFO L480 AbstractCegarLoop]: Abstraction has 218 states and 238 transitions. [2018-11-07 22:05:09,504 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-07 22:05:09,504 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 238 transitions. [2018-11-07 22:05:09,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-07 22:05:09,505 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:05:09,506 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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, 1, 1, 1] [2018-11-07 22:05:09,506 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:05:09,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:05:09,506 INFO L82 PathProgramCache]: Analyzing trace with hash -1818764072, now seen corresponding path program 3 times [2018-11-07 22:05:09,506 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:05:09,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:05:09,507 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:05:09,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:05:09,507 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:05:09,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:05:10,155 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 19 [2018-11-07 22:05:10,548 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:05:10,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:05:10,549 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:05:10,549 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:05:10,549 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:05:10,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:05:10,549 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:05:10,577 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:05:10,577 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:05:10,599 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:05:10,600 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:05:10,602 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:05:10,830 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 28 treesize of output 23 [2018-11-07 22:05:10,834 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:05:10,836 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 23 treesize of output 37 [2018-11-07 22:05:10,836 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 22:05:10,843 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:05:10,854 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-07 22:05:10,854 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:32 [2018-11-07 22:05:10,954 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 37 treesize of output 30 [2018-11-07 22:05:10,957 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:05:10,958 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:05:10,960 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:05:10,964 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 73 [2018-11-07 22:05:10,965 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 22:05:10,977 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:05:10,988 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-07 22:05:10,988 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:46, output treesize:27 [2018-11-07 22:05:11,149 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 37 treesize of output 29 [2018-11-07 22:05:11,150 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:05:11,151 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:05:11,152 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:05:11,152 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:05:11,158 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2018-11-07 22:05:11,159 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 22:05:11,166 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:05:11,172 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:05:11,173 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:43, output treesize:3 [2018-11-07 22:05:11,195 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 6 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:05:11,195 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:05:13,333 WARN L832 $PredicateComparison]: unable to prove that (forall ((main_~key~0 Int)) (let ((.cse0 (store (select |c_#memory_int| |c_main_~#v~0.base|) (+ (* 4 c_main_~i~0) |c_main_~#v~0.offset| 4) main_~key~0))) (< (select .cse0 |c_main_~#v~0.offset|) (+ (select .cse0 (+ |c_main_~#v~0.offset| 4)) 1)))) is different from false [2018-11-07 22:05:29,652 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 59 treesize of output 53 [2018-11-07 22:05:29,655 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:05:29,656 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 53 treesize of output 60 [2018-11-07 22:05:29,728 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:05:29,729 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:05:29,730 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:05:29,731 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:05:29,732 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:05:29,750 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 83 [2018-11-07 22:05:29,753 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-11-07 22:05:29,779 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:05:29,781 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:05:29,782 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:05:29,783 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:05:29,783 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:05:29,801 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 86 [2018-11-07 22:05:29,803 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 4 xjuncts. [2018-11-07 22:05:29,806 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:05:29,807 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:05:29,807 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:05:29,809 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:05:29,809 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:05:29,828 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 83 [2018-11-07 22:05:29,831 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 4 xjuncts. [2018-11-07 22:05:29,832 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:05:29,834 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:05:29,834 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:05:29,836 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:05:29,836 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:05:29,856 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 85 [2018-11-07 22:05:29,859 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 4 xjuncts. [2018-11-07 22:05:29,928 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:05:29,995 INFO L303 Elim1Store]: Index analysis took 135 ms [2018-11-07 22:05:30,159 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 63 [2018-11-07 22:05:30,161 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 4 xjuncts. [2018-11-07 22:05:30,232 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:05:30,291 INFO L303 Elim1Store]: Index analysis took 129 ms [2018-11-07 22:05:30,448 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 52 [2018-11-07 22:05:30,450 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 4 xjuncts. [2018-11-07 22:05:30,467 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:05:30,502 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:05:30,511 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:05:30,544 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:05:30,557 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:05:30,680 INFO L303 Elim1Store]: Index analysis took 229 ms [2018-11-07 22:05:30,871 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 85 [2018-11-07 22:05:30,873 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 4 xjuncts. [2018-11-07 22:05:31,019 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-07 22:05:31,042 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-07 22:05:31,071 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-11-07 22:05:31,071 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 6 variables, input treesize:62, output treesize:38 [2018-11-07 22:05:33,287 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 3 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 20 not checked. [2018-11-07 22:05:33,307 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:05:33,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20, 20] total 51 [2018-11-07 22:05:33,307 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:05:33,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-07 22:05:33,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-07 22:05:33,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=2195, Unknown=6, NotChecked=96, Total=2550 [2018-11-07 22:05:33,309 INFO L87 Difference]: Start difference. First operand 218 states and 238 transitions. Second operand 34 states. [2018-11-07 22:05:35,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:05:35,388 INFO L93 Difference]: Finished difference Result 302 states and 332 transitions. [2018-11-07 22:05:35,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-07 22:05:35,389 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 64 [2018-11-07 22:05:35,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:05:35,391 INFO L225 Difference]: With dead ends: 302 [2018-11-07 22:05:35,391 INFO L226 Difference]: Without dead ends: 300 [2018-11-07 22:05:35,392 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 96 SyntacticMatches, 7 SemanticMatches, 73 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 1538 ImplicationChecksByTransitivity, 23.2s TimeCoverageRelationStatistics Valid=699, Invalid=4701, Unknown=6, NotChecked=144, Total=5550 [2018-11-07 22:05:35,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2018-11-07 22:05:35,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 214. [2018-11-07 22:05:35,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-11-07 22:05:35,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 234 transitions. [2018-11-07 22:05:35,430 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 234 transitions. Word has length 64 [2018-11-07 22:05:35,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:05:35,430 INFO L480 AbstractCegarLoop]: Abstraction has 214 states and 234 transitions. [2018-11-07 22:05:35,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-07 22:05:35,431 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 234 transitions. [2018-11-07 22:05:35,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-07 22:05:35,432 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:05:35,432 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:05:35,432 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:05:35,432 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:05:35,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1292852080, now seen corresponding path program 4 times [2018-11-07 22:05:35,432 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:05:35,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:05:35,433 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:05:35,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:05:35,433 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:05:35,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:05:36,295 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 1 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:05:36,295 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:05:36,296 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:05:36,296 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:05:36,296 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:05:36,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:05:36,296 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:05:36,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:05:36,305 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:05:36,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:05:36,327 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:05:36,542 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 28 treesize of output 23 [2018-11-07 22:05:36,545 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:05:36,547 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 23 treesize of output 37 [2018-11-07 22:05:36,547 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 22:05:36,554 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:05:36,563 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:05:36,563 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:27 [2018-11-07 22:05:36,662 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 32 treesize of output 25 [2018-11-07 22:05:36,665 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:05:36,666 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:05:36,667 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:05:36,673 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 58 [2018-11-07 22:05:36,673 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 22:05:36,682 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:05:36,691 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:05:36,692 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:19 [2018-11-07 22:05:36,962 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 26 treesize of output 18 [2018-11-07 22:05:36,964 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-07 22:05:36,964 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 22:05:36,966 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:05:36,967 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:05:36,968 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-11-07 22:05:37,026 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:05:37,026 INFO L316 TraceCheckSpWp]: Computing backward predicates... Received shutdown request... [2018-11-07 22:05:45,261 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2018-11-07 22:05:45,462 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:05:45,463 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-07 22:05:45,468 WARN L205 ceAbstractionStarter]: Timeout [2018-11-07 22:05:45,469 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 10:05:45 BoogieIcfgContainer [2018-11-07 22:05:45,469 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 22:05:45,470 INFO L168 Benchmark]: Toolchain (without parser) took 265544.74 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.6 GB in the end (delta: -157.0 MB). Peak memory consumption was 865.4 MB. Max. memory is 7.1 GB. [2018-11-07 22:05:45,470 INFO L168 Benchmark]: CDTParser took 0.23 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-11-07 22:05:45,470 INFO L168 Benchmark]: CACSL2BoogieTranslator took 370.10 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-11-07 22:05:45,471 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.06 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-11-07 22:05:45,471 INFO L168 Benchmark]: Boogie Preprocessor took 46.17 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-11-07 22:05:45,471 INFO L168 Benchmark]: RCFGBuilder took 669.56 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 718.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -750.7 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. [2018-11-07 22:05:45,472 INFO L168 Benchmark]: TraceAbstraction took 264421.44 ms. Allocated memory was 2.2 GB in the beginning and 2.5 GB in the end (delta: 303.6 MB). Free memory was 2.2 GB in the beginning and 1.6 GB in the end (delta: 583.1 MB). Peak memory consumption was 886.7 MB. Max. memory is 7.1 GB. [2018-11-07 22:05:45,473 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 370.10 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 33.06 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 46.17 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 669.56 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 718.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -750.7 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 264421.44 ms. Allocated memory was 2.2 GB in the beginning and 2.5 GB in the end (delta: 303.6 MB). Free memory was 2.2 GB in the beginning and 1.6 GB in the end (delta: 583.1 MB). Peak memory consumption was 886.7 MB. 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 67 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 41 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 44 locations, 1 error locations. TIMEOUT Result, 264.3s OverallTime, 19 OverallIterations, 4 TraceHistogramMax, 41.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 777 SDtfs, 3600 SDslu, 6477 SDs, 0 SdLazy, 10691 SolverSat, 1235 SolverUnsat, 9 SolverUnknown, 0 SolverNotchecked, 25.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2161 GetRequests, 1186 SyntacticMatches, 109 SemanticMatches, 866 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 19696 ImplicationChecksByTransitivity, 208.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=218occurred in iteration=17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.5s AbstIntTime, 6 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 18 MinimizatonAttempts, 1175 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 208.8s InterpolantComputationTime, 1622 NumberOfCodeBlocks, 1611 NumberOfCodeBlocksAsserted, 47 NumberOfCheckSat, 2352 ConstructedInterpolants, 260 QuantifiedInterpolants, 1745914 SizeOfPredicates, 214 NumberOfNonLiveVariables, 1564 ConjunctsInSsa, 354 ConjunctsInUnsatCore, 48 InterpolantComputations, 3 PerfectInterpolantSequences, 226/1319 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown