java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT.epf -i ../../../trunk/examples/svcomp/loops/insertion_sort_false-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 16:30:46,782 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 16:30:46,785 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 16:30:46,805 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 16:30:46,807 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 16:30:46,808 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 16:30:46,810 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 16:30:46,813 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 16:30:46,816 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 16:30:46,818 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 16:30:46,820 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 16:30:46,820 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 16:30:46,821 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 16:30:46,822 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 16:30:46,827 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 16:30:46,829 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 16:30:46,831 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 16:30:46,839 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 16:30:46,845 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 16:30:46,848 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 16:30:46,850 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 16:30:46,851 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 16:30:46,858 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 16:30:46,858 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 16:30:46,858 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 16:30:46,859 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 16:30:46,860 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 16:30:46,861 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 16:30:46,862 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 16:30:46,863 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 16:30:46,863 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 16:30:46,864 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 16:30:46,864 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 16:30:46,864 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 16:30:46,865 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 16:30:46,866 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 16:30:46,866 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT.epf [2018-11-07 16:30:46,881 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 16:30:46,882 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 16:30:46,883 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 16:30:46,883 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 16:30:46,883 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 16:30:46,883 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 16:30:46,884 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 16:30:46,884 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 16:30:46,884 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 16:30:46,884 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 16:30:46,885 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 16:30:46,885 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 16:30:46,886 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 16:30:46,886 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 16:30:46,886 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 16:30:46,886 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 16:30:46,887 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 16:30:46,887 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 16:30:46,887 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 16:30:46,887 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 16:30:46,888 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 16:30:46,888 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 16:30:46,888 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 16:30:46,888 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 16:30:46,888 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 16:30:46,889 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 16:30:46,889 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 16:30:46,889 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 16:30:46,889 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 16:30:46,890 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 16:30:46,890 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 16:30:46,890 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 16:30:46,890 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 16:30:46,890 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 16:30:46,970 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 16:30:46,989 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 16:30:46,994 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 16:30:46,996 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 16:30:46,997 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 16:30:46,998 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/insertion_sort_false-unreach-call_true-termination.i [2018-11-07 16:30:47,071 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70767e889/c1b389db7ef845c797996fa34e9a71a8/FLAG05715b2e3 [2018-11-07 16:30:47,576 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 16:30:47,577 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/insertion_sort_false-unreach-call_true-termination.i [2018-11-07 16:30:47,583 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70767e889/c1b389db7ef845c797996fa34e9a71a8/FLAG05715b2e3 [2018-11-07 16:30:47,598 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70767e889/c1b389db7ef845c797996fa34e9a71a8 [2018-11-07 16:30:47,609 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 16:30:47,611 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 16:30:47,612 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 16:30:47,612 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 16:30:47,615 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 16:30:47,616 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:30:47" (1/1) ... [2018-11-07 16:30:47,619 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ade47ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:30:47, skipping insertion in model container [2018-11-07 16:30:47,619 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:30:47" (1/1) ... [2018-11-07 16:30:47,629 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 16:30:47,651 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 16:30:47,847 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 16:30:47,851 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 16:30:47,884 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 16:30:47,904 INFO L193 MainTranslator]: Completed translation [2018-11-07 16:30:47,905 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:30:47 WrapperNode [2018-11-07 16:30:47,905 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 16:30:47,906 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 16:30:47,906 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 16:30:47,906 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 16:30:47,914 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:30:47" (1/1) ... [2018-11-07 16:30:47,922 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:30:47" (1/1) ... [2018-11-07 16:30:47,928 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 16:30:47,928 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 16:30:47,928 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 16:30:47,928 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 16:30:47,936 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:30:47" (1/1) ... [2018-11-07 16:30:47,936 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:30:47" (1/1) ... [2018-11-07 16:30:47,938 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:30:47" (1/1) ... [2018-11-07 16:30:47,938 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:30:47" (1/1) ... [2018-11-07 16:30:47,945 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:30:47" (1/1) ... [2018-11-07 16:30:47,951 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:30:47" (1/1) ... [2018-11-07 16:30:47,953 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:30:47" (1/1) ... [2018-11-07 16:30:47,956 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 16:30:47,961 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 16:30:47,961 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 16:30:47,961 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 16:30:47,962 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:30:47" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 16:30:48,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-07 16:30:48,086 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 16:30:48,087 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 16:30:48,087 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-07 16:30:48,087 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 16:30:48,087 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 16:30:48,087 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 16:30:48,087 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 16:30:48,088 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-07 16:30:48,088 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-07 16:30:48,088 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-07 16:30:48,088 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-07 16:30:48,543 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 16:30:48,543 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:30:48 BoogieIcfgContainer [2018-11-07 16:30:48,543 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 16:30:48,544 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 16:30:48,545 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 16:30:48,551 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 16:30:48,552 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:30:47" (1/3) ... [2018-11-07 16:30:48,552 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dc4d0da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:30:48, skipping insertion in model container [2018-11-07 16:30:48,553 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:30:47" (2/3) ... [2018-11-07 16:30:48,553 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dc4d0da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:30:48, skipping insertion in model container [2018-11-07 16:30:48,553 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:30:48" (3/3) ... [2018-11-07 16:30:48,555 INFO L112 eAbstractionObserver]: Analyzing ICFG insertion_sort_false-unreach-call_true-termination.i [2018-11-07 16:30:48,563 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 16:30:48,572 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 16:30:48,589 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 16:30:48,624 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 16:30:48,625 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 16:30:48,625 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 16:30:48,625 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 16:30:48,625 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 16:30:48,626 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 16:30:48,626 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 16:30:48,626 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 16:30:48,646 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2018-11-07 16:30:48,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-07 16:30:48,654 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:30:48,655 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:30:48,657 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:30:48,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:30:48,663 INFO L82 PathProgramCache]: Analyzing trace with hash 700728677, now seen corresponding path program 1 times [2018-11-07 16:30:48,665 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:30:48,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:30:48,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:30:48,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:30:48,714 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:30:48,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:30:48,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:30:48,799 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 16:30:48,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-07 16:30:48,799 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 16:30:48,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-07 16:30:48,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-07 16:30:48,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 16:30:48,819 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 2 states. [2018-11-07 16:30:48,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:30:48,843 INFO L93 Difference]: Finished difference Result 84 states and 101 transitions. [2018-11-07 16:30:48,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-07 16:30:48,845 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2018-11-07 16:30:48,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:30:48,854 INFO L225 Difference]: With dead ends: 84 [2018-11-07 16:30:48,854 INFO L226 Difference]: Without dead ends: 39 [2018-11-07 16:30:48,858 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 16:30:48,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-07 16:30:48,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-11-07 16:30:48,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-07 16:30:48,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2018-11-07 16:30:48,917 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 18 [2018-11-07 16:30:48,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:30:48,919 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2018-11-07 16:30:48,919 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-07 16:30:48,919 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-11-07 16:30:48,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-07 16:30:48,922 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:30:48,922 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:30:48,922 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:30:48,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:30:48,924 INFO L82 PathProgramCache]: Analyzing trace with hash -560510619, now seen corresponding path program 1 times [2018-11-07 16:30:48,924 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:30:48,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:30:48,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:30:48,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:30:48,926 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:30:48,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:30:49,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:30:49,290 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 16:30:49,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 16:30:49,295 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 16:30:49,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 16:30:49,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 16:30:49,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-07 16:30:49,297 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 5 states. [2018-11-07 16:30:49,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:30:49,487 INFO L93 Difference]: Finished difference Result 72 states and 80 transitions. [2018-11-07 16:30:49,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 16:30:49,488 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-11-07 16:30:49,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:30:49,489 INFO L225 Difference]: With dead ends: 72 [2018-11-07 16:30:49,489 INFO L226 Difference]: Without dead ends: 56 [2018-11-07 16:30:49,491 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-07 16:30:49,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-07 16:30:49,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 41. [2018-11-07 16:30:49,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-07 16:30:49,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-11-07 16:30:49,501 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 19 [2018-11-07 16:30:49,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:30:49,501 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-11-07 16:30:49,501 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 16:30:49,501 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-11-07 16:30:49,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-07 16:30:49,503 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:30:49,503 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:30:49,503 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:30:49,503 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:30:49,504 INFO L82 PathProgramCache]: Analyzing trace with hash 25713751, now seen corresponding path program 1 times [2018-11-07 16:30:49,504 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:30:49,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:30:49,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:30:49,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:30:49,506 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:30:49,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:30:49,840 WARN L179 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 5 [2018-11-07 16:30:49,849 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:30:49,849 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 16:30:49,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 16:30:49,850 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 16:30:49,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 16:30:49,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 16:30:49,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 16:30:49,851 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 5 states. [2018-11-07 16:30:50,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:30:50,119 INFO L93 Difference]: Finished difference Result 100 states and 114 transitions. [2018-11-07 16:30:50,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-07 16:30:50,120 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-11-07 16:30:50,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:30:50,122 INFO L225 Difference]: With dead ends: 100 [2018-11-07 16:30:50,123 INFO L226 Difference]: Without dead ends: 69 [2018-11-07 16:30:50,124 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-11-07 16:30:50,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-07 16:30:50,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 46. [2018-11-07 16:30:50,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-07 16:30:50,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2018-11-07 16:30:50,132 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 29 [2018-11-07 16:30:50,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:30:50,132 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2018-11-07 16:30:50,132 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 16:30:50,132 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2018-11-07 16:30:50,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-07 16:30:50,134 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:30:50,134 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:30:50,134 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:30:50,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:30:50,135 INFO L82 PathProgramCache]: Analyzing trace with hash 1322865364, now seen corresponding path program 1 times [2018-11-07 16:30:50,135 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:30:50,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:30:50,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:30:50,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:30:50,136 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:30:50,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:30:50,496 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 10 [2018-11-07 16:30:50,714 WARN L179 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 14 [2018-11-07 16:30:51,296 WARN L179 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 19 [2018-11-07 16:30:51,510 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:30:51,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:30:51,511 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:30:51,512 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 32 with the following transitions: [2018-11-07 16:30:51,514 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [6], [7], [11], [14], [16], [17], [18], [22], [24], [27], [28], [29], [35], [51], [53], [57], [61], [66], [67], [68], [80], [83], [85], [91], [92], [93], [95] [2018-11-07 16:30:51,553 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 16:30:51,553 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 16:30:51,679 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 16:30:51,994 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 16:30:51,997 INFO L272 AbstractInterpreter]: Visited 30 different actions 154 times. Merged at 18 different actions 103 times. Widened at 3 different actions 5 times. Found 2 fixpoints after 2 different actions. Largest state had 24 variables. [2018-11-07 16:30:52,031 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:30:52,033 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 16:30:52,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:30:52,033 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:30:52,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:30:52,047 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:30:52,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:30:52,083 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:30:52,586 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-11-07 16:30:52,603 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:30:52,605 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2018-11-07 16:30:52,606 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 16:30:52,614 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:30:52,630 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-07 16:30:52,630 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:30 [2018-11-07 16:30:52,752 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2018-11-07 16:30:52,791 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-07 16:30:52,792 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 16:30:52,818 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:30:52,843 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:30:52,844 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-11-07 16:30:52,910 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:30:52,911 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:30:53,882 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 37 [2018-11-07 16:30:53,954 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:30:53,957 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2018-11-07 16:30:53,958 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 16:30:53,961 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:30:53,962 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:30:53,963 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:30:53,975 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 43 [2018-11-07 16:30:53,977 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-07 16:30:53,981 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:30:53,986 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:30:53,986 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:30:54,000 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 45 [2018-11-07 16:30:54,003 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-07 16:30:54,080 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-07 16:30:54,083 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:30:54,084 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:43, output treesize:7 [2018-11-07 16:30:54,266 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:30:54,293 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:30:54,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 15] total 36 [2018-11-07 16:30:54,293 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:30:54,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-07 16:30:54,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-07 16:30:54,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=1072, Unknown=0, NotChecked=0, Total=1260 [2018-11-07 16:30:54,296 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 24 states. [2018-11-07 16:30:55,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:30:55,487 INFO L93 Difference]: Finished difference Result 139 states and 159 transitions. [2018-11-07 16:30:55,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-07 16:30:55,488 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 31 [2018-11-07 16:30:55,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:30:55,492 INFO L225 Difference]: With dead ends: 139 [2018-11-07 16:30:55,492 INFO L226 Difference]: Without dead ends: 108 [2018-11-07 16:30:55,494 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 40 SyntacticMatches, 4 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 690 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=380, Invalid=1782, Unknown=0, NotChecked=0, Total=2162 [2018-11-07 16:30:55,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-11-07 16:30:55,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 72. [2018-11-07 16:30:55,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-07 16:30:55,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 80 transitions. [2018-11-07 16:30:55,510 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 80 transitions. Word has length 31 [2018-11-07 16:30:55,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:30:55,510 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 80 transitions. [2018-11-07 16:30:55,510 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-07 16:30:55,511 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 80 transitions. [2018-11-07 16:30:55,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-07 16:30:55,512 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:30:55,512 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:30:55,512 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:30:55,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:30:55,513 INFO L82 PathProgramCache]: Analyzing trace with hash 1800151797, now seen corresponding path program 1 times [2018-11-07 16:30:55,513 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:30:55,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:30:55,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:30:55,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:30:55,514 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:30:55,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:30:56,299 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:30:56,299 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:30:56,299 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:30:56,299 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 41 with the following transitions: [2018-11-07 16:30:56,300 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [6], [7], [11], [14], [16], [17], [18], [22], [24], [27], [28], [29], [31], [35], [37], [40], [41], [42], [43], [47], [51], [53], [57], [61], [66], [67], [68], [80], [83], [85], [91], [92], [93], [95] [2018-11-07 16:30:56,303 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 16:30:56,303 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 16:30:56,312 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 16:30:56,555 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 16:30:56,556 INFO L272 AbstractInterpreter]: Visited 37 different actions 235 times. Merged at 25 different actions 154 times. Widened at 4 different actions 6 times. Found 22 fixpoints after 9 different actions. Largest state had 25 variables. [2018-11-07 16:30:56,568 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:30:56,568 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 16:30:56,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:30:56,568 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:30:56,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:30:56,577 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:30:56,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:30:56,622 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:30:56,855 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 34 [2018-11-07 16:30:56,860 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:30:56,861 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 50 [2018-11-07 16:30:56,862 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 16:30:56,871 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:30:56,882 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:30:56,883 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:40 [2018-11-07 16:30:57,306 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:30:57,307 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 52 [2018-11-07 16:30:57,319 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:30:57,321 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:30:57,324 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:30:57,326 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 71 [2018-11-07 16:30:57,327 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 16:30:57,336 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:30:57,352 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-07 16:30:57,352 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:64, output treesize:29 [2018-11-07 16:30:57,699 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 31 [2018-11-07 16:30:57,727 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:30:57,729 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:30:57,729 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:30:57,729 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:30:57,730 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:30:57,731 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 49 [2018-11-07 16:30:57,733 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 16:30:57,776 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:30:57,781 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:30:57,782 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:45, output treesize:5 [2018-11-07 16:30:57,889 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:30:57,889 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:31:05,339 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 64 [2018-11-07 16:31:05,344 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:05,346 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 71 [2018-11-07 16:31:05,479 WARN L179 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2018-11-07 16:31:05,482 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-07 16:31:05,482 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-07 16:31:05,484 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:05,485 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:05,485 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:05,486 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:05,487 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:05,492 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:05,492 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:05,494 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:05,506 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 89 [2018-11-07 16:31:05,509 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-07 16:31:05,532 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:05,545 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:05,558 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:05,576 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:05,585 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:05,607 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 64 [2018-11-07 16:31:05,608 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-07 16:31:05,611 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:05,613 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:05,613 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:05,615 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:05,617 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:05,620 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:05,641 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 85 [2018-11-07 16:31:05,644 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-11-07 16:31:05,655 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:05,655 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:05,658 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:05,658 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:05,662 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:05,662 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:05,691 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 85 [2018-11-07 16:31:05,693 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-11-07 16:31:05,702 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:05,702 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:05,703 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:05,703 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:05,705 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:05,705 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:05,709 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:05,709 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:05,717 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 92 [2018-11-07 16:31:05,720 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-11-07 16:31:05,722 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:05,723 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:05,723 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:05,724 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:05,725 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:05,726 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:05,727 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:05,728 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:05,740 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 89 [2018-11-07 16:31:05,743 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-11-07 16:31:05,786 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:31:05,791 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:31:05,800 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-07 16:31:05,801 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 6 variables, input treesize:80, output treesize:14 [2018-11-07 16:31:07,886 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:31:07,907 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:31:07,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20, 18] total 50 [2018-11-07 16:31:07,908 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:31:07,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-07 16:31:07,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-07 16:31:07,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=280, Invalid=2168, Unknown=2, NotChecked=0, Total=2450 [2018-11-07 16:31:07,910 INFO L87 Difference]: Start difference. First operand 72 states and 80 transitions. Second operand 35 states. [2018-11-07 16:31:09,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:31:09,695 INFO L93 Difference]: Finished difference Result 174 states and 197 transitions. [2018-11-07 16:31:09,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-07 16:31:09,695 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 40 [2018-11-07 16:31:09,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:31:09,699 INFO L225 Difference]: With dead ends: 174 [2018-11-07 16:31:09,699 INFO L226 Difference]: Without dead ends: 117 [2018-11-07 16:31:09,702 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1452 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=529, Invalid=3629, Unknown=2, NotChecked=0, Total=4160 [2018-11-07 16:31:09,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-11-07 16:31:09,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 72. [2018-11-07 16:31:09,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-07 16:31:09,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 78 transitions. [2018-11-07 16:31:09,716 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 78 transitions. Word has length 40 [2018-11-07 16:31:09,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:31:09,716 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 78 transitions. [2018-11-07 16:31:09,717 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-07 16:31:09,721 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2018-11-07 16:31:09,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-07 16:31:09,723 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:31:09,723 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:31:09,723 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:31:09,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:31:09,724 INFO L82 PathProgramCache]: Analyzing trace with hash 549234438, now seen corresponding path program 1 times [2018-11-07 16:31:09,724 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:31:09,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:31:09,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:31:09,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:31:09,725 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:31:09,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:31:09,917 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:31:09,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:31:09,918 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:31:09,918 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 42 with the following transitions: [2018-11-07 16:31:09,919 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [6], [7], [11], [14], [16], [17], [18], [22], [24], [27], [28], [29], [31], [35], [51], [53], [57], [61], [66], [67], [68], [80], [83], [85], [91], [92], [93], [95] [2018-11-07 16:31:09,920 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 16:31:09,921 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 16:31:09,928 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 16:31:10,032 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 16:31:10,032 INFO L272 AbstractInterpreter]: Visited 31 different actions 164 times. Merged at 19 different actions 106 times. Widened at 3 different actions 5 times. Found 4 fixpoints after 3 different actions. Largest state had 24 variables. [2018-11-07 16:31:10,058 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:31:10,058 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 16:31:10,059 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:31:10,059 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:31:10,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:31:10,073 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:31:10,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:31:10,090 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:31:10,095 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:31:10,095 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:31:10,151 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:31:10,171 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:31:10,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 10 [2018-11-07 16:31:10,171 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:31:10,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-07 16:31:10,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-07 16:31:10,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-07 16:31:10,173 INFO L87 Difference]: Start difference. First operand 72 states and 78 transitions. Second operand 8 states. [2018-11-07 16:31:10,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:31:10,347 INFO L93 Difference]: Finished difference Result 128 states and 143 transitions. [2018-11-07 16:31:10,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-07 16:31:10,348 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2018-11-07 16:31:10,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:31:10,350 INFO L225 Difference]: With dead ends: 128 [2018-11-07 16:31:10,350 INFO L226 Difference]: Without dead ends: 97 [2018-11-07 16:31:10,351 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=158, Unknown=0, NotChecked=0, Total=240 [2018-11-07 16:31:10,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-11-07 16:31:10,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 75. [2018-11-07 16:31:10,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-07 16:31:10,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 81 transitions. [2018-11-07 16:31:10,361 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 81 transitions. Word has length 41 [2018-11-07 16:31:10,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:31:10,361 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 81 transitions. [2018-11-07 16:31:10,361 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-07 16:31:10,362 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 81 transitions. [2018-11-07 16:31:10,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-07 16:31:10,363 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:31:10,363 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:31:10,363 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:31:10,363 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:31:10,364 INFO L82 PathProgramCache]: Analyzing trace with hash 1677539559, now seen corresponding path program 1 times [2018-11-07 16:31:10,364 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:31:10,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:31:10,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:31:10,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:31:10,365 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:31:10,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:31:10,854 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:31:10,855 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:31:10,855 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:31:10,855 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 43 with the following transitions: [2018-11-07 16:31:10,856 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [6], [7], [11], [14], [16], [17], [18], [22], [24], [27], [28], [29], [35], [51], [53], [57], [61], [66], [67], [68], [70], [72], [80], [83], [85], [88], [90], [91], [92], [93], [95], [96] [2018-11-07 16:31:10,858 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 16:31:10,858 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 16:31:10,864 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 16:31:10,996 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 16:31:10,996 INFO L272 AbstractInterpreter]: Visited 35 different actions 236 times. Merged at 21 different actions 141 times. Widened at 4 different actions 8 times. Found 8 fixpoints after 3 different actions. Largest state had 25 variables. [2018-11-07 16:31:11,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:31:11,033 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 16:31:11,034 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:31:11,034 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:31:11,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:31:11,050 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:31:11,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:31:11,080 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:31:11,198 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:31:11,198 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:31:11,477 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:31:11,498 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:31:11,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2018-11-07 16:31:11,498 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:31:11,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 16:31:11,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 16:31:11,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-11-07 16:31:11,499 INFO L87 Difference]: Start difference. First operand 75 states and 81 transitions. Second operand 9 states. [2018-11-07 16:31:11,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:31:11,722 INFO L93 Difference]: Finished difference Result 110 states and 119 transitions. [2018-11-07 16:31:11,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 16:31:11,723 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 42 [2018-11-07 16:31:11,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:31:11,723 INFO L225 Difference]: With dead ends: 110 [2018-11-07 16:31:11,723 INFO L226 Difference]: Without dead ends: 83 [2018-11-07 16:31:11,724 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 77 SyntacticMatches, 8 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2018-11-07 16:31:11,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-11-07 16:31:11,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 65. [2018-11-07 16:31:11,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-07 16:31:11,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2018-11-07 16:31:11,731 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 42 [2018-11-07 16:31:11,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:31:11,732 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2018-11-07 16:31:11,732 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 16:31:11,732 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2018-11-07 16:31:11,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-07 16:31:11,733 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:31:11,733 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:31:11,733 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:31:11,734 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:31:11,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1915071939, now seen corresponding path program 2 times [2018-11-07 16:31:11,734 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:31:11,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:31:11,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:31:11,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:31:11,735 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:31:11,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:31:12,114 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 13 [2018-11-07 16:31:12,494 WARN L179 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 23 [2018-11-07 16:31:12,625 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:31:12,625 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:31:12,626 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:31:12,626 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:31:12,626 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:31:12,626 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:31:12,626 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:31:12,634 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:31:12,634 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:31:12,694 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-07 16:31:12,694 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:31:12,698 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:31:13,026 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-11-07 16:31:13,029 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:31:13,031 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2018-11-07 16:31:13,031 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 16:31:13,037 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:31:13,047 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:31:13,048 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:27 [2018-11-07 16:31:13,191 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2018-11-07 16:31:13,195 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:31:13,201 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:31:13,201 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:31:13,207 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 43 [2018-11-07 16:31:13,208 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 16:31:13,215 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:31:13,219 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:31:13,220 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:17 [2018-11-07 16:31:13,290 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2018-11-07 16:31:13,293 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-07 16:31:13,294 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 16:31:13,295 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:31:13,297 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:31:13,297 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-11-07 16:31:13,316 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:31:13,316 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:31:13,935 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 83 [2018-11-07 16:31:13,962 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:13,962 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:13,971 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 94 [2018-11-07 16:31:14,085 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 23 [2018-11-07 16:31:14,116 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:14,151 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:14,160 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:14,194 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:14,203 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:14,261 INFO L303 Elim1Store]: Index analysis took 174 ms [2018-11-07 16:31:14,272 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 73 [2018-11-07 16:31:14,275 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-11-07 16:31:14,299 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:31:14,304 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:14,322 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 110 treesize of output 113 [2018-11-07 16:31:14,579 WARN L179 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 49 [2018-11-07 16:31:14,583 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:14,584 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:14,586 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:14,587 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:14,588 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:14,603 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:14,604 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:14,607 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:14,607 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:14,615 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 87 [2018-11-07 16:31:14,618 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-11-07 16:31:14,628 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:14,629 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:14,631 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:14,632 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:14,633 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:14,653 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 85 [2018-11-07 16:31:14,656 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 4 xjuncts. [2018-11-07 16:31:14,659 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:14,659 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:14,662 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:14,662 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:14,663 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:14,664 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:14,680 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 86 [2018-11-07 16:31:14,684 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 4 xjuncts. [2018-11-07 16:31:14,708 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:14,722 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:14,734 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:14,735 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:14,735 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:14,736 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:14,738 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:14,739 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:14,747 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 86 [2018-11-07 16:31:14,749 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-11-07 16:31:14,811 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-07 16:31:14,814 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:14,816 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 68 [2018-11-07 16:31:14,905 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:14,906 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:14,909 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:14,909 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:14,910 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:14,911 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:14,924 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 68 [2018-11-07 16:31:14,926 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-11-07 16:31:14,943 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:31:14,954 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:31:14,958 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:31:14,959 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 3 variables, input treesize:96, output treesize:14 [2018-11-07 16:31:15,076 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:31:15,096 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:31:15,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 21, 21] total 45 [2018-11-07 16:31:15,096 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:31:15,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-07 16:31:15,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-07 16:31:15,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=261, Invalid=1719, Unknown=0, NotChecked=0, Total=1980 [2018-11-07 16:31:15,098 INFO L87 Difference]: Start difference. First operand 65 states and 70 transitions. Second operand 27 states. [2018-11-07 16:31:16,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:31:16,594 INFO L93 Difference]: Finished difference Result 193 states and 218 transitions. [2018-11-07 16:31:16,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-07 16:31:16,595 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 43 [2018-11-07 16:31:16,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:31:16,597 INFO L225 Difference]: With dead ends: 193 [2018-11-07 16:31:16,597 INFO L226 Difference]: Without dead ends: 159 [2018-11-07 16:31:16,599 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 54 SyntacticMatches, 8 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1232 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=585, Invalid=3075, Unknown=0, NotChecked=0, Total=3660 [2018-11-07 16:31:16,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-11-07 16:31:16,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 100. [2018-11-07 16:31:16,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-11-07 16:31:16,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 108 transitions. [2018-11-07 16:31:16,611 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 108 transitions. Word has length 43 [2018-11-07 16:31:16,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:31:16,612 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 108 transitions. [2018-11-07 16:31:16,612 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-07 16:31:16,612 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2018-11-07 16:31:16,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-07 16:31:16,613 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:31:16,614 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:31:16,614 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:31:16,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:31:16,614 INFO L82 PathProgramCache]: Analyzing trace with hash 534095078, now seen corresponding path program 2 times [2018-11-07 16:31:16,614 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:31:16,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:31:16,615 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:31:16,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:31:16,615 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:31:16,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:31:16,739 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:31:16,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:31:16,740 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:31:16,740 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:31:16,740 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:31:16,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:31:16,740 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:31:16,749 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:31:16,749 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:31:16,784 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-07 16:31:16,785 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:31:16,788 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:31:16,794 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:31:16,794 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:31:16,836 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:31:16,857 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:31:16,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 9 [2018-11-07 16:31:16,857 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:31:16,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 16:31:16,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 16:31:16,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-07 16:31:16,858 INFO L87 Difference]: Start difference. First operand 100 states and 108 transitions. Second operand 9 states. [2018-11-07 16:31:17,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:31:17,232 INFO L93 Difference]: Finished difference Result 181 states and 202 transitions. [2018-11-07 16:31:17,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-07 16:31:17,233 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 52 [2018-11-07 16:31:17,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:31:17,235 INFO L225 Difference]: With dead ends: 181 [2018-11-07 16:31:17,235 INFO L226 Difference]: Without dead ends: 147 [2018-11-07 16:31:17,236 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 105 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=197, Unknown=0, NotChecked=0, Total=306 [2018-11-07 16:31:17,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-11-07 16:31:17,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 111. [2018-11-07 16:31:17,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-11-07 16:31:17,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 121 transitions. [2018-11-07 16:31:17,251 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 121 transitions. Word has length 52 [2018-11-07 16:31:17,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:31:17,251 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 121 transitions. [2018-11-07 16:31:17,252 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 16:31:17,252 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 121 transitions. [2018-11-07 16:31:17,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-07 16:31:17,253 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:31:17,253 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:31:17,254 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:31:17,254 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:31:17,254 INFO L82 PathProgramCache]: Analyzing trace with hash -1480305564, now seen corresponding path program 3 times [2018-11-07 16:31:17,254 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:31:17,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:31:17,255 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:31:17,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:31:17,255 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:31:17,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:31:17,840 WARN L179 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 10 [2018-11-07 16:31:18,196 WARN L179 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 14 [2018-11-07 16:31:18,808 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:31:18,809 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:31:18,809 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:31:18,809 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:31:18,809 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:31:18,809 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:31:18,809 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:31:18,818 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:31:18,818 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:31:18,835 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:31:18,835 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:31:18,838 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:31:19,077 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 34 [2018-11-07 16:31:19,080 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:31:19,082 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 50 [2018-11-07 16:31:19,082 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 16:31:19,089 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:31:19,101 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:31:19,102 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:45 [2018-11-07 16:31:19,268 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:31:19,269 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 52 [2018-11-07 16:31:19,275 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:31:19,276 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:31:19,277 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:19,281 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:31:19,282 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 85 [2018-11-07 16:31:19,284 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 16:31:19,294 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:31:19,310 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-07 16:31:19,310 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:69, output treesize:32 [2018-11-07 16:31:19,536 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 36 treesize of output 29 [2018-11-07 16:31:19,563 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:31:19,584 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:31:19,601 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:31:19,612 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:31:19,653 INFO L303 Elim1Store]: Index analysis took 115 ms [2018-11-07 16:31:19,654 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 29 treesize of output 87 [2018-11-07 16:31:19,654 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 16:31:19,831 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:31:19,924 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-07 16:31:19,925 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:29 [2018-11-07 16:31:20,161 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 31 [2018-11-07 16:31:20,163 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:20,164 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:31:20,165 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:31:20,165 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:20,166 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:31:20,167 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 55 [2018-11-07 16:31:20,168 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 16:31:20,176 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:31:20,181 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:31:20,182 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:45, output treesize:5 [2018-11-07 16:31:20,242 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:31:20,242 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:31:38,867 WARN L179 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 35 [2018-11-07 16:31:44,681 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 80 [2018-11-07 16:31:44,684 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:44,686 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 87 [2018-11-07 16:31:44,689 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:44,693 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:44,693 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:44,715 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 75 treesize of output 115 [2018-11-07 16:31:45,030 WARN L179 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 91 [2018-11-07 16:31:45,036 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:45,037 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:45,041 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:45,048 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 75 [2018-11-07 16:31:45,049 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-07 16:31:45,053 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:45,054 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:45,054 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:45,056 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:45,057 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:45,057 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:45,067 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:45,075 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 98 [2018-11-07 16:31:45,077 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-11-07 16:31:45,111 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:45,120 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:45,134 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:45,169 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:45,178 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:45,192 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:45,228 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:45,228 INFO L303 Elim1Store]: Index analysis took 150 ms [2018-11-07 16:31:45,236 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 96 [2018-11-07 16:31:45,238 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-11-07 16:31:45,242 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:45,243 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:45,243 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:45,245 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:45,245 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:45,246 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:45,253 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:45,261 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 98 [2018-11-07 16:31:45,262 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-11-07 16:31:45,268 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:45,272 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:45,286 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 51 treesize of output 69 [2018-11-07 16:31:45,288 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 3 xjuncts. [2018-11-07 16:31:45,291 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:45,292 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:45,293 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:45,295 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:45,296 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:45,296 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:45,306 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:45,314 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 99 [2018-11-07 16:31:45,316 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-11-07 16:31:45,350 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:45,366 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:45,380 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:45,414 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:45,423 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:45,437 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:45,533 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:45,534 INFO L303 Elim1Store]: Index analysis took 216 ms [2018-11-07 16:31:45,585 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 96 [2018-11-07 16:31:45,587 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-11-07 16:31:46,653 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:46,654 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:46,657 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:46,665 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 53 treesize of output 63 [2018-11-07 16:31:46,667 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2018-11-07 16:31:46,671 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:46,671 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:46,672 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:46,672 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:46,674 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:46,674 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:46,681 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:46,689 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 96 [2018-11-07 16:31:46,691 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-11-07 16:31:46,694 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:46,695 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:46,695 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:46,699 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:46,700 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 64 [2018-11-07 16:31:46,701 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-07 16:31:46,966 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:46,967 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:46,967 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:46,968 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:46,968 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:46,969 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:46,971 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:46,971 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:46,972 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:46,973 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:46,986 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:46,987 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:46,994 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 134 [2018-11-07 16:31:46,995 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 2 xjuncts. [2018-11-07 16:31:46,998 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:46,999 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:47,001 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:47,002 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:47,002 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:47,009 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:47,010 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:47,028 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 91 [2018-11-07 16:31:47,029 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 2 xjuncts. [2018-11-07 16:31:47,031 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:47,032 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:47,032 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:47,033 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:47,033 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:47,034 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:47,041 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:47,042 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:31:47,043 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 94 [2018-11-07 16:31:47,044 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-07 16:31:47,190 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 8 xjuncts. [2018-11-07 16:31:47,244 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-11-07 16:31:47,283 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-11-07 16:31:47,399 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 5 xjuncts. [2018-11-07 16:31:47,400 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 7 variables, input treesize:96, output treesize:68 [2018-11-07 16:32:02,950 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 16 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:32:02,970 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:32:02,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 23, 22] total 59 [2018-11-07 16:32:02,971 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:32:02,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-07 16:32:02,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-07 16:32:02,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=374, Invalid=3035, Unknown=13, NotChecked=0, Total=3422 [2018-11-07 16:32:02,972 INFO L87 Difference]: Start difference. First operand 111 states and 121 transitions. Second operand 39 states. [2018-11-07 16:32:05,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:32:05,048 INFO L93 Difference]: Finished difference Result 247 states and 277 transitions. [2018-11-07 16:32:05,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-07 16:32:05,049 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 52 [2018-11-07 16:32:05,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:32:05,050 INFO L225 Difference]: With dead ends: 247 [2018-11-07 16:32:05,050 INFO L226 Difference]: Without dead ends: 202 [2018-11-07 16:32:05,052 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 65 SyntacticMatches, 6 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2246 ImplicationChecksByTransitivity, 43.2s TimeCoverageRelationStatistics Valid=831, Invalid=5476, Unknown=13, NotChecked=0, Total=6320 [2018-11-07 16:32:05,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-11-07 16:32:05,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 107. [2018-11-07 16:32:05,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-11-07 16:32:05,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 117 transitions. [2018-11-07 16:32:05,065 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 117 transitions. Word has length 52 [2018-11-07 16:32:05,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:32:05,065 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 117 transitions. [2018-11-07 16:32:05,066 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-11-07 16:32:05,066 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 117 transitions. [2018-11-07 16:32:05,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-07 16:32:05,067 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:32:05,067 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:32:05,067 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:32:05,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:32:05,068 INFO L82 PathProgramCache]: Analyzing trace with hash 472777368, now seen corresponding path program 2 times [2018-11-07 16:32:05,068 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:32:05,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:32:05,069 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:32:05,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:32:05,069 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:32:05,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:32:05,420 WARN L179 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 7 [2018-11-07 16:32:06,112 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:32:06,113 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:32:06,113 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:32:06,113 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:32:06,113 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:32:06,113 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:32:06,113 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:32:06,122 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:32:06,123 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:32:06,191 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-07 16:32:06,191 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:32:06,195 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:32:06,413 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-07 16:32:06,415 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:32:06,417 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-07 16:32:06,417 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 16:32:06,423 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:32:06,429 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:32:06,430 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-11-07 16:32:06,895 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2018-11-07 16:32:06,901 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-07 16:32:06,902 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 16:32:06,907 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:32:06,909 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:32:06,909 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-11-07 16:32:07,077 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:32:07,077 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:32:07,410 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 41 [2018-11-07 16:32:07,455 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:32:07,456 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:32:07,456 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:32:07,463 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 53 [2018-11-07 16:32:07,465 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-07 16:32:07,467 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:32:07,468 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2018-11-07 16:32:07,468 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-07 16:32:07,472 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:32:07,474 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:32:07,474 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:32:07,482 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 51 [2018-11-07 16:32:07,483 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-07 16:32:07,497 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:32:07,498 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:32:07,499 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:47, output treesize:11 [2018-11-07 16:32:07,573 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:32:07,592 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:32:07,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19, 15] total 39 [2018-11-07 16:32:07,593 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:32:07,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-07 16:32:07,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-07 16:32:07,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1341, Unknown=0, NotChecked=0, Total=1482 [2018-11-07 16:32:07,594 INFO L87 Difference]: Start difference. First operand 107 states and 117 transitions. Second operand 34 states. [2018-11-07 16:32:26,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:32:26,166 INFO L93 Difference]: Finished difference Result 195 states and 213 transitions. [2018-11-07 16:32:26,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-07 16:32:26,166 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 54 [2018-11-07 16:32:26,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:32:26,168 INFO L225 Difference]: With dead ends: 195 [2018-11-07 16:32:26,168 INFO L226 Difference]: Without dead ends: 193 [2018-11-07 16:32:26,170 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 82 SyntacticMatches, 13 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1024 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=417, Invalid=3243, Unknown=0, NotChecked=0, Total=3660 [2018-11-07 16:32:26,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-11-07 16:32:26,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 123. [2018-11-07 16:32:26,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-11-07 16:32:26,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 134 transitions. [2018-11-07 16:32:26,181 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 134 transitions. Word has length 54 [2018-11-07 16:32:26,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:32:26,181 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 134 transitions. [2018-11-07 16:32:26,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-07 16:32:26,181 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 134 transitions. [2018-11-07 16:32:26,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-07 16:32:26,182 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:32:26,183 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:32:26,183 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:32:26,183 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:32:26,183 INFO L82 PathProgramCache]: Analyzing trace with hash 251048867, now seen corresponding path program 1 times [2018-11-07 16:32:26,183 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:32:26,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:32:26,184 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:32:26,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:32:26,184 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:32:26,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:32:26,760 WARN L179 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 10 [2018-11-07 16:32:27,681 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:32:27,682 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:32:27,682 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:32:27,682 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 55 with the following transitions: [2018-11-07 16:32:27,682 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [6], [7], [11], [14], [16], [17], [18], [22], [24], [27], [28], [29], [35], [37], [40], [41], [42], [43], [47], [51], [53], [57], [61], [66], [67], [68], [80], [83], [85], [91], [92], [93], [95] [2018-11-07 16:32:27,684 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 16:32:27,684 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 16:32:27,690 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 16:32:27,784 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 16:32:27,785 INFO L272 AbstractInterpreter]: Visited 36 different actions 199 times. Merged at 24 different actions 136 times. Widened at 4 different actions 6 times. Found 9 fixpoints after 5 different actions. Largest state had 25 variables. [2018-11-07 16:32:27,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:32:27,820 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 16:32:27,820 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:32:27,820 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:32:27,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:32:27,837 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:32:27,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:32:27,857 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:32:28,029 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 21 treesize of output 16 [2018-11-07 16:32:28,036 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:32:28,037 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-07 16:32:28,038 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 16:32:28,057 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:32:28,063 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:32:28,063 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17 [2018-11-07 16:32:28,117 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2018-11-07 16:32:28,119 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-07 16:32:28,119 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 16:32:28,121 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:32:28,122 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:32:28,122 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-11-07 16:32:28,143 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:32:28,143 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:32:30,299 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 37 [2018-11-07 16:32:30,603 WARN L179 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 25 [2018-11-07 16:32:30,604 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:32:30,606 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:32:30,607 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:32:30,615 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-11-07 16:32:30,616 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-07 16:32:30,618 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:32:30,619 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2018-11-07 16:32:30,619 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-07 16:32:30,621 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:32:30,623 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:32:30,624 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:32:30,632 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-11-07 16:32:30,633 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-07 16:32:30,653 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:32:30,655 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:32:30,655 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:43, output treesize:5 [2018-11-07 16:32:30,773 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:32:30,793 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:32:30,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 17] total 38 [2018-11-07 16:32:30,793 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:32:30,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-07 16:32:30,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-07 16:32:30,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=1219, Unknown=1, NotChecked=0, Total=1406 [2018-11-07 16:32:30,795 INFO L87 Difference]: Start difference. First operand 123 states and 134 transitions. Second operand 24 states. [2018-11-07 16:32:32,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:32:32,853 INFO L93 Difference]: Finished difference Result 324 states and 363 transitions. [2018-11-07 16:32:32,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-07 16:32:32,853 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 54 [2018-11-07 16:32:32,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:32:32,858 INFO L225 Difference]: With dead ends: 324 [2018-11-07 16:32:32,858 INFO L226 Difference]: Without dead ends: 279 [2018-11-07 16:32:32,860 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 84 SyntacticMatches, 13 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1293 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=722, Invalid=3969, Unknown=1, NotChecked=0, Total=4692 [2018-11-07 16:32:32,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-11-07 16:32:32,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 146. [2018-11-07 16:32:32,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-11-07 16:32:32,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 161 transitions. [2018-11-07 16:32:32,878 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 161 transitions. Word has length 54 [2018-11-07 16:32:32,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:32:32,878 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 161 transitions. [2018-11-07 16:32:32,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-07 16:32:32,878 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 161 transitions. [2018-11-07 16:32:32,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-07 16:32:32,879 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:32:32,880 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:32:32,880 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:32:32,880 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:32:32,880 INFO L82 PathProgramCache]: Analyzing trace with hash 1639595941, now seen corresponding path program 1 times [2018-11-07 16:32:32,880 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:32:32,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:32:32,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:32:32,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:32:32,881 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:32:32,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:32:33,785 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:32:33,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:32:33,786 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:32:33,786 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 64 with the following transitions: [2018-11-07 16:32:33,786 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [6], [7], [11], [14], [16], [17], [18], [22], [24], [27], [28], [29], [35], [37], [45], [47], [51], [53], [57], [61], [66], [67], [68], [80], [83], [85], [91], [92], [93], [95] [2018-11-07 16:32:33,788 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 16:32:33,788 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 16:32:33,793 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 16:32:33,871 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 16:32:33,871 INFO L272 AbstractInterpreter]: Visited 33 different actions 173 times. Merged at 21 different actions 113 times. Widened at 3 different actions 5 times. Found 7 fixpoints after 4 different actions. Largest state had 24 variables. [2018-11-07 16:32:33,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:32:33,909 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 16:32:33,909 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:32:33,909 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:32:33,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:32:33,927 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:32:33,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:32:33,959 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:32:34,254 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-11-07 16:32:34,258 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:32:34,259 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2018-11-07 16:32:34,260 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 16:32:34,267 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:32:34,274 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:32:34,274 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:27 [2018-11-07 16:32:34,331 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-11-07 16:32:34,333 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:32:34,334 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:32:34,335 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:32:34,339 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-11-07 16:32:34,340 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 16:32:34,347 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:32:34,354 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:32:34,355 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:19 [2018-11-07 16:32:34,413 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2018-11-07 16:32:34,415 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:32:34,416 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:32:34,416 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:32:34,421 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 58 [2018-11-07 16:32:34,421 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 16:32:34,432 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:32:34,440 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:32:34,441 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:19 [2018-11-07 16:32:34,491 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2018-11-07 16:32:34,494 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-07 16:32:34,495 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 16:32:34,496 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:32:34,497 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:32:34,498 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-11-07 16:32:34,522 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 6 proven. 51 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-07 16:32:34,523 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:32:36,644 WARN L832 $PredicateComparison]: unable to prove that (forall ((main_~key~0 Int)) (let ((.cse0 (store (select |c_#memory_int| |c_main_~#v~0.base|) (+ (* 4 c_main_~i~0) |c_main_~#v~0.offset| 4) main_~key~0))) (< (select .cse0 |c_main_~#v~0.offset|) (+ (select .cse0 (+ |c_main_~#v~0.offset| 4)) 1)))) is different from false [2018-11-07 16:32:38,744 WARN L832 $PredicateComparison]: unable to prove that (forall ((main_~key~0 Int)) (let ((.cse0 (store (select |c_#memory_int| |c_main_~#v~0.base|) (+ |c_main_~#v~0.offset| (* 4 c_main_~j~0)) main_~key~0))) (< (select .cse0 |c_main_~#v~0.offset|) (+ (select .cse0 (+ |c_main_~#v~0.offset| 4)) 1)))) is different from false [2018-11-07 16:32:40,833 WARN L832 $PredicateComparison]: unable to prove that (forall ((v_subst_2 Int)) (let ((.cse0 (store (store (select |c_#memory_int| |c_main_~#v~0.base|) (+ (* 4 c_main_~i~0) |c_main_~#v~0.offset| 4) c_main_~key~0) (+ |c_main_~#v~0.offset| (* 4 c_main_~j~0) 4) v_subst_2))) (< (select .cse0 |c_main_~#v~0.offset|) (+ (select .cse0 (+ |c_main_~#v~0.offset| 4)) 1)))) is different from false [2018-11-07 16:32:42,891 WARN L179 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 24 [2018-11-07 16:32:44,901 WARN L832 $PredicateComparison]: unable to prove that (forall ((main_~key~0 Int) (v_subst_2 Int)) (or (< main_~key~0 |c_main_#t~mem3|) (let ((.cse0 (store (store (select |c_#memory_int| |c_main_~#v~0.base|) (+ (* 4 c_main_~i~0) |c_main_~#v~0.offset| 4) main_~key~0) (+ |c_main_~#v~0.offset| (* 4 c_main_~j~0) 4) v_subst_2))) (< (select .cse0 |c_main_~#v~0.offset|) (+ (select .cse0 (+ |c_main_~#v~0.offset| 4)) 1))))) is different from false [2018-11-07 16:32:44,907 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 53 [2018-11-07 16:32:44,909 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:32:44,911 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 60 [2018-11-07 16:32:44,978 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:32:44,980 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:32:44,981 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:32:44,982 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:32:44,983 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:32:45,002 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 83 [2018-11-07 16:32:45,005 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-11-07 16:32:45,030 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:32:45,056 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:32:45,056 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:32:45,057 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:32:45,058 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:32:45,074 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 85 [2018-11-07 16:32:45,077 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 4 xjuncts. [2018-11-07 16:32:45,084 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:32:45,086 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:32:45,086 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:32:45,087 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:32:45,088 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:32:45,104 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 83 [2018-11-07 16:32:45,107 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 4 xjuncts. [2018-11-07 16:32:45,110 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:32:45,126 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 63 [2018-11-07 16:32:45,127 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 4 xjuncts. [2018-11-07 16:32:45,129 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:32:45,130 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:32:45,131 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:32:45,132 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:32:45,136 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:32:45,152 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 85 [2018-11-07 16:32:45,154 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 4 xjuncts. [2018-11-07 16:32:45,157 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:32:45,158 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:32:45,158 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:32:45,160 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:32:45,161 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:32:45,180 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 86 [2018-11-07 16:32:45,182 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 4 xjuncts. [2018-11-07 16:32:45,186 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:32:45,202 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 52 [2018-11-07 16:32:45,204 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 4 xjuncts. [2018-11-07 16:32:45,300 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-07 16:32:45,321 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-07 16:32:45,343 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-07 16:32:45,344 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:59, output treesize:50 [2018-11-07 16:32:45,505 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 10 trivial. 37 not checked. [2018-11-07 16:32:45,524 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:32:45,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 19] total 44 [2018-11-07 16:32:45,525 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:32:45,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-07 16:32:45,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-07 16:32:45,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=1356, Unknown=4, NotChecked=316, Total=1892 [2018-11-07 16:32:45,526 INFO L87 Difference]: Start difference. First operand 146 states and 161 transitions. Second operand 28 states. [2018-11-07 16:32:47,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:32:47,782 INFO L93 Difference]: Finished difference Result 396 states and 447 transitions. [2018-11-07 16:32:47,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-07 16:32:47,782 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 63 [2018-11-07 16:32:47,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:32:47,785 INFO L225 Difference]: With dead ends: 396 [2018-11-07 16:32:47,785 INFO L226 Difference]: Without dead ends: 351 [2018-11-07 16:32:47,787 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 97 SyntacticMatches, 13 SemanticMatches, 65 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1331 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=548, Invalid=3370, Unknown=4, NotChecked=500, Total=4422 [2018-11-07 16:32:47,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2018-11-07 16:32:47,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 223. [2018-11-07 16:32:47,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-11-07 16:32:47,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 252 transitions. [2018-11-07 16:32:47,811 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 252 transitions. Word has length 63 [2018-11-07 16:32:47,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:32:47,811 INFO L480 AbstractCegarLoop]: Abstraction has 223 states and 252 transitions. [2018-11-07 16:32:47,811 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-07 16:32:47,811 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 252 transitions. [2018-11-07 16:32:47,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-07 16:32:47,812 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:32:47,813 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:32:47,813 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:32:47,813 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:32:47,813 INFO L82 PathProgramCache]: Analyzing trace with hash 238536355, now seen corresponding path program 3 times [2018-11-07 16:32:47,813 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:32:47,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:32:47,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:32:47,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:32:47,814 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:32:47,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:32:48,485 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 10 proven. 27 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-07 16:32:48,486 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:32:48,486 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:32:48,486 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:32:48,486 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:32:48,486 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:32:48,486 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:32:48,494 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:32:48,494 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:32:48,519 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:32:48,519 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:32:48,521 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:32:48,584 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 10 proven. 27 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-07 16:32:48,584 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:32:48,799 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 10 proven. 27 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-07 16:32:48,820 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:32:48,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-11-07 16:32:48,820 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:32:48,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 16:32:48,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 16:32:48,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2018-11-07 16:32:48,821 INFO L87 Difference]: Start difference. First operand 223 states and 252 transitions. Second operand 11 states. [2018-11-07 16:32:49,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:32:49,042 INFO L93 Difference]: Finished difference Result 328 states and 373 transitions. [2018-11-07 16:32:49,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-07 16:32:49,042 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2018-11-07 16:32:49,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:32:49,044 INFO L225 Difference]: With dead ends: 328 [2018-11-07 16:32:49,044 INFO L226 Difference]: Without dead ends: 294 [2018-11-07 16:32:49,045 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 120 SyntacticMatches, 6 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2018-11-07 16:32:49,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-11-07 16:32:49,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 234. [2018-11-07 16:32:49,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-11-07 16:32:49,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 264 transitions. [2018-11-07 16:32:49,069 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 264 transitions. Word has length 65 [2018-11-07 16:32:49,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:32:49,070 INFO L480 AbstractCegarLoop]: Abstraction has 234 states and 264 transitions. [2018-11-07 16:32:49,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 16:32:49,070 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 264 transitions. [2018-11-07 16:32:49,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-07 16:32:49,072 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:32:49,072 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:32:49,072 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:32:49,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:32:49,073 INFO L82 PathProgramCache]: Analyzing trace with hash -1919075578, now seen corresponding path program 4 times [2018-11-07 16:32:49,073 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:32:49,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:32:49,073 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:32:49,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:32:49,074 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:32:49,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:32:49,663 WARN L179 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 9 [2018-11-07 16:32:50,320 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 2 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:32:50,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:32:50,320 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:32:50,320 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:32:50,320 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:32:50,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:32:50,320 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:32:50,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:32:50,329 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:32:50,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:32:50,359 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:32:50,576 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 34 [2018-11-07 16:32:50,580 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:32:50,581 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 50 [2018-11-07 16:32:50,581 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 16:32:50,590 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:32:50,602 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:32:50,602 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:40 [2018-11-07 16:32:50,785 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:32:50,785 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 52 [2018-11-07 16:32:50,789 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:32:50,789 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:32:50,792 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:32:50,795 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 71 [2018-11-07 16:32:50,796 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 16:32:50,833 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:32:50,905 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-07 16:32:50,905 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:64, output treesize:29 [2018-11-07 16:32:51,004 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 31 [2018-11-07 16:32:51,006 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:32:51,008 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:32:51,008 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:32:51,009 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:32:51,010 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:32:51,013 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 49 [2018-11-07 16:32:51,014 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 16:32:51,019 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:32:51,025 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:32:51,025 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:45, output treesize:5 [2018-11-07 16:32:51,047 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 12 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:32:51,048 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:32:53,860 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 64 [2018-11-07 16:32:53,862 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:32:53,865 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 71 [2018-11-07 16:32:53,939 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:32:53,939 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:32:53,939 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:32:53,940 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:32:53,941 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:32:53,942 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:32:53,955 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 85 [2018-11-07 16:32:53,957 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-07 16:32:53,959 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-07 16:32:53,959 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-07 16:32:53,962 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:32:53,962 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:32:53,963 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:32:53,963 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:32:53,965 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:32:53,966 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:32:53,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 3 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 85 [2018-11-07 16:32:53,992 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-11-07 16:32:53,994 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:32:53,995 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:32:53,995 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:32:53,996 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:32:53,997 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:32:53,999 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 59 [2018-11-07 16:32:54,000 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-07 16:32:54,004 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:32:54,004 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:32:54,005 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:32:54,005 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:32:54,006 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:32:54,007 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:32:54,007 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:32:54,008 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:32:54,020 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 89 [2018-11-07 16:32:54,022 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-11-07 16:32:54,024 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-07 16:32:54,024 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-07 16:32:54,025 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:32:54,026 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:32:54,026 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:32:54,027 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:32:54,029 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:32:54,030 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:32:54,030 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:32:54,031 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:32:54,042 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 89 [2018-11-07 16:32:54,044 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-11-07 16:32:54,077 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:32:54,082 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:32:54,091 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-07 16:32:54,091 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 6 variables, input treesize:80, output treesize:14 [2018-11-07 16:32:54,181 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 29 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-07 16:32:54,201 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:32:54,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22, 18] total 54 [2018-11-07 16:32:54,201 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:32:54,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-11-07 16:32:54,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-07 16:32:54,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=308, Invalid=2553, Unknown=1, NotChecked=0, Total=2862 [2018-11-07 16:32:54,203 INFO L87 Difference]: Start difference. First operand 234 states and 264 transitions. Second operand 38 states. [2018-11-07 16:32:54,596 WARN L179 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-11-07 16:32:57,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:32:57,821 INFO L93 Difference]: Finished difference Result 488 states and 560 transitions. [2018-11-07 16:32:57,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-11-07 16:32:57,822 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 63 [2018-11-07 16:32:57,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:32:57,825 INFO L225 Difference]: With dead ends: 488 [2018-11-07 16:32:57,825 INFO L226 Difference]: Without dead ends: 362 [2018-11-07 16:32:57,829 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 92 SyntacticMatches, 5 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2813 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=1373, Invalid=8726, Unknown=1, NotChecked=0, Total=10100 [2018-11-07 16:32:57,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2018-11-07 16:32:57,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 234. [2018-11-07 16:32:57,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-11-07 16:32:57,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 260 transitions. [2018-11-07 16:32:57,858 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 260 transitions. Word has length 63 [2018-11-07 16:32:57,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:32:57,858 INFO L480 AbstractCegarLoop]: Abstraction has 234 states and 260 transitions. [2018-11-07 16:32:57,858 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-11-07 16:32:57,858 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 260 transitions. [2018-11-07 16:32:57,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-07 16:32:57,859 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:32:57,860 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:32:57,860 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:32:57,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:32:57,860 INFO L82 PathProgramCache]: Analyzing trace with hash 912822456, now seen corresponding path program 1 times [2018-11-07 16:32:57,860 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:32:57,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:32:57,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:32:57,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:32:57,861 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:32:57,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:32:58,461 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 1 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:32:58,461 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:32:58,461 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:32:58,461 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 66 with the following transitions: [2018-11-07 16:32:58,461 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [6], [7], [11], [14], [16], [17], [18], [22], [24], [27], [28], [29], [35], [37], [40], [41], [42], [43], [47], [51], [53], [57], [61], [66], [67], [68], [70], [72], [80], [83], [85], [88], [90], [91], [92], [93], [95], [96] [2018-11-07 16:32:58,463 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 16:32:58,463 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 16:32:58,468 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 16:32:58,587 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 16:32:58,587 INFO L272 AbstractInterpreter]: Visited 41 different actions 281 times. Merged at 27 different actions 174 times. Widened at 5 different actions 9 times. Found 15 fixpoints after 6 different actions. Largest state had 26 variables. [2018-11-07 16:32:58,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:32:58,620 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 16:32:58,621 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:32:58,621 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:32:58,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:32:58,630 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:32:58,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:32:58,663 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:32:58,877 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 34 [2018-11-07 16:32:58,881 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:32:58,882 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 50 [2018-11-07 16:32:58,882 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 16:32:58,894 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:32:58,904 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:32:58,905 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:40 [2018-11-07 16:32:59,079 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:32:59,080 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 45 [2018-11-07 16:32:59,082 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:32:59,083 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:32:59,086 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:32:59,087 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 59 [2018-11-07 16:32:59,088 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 16:32:59,162 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:32:59,172 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-07 16:32:59,172 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:30 [2018-11-07 16:32:59,905 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2018-11-07 16:32:59,907 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:32:59,907 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:32:59,909 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:32:59,909 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 31 [2018-11-07 16:32:59,910 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 16:32:59,914 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:32:59,919 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:32:59,920 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:5 [2018-11-07 16:33:00,012 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:33:00,012 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:33:03,267 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 66 [2018-11-07 16:33:03,269 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:33:03,272 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 73 [2018-11-07 16:33:03,377 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:33:03,379 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:33:03,379 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:33:03,381 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:33:03,381 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:33:03,383 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:33:03,383 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:33:03,389 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:33:03,389 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:33:03,392 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 91 [2018-11-07 16:33:03,394 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-07 16:33:03,412 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:33:03,414 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:33:03,414 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:33:03,416 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:33:03,416 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:33:03,418 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:33:03,418 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:33:03,424 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:33:03,424 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:33:03,428 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 90 [2018-11-07 16:33:03,429 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-07 16:33:03,433 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:33:03,433 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:33:03,435 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:33:03,435 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:33:03,437 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:33:03,437 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:33:03,439 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:33:03,449 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 84 [2018-11-07 16:33:03,450 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-07 16:33:03,456 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:33:03,458 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:33:03,458 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:33:03,462 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:33:03,462 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:33:03,464 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:33:03,484 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 89 [2018-11-07 16:33:03,485 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-11-07 16:33:03,490 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:33:03,490 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:33:03,492 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:33:03,499 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 52 treesize of output 56 [2018-11-07 16:33:03,500 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-07 16:33:03,505 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:33:03,508 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:33:03,508 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:33:03,510 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:33:03,510 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:33:03,512 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:33:03,512 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:33:03,518 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:33:03,518 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:33:03,521 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 90 [2018-11-07 16:33:03,522 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-07 16:33:03,526 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:33:03,526 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:33:03,528 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:33:03,528 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:33:03,530 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:33:03,532 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 47 treesize of output 57 [2018-11-07 16:33:03,532 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-07 16:33:03,576 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-07 16:33:03,590 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-07 16:33:03,610 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-07 16:33:03,611 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:82, output treesize:31 [2018-11-07 16:33:05,731 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:33:05,751 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:33:05,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 24, 20] total 57 [2018-11-07 16:33:05,751 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:33:05,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-07 16:33:05,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-07 16:33:05,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=2911, Unknown=2, NotChecked=0, Total=3192 [2018-11-07 16:33:05,752 INFO L87 Difference]: Start difference. First operand 234 states and 260 transitions. Second operand 42 states. [2018-11-07 16:33:07,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:33:07,451 INFO L93 Difference]: Finished difference Result 285 states and 315 transitions. [2018-11-07 16:33:07,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-07 16:33:07,452 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 65 [2018-11-07 16:33:07,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:33:07,454 INFO L225 Difference]: With dead ends: 285 [2018-11-07 16:33:07,454 INFO L226 Difference]: Without dead ends: 262 [2018-11-07 16:33:07,455 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 93 SyntacticMatches, 8 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1664 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=546, Invalid=5002, Unknown=2, NotChecked=0, Total=5550 [2018-11-07 16:33:07,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2018-11-07 16:33:07,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 238. [2018-11-07 16:33:07,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-11-07 16:33:07,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 264 transitions. [2018-11-07 16:33:07,483 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 264 transitions. Word has length 65 [2018-11-07 16:33:07,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:33:07,483 INFO L480 AbstractCegarLoop]: Abstraction has 238 states and 264 transitions. [2018-11-07 16:33:07,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-07 16:33:07,484 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 264 transitions. [2018-11-07 16:33:07,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-07 16:33:07,485 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:33:07,485 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:33:07,485 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:33:07,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:33:07,485 INFO L82 PathProgramCache]: Analyzing trace with hash -720319799, now seen corresponding path program 4 times [2018-11-07 16:33:07,485 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:33:07,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:33:07,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:33:07,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:33:07,486 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:33:07,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:33:08,187 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 1 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:33:08,187 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:33:08,187 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:33:08,187 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:33:08,187 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:33:08,187 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:33:08,187 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:33:08,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:33:08,197 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:33:08,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:33:08,223 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:33:08,612 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-11-07 16:33:08,616 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:33:08,618 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2018-11-07 16:33:08,618 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 16:33:08,624 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:33:08,633 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:33:08,633 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:27 [2018-11-07 16:33:08,730 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2018-11-07 16:33:08,733 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:33:08,734 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:33:08,736 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:33:08,740 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 58 [2018-11-07 16:33:08,741 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 16:33:08,757 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:33:08,764 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:33:08,765 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:19 [2018-11-07 16:33:09,034 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2018-11-07 16:33:09,037 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-07 16:33:09,037 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 16:33:09,038 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:33:09,039 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:33:09,039 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-11-07 16:33:09,104 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:33:09,104 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:33:11,246 WARN L832 $PredicateComparison]: unable to prove that (forall ((main_~key~0 Int)) (let ((.cse0 (store (select |c_#memory_int| |c_main_~#v~0.base|) (+ (* 4 c_main_~i~0) |c_main_~#v~0.offset| 4) main_~key~0))) (<= (select .cse0 (+ (* 4 1) |c_main_~#v~0.offset|)) (select .cse0 (+ (* 4 2) |c_main_~#v~0.offset|))))) is different from false [2018-11-07 16:33:32,401 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-11-07 16:33:32,404 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:33:32,405 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-11-07 16:33:32,466 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:33:32,481 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 63 [2018-11-07 16:33:32,482 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-11-07 16:33:32,484 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:33:32,544 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 36 treesize of output 58 [2018-11-07 16:33:32,545 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 4 xjuncts. [2018-11-07 16:33:32,557 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:33:32,559 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:33:32,559 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:33:32,561 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:33:32,566 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:33:32,582 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 97 [2018-11-07 16:33:32,584 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 4 xjuncts. [2018-11-07 16:33:32,589 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:33:32,590 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:33:32,591 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:33:32,593 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:33:32,597 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:33:32,613 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 99 [2018-11-07 16:33:32,615 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 4 xjuncts. [2018-11-07 16:33:32,617 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:33:32,618 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:33:32,618 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:33:32,620 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:33:32,623 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:33:32,638 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 97 [2018-11-07 16:33:32,641 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 4 xjuncts. [2018-11-07 16:33:32,651 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:33:32,652 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:33:32,652 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:33:32,654 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:33:32,656 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:33:32,671 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 98 [2018-11-07 16:33:32,673 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 4 xjuncts. [2018-11-07 16:33:32,675 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:33:32,676 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:33:32,677 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:33:32,678 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:33:32,681 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:33:32,697 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 54 treesize of output 95 [2018-11-07 16:33:32,699 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 4 xjuncts. [2018-11-07 16:33:32,782 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-07 16:33:32,803 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-07 16:33:32,827 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-07 16:33:32,828 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:66, output treesize:43 [2018-11-07 16:33:32,886 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 2 proven. 29 refuted. 4 times theorem prover too weak. 0 trivial. 14 not checked. [2018-11-07 16:33:32,907 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:33:32,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22, 18] total 47 [2018-11-07 16:33:32,907 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:33:32,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-07 16:33:32,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-07 16:33:32,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=1864, Unknown=10, NotChecked=88, Total=2162 [2018-11-07 16:33:32,908 INFO L87 Difference]: Start difference. First operand 238 states and 264 transitions. Second operand 39 states. [2018-11-07 16:33:48,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:33:48,581 INFO L93 Difference]: Finished difference Result 376 states and 418 transitions. [2018-11-07 16:33:48,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-07 16:33:48,582 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 66 [2018-11-07 16:33:48,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:33:48,584 INFO L225 Difference]: With dead ends: 376 [2018-11-07 16:33:48,584 INFO L226 Difference]: Without dead ends: 299 [2018-11-07 16:33:48,585 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 100 SyntacticMatches, 14 SemanticMatches, 65 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1286 ImplicationChecksByTransitivity, 25.2s TimeCoverageRelationStatistics Valid=479, Invalid=3805, Unknown=10, NotChecked=128, Total=4422 [2018-11-07 16:33:48,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2018-11-07 16:33:48,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 261. [2018-11-07 16:33:48,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-11-07 16:33:48,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 287 transitions. [2018-11-07 16:33:48,621 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 287 transitions. Word has length 66 [2018-11-07 16:33:48,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:33:48,621 INFO L480 AbstractCegarLoop]: Abstraction has 261 states and 287 transitions. [2018-11-07 16:33:48,621 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-11-07 16:33:48,621 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 287 transitions. [2018-11-07 16:33:48,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-07 16:33:48,622 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:33:48,622 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:33:48,623 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:33:48,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:33:48,623 INFO L82 PathProgramCache]: Analyzing trace with hash -316321774, now seen corresponding path program 2 times [2018-11-07 16:33:48,623 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:33:48,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:33:48,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:33:48,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:33:48,624 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:33:48,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:33:49,555 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:33:49,555 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:33:49,555 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:33:49,555 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:33:49,556 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:33:49,556 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:33:49,556 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:33:49,564 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:33:49,564 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:33:49,603 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-07 16:33:49,603 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:33:49,606 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:33:49,833 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 21 treesize of output 16 [2018-11-07 16:33:49,835 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:33:49,837 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-07 16:33:49,837 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 16:33:49,845 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:33:49,852 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:33:49,853 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17 [2018-11-07 16:33:50,013 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 32 [2018-11-07 16:33:50,016 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:33:50,018 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:33:50,045 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 65 [2018-11-07 16:33:50,046 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-07 16:33:50,060 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:33:50,067 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:33:50,067 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:19 [2018-11-07 16:33:50,176 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2018-11-07 16:33:50,178 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-07 16:33:50,179 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 16:33:50,181 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:33:50,182 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:33:50,183 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-11-07 16:33:50,203 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 28 proven. 26 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-07 16:33:50,203 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:33:52,566 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 37 [2018-11-07 16:33:52,616 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:33:52,618 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:33:52,619 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:33:52,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, 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-11-07 16:33:52,629 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-07 16:33:52,635 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:33:52,637 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2018-11-07 16:33:52,637 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-07 16:33:52,639 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:33:52,640 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:33:52,641 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:33:52,649 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-11-07 16:33:52,651 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-07 16:33:52,664 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:33:52,666 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:33:52,666 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:43, output treesize:5 [2018-11-07 16:33:52,768 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 41 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-07 16:33:52,787 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:33:52,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 22, 18] total 47 [2018-11-07 16:33:52,788 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:33:52,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-07 16:33:52,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-07 16:33:52,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=254, Invalid=1907, Unknown=1, NotChecked=0, Total=2162 [2018-11-07 16:33:52,789 INFO L87 Difference]: Start difference. First operand 261 states and 287 transitions. Second operand 32 states. [2018-11-07 16:33:58,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:33:58,061 INFO L93 Difference]: Finished difference Result 488 states and 543 transitions. [2018-11-07 16:33:58,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-11-07 16:33:58,062 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 66 [2018-11-07 16:33:58,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:33:58,067 INFO L225 Difference]: With dead ends: 488 [2018-11-07 16:33:58,067 INFO L226 Difference]: Without dead ends: 486 [2018-11-07 16:33:58,069 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 99 SyntacticMatches, 12 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3664 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=1721, Invalid=11160, Unknown=1, NotChecked=0, Total=12882 [2018-11-07 16:33:58,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2018-11-07 16:33:58,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 274. [2018-11-07 16:33:58,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2018-11-07 16:33:58,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 302 transitions. [2018-11-07 16:33:58,111 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 302 transitions. Word has length 66 [2018-11-07 16:33:58,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:33:58,112 INFO L480 AbstractCegarLoop]: Abstraction has 274 states and 302 transitions. [2018-11-07 16:33:58,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-07 16:33:58,112 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 302 transitions. [2018-11-07 16:33:58,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-07 16:33:58,113 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:33:58,113 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:33:58,113 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:33:58,113 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:33:58,114 INFO L82 PathProgramCache]: Analyzing trace with hash -1196814012, now seen corresponding path program 1 times [2018-11-07 16:33:58,114 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:33:58,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:33:58,114 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:33:58,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:33:58,115 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:33:58,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:33:58,233 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 42 proven. 4 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-07 16:33:58,233 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:33:58,234 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:33:58,234 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 73 with the following transitions: [2018-11-07 16:33:58,234 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [6], [7], [11], [14], [16], [17], [18], [22], [24], [27], [28], [29], [31], [35], [37], [40], [41], [42], [43], [45], [47], [51], [53], [57], [61], [66], [67], [68], [80], [83], [85], [91], [92], [93], [95] [2018-11-07 16:33:58,236 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 16:33:58,237 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 16:33:58,241 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 16:33:58,334 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 16:33:58,334 INFO L272 AbstractInterpreter]: Visited 38 different actions 234 times. Merged at 26 different actions 149 times. Widened at 4 different actions 5 times. Found 24 fixpoints after 9 different actions. Largest state had 25 variables. [2018-11-07 16:33:58,372 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:33:58,372 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 16:33:58,373 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:33:58,373 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:33:58,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:33:58,389 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:33:58,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:33:58,422 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:33:58,427 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 42 proven. 4 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-07 16:33:58,427 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:33:58,467 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 42 proven. 4 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-07 16:33:58,488 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:33:58,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2018-11-07 16:33:58,488 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:33:58,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 16:33:58,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 16:33:58,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 16:33:58,489 INFO L87 Difference]: Start difference. First operand 274 states and 302 transitions. Second operand 6 states. [2018-11-07 16:33:58,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:33:58,607 INFO L93 Difference]: Finished difference Result 419 states and 464 transitions. [2018-11-07 16:33:58,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 16:33:58,607 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 72 [2018-11-07 16:33:58,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:33:58,609 INFO L225 Difference]: With dead ends: 419 [2018-11-07 16:33:58,609 INFO L226 Difference]: Without dead ends: 320 [2018-11-07 16:33:58,610 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 143 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-07 16:33:58,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2018-11-07 16:33:58,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 258. [2018-11-07 16:33:58,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2018-11-07 16:33:58,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 281 transitions. [2018-11-07 16:33:58,642 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 281 transitions. Word has length 72 [2018-11-07 16:33:58,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:33:58,643 INFO L480 AbstractCegarLoop]: Abstraction has 258 states and 281 transitions. [2018-11-07 16:33:58,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 16:33:58,643 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 281 transitions. [2018-11-07 16:33:58,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-07 16:33:58,644 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:33:58,644 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:33:58,644 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:33:58,644 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:33:58,644 INFO L82 PathProgramCache]: Analyzing trace with hash -1212396602, now seen corresponding path program 2 times [2018-11-07 16:33:58,644 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:33:58,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:33:58,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:33:58,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:33:58,646 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:33:58,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:33:59,892 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:33:59,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:33:59,893 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:33:59,893 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:33:59,893 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:33:59,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:33:59,893 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:33:59,902 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:33:59,902 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:33:59,971 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-07 16:33:59,971 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:33:59,973 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:34:00,078 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 34 [2018-11-07 16:34:00,082 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:00,083 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:34:00,086 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 74 [2018-11-07 16:34:00,087 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 16:34:00,096 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:34:00,110 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:34:00,111 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:45 [2018-11-07 16:34:00,286 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:34:00,287 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 53 [2018-11-07 16:34:00,291 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:34:00,292 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:34:00,292 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:00,296 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:34:00,297 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 84 [2018-11-07 16:34:00,298 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 16:34:00,310 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:34:00,323 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:34:00,323 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:65, output treesize:32 [2018-11-07 16:34:00,402 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2018-11-07 16:34:00,404 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:34:00,406 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:34:00,407 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:34:00,409 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:34:00,412 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 25 treesize of output 68 [2018-11-07 16:34:00,413 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 16:34:00,424 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:34:00,435 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:34:00,436 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:22 [2018-11-07 16:34:00,577 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2018-11-07 16:34:00,580 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:34:00,581 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:34:00,583 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:34:00,584 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:34:00,587 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 25 treesize of output 68 [2018-11-07 16:34:00,587 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 16:34:00,598 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:34:00,607 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:34:00,608 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:19 [2018-11-07 16:34:00,679 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2018-11-07 16:34:00,686 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:34:00,687 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-11-07 16:34:00,688 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 16:34:00,689 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:34:00,690 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:34:00,690 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:5 [2018-11-07 16:34:00,751 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 4 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:34:00,751 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:34:40,191 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 64 [2018-11-07 16:34:40,193 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:40,195 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 71 [2018-11-07 16:34:40,269 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:40,270 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:40,271 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:40,272 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:40,274 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:40,274 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:40,275 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:40,276 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:40,287 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 89 [2018-11-07 16:34:40,289 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-07 16:34:40,292 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:40,292 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:40,293 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:40,293 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:40,295 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:40,296 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:40,309 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 85 [2018-11-07 16:34:40,310 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-07 16:34:40,315 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:40,316 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:40,316 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:40,317 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:40,317 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:40,319 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 64 [2018-11-07 16:34:40,319 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-07 16:34:40,321 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:40,322 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:40,322 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:40,323 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:40,324 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:40,325 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:40,326 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:40,326 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:40,338 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 89 [2018-11-07 16:34:40,340 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-11-07 16:34:40,342 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:40,342 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:40,343 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:40,343 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:40,345 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:40,345 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:40,365 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 85 [2018-11-07 16:34:40,366 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-11-07 16:34:40,371 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-07 16:34:40,371 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-07 16:34:40,391 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:40,392 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:40,396 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:40,396 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:40,398 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:40,399 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:40,400 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:40,400 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:40,417 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 92 [2018-11-07 16:34:40,418 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-11-07 16:34:40,477 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:34:40,486 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:34:40,496 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:34:40,497 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:80, output treesize:14 [2018-11-07 16:34:41,896 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 16 proven. 59 refuted. 2 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-07 16:34:41,916 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:34:41,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 26, 26] total 61 [2018-11-07 16:34:41,916 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:34:41,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-11-07 16:34:41,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-11-07 16:34:41,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=547, Invalid=3093, Unknown=20, NotChecked=0, Total=3660 [2018-11-07 16:34:41,917 INFO L87 Difference]: Start difference. First operand 258 states and 281 transitions. Second operand 37 states. [2018-11-07 16:34:44,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:34:44,300 INFO L93 Difference]: Finished difference Result 540 states and 596 transitions. [2018-11-07 16:34:44,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-11-07 16:34:44,301 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 72 [2018-11-07 16:34:44,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:34:44,304 INFO L225 Difference]: With dead ends: 540 [2018-11-07 16:34:44,304 INFO L226 Difference]: Without dead ends: 457 [2018-11-07 16:34:44,306 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 101 SyntacticMatches, 12 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2914 ImplicationChecksByTransitivity, 43.5s TimeCoverageRelationStatistics Valid=1432, Invalid=6558, Unknown=20, NotChecked=0, Total=8010 [2018-11-07 16:34:44,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2018-11-07 16:34:44,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 307. [2018-11-07 16:34:44,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2018-11-07 16:34:44,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 338 transitions. [2018-11-07 16:34:44,349 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 338 transitions. Word has length 72 [2018-11-07 16:34:44,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:34:44,349 INFO L480 AbstractCegarLoop]: Abstraction has 307 states and 338 transitions. [2018-11-07 16:34:44,349 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-11-07 16:34:44,349 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 338 transitions. [2018-11-07 16:34:44,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-07 16:34:44,350 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:34:44,350 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:34:44,350 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:34:44,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:34:44,351 INFO L82 PathProgramCache]: Analyzing trace with hash -778514570, now seen corresponding path program 1 times [2018-11-07 16:34:44,351 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:34:44,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:34:44,352 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:34:44,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:34:44,352 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:34:44,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:34:45,457 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 1 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:34:45,457 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:34:45,458 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:34:45,458 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 75 with the following transitions: [2018-11-07 16:34:45,458 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [6], [7], [11], [14], [16], [17], [18], [22], [24], [27], [28], [29], [35], [37], [45], [47], [51], [53], [57], [61], [66], [67], [68], [70], [72], [80], [83], [85], [88], [90], [91], [92], [93], [95], [96] [2018-11-07 16:34:45,459 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 16:34:45,459 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 16:34:45,464 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 16:34:45,569 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 16:34:45,569 INFO L272 AbstractInterpreter]: Visited 38 different actions 255 times. Merged at 24 different actions 151 times. Widened at 4 different actions 8 times. Found 13 fixpoints after 5 different actions. Largest state had 25 variables. [2018-11-07 16:34:45,608 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:34:45,609 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 16:34:45,609 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:34:45,609 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:34:45,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:34:45,621 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:34:45,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:34:45,652 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:34:46,055 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-11-07 16:34:46,058 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:34:46,060 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2018-11-07 16:34:46,060 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 16:34:46,066 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:34:46,077 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-07 16:34:46,077 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:30 [2018-11-07 16:34:46,540 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2018-11-07 16:34:46,542 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:46,543 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:34:46,544 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:46,550 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 24 treesize of output 40 [2018-11-07 16:34:46,550 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 16:34:46,556 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:34:46,562 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:34:46,563 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:3 [2018-11-07 16:34:46,639 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 6 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:34:46,640 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:34:46,866 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 41 [2018-11-07 16:34:46,913 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:46,915 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:46,916 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:46,924 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 39 treesize of output 56 [2018-11-07 16:34:46,926 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-07 16:34:46,927 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:46,928 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:46,929 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:46,937 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 58 [2018-11-07 16:34:46,938 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-07 16:34:46,940 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:34:46,941 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2018-11-07 16:34:46,941 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-07 16:34:46,956 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:34:46,958 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:34:46,958 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:47, output treesize:11 [2018-11-07 16:34:47,086 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 6 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:34:47,105 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:34:47,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 22, 18] total 45 [2018-11-07 16:34:47,106 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:34:47,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-11-07 16:34:47,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-11-07 16:34:47,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=1795, Unknown=0, NotChecked=0, Total=1980 [2018-11-07 16:34:47,108 INFO L87 Difference]: Start difference. First operand 307 states and 338 transitions. Second operand 37 states. Received shutdown request... [2018-11-07 16:35:13,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-11-07 16:35:13,518 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-07 16:35:13,524 WARN L205 ceAbstractionStarter]: Timeout [2018-11-07 16:35:13,524 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 04:35:13 BoogieIcfgContainer [2018-11-07 16:35:13,524 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 16:35:13,525 INFO L168 Benchmark]: Toolchain (without parser) took 265915.83 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 869.3 MB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -460.2 MB). Peak memory consumption was 409.1 MB. Max. memory is 7.1 GB. [2018-11-07 16:35:13,526 INFO L168 Benchmark]: CDTParser took 0.22 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-11-07 16:35:13,526 INFO L168 Benchmark]: CACSL2BoogieTranslator took 293.59 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-07 16:35:13,526 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.91 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 16:35:13,526 INFO L168 Benchmark]: Boogie Preprocessor took 29.29 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 16:35:13,527 INFO L168 Benchmark]: RCFGBuilder took 583.03 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 740.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -775.0 MB). Peak memory consumption was 14.7 MB. Max. memory is 7.1 GB. [2018-11-07 16:35:13,527 INFO L168 Benchmark]: TraceAbstraction took 264979.86 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 128.5 MB). Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 304.2 MB). Peak memory consumption was 432.7 MB. Max. memory is 7.1 GB. [2018-11-07 16:35:13,528 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.22 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 293.59 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 21.91 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 29.29 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 583.03 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 740.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -775.0 MB). Peak memory consumption was 14.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 264979.86 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 128.5 MB). Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 304.2 MB). Peak memory consumption was 432.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 5]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 5). Cancelled while BasicCegarLoop was constructing difference of abstraction (307states) and FLOYD_HOARE automaton (currently 44 states, 37 states before enhancement),while ReachableStatesComputation was computing reachable states (368 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 46 locations, 1 error locations. TIMEOUT Result, 264.9s OverallTime, 21 OverallIterations, 5 TraceHistogramMax, 86.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 987 SDtfs, 4910 SDslu, 8326 SDs, 0 SdLazy, 13738 SolverSat, 1566 SolverUnsat, 29 SolverUnknown, 0 SolverNotchecked, 68.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2777 GetRequests, 1604 SyntacticMatches, 146 SemanticMatches, 1027 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 23394 ImplicationChecksByTransitivity, 177.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=307occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.8s AbstIntTime, 9 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 20 MinimizatonAttempts, 1354 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 174.4s InterpolantComputationTime, 2096 NumberOfCodeBlocks, 2091 NumberOfCodeBlocksAsserted, 53 NumberOfCheckSat, 3054 ConstructedInterpolants, 264 QuantifiedInterpolants, 2229349 SizeOfPredicates, 257 NumberOfNonLiveVariables, 2002 ConjunctsInSsa, 429 ConjunctsInUnsatCore, 57 InterpolantComputations, 3 PerfectInterpolantSequences, 576/1979 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown