java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf -i ../../../trunk/examples/svcomp/loops/insertion_sort_false-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1dbac8b [2018-10-27 09:00:27,999 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 09:00:28,001 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 09:00:28,017 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 09:00:28,017 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 09:00:28,018 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 09:00:28,020 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 09:00:28,021 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 09:00:28,023 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 09:00:28,024 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 09:00:28,025 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 09:00:28,025 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 09:00:28,026 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 09:00:28,027 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 09:00:28,028 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 09:00:28,029 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 09:00:28,030 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 09:00:28,032 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 09:00:28,034 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 09:00:28,035 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 09:00:28,036 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 09:00:28,038 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 09:00:28,040 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 09:00:28,040 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 09:00:28,041 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 09:00:28,042 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 09:00:28,043 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 09:00:28,043 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 09:00:28,044 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 09:00:28,045 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 09:00:28,046 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 09:00:28,046 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 09:00:28,047 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 09:00:28,047 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 09:00:28,048 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 09:00:28,049 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 09:00:28,049 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf [2018-10-27 09:00:28,064 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 09:00:28,064 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 09:00:28,065 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-27 09:00:28,065 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-27 09:00:28,065 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-27 09:00:28,065 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-27 09:00:28,066 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-27 09:00:28,066 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-27 09:00:28,066 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-27 09:00:28,066 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-27 09:00:28,066 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-27 09:00:28,067 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-27 09:00:28,067 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-27 09:00:28,067 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-27 09:00:28,068 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 09:00:28,068 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 09:00:28,068 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 09:00:28,068 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-27 09:00:28,068 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-27 09:00:28,069 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-27 09:00:28,069 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 09:00:28,069 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-27 09:00:28,069 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 09:00:28,069 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 09:00:28,069 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-27 09:00:28,070 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-27 09:00:28,070 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-27 09:00:28,070 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 09:00:28,070 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-27 09:00:28,070 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-27 09:00:28,072 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-27 09:00:28,072 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-27 09:00:28,072 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-27 09:00:28,073 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-27 09:00:28,073 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-27 09:00:28,073 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-27 09:00:28,135 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 09:00:28,151 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 09:00:28,155 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 09:00:28,157 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 09:00:28,158 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 09:00:28,158 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/loops/insertion_sort_false-unreach-call_true-termination.i [2018-10-27 09:00:28,229 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/5910d014a/19998d2d29e343698a25cc78fe3ab384/FLAGaba6c9eaa [2018-10-27 09:00:28,722 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 09:00:28,723 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/insertion_sort_false-unreach-call_true-termination.i [2018-10-27 09:00:28,732 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/5910d014a/19998d2d29e343698a25cc78fe3ab384/FLAGaba6c9eaa [2018-10-27 09:00:28,750 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/5910d014a/19998d2d29e343698a25cc78fe3ab384 [2018-10-27 09:00:28,762 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 09:00:28,764 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-27 09:00:28,765 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 09:00:28,765 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 09:00:28,769 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 09:00:28,770 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 09:00:28" (1/1) ... [2018-10-27 09:00:28,773 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ea74f48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 09:00:28, skipping insertion in model container [2018-10-27 09:00:28,773 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 09:00:28" (1/1) ... [2018-10-27 09:00:28,783 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 09:00:28,807 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 09:00:29,007 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 09:00:29,011 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 09:00:29,045 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 09:00:29,070 INFO L193 MainTranslator]: Completed translation [2018-10-27 09:00:29,070 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 09:00:29 WrapperNode [2018-10-27 09:00:29,070 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 09:00:29,071 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 09:00:29,072 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 09:00:29,072 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 09:00:29,082 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 09:00:29" (1/1) ... [2018-10-27 09:00:29,092 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 09:00:29" (1/1) ... [2018-10-27 09:00:29,122 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 09:00:29,123 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 09:00:29,123 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 09:00:29,124 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 09:00:29,136 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 09:00:29" (1/1) ... [2018-10-27 09:00:29,137 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 09:00:29" (1/1) ... [2018-10-27 09:00:29,139 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 09:00:29" (1/1) ... [2018-10-27 09:00:29,140 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 09:00:29" (1/1) ... [2018-10-27 09:00:29,146 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 09:00:29" (1/1) ... [2018-10-27 09:00:29,152 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 09:00:29" (1/1) ... [2018-10-27 09:00:29,153 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 09:00:29" (1/1) ... [2018-10-27 09:00:29,156 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 09:00:29,157 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 09:00:29,157 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 09:00:29,157 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 09:00:29,158 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 09:00:29" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-27 09:00:29,292 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-27 09:00:29,292 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-27 09:00:29,292 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 09:00:29,292 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 09:00:29,292 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-27 09:00:29,293 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-27 09:00:29,293 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-10-27 09:00:29,293 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-10-27 09:00:29,779 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 09:00:29,780 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 09:00:29 BoogieIcfgContainer [2018-10-27 09:00:29,780 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 09:00:29,781 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-27 09:00:29,781 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-27 09:00:29,784 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-27 09:00:29,784 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.10 09:00:28" (1/3) ... [2018-10-27 09:00:29,785 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a184e2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 09:00:29, skipping insertion in model container [2018-10-27 09:00:29,785 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 09:00:29" (2/3) ... [2018-10-27 09:00:29,786 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a184e2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 09:00:29, skipping insertion in model container [2018-10-27 09:00:29,786 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 09:00:29" (3/3) ... [2018-10-27 09:00:29,788 INFO L112 eAbstractionObserver]: Analyzing ICFG insertion_sort_false-unreach-call_true-termination.i [2018-10-27 09:00:29,796 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-27 09:00:29,807 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-27 09:00:29,828 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-27 09:00:29,859 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-27 09:00:29,859 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-27 09:00:29,860 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-27 09:00:29,860 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 09:00:29,860 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 09:00:29,860 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-27 09:00:29,860 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 09:00:29,860 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-27 09:00:29,879 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2018-10-27 09:00:29,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-27 09:00:29,886 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:00:29,887 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 09:00:29,889 INFO L424 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:00:29,895 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:00:29,896 INFO L82 PathProgramCache]: Analyzing trace with hash 1403248464, now seen corresponding path program 1 times [2018-10-27 09:00:29,898 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:00:29,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:00:29,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:00:29,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:00:29,956 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:00:30,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:00:30,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:00:30,062 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 09:00:30,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-27 09:00:30,063 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 09:00:30,067 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-27 09:00:30,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-27 09:00:30,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-27 09:00:30,083 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 2 states. [2018-10-27 09:00:30,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:00:30,106 INFO L93 Difference]: Finished difference Result 60 states and 77 transitions. [2018-10-27 09:00:30,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-27 09:00:30,107 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-10-27 09:00:30,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:00:30,116 INFO L225 Difference]: With dead ends: 60 [2018-10-27 09:00:30,117 INFO L226 Difference]: Without dead ends: 28 [2018-10-27 09:00:30,121 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-27 09:00:30,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-10-27 09:00:30,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-10-27 09:00:30,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-27 09:00:30,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2018-10-27 09:00:30,163 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 14 [2018-10-27 09:00:30,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:00:30,163 INFO L481 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2018-10-27 09:00:30,163 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-27 09:00:30,163 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-10-27 09:00:30,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-27 09:00:30,164 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:00:30,165 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 09:00:30,165 INFO L424 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:00:30,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:00:30,166 INFO L82 PathProgramCache]: Analyzing trace with hash 969867983, now seen corresponding path program 1 times [2018-10-27 09:00:30,166 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:00:30,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:00:30,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:00:30,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:00:30,168 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:00:30,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:00:30,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:00:30,536 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 09:00:30,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 09:00:30,537 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 09:00:30,538 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 09:00:30,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 09:00:30,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-27 09:00:30,539 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 5 states. [2018-10-27 09:00:30,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:00:30,741 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2018-10-27 09:00:30,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 09:00:30,742 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-10-27 09:00:30,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:00:30,743 INFO L225 Difference]: With dead ends: 52 [2018-10-27 09:00:30,743 INFO L226 Difference]: Without dead ends: 38 [2018-10-27 09:00:30,745 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-27 09:00:30,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-10-27 09:00:30,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 30. [2018-10-27 09:00:30,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-27 09:00:30,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2018-10-27 09:00:30,752 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 15 [2018-10-27 09:00:30,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:00:30,752 INFO L481 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2018-10-27 09:00:30,752 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 09:00:30,753 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2018-10-27 09:00:30,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-27 09:00:30,753 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:00:30,754 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] [2018-10-27 09:00:30,754 INFO L424 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:00:30,754 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:00:30,754 INFO L82 PathProgramCache]: Analyzing trace with hash 1889876064, now seen corresponding path program 1 times [2018-10-27 09:00:30,755 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:00:30,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:00:30,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:00:30,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:00:30,756 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:00:30,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:00:31,311 WARN L179 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 11 [2018-10-27 09:00:31,742 WARN L179 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 23 [2018-10-27 09:00:31,961 WARN L179 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 21 [2018-10-27 09:00:32,179 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 16 [2018-10-27 09:00:32,480 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:00:32,480 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:00:32,481 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 09:00:32,481 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 24 with the following transitions: [2018-10-27 09:00:32,483 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [18], [20], [23], [29], [42], [44], [48], [52], [57], [67], [70], [72], [78], [79], [80], [82] [2018-10-27 09:00:32,520 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-27 09:00:32,521 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 09:00:32,882 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 09:00:32,884 INFO L272 AbstractInterpreter]: Visited 22 different actions 70 times. Merged at 12 different actions 36 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 38 variables. [2018-10-27 09:00:32,914 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:00:32,916 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 09:00:32,916 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:00:32,916 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 09:00:32,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:00:32,926 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 09:00:32,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:00:32,983 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 09:00: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 28 treesize of output 23 [2018-10-27 09:00:33,359 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:00:33,361 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-10-27 09:00:33,362 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 09:00:33,402 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:00:33,414 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-10-27 09:00:33,415 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:27 [2018-10-27 09:00:33,551 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-10-27 09:00:33,556 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:00:33,558 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:00:33,560 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:00:33,560 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:00:33,570 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-10-27 09:00:33,571 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 09:00:33,674 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:00:33,682 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:00:33,683 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:43, output treesize:3 [2018-10-27 09:00:33,716 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:00:33,718 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 09:00:34,092 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-10-27 09:00:34,167 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:00:34,169 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:00:34,170 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:00:34,179 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 35 treesize of output 48 [2018-10-27 09:00:34,182 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-10-27 09:00:34,184 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:00:34,186 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:00:34,186 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:00:34,198 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 33 treesize of output 50 [2018-10-27 09:00:34,200 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-10-27 09:00:34,205 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:00:34,207 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-10-27 09:00:34,208 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 09:00:34,337 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:00:34,342 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:00:34,343 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:45, output treesize:8 [2018-10-27 09:00:34,412 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:00:34,435 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 09:00:34,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 27 [2018-10-27 09:00:34,435 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 09:00:34,436 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-27 09:00:34,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-27 09:00:34,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=597, Unknown=0, NotChecked=0, Total=702 [2018-10-27 09:00:34,438 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 20 states. [2018-10-27 09:00:34,744 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 17 [2018-10-27 09:00:35,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:00:35,665 INFO L93 Difference]: Finished difference Result 99 states and 121 transitions. [2018-10-27 09:00:35,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-27 09:00:35,666 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 23 [2018-10-27 09:00:35,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:00:35,669 INFO L225 Difference]: With dead ends: 99 [2018-10-27 09:00:35,669 INFO L226 Difference]: Without dead ends: 77 [2018-10-27 09:00:35,671 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=217, Invalid=1043, Unknown=0, NotChecked=0, Total=1260 [2018-10-27 09:00:35,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-10-27 09:00:35,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 55. [2018-10-27 09:00:35,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-10-27 09:00:35,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 66 transitions. [2018-10-27 09:00:35,688 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 66 transitions. Word has length 23 [2018-10-27 09:00:35,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:00:35,689 INFO L481 AbstractCegarLoop]: Abstraction has 55 states and 66 transitions. [2018-10-27 09:00:35,689 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-27 09:00:35,689 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 66 transitions. [2018-10-27 09:00:35,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-27 09:00:35,690 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:00:35,691 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] [2018-10-27 09:00:35,691 INFO L424 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:00:35,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:00:35,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1303070050, now seen corresponding path program 1 times [2018-10-27 09:00:35,692 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:00:35,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:00:35,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:00:35,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:00:35,693 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:00:35,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:00:35,761 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:00:35,761 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 09:00:35,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 09:00:35,762 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 09:00:35,762 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 09:00:35,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 09:00:35,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-27 09:00:35,763 INFO L87 Difference]: Start difference. First operand 55 states and 66 transitions. Second operand 5 states. [2018-10-27 09:00:35,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:00:35,861 INFO L93 Difference]: Finished difference Result 137 states and 171 transitions. [2018-10-27 09:00:35,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 09:00:35,862 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-10-27 09:00:35,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:00:35,866 INFO L225 Difference]: With dead ends: 137 [2018-10-27 09:00:35,866 INFO L226 Difference]: Without dead ends: 90 [2018-10-27 09:00:35,867 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-27 09:00:35,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-10-27 09:00:35,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 64. [2018-10-27 09:00:35,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-10-27 09:00:35,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 75 transitions. [2018-10-27 09:00:35,880 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 75 transitions. Word has length 23 [2018-10-27 09:00:35,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:00:35,880 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 75 transitions. [2018-10-27 09:00:35,880 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 09:00:35,880 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 75 transitions. [2018-10-27 09:00:35,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-27 09:00:35,882 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:00:35,882 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] [2018-10-27 09:00:35,882 INFO L424 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:00:35,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:00:35,882 INFO L82 PathProgramCache]: Analyzing trace with hash -249426572, now seen corresponding path program 1 times [2018-10-27 09:00:35,883 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:00:35,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:00:35,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:00:35,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:00:35,884 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:00:35,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:00:36,503 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:00:36,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:00:36,504 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 09:00:36,504 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 30 with the following transitions: [2018-10-27 09:00:36,504 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [18], [20], [23], [25], [29], [31], [34], [38], [42], [44], [48], [52], [57], [67], [70], [72], [78], [79], [80], [82] [2018-10-27 09:00:36,507 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-27 09:00:36,507 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 09:00:36,771 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 09:00:36,771 INFO L272 AbstractInterpreter]: Visited 26 different actions 88 times. Merged at 16 different actions 44 times. Widened at 1 different actions 1 times. Found 8 fixpoints after 6 different actions. Largest state had 39 variables. [2018-10-27 09:00:36,815 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:00:36,815 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 09:00:36,815 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:00:36,816 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 09:00:36,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:00:36,833 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 09:00:36,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:00:36,881 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 09:00:37,104 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-10-27 09:00:37,107 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:00:37,112 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-10-27 09:00:37,113 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 09:00:37,137 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:00:37,152 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:00:37,153 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:50, output treesize:43 [2018-10-27 09:00:37,340 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:00:37,341 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 52 treesize of output 54 [2018-10-27 09:00:37,345 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:00:37,348 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:00:37,350 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 61 [2018-10-27 09:00:37,352 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 09:00:37,362 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:00:37,372 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-10-27 09:00:37,373 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:65, output treesize:37 [2018-10-27 09:00:37,417 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-10-27 09:00:37,424 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:00:37,425 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-10-27 09:00:37,426 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 09:00:37,427 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:00:37,430 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:00:37,431 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:5 [2018-10-27 09:00:37,472 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:00:37,472 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 09:00:41,701 WARN L179 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 20 [2018-10-27 09:00:43,957 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 70 treesize of output 62 [2018-10-27 09:00:43,981 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:00:44,008 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 62 treesize of output 69 [2018-10-27 09:00:44,168 WARN L179 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 29 [2018-10-27 09:00:44,196 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:00:44,209 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:00:44,218 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:00:44,233 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:00:44,265 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:00:44,265 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:00:44,273 INFO L303 Elim1Store]: Index analysis took 103 ms [2018-10-27 09:00:44,281 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 48 treesize of output 78 [2018-10-27 09:00:44,284 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-10-27 09:00:44,290 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:00:44,291 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:00:44,292 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:00:44,293 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:00:44,294 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:00:44,315 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 50 treesize of output 83 [2018-10-27 09:00:44,319 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 4 xjuncts. [2018-10-27 09:00:44,321 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:00:44,322 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:00:44,322 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:00:44,329 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 45 treesize of output 47 [2018-10-27 09:00:44,330 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-27 09:00:44,376 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:00:44,380 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:00:44,388 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:00:44,388 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:72, output treesize:13 [2018-10-27 09:00:44,495 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:00:44,517 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 09:00:44,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 14] total 34 [2018-10-27 09:00:44,518 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 09:00:44,518 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-27 09:00:44,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-27 09:00:44,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=985, Unknown=1, NotChecked=0, Total=1122 [2018-10-27 09:00:44,521 INFO L87 Difference]: Start difference. First operand 64 states and 75 transitions. Second operand 22 states. [2018-10-27 09:00:45,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:00:45,667 INFO L93 Difference]: Finished difference Result 152 states and 183 transitions. [2018-10-27 09:00:45,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-27 09:00:45,669 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 29 [2018-10-27 09:00:45,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:00:45,673 INFO L225 Difference]: With dead ends: 152 [2018-10-27 09:00:45,673 INFO L226 Difference]: Without dead ends: 150 [2018-10-27 09:00:45,674 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 37 SyntacticMatches, 5 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 491 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=217, Invalid=1422, Unknown=1, NotChecked=0, Total=1640 [2018-10-27 09:00:45,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-10-27 09:00:45,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 75. [2018-10-27 09:00:45,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-10-27 09:00:45,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 90 transitions. [2018-10-27 09:00:45,688 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 90 transitions. Word has length 29 [2018-10-27 09:00:45,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:00:45,689 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 90 transitions. [2018-10-27 09:00:45,689 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-27 09:00:45,689 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 90 transitions. [2018-10-27 09:00:45,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-10-27 09:00:45,690 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:00:45,690 INFO L375 BasicCegarLoop]: trace histogram [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-10-27 09:00:45,691 INFO L424 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:00:45,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:00:45,691 INFO L82 PathProgramCache]: Analyzing trace with hash -853417747, now seen corresponding path program 1 times [2018-10-27 09:00:45,691 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:00:45,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:00:45,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:00:45,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:00:45,693 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:00:45,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:00:45,903 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:00:45,903 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:00:45,903 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 09:00:45,903 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 33 with the following transitions: [2018-10-27 09:00:45,904 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [18], [20], [23], [29], [42], [44], [48], [52], [57], [59], [61], [67], [70], [72], [75], [77], [78], [79], [80], [82], [83] [2018-10-27 09:00:45,906 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-27 09:00:45,906 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 09:00:46,074 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 09:00:46,074 INFO L272 AbstractInterpreter]: Visited 27 different actions 112 times. Merged at 15 different actions 52 times. Widened at 1 different actions 1 times. Found 5 fixpoints after 3 different actions. Largest state had 39 variables. [2018-10-27 09:00:46,112 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:00:46,112 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 09:00:46,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:00:46,112 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 09:00:46,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:00:46,130 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 09:00:46,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:00:46,181 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 09:00:46,350 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:00:46,350 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 09:00:46,729 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:00:46,760 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 09:00:46,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2018-10-27 09:00:46,760 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 09:00:46,761 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-27 09:00:46,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-27 09:00:46,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-10-27 09:00:46,762 INFO L87 Difference]: Start difference. First operand 75 states and 90 transitions. Second operand 8 states. [2018-10-27 09:00:46,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:00:46,955 INFO L93 Difference]: Finished difference Result 142 states and 173 transitions. [2018-10-27 09:00:46,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 09:00:46,956 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2018-10-27 09:00:46,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:00:46,957 INFO L225 Difference]: With dead ends: 142 [2018-10-27 09:00:46,957 INFO L226 Difference]: Without dead ends: 123 [2018-10-27 09:00:46,958 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 56 SyntacticMatches, 6 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-10-27 09:00:46,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-10-27 09:00:46,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 94. [2018-10-27 09:00:46,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-10-27 09:00:46,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 112 transitions. [2018-10-27 09:00:46,972 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 112 transitions. Word has length 32 [2018-10-27 09:00:46,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:00:46,973 INFO L481 AbstractCegarLoop]: Abstraction has 94 states and 112 transitions. [2018-10-27 09:00:46,973 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-27 09:00:46,973 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 112 transitions. [2018-10-27 09:00:46,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-10-27 09:00:46,974 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:00:46,974 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 09:00:46,974 INFO L424 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:00:46,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:00:46,975 INFO L82 PathProgramCache]: Analyzing trace with hash -1757852431, now seen corresponding path program 2 times [2018-10-27 09:00:46,975 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:00:46,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:00:46,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:00:46,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:00:46,976 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:00:47,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:00:47,447 WARN L179 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 9 [2018-10-27 09:00:48,026 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 22 [2018-10-27 09:00:48,236 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:00:48,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:00:48,236 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 09:00:48,236 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 09:00:48,237 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 09:00:48,237 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:00:48,237 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 09:00:48,252 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 09:00:48,252 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-27 09:00:48,284 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-10-27 09:00:48,284 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 09:00:48,289 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 09:00:48,452 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 24 treesize of output 19 [2018-10-27 09:00:48,455 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:00:48,457 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 19 treesize of output 29 [2018-10-27 09:00:48,457 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 09:00:48,463 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:00:48,480 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-10-27 09:00:48,481 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:47, output treesize:40 [2018-10-27 09:00:48,584 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 25 treesize of output 18 [2018-10-27 09:00:48,586 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:00:48,587 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:00:48,588 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:00:48,593 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 18 treesize of output 37 [2018-10-27 09:00:48,594 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 09:00:48,603 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:00:48,613 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:00:48,613 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:17 [2018-10-27 09:00:48,642 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-10-27 09:00:48,646 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-10-27 09:00:48,647 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 09:00:48,651 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:00:48,652 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:00:48,652 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-10-27 09:00:48,667 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:00:48,667 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 09:00:51,239 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 49 treesize of output 43 [2018-10-27 09:00:51,241 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:00:51,243 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 43 treesize of output 50 [2018-10-27 09:00:51,356 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2018-10-27 09:00:51,360 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:00:51,362 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:00:51,363 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:00:51,365 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:00:51,369 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:00:51,386 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-10-27 09:00:51,391 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-10-27 09:00:51,393 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-27 09:00:51,393 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 09:00:51,395 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:00:51,397 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:00:51,398 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:00:51,400 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:00:51,401 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:00:51,421 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 2 case distinctions, treesize of input 40 treesize of output 81 [2018-10-27 09:00:51,423 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 4 xjuncts. [2018-10-27 09:00:51,432 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:00:51,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-10-27 09:00:51,451 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 4 xjuncts. [2018-10-27 09:00:51,457 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:00:51,458 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:00:51,459 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:00:51,461 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:00:51,462 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:00:51,483 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 42 treesize of output 81 [2018-10-27 09:00:51,485 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 4 xjuncts. [2018-10-27 09:00:51,487 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:00:51,489 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:00:51,490 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:00:51,492 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:00:51,493 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:00:51,514 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 83 [2018-10-27 09:00:51,518 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 4 xjuncts. [2018-10-27 09:00:51,540 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-27 09:00:51,540 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-10-27 09:00:51,648 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 09:00:51,666 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 09:00:51,693 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-10-27 09:00:51,694 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:62, output treesize:49 [2018-10-27 09:00:51,940 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:00:51,961 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 09:00:51,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 17] total 34 [2018-10-27 09:00:51,961 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 09:00:51,961 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-27 09:00:51,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-27 09:00:51,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=973, Unknown=1, NotChecked=0, Total=1122 [2018-10-27 09:00:51,963 INFO L87 Difference]: Start difference. First operand 94 states and 112 transitions. Second operand 20 states. [2018-10-27 09:00:53,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:00:53,040 INFO L93 Difference]: Finished difference Result 194 states and 240 transitions. [2018-10-27 09:00:53,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-27 09:00:53,041 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 31 [2018-10-27 09:00:53,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:00:53,043 INFO L225 Difference]: With dead ends: 194 [2018-10-27 09:00:53,043 INFO L226 Difference]: Without dead ends: 141 [2018-10-27 09:00:53,045 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 38 SyntacticMatches, 8 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 538 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=305, Invalid=1764, Unknown=1, NotChecked=0, Total=2070 [2018-10-27 09:00:53,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-10-27 09:00:53,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 101. [2018-10-27 09:00:53,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-10-27 09:00:53,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 121 transitions. [2018-10-27 09:00:53,059 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 121 transitions. Word has length 31 [2018-10-27 09:00:53,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:00:53,059 INFO L481 AbstractCegarLoop]: Abstraction has 101 states and 121 transitions. [2018-10-27 09:00:53,059 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-27 09:00:53,059 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 121 transitions. [2018-10-27 09:00:53,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-10-27 09:00:53,061 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:00:53,061 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 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-10-27 09:00:53,061 INFO L424 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:00:53,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:00:53,061 INFO L82 PathProgramCache]: Analyzing trace with hash 982712326, now seen corresponding path program 2 times [2018-10-27 09:00:53,062 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:00:53,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:00:53,063 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 09:00:53,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:00:53,063 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:00:53,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:00:53,128 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-27 09:00:53,129 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:00:53,129 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 09:00:53,129 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 09:00:53,129 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 09:00:53,129 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:00:53,129 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 09:00:53,137 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 09:00:53,138 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-27 09:00:53,168 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-10-27 09:00:53,168 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 09:00:53,172 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 09:00:53,278 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-10-27 09:00:53,337 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:00:53,355 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-10-27 09:00:53,356 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 09:00:53,432 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:00:53,443 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:00:53,444 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:40 [2018-10-27 09:00:53,600 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:00:53,601 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 52 treesize of output 54 [2018-10-27 09:00:53,603 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:00:53,606 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:00:53,607 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 61 [2018-10-27 09:00:53,609 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 09:00:53,652 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:00:53,665 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-10-27 09:00:53,665 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:63, output treesize:35 [2018-10-27 09:00:53,735 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2018-10-27 09:00:53,738 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:00:53,740 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:00:53,742 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:00:53,742 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:00:53,744 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:00:53,745 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2018-10-27 09:00:53,746 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 09:00:53,756 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:00:53,763 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:00:53,763 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:5 [2018-10-27 09:00:53,818 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-27 09:00:53,818 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 09:00:55,922 WARN L832 $PredicateComparison]: unable to prove that (forall ((|v_main_write~int_#value_9| Int)) (or (< c_main_~key~0 |v_main_write~int_#value_9|) (let ((.cse0 (store (select |c_#memory_int| |c_main_~#v~0.base|) (+ (* 4 c_main_~i~0) |c_main_~#v~0.offset| 4) |v_main_write~int_#value_9|))) (< (select .cse0 |c_main_~#v~0.offset|) (+ (select .cse0 (+ |c_main_~#v~0.offset| 4)) 1))))) is different from false [2018-10-27 09:00:57,988 WARN L179 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 22 [2018-10-27 09:00:58,172 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 70 treesize of output 62 [2018-10-27 09:00:58,198 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:00:58,216 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 62 treesize of output 69 [2018-10-27 09:00:58,381 WARN L179 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 29 [2018-10-27 09:00:58,385 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:00:58,386 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:00:58,387 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:00:58,389 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:00:58,389 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:00:58,389 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:00:58,403 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 50 treesize of output 78 [2018-10-27 09:00:58,405 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-10-27 09:00:58,420 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-27 09:00:58,420 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 09:00:58,422 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:00:58,423 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:00:58,423 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:00:58,425 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:00:58,426 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:00:58,426 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:00:58,440 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 48 treesize of output 78 [2018-10-27 09:00:58,442 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-10-27 09:00:58,468 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:00:58,474 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:00:58,483 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:00:58,483 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:75, output treesize:16 [2018-10-27 09:00:58,523 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 1 not checked. [2018-10-27 09:00:58,544 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 09:00:58,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 15, 14] total 31 [2018-10-27 09:00:58,544 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 09:00:58,545 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-27 09:00:58,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-27 09:00:58,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=762, Unknown=1, NotChecked=56, Total=930 [2018-10-27 09:00:58,546 INFO L87 Difference]: Start difference. First operand 101 states and 121 transitions. Second operand 19 states. [2018-10-27 09:01:00,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:01:00,044 INFO L93 Difference]: Finished difference Result 213 states and 259 transitions. [2018-10-27 09:01:00,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-27 09:01:00,047 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 35 [2018-10-27 09:01:00,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:01:00,049 INFO L225 Difference]: With dead ends: 213 [2018-10-27 09:01:00,049 INFO L226 Difference]: Without dead ends: 134 [2018-10-27 09:01:00,051 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 570 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=387, Invalid=2372, Unknown=1, NotChecked=102, Total=2862 [2018-10-27 09:01:00,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-10-27 09:01:00,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 74. [2018-10-27 09:01:00,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-10-27 09:01:00,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 82 transitions. [2018-10-27 09:01:00,063 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 82 transitions. Word has length 35 [2018-10-27 09:01:00,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:01:00,063 INFO L481 AbstractCegarLoop]: Abstraction has 74 states and 82 transitions. [2018-10-27 09:01:00,063 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-27 09:01:00,064 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 82 transitions. [2018-10-27 09:01:00,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-27 09:01:00,065 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:01:00,065 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 09:01:00,065 INFO L424 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:01:00,065 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:01:00,065 INFO L82 PathProgramCache]: Analyzing trace with hash -289889213, now seen corresponding path program 1 times [2018-10-27 09:01:00,066 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:01:00,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:01:00,066 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 09:01:00,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:01:00,067 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:01:00,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:01:00,598 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:01:00,598 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:01:00,598 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 09:01:00,598 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 38 with the following transitions: [2018-10-27 09:01:00,599 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [18], [20], [23], [29], [31], [34], [38], [42], [44], [48], [52], [57], [67], [70], [72], [78], [79], [80], [82] [2018-10-27 09:01:00,601 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-27 09:01:00,601 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 09:01:00,681 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 09:01:00,681 INFO L272 AbstractInterpreter]: Visited 25 different actions 68 times. Merged at 15 different actions 33 times. Never widened. Found 4 fixpoints after 4 different actions. Largest state had 39 variables. [2018-10-27 09:01:00,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:01:00,710 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 09:01:00,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:01:00,710 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 09:01:00,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:01:00,724 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 09:01:00,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:01:00,769 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 09:01:01,089 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-10-27 09:01:01,099 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:01:01,101 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-10-27 09:01:01,102 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 09:01:01,110 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:01:01,120 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-10-27 09:01:01,121 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:27 [2018-10-27 09:01:01,555 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-10-27 09:01:01,594 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:01:01,603 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:01:01,624 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:01:01,629 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:01:01,713 INFO L303 Elim1Store]: Index analysis took 156 ms [2018-10-27 09:01:01,714 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-10-27 09:01:01,715 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 09:01:01,839 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:01:01,938 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:01:01,938 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:43, output treesize:3 [2018-10-27 09:01:02,146 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:01:02,147 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 09:01:02,283 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-10-27 09:01:02,340 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:01:02,342 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:01:02,342 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:01:02,351 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 35 treesize of output 48 [2018-10-27 09:01:02,353 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-10-27 09:01:02,357 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:01:02,359 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-10-27 09:01:02,359 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 09:01:02,371 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:01:02,373 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:01:02,373 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:01:02,381 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 33 treesize of output 50 [2018-10-27 09:01:02,383 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-10-27 09:01:02,396 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:01:02,399 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:01:02,399 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:45, output treesize:8 [2018-10-27 09:01:02,755 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:01:02,793 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 09:01:02,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 30 [2018-10-27 09:01:02,794 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 09:01:02,794 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-27 09:01:02,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-27 09:01:02,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=748, Unknown=0, NotChecked=0, Total=870 [2018-10-27 09:01:02,796 INFO L87 Difference]: Start difference. First operand 74 states and 82 transitions. Second operand 23 states. [2018-10-27 09:01:03,474 WARN L179 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 17 [2018-10-27 09:01:04,322 WARN L179 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 19 [2018-10-27 09:01:05,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:01:05,188 INFO L93 Difference]: Finished difference Result 190 states and 222 transitions. [2018-10-27 09:01:05,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-27 09:01:05,189 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 37 [2018-10-27 09:01:05,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:01:05,191 INFO L225 Difference]: With dead ends: 190 [2018-10-27 09:01:05,191 INFO L226 Difference]: Without dead ends: 147 [2018-10-27 09:01:05,192 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 54 SyntacticMatches, 6 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 807 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=558, Invalid=2304, Unknown=0, NotChecked=0, Total=2862 [2018-10-27 09:01:05,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-10-27 09:01:05,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 78. [2018-10-27 09:01:05,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-10-27 09:01:05,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 87 transitions. [2018-10-27 09:01:05,203 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 87 transitions. Word has length 37 [2018-10-27 09:01:05,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:01:05,204 INFO L481 AbstractCegarLoop]: Abstraction has 78 states and 87 transitions. [2018-10-27 09:01:05,204 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-27 09:01:05,204 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 87 transitions. [2018-10-27 09:01:05,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-27 09:01:05,205 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:01:05,205 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 09:01:05,206 INFO L424 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:01:05,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:01:05,206 INFO L82 PathProgramCache]: Analyzing trace with hash 1634323973, now seen corresponding path program 3 times [2018-10-27 09:01:05,206 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:01:05,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:01:05,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:01:05,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:01:05,207 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:01:05,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:01:05,707 WARN L179 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 11 [2018-10-27 09:01:06,755 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:01:06,755 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:01:06,755 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 09:01:06,755 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 09:01:06,755 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 09:01:06,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:01:06,756 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 09:01:06,763 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-27 09:01:06,764 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-27 09:01:06,791 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-27 09:01:06,791 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 09:01:06,795 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 09:01:06,922 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 25 treesize of output 21 [2018-10-27 09:01:06,925 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-10-27 09:01:06,925 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 09:01:06,949 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:01:06,963 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-10-27 09:01:06,966 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-10-27 09:01:06,966 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 09:01:06,968 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:01:06,980 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:01:06,981 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:53, output treesize:27 [2018-10-27 09:01:07,121 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 25 [2018-10-27 09:01:07,124 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:01:07,126 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:01:07,127 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2018-10-27 09:01:07,127 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 09:01:07,137 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:01:07,153 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-10-27 09:01:07,153 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:49, output treesize:42 [2018-10-27 09:01:07,208 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2018-10-27 09:01:07,211 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:01:07,213 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:01:07,214 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:01:07,215 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:01:07,219 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 22 treesize of output 61 [2018-10-27 09:01:07,220 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 09:01:07,229 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:01:07,350 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:01:07,351 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:21 [2018-10-27 09:01:07,462 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-10-27 09:01:07,499 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:01:07,500 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-10-27 09:01:07,501 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 09:01:07,523 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:01:07,546 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:01:07,547 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:5 [2018-10-27 09:01:07,805 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:01:07,805 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 09:01:26,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 51 treesize of output 47 [2018-10-27 09:01:26,428 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 43 [2018-10-27 09:01:26,453 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:01:26,455 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 43 treesize of output 51 [2018-10-27 09:01:26,548 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:01:26,550 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:01:26,556 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:01:26,558 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:01:26,594 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 86 [2018-10-27 09:01:26,597 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 6 xjuncts. [2018-10-27 09:01:26,611 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:01:26,613 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:01:26,628 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 1 case distinctions, treesize of input 35 treesize of output 46 [2018-10-27 09:01:26,630 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-10-27 09:01:26,635 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:01:26,637 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:01:26,644 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:01:26,646 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:01:26,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 2 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 85 [2018-10-27 09:01:26,753 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 6 xjuncts. [2018-10-27 09:01:26,756 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:01:26,758 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:01:26,765 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:01:26,767 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:01:26,800 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 83 [2018-10-27 09:01:26,804 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 6 xjuncts. [2018-10-27 09:01:26,810 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:01:26,812 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:01:26,822 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:01:26,822 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:01:26,860 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 85 [2018-10-27 09:01:26,864 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 6 xjuncts. [2018-10-27 09:01:26,890 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:01:26,903 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:01:26,967 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:01:26,968 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:01:26,976 INFO L303 Elim1Store]: Index analysis took 110 ms [2018-10-27 09:01:26,992 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 3 case distinctions, treesize of input 41 treesize of output 83 [2018-10-27 09:01:26,995 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 6 xjuncts. [2018-10-27 09:01:26,999 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:01:27,015 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 38 treesize of output 52 [2018-10-27 09:01:27,017 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 4 xjuncts. [2018-10-27 09:01:27,215 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-10-27 09:01:27,281 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-10-27 09:01:27,365 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-10-27 09:01:27,443 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-10-27 09:01:27,444 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:77, output treesize:104 [2018-10-27 09:01:36,520 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 14 refuted. 4 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:01:36,542 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 09:01:36,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 42 [2018-10-27 09:01:36,542 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 09:01:36,542 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-27 09:01:36,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-27 09:01:36,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=1491, Unknown=15, NotChecked=0, Total=1722 [2018-10-27 09:01:36,544 INFO L87 Difference]: Start difference. First operand 78 states and 87 transitions. Second operand 26 states. [2018-10-27 09:01:37,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:01:37,479 INFO L93 Difference]: Finished difference Result 119 states and 135 transitions. [2018-10-27 09:01:37,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-27 09:01:37,479 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 37 [2018-10-27 09:01:37,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:01:37,480 INFO L225 Difference]: With dead ends: 119 [2018-10-27 09:01:37,480 INFO L226 Difference]: Without dead ends: 117 [2018-10-27 09:01:37,481 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 46 SyntacticMatches, 7 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 836 ImplicationChecksByTransitivity, 30.0s TimeCoverageRelationStatistics Valid=309, Invalid=2028, Unknown=15, NotChecked=0, Total=2352 [2018-10-27 09:01:37,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-10-27 09:01:37,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 70. [2018-10-27 09:01:37,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-10-27 09:01:37,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 78 transitions. [2018-10-27 09:01:37,492 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 78 transitions. Word has length 37 [2018-10-27 09:01:37,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:01:37,493 INFO L481 AbstractCegarLoop]: Abstraction has 70 states and 78 transitions. [2018-10-27 09:01:37,493 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-27 09:01:37,493 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 78 transitions. [2018-10-27 09:01:37,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-27 09:01:37,494 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:01:37,495 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] [2018-10-27 09:01:37,495 INFO L424 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:01:37,495 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:01:37,495 INFO L82 PathProgramCache]: Analyzing trace with hash -411213956, now seen corresponding path program 2 times [2018-10-27 09:01:37,495 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:01:37,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:01:37,496 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 09:01:37,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:01:37,496 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:01:37,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:01:37,876 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:01:37,876 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:01:37,876 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 09:01:37,876 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 09:01:37,877 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 09:01:37,877 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:01:37,877 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 09:01:37,885 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 09:01:37,886 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-27 09:01:37,921 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-10-27 09:01:37,922 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 09:01:37,925 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 09:01:38,119 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-10-27 09:01:38,128 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:01:38,129 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-10-27 09:01:38,130 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 09:01:38,168 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:01:38,176 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:01:38,177 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:27 [2018-10-27 09:01:38,430 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-10-27 09:01:38,433 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-10-27 09:01:38,433 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 09:01:38,435 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:01:38,436 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:01:38,437 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-10-27 09:01:38,481 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:01:38,481 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 09:01:38,952 WARN L179 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-10-27 09:01:39,012 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 45 treesize of output 39 [2018-10-27 09:01:39,061 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:01:39,069 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-10-27 09:01:39,070 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 09:01:39,072 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:01:39,072 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:01:39,074 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:01:39,081 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 37 treesize of output 52 [2018-10-27 09:01:39,082 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-10-27 09:01:39,085 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:01:39,086 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:01:39,087 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:01:39,095 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 33 treesize of output 52 [2018-10-27 09:01:39,096 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-10-27 09:01:39,111 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:01:39,120 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-10-27 09:01:39,121 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:61, output treesize:22 [2018-10-27 09:01:41,383 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:01:41,407 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 09:01:41,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19, 16] total 43 [2018-10-27 09:01:41,407 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 09:01:41,408 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-27 09:01:41,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-27 09:01:41,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=1574, Unknown=1, NotChecked=0, Total=1806 [2018-10-27 09:01:41,409 INFO L87 Difference]: Start difference. First operand 70 states and 78 transitions. Second operand 32 states. [2018-10-27 09:01:54,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:01:54,636 INFO L93 Difference]: Finished difference Result 136 states and 153 transitions. [2018-10-27 09:01:54,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-27 09:01:54,636 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 40 [2018-10-27 09:01:54,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:01:54,638 INFO L225 Difference]: With dead ends: 136 [2018-10-27 09:01:54,638 INFO L226 Difference]: Without dead ends: 134 [2018-10-27 09:01:54,639 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 53 SyntacticMatches, 3 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 939 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=400, Invalid=2679, Unknown=1, NotChecked=0, Total=3080 [2018-10-27 09:01:54,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-10-27 09:01:54,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 85. [2018-10-27 09:01:54,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-10-27 09:01:54,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 95 transitions. [2018-10-27 09:01:54,652 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 95 transitions. Word has length 40 [2018-10-27 09:01:54,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:01:54,653 INFO L481 AbstractCegarLoop]: Abstraction has 85 states and 95 transitions. [2018-10-27 09:01:54,653 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-27 09:01:54,653 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 95 transitions. [2018-10-27 09:01:54,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-27 09:01:54,654 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:01:54,654 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 09:01:54,654 INFO L424 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:01:54,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:01:54,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1027358850, now seen corresponding path program 3 times [2018-10-27 09:01:54,655 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:01:54,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:01:54,656 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 09:01:54,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:01:54,656 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:01:54,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:01:54,993 WARN L179 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 8 [2018-10-27 09:01:55,286 WARN L179 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 10 [2018-10-27 09:01:55,768 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 7 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:01:55,768 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:01:55,768 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 09:01:55,768 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 09:01:55,768 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 09:01:55,769 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:01:55,769 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 09:01:55,778 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-27 09:01:55,778 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-27 09:01:55,812 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-27 09:01:55,812 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 09:01:55,816 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 09:01:55,928 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-10-27 09:01:55,931 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:01:55,933 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-10-27 09:01:55,934 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 09:01:55,941 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:01:55,948 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:01:55,949 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:24 [2018-10-27 09:01:56,019 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2018-10-27 09:01:56,024 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:01:56,025 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:01:56,025 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:01:56,029 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 22 treesize of output 49 [2018-10-27 09:01:56,030 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 09:01:56,037 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:01:56,045 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:01:56,045 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:17 [2018-10-27 09:01:56,091 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 25 treesize of output 18 [2018-10-27 09:01:56,093 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:01:56,094 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:01:56,095 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:01:56,100 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 18 treesize of output 37 [2018-10-27 09:01:56,101 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 09:01:56,110 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:01:56,120 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:01:56,120 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:36, output treesize:13 [2018-10-27 09:01:56,226 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 30 treesize of output 22 [2018-10-27 09:01:56,230 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:01:56,233 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 22 treesize of output 16 [2018-10-27 09:01:56,233 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 09:01:56,244 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:01:56,246 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:01:56,246 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:3 [2018-10-27 09:01:56,264 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:01:56,265 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 09:03:01,961 WARN L179 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 35 [2018-10-27 09:03:01,985 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 63 treesize of output 57 [2018-10-27 09:03:01,988 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:01,990 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 57 treesize of output 64 [2018-10-27 09:03:01,993 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:02,023 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 4 case distinctions, treesize of input 52 treesize of output 92 [2018-10-27 09:03:02,474 WARN L179 SmtUtils]: Spent 446.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 79 [2018-10-27 09:03:02,493 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:02,497 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:02,498 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:02,531 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 95 [2018-10-27 09:03:02,537 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 9 xjuncts. [2018-10-27 09:03:02,541 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:02,541 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:02,550 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 43 treesize of output 56 [2018-10-27 09:03:02,551 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-10-27 09:03:02,553 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:02,559 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:02,560 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:02,592 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 46 treesize of output 95 [2018-10-27 09:03:02,598 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 9 xjuncts. [2018-10-27 09:03:02,600 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:02,600 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:02,601 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:02,605 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 40 treesize of output 50 [2018-10-27 09:03:02,606 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-10-27 09:03:02,608 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:02,615 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:02,615 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:02,647 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 4 case distinctions, treesize of input 46 treesize of output 97 [2018-10-27 09:03:02,653 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 9 xjuncts. [2018-10-27 09:03:02,666 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:02,668 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:02,668 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:02,672 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:02,672 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:02,673 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:02,684 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 47 treesize of output 83 [2018-10-27 09:03:02,685 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-10-27 09:03:02,687 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:02,693 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:02,694 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:02,728 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 97 [2018-10-27 09:03:02,733 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 9 xjuncts. [2018-10-27 09:03:03,168 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:03,172 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:03,175 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:03,180 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:03,181 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:03,232 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 142 [2018-10-27 09:03:03,233 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-10-27 09:03:03,249 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 39 xjuncts. [2018-10-27 09:03:03,270 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:03,310 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 5 case distinctions, treesize of input 43 treesize of output 98 [2018-10-27 09:03:03,316 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 32 xjuncts. [2018-10-27 09:03:03,319 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:03,325 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:03,359 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 4 case distinctions, treesize of input 43 treesize of output 97 [2018-10-27 09:03:03,364 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 16 xjuncts. [2018-10-27 09:03:04,559 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:04,565 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:04,566 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:04,594 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 54 treesize of output 99 [2018-10-27 09:03:04,598 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 9 xjuncts. [2018-10-27 09:03:04,602 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:04,617 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 59 [2018-10-27 09:03:04,619 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 4 xjuncts. [2018-10-27 09:03:04,621 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:04,639 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 51 [2018-10-27 09:03:04,640 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 4 xjuncts. [2018-10-27 09:03:04,645 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:04,650 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:04,651 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:04,679 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 97 [2018-10-27 09:03:04,684 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 9 xjuncts. [2018-10-27 09:03:05,027 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 13 xjuncts. [2018-10-27 09:03:05,133 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 10 xjuncts. [2018-10-27 09:03:05,231 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 10 xjuncts. [2018-10-27 09:03:05,465 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 10 xjuncts. [2018-10-27 09:03:05,465 INFO L202 ElimStorePlain]: Needed 18 recursive calls to eliminate 8 variables, input treesize:76, output treesize:145 [2018-10-27 09:03:05,551 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 25 refuted. 5 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:03:05,572 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 09:03:05,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 17] total 40 [2018-10-27 09:03:05,573 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 09:03:05,573 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-27 09:03:05,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-27 09:03:05,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=1334, Unknown=31, NotChecked=0, Total=1560 [2018-10-27 09:03:05,574 INFO L87 Difference]: Start difference. First operand 85 states and 95 transitions. Second operand 28 states. [2018-10-27 09:03:06,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:03:06,844 INFO L93 Difference]: Finished difference Result 202 states and 233 transitions. [2018-10-27 09:03:06,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-27 09:03:06,844 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 39 [2018-10-27 09:03:06,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:03:06,845 INFO L225 Difference]: With dead ends: 202 [2018-10-27 09:03:06,845 INFO L226 Difference]: Without dead ends: 157 [2018-10-27 09:03:06,847 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 53 SyntacticMatches, 5 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 908 ImplicationChecksByTransitivity, 67.6s TimeCoverageRelationStatistics Valid=419, Invalid=2520, Unknown=31, NotChecked=0, Total=2970 [2018-10-27 09:03:06,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-10-27 09:03:06,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 106. [2018-10-27 09:03:06,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-10-27 09:03:06,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 120 transitions. [2018-10-27 09:03:06,863 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 120 transitions. Word has length 39 [2018-10-27 09:03:06,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:03:06,863 INFO L481 AbstractCegarLoop]: Abstraction has 106 states and 120 transitions. [2018-10-27 09:03:06,863 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-27 09:03:06,863 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 120 transitions. [2018-10-27 09:03:06,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-27 09:03:06,864 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:03:06,864 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 09:03:06,865 INFO L424 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:03:06,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:03:06,865 INFO L82 PathProgramCache]: Analyzing trace with hash -1389059306, now seen corresponding path program 1 times [2018-10-27 09:03:06,865 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:03:06,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:03:06,866 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 09:03:06,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:03:06,866 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:03:06,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:03:07,763 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:03:07,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:03:07,763 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 09:03:07,763 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 46 with the following transitions: [2018-10-27 09:03:07,764 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [18], [20], [23], [29], [31], [36], [38], [42], [44], [48], [52], [57], [67], [70], [72], [78], [79], [80], [82] [2018-10-27 09:03:07,765 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-27 09:03:07,765 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 09:03:07,841 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 09:03:07,841 INFO L272 AbstractInterpreter]: Visited 25 different actions 80 times. Merged at 14 different actions 40 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 38 variables. [2018-10-27 09:03:07,879 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:03:07,879 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 09:03:07,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:03:07,879 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 09:03:07,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:03:07,892 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 09:03:07,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:03:07,935 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 09:03:08,108 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-10-27 09:03:08,111 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:03:08,112 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-10-27 09:03:08,113 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 09:03:08,119 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:03:08,129 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-10-27 09:03:08,130 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:32 [2018-10-27 09:03:08,281 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-10-27 09:03:08,284 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:03:08,285 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:03:08,286 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:03:08,291 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-10-27 09:03:08,291 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 09:03:08,303 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:03:08,315 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-10-27 09:03:08,316 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:43, output treesize:27 [2018-10-27 09:03:08,426 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-10-27 09:03:08,428 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:03:08,430 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:03:08,431 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:03:08,437 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-10-27 09:03:08,438 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 09:03:08,457 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:03:08,472 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 09:03:08,473 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:49, output treesize:27 [2018-10-27 09:03:08,509 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-10-27 09:03:08,512 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:08,513 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:03:08,513 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:03:08,514 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:03:08,520 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 49 [2018-10-27 09:03:08,520 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 09:03:08,527 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:03:08,533 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:03:08,533 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:43, output treesize:3 [2018-10-27 09:03:08,556 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 4 proven. 35 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-27 09:03:08,556 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 09:04:01,677 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 55 treesize of output 49 [2018-10-27 09:04:01,679 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:01,681 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 49 treesize of output 56 [2018-10-27 09:04:01,684 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:01,716 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 4 case distinctions, treesize of input 44 treesize of output 79 [2018-10-27 09:04:01,964 WARN L179 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 81 [2018-10-27 09:04:01,969 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:01,971 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:01,973 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:01,979 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:01,979 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:02,029 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 54 treesize of output 126 [2018-10-27 09:04:02,030 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-10-27 09:04:02,040 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 39 xjuncts. [2018-10-27 09:04:02,042 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-27 09:04:02,042 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-27 09:04:02,044 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:02,047 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:02,051 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:02,054 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:02,055 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:02,105 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 46 treesize of output 124 [2018-10-27 09:04:02,106 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-10-27 09:04:02,116 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 39 xjuncts. [2018-10-27 09:04:02,131 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-27 09:04:02,131 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-10-27 09:04:02,138 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:02,140 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:02,142 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:02,148 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:02,148 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:02,198 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 52 treesize of output 126 [2018-10-27 09:04:02,198 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-10-27 09:04:02,209 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 39 xjuncts. [2018-10-27 09:04:02,221 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-27 09:04:02,221 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-10-27 09:04:02,224 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:02,226 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:02,228 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:02,234 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:02,234 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:02,283 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 124 [2018-10-27 09:04:02,283 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-10-27 09:04:02,293 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 39 xjuncts. [2018-10-27 09:04:03,481 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:03,487 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:03,488 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:03,519 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 92 [2018-10-27 09:04:03,523 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 9 xjuncts. [2018-10-27 09:04:03,697 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:03,704 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:03,704 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:03,739 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 97 [2018-10-27 09:04:03,744 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 9 xjuncts. [2018-10-27 09:04:03,830 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-10-27 09:04:03,870 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-10-27 09:04:03,902 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-10-27 09:04:03,950 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-10-27 09:04:03,951 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 7 variables, input treesize:76, output treesize:57 [2018-10-27 09:04:04,088 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 8 proven. 30 refuted. 4 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:04:04,109 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 09:04:04,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 18] total 46 [2018-10-27 09:04:04,110 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 09:04:04,110 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-27 09:04:04,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-27 09:04:04,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=254, Invalid=1789, Unknown=27, NotChecked=0, Total=2070 [2018-10-27 09:04:04,111 INFO L87 Difference]: Start difference. First operand 106 states and 120 transitions. Second operand 31 states. [2018-10-27 09:04:06,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:04:06,273 INFO L93 Difference]: Finished difference Result 278 states and 325 transitions. [2018-10-27 09:04:06,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-27 09:04:06,274 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 45 [2018-10-27 09:04:06,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:04:06,277 INFO L225 Difference]: With dead ends: 278 [2018-10-27 09:04:06,277 INFO L226 Difference]: Without dead ends: 233 [2018-10-27 09:04:06,279 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 63 SyntacticMatches, 3 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 1193 ImplicationChecksByTransitivity, 55.6s TimeCoverageRelationStatistics Valid=605, Invalid=3790, Unknown=27, NotChecked=0, Total=4422 [2018-10-27 09:04:06,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-10-27 09:04:06,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 140. [2018-10-27 09:04:06,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-10-27 09:04:06,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 164 transitions. [2018-10-27 09:04:06,301 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 164 transitions. Word has length 45 [2018-10-27 09:04:06,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:04:06,302 INFO L481 AbstractCegarLoop]: Abstraction has 140 states and 164 transitions. [2018-10-27 09:04:06,302 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-27 09:04:06,302 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 164 transitions. [2018-10-27 09:04:06,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-10-27 09:04:06,303 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:04:06,303 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2018-10-27 09:04:06,303 INFO L424 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:04:06,303 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:04:06,304 INFO L82 PathProgramCache]: Analyzing trace with hash -1009376150, now seen corresponding path program 1 times [2018-10-27 09:04:06,304 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:04:06,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:04:06,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:04:06,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:04:06,305 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:04:06,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:04:06,664 WARN L179 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 8 [2018-10-27 09:04:07,172 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:04:07,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:04:07,172 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 09:04:07,172 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 47 with the following transitions: [2018-10-27 09:04:07,173 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [18], [20], [23], [29], [31], [34], [38], [42], [44], [48], [52], [57], [59], [61], [67], [70], [72], [75], [77], [78], [79], [80], [82], [83] [2018-10-27 09:04:07,174 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-27 09:04:07,175 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 09:04:07,263 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 09:04:07,264 INFO L272 AbstractInterpreter]: Visited 30 different actions 105 times. Merged at 18 different actions 47 times. Never widened. Found 7 fixpoints after 5 different actions. Largest state had 40 variables. [2018-10-27 09:04:07,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:04:07,301 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 09:04:07,301 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:04:07,301 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 09:04:07,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:04:07,317 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 09:04:07,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:04:07,355 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 09:04:07,463 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-10-27 09:04:07,465 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:04:07,467 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-10-27 09:04:07,467 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 09:04:07,475 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:04:07,486 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:04:07,487 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:49, output treesize:42 [2018-10-27 09:04:07,909 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:04:07,910 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-10-27 09:04:07,913 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:04:07,918 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:04:07,918 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:07,921 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:04:07,922 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-10-27 09:04:07,923 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 09:04:07,935 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:04:07,948 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-10-27 09:04:07,948 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:66, output treesize:37 [2018-10-27 09:04:18,126 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 38 treesize of output 30 [2018-10-27 09:04:18,128 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:04:18,129 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:04:18,129 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:18,130 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:04:18,130 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 43 [2018-10-27 09:04:18,131 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 09:04:18,135 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:04:18,161 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:04:18,162 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:5 [2018-10-27 09:04:18,255 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:04:18,256 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 09:04:42,037 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-10-27 09:04:42,039 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:42,041 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-10-27 09:04:42,115 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:42,116 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:42,117 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:42,117 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:42,118 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:42,118 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:42,119 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:42,125 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:42,126 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:42,129 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-10-27 09:04:42,130 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 09:04:42,133 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:42,134 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:42,134 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:42,135 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:42,135 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:42,136 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:42,136 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:42,141 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:42,142 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:42,144 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-10-27 09:04:42,145 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 09:04:42,148 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:42,148 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:42,148 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:42,153 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-10-27 09:04:42,154 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-27 09:04:42,156 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:42,156 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:42,157 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:42,158 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:42,159 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:42,160 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:42,173 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-10-27 09:04:42,175 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-10-27 09:04:42,177 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:42,177 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:42,178 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:42,178 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:42,179 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:42,179 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:42,180 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:42,188 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-10-27 09:04:42,189 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-10-27 09:04:42,191 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:42,192 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:42,192 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:42,193 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:42,193 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:42,196 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-10-27 09:04:42,197 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-27 09:04:42,215 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:42,215 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:42,216 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:42,216 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:42,217 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:42,217 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:42,217 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:42,223 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:42,224 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:42,225 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-10-27 09:04:42,226 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-10-27 09:04:42,272 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 09:04:42,287 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 09:04:42,308 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-27 09:04:42,308 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:82, output treesize:27 [2018-10-27 09:04:46,491 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:04:46,512 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 09:04:46,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 17] total 46 [2018-10-27 09:04:46,512 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 09:04:46,515 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-27 09:04:46,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-27 09:04:46,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=1843, Unknown=18, NotChecked=0, Total=2070 [2018-10-27 09:04:46,516 INFO L87 Difference]: Start difference. First operand 140 states and 164 transitions. Second operand 33 states. Received shutdown request... [2018-10-27 09:05:02,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-27 09:05:02,993 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-27 09:05:02,999 WARN L205 ceAbstractionStarter]: Timeout [2018-10-27 09:05:02,999 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.10 09:05:02 BoogieIcfgContainer [2018-10-27 09:05:02,999 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-27 09:05:03,000 INFO L168 Benchmark]: Toolchain (without parser) took 274237.47 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 941.1 MB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -586.0 MB). Peak memory consumption was 355.1 MB. Max. memory is 7.1 GB. [2018-10-27 09:05:03,001 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-27 09:05:03,001 INFO L168 Benchmark]: CACSL2BoogieTranslator took 305.94 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-10-27 09:05:03,001 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.52 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-27 09:05:03,001 INFO L168 Benchmark]: Boogie Preprocessor took 33.01 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-27 09:05:03,002 INFO L168 Benchmark]: RCFGBuilder took 623.26 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 758.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -792.4 MB). Peak memory consumption was 15.4 MB. Max. memory is 7.1 GB. [2018-10-27 09:05:03,002 INFO L168 Benchmark]: TraceAbstraction took 273218.64 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 182.5 MB). Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 182.5 MB). Peak memory consumption was 364.9 MB. Max. memory is 7.1 GB. [2018-10-27 09:05:03,004 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.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 305.94 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 51.52 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 33.01 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 623.26 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 758.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -792.4 MB). Peak memory consumption was 15.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 273218.64 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 182.5 MB). Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 182.5 MB). Peak memory consumption was 364.9 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 constructing difference of abstraction (140states) and FLOYD_HOARE automaton (currently 11 states, 33 states before enhancement),while ReachableStatesComputation was computing reachable states (38 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 33 locations, 1 error locations. TIMEOUT Result, 273.1s OverallTime, 14 OverallIterations, 4 TraceHistogramMax, 42.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 468 SDtfs, 1233 SDslu, 3389 SDs, 0 SdLazy, 4005 SolverSat, 745 SolverUnsat, 12 SolverUnknown, 0 SolverNotchecked, 29.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1109 GetRequests, 544 SyntacticMatches, 53 SemanticMatches, 512 ConstructedPredicates, 1 IntricatePredicates, 3 DeprecatedPredicates, 7404 ImplicationChecksByTransitivity, 226.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=140occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.3s AbstIntTime, 6 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 569 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 228.1s InterpolantComputationTime, 840 NumberOfCodeBlocks, 834 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 1198 ConstructedInterpolants, 181 QuantifiedInterpolants, 666367 SizeOfPredicates, 329 NumberOfNonLiveVariables, 1866 ConjunctsInSsa, 541 ConjunctsInUnsatCore, 36 InterpolantComputations, 3 PerfectInterpolantSequences, 99/593 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown