java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default.epf -i ../../../trunk/examples/svcomp/loops/eureka_01_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 12:05:17,865 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 12:05:17,867 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 12:05:17,886 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 12:05:17,886 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 12:05:17,887 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 12:05:17,888 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 12:05:17,890 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 12:05:17,892 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 12:05:17,892 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 12:05:17,893 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 12:05:17,894 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 12:05:17,895 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 12:05:17,896 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 12:05:17,897 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 12:05:17,898 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 12:05:17,899 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 12:05:17,900 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 12:05:17,902 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 12:05:17,904 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 12:05:17,905 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 12:05:17,907 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 12:05:17,909 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 12:05:17,909 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 12:05:17,910 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 12:05:17,911 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 12:05:17,912 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 12:05:17,912 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 12:05:17,913 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 12:05:17,914 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 12:05:17,915 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 12:05:17,915 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 12:05:17,916 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 12:05:17,916 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 12:05:17,917 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 12:05:17,918 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 12:05:17,918 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default.epf [2018-10-24 12:05:17,934 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 12:05:17,935 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 12:05:17,935 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 12:05:17,936 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-24 12:05:17,936 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-24 12:05:17,936 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-24 12:05:17,936 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-24 12:05:17,937 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-24 12:05:17,937 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-24 12:05:17,937 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-24 12:05:17,937 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-24 12:05:17,937 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-24 12:05:17,938 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 12:05:17,938 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 12:05:17,939 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 12:05:17,939 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 12:05:17,939 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 12:05:17,939 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 12:05:17,939 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 12:05:17,939 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 12:05:17,940 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 12:05:17,940 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 12:05:17,940 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 12:05:17,940 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 12:05:17,940 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 12:05:17,941 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 12:05:17,941 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 12:05:17,941 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 12:05:17,941 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-24 12:05:17,941 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 12:05:17,943 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 12:05:17,943 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 12:05:17,943 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 12:05:17,944 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-24 12:05:18,014 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 12:05:18,034 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 12:05:18,039 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 12:05:18,040 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 12:05:18,041 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 12:05:18,041 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/loops/eureka_01_true-unreach-call.i [2018-10-24 12:05:18,106 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/79d76b0c6/60ddbb8e3701411da048aa9363b52237/FLAG15a97c6a7 [2018-10-24 12:05:18,589 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 12:05:18,590 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/eureka_01_true-unreach-call.i [2018-10-24 12:05:18,597 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/79d76b0c6/60ddbb8e3701411da048aa9363b52237/FLAG15a97c6a7 [2018-10-24 12:05:18,614 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/79d76b0c6/60ddbb8e3701411da048aa9363b52237 [2018-10-24 12:05:18,627 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 12:05:18,629 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 12:05:18,630 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 12:05:18,630 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 12:05:18,634 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 12:05:18,636 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:05:18" (1/1) ... [2018-10-24 12:05:18,639 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73d4e6ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:05:18, skipping insertion in model container [2018-10-24 12:05:18,640 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:05:18" (1/1) ... [2018-10-24 12:05:18,650 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 12:05:18,673 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 12:05:18,880 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 12:05:18,885 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 12:05:18,944 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 12:05:18,977 INFO L193 MainTranslator]: Completed translation [2018-10-24 12:05:18,978 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:05:18 WrapperNode [2018-10-24 12:05:18,978 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 12:05:18,979 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 12:05:18,979 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 12:05:18,980 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 12:05:18,990 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:05:18" (1/1) ... [2018-10-24 12:05:19,013 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:05:18" (1/1) ... [2018-10-24 12:05:19,086 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 12:05:19,087 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 12:05:19,087 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 12:05:19,087 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 12:05:19,099 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:05:18" (1/1) ... [2018-10-24 12:05:19,099 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:05:18" (1/1) ... [2018-10-24 12:05:19,116 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:05:18" (1/1) ... [2018-10-24 12:05:19,116 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:05:18" (1/1) ... [2018-10-24 12:05:19,150 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:05:18" (1/1) ... [2018-10-24 12:05:19,241 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:05:18" (1/1) ... [2018-10-24 12:05:19,244 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:05:18" (1/1) ... [2018-10-24 12:05:19,248 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 12:05:19,248 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 12:05:19,248 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 12:05:19,249 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 12:05:19,249 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:05:18" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 12:05:19,317 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-24 12:05:19,318 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-24 12:05:19,318 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 12:05:19,318 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 12:05:19,318 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-24 12:05:19,319 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-24 12:05:19,319 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-10-24 12:05:19,319 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-10-24 12:05:20,594 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 12:05:20,595 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:05:20 BoogieIcfgContainer [2018-10-24 12:05:20,595 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 12:05:20,596 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 12:05:20,596 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 12:05:20,599 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 12:05:20,599 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 12:05:18" (1/3) ... [2018-10-24 12:05:20,600 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1af4b7f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:05:20, skipping insertion in model container [2018-10-24 12:05:20,601 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:05:18" (2/3) ... [2018-10-24 12:05:20,601 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1af4b7f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:05:20, skipping insertion in model container [2018-10-24 12:05:20,601 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:05:20" (3/3) ... [2018-10-24 12:05:20,603 INFO L112 eAbstractionObserver]: Analyzing ICFG eureka_01_true-unreach-call.i [2018-10-24 12:05:20,613 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 12:05:20,621 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 12:05:20,639 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 12:05:20,674 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 12:05:20,674 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 12:05:20,674 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 12:05:20,675 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 12:05:20,675 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 12:05:20,675 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 12:05:20,675 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 12:05:20,676 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 12:05:20,696 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2018-10-24 12:05:20,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-24 12:05:20,705 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:05:20,707 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:05:20,714 INFO L424 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:05:20,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:05:20,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1090382313, now seen corresponding path program 1 times [2018-10-24 12:05:20,723 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:05:20,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:05:20,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:05:20,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:05:20,774 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:05:20,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:05:20,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:05:20,973 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 12:05:20,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 12:05:20,973 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 12:05:20,979 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-24 12:05:20,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-24 12:05:20,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-24 12:05:20,999 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 2 states. [2018-10-24 12:05:21,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:05:21,028 INFO L93 Difference]: Finished difference Result 70 states and 94 transitions. [2018-10-24 12:05:21,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-24 12:05:21,030 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2018-10-24 12:05:21,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:05:21,042 INFO L225 Difference]: With dead ends: 70 [2018-10-24 12:05:21,045 INFO L226 Difference]: Without dead ends: 35 [2018-10-24 12:05:21,050 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-24 12:05:21,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-24 12:05:21,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-10-24 12:05:21,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-10-24 12:05:21,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2018-10-24 12:05:21,097 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 18 [2018-10-24 12:05:21,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:05:21,097 INFO L481 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2018-10-24 12:05:21,098 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-24 12:05:21,098 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2018-10-24 12:05:21,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-24 12:05:21,099 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:05:21,099 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:05:21,100 INFO L424 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:05:21,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:05:21,100 INFO L82 PathProgramCache]: Analyzing trace with hash -448793496, now seen corresponding path program 1 times [2018-10-24 12:05:21,101 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:05:21,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:05:21,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:05:21,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:05:21,103 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:05:21,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:05:21,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:05:21,256 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 12:05:21,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 12:05:21,256 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 12:05:21,259 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 12:05:21,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 12:05:21,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 12:05:21,260 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand 3 states. [2018-10-24 12:05:21,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:05:21,392 INFO L93 Difference]: Finished difference Result 64 states and 76 transitions. [2018-10-24 12:05:21,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 12:05:21,393 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-10-24 12:05:21,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:05:21,394 INFO L225 Difference]: With dead ends: 64 [2018-10-24 12:05:21,395 INFO L226 Difference]: Without dead ends: 39 [2018-10-24 12:05:21,396 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 12:05:21,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-24 12:05:21,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2018-10-24 12:05:21,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-10-24 12:05:21,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2018-10-24 12:05:21,404 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 21 [2018-10-24 12:05:21,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:05:21,405 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2018-10-24 12:05:21,405 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 12:05:21,405 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2018-10-24 12:05:21,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-24 12:05:21,406 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:05:21,406 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] [2018-10-24 12:05:21,407 INFO L424 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:05:21,407 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:05:21,407 INFO L82 PathProgramCache]: Analyzing trace with hash -1500559425, now seen corresponding path program 1 times [2018-10-24 12:05:21,407 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:05:21,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:05:21,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:05:21,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:05:21,409 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:05:21,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:05:21,551 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:05:21,551 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:05:21,552 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:05:21,553 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 26 with the following transitions: [2018-10-24 12:05:21,555 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [17], [21], [25], [29], [32], [58], [62], [65], [77], [81], [86], [96], [99], [101], [107], [108], [109], [111] [2018-10-24 12:05:21,613 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-24 12:05:21,613 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 12:05:22,177 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-24 12:05:22,180 INFO L272 AbstractInterpreter]: Visited 11 different actions 15 times. Merged at 3 different actions 3 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 48 variables. [2018-10-24 12:05:22,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:05:22,204 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-24 12:05:22,806 INFO L232 lantSequenceWeakener]: Weakened 11 states. On average, predicates are now at 91.54% of their original sizes. [2018-10-24 12:05:22,806 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-24 12:05:23,023 INFO L413 sIntCurrentIteration]: We have 24 unified AI predicates [2018-10-24 12:05:23,024 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-24 12:05:23,025 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 12:05:23,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 7 [2018-10-24 12:05:23,026 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 12:05:23,027 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 12:05:23,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 12:05:23,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-24 12:05:23,028 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand 5 states. [2018-10-24 12:05:24,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:05:24,647 INFO L93 Difference]: Finished difference Result 72 states and 87 transitions. [2018-10-24 12:05:24,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 12:05:24,647 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-10-24 12:05:24,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:05:24,648 INFO L225 Difference]: With dead ends: 72 [2018-10-24 12:05:24,648 INFO L226 Difference]: Without dead ends: 43 [2018-10-24 12:05:24,649 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 25 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-10-24 12:05:24,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-24 12:05:24,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2018-10-24 12:05:24,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-10-24 12:05:24,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2018-10-24 12:05:24,662 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 25 [2018-10-24 12:05:24,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:05:24,662 INFO L481 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2018-10-24 12:05:24,663 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 12:05:24,663 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2018-10-24 12:05:24,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-24 12:05:24,664 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:05:24,665 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-24 12:05:24,665 INFO L424 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:05:24,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:05:24,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1612370840, now seen corresponding path program 1 times [2018-10-24 12:05:24,665 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:05:24,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:05:24,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:05:24,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:05:24,667 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:05:24,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:05:25,018 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:05:25,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:05:25,018 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:05:25,019 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 30 with the following transitions: [2018-10-24 12:05:25,019 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [17], [19], [21], [25], [29], [32], [58], [62], [65], [77], [81], [86], [96], [99], [101], [107], [108], [109], [111] [2018-10-24 12:05:25,023 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-24 12:05:25,023 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 12:05:26,567 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-24 12:05:26,567 INFO L272 AbstractInterpreter]: Visited 15 different actions 57 times. Merged at 5 different actions 29 times. Widened at 1 different actions 2 times. Found 7 fixpoints after 4 different actions. Largest state had 48 variables. [2018-10-24 12:05:26,605 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:05:26,606 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-24 12:05:26,805 INFO L232 lantSequenceWeakener]: Weakened 18 states. On average, predicates are now at 79.38% of their original sizes. [2018-10-24 12:05:26,805 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-24 12:05:27,351 INFO L413 sIntCurrentIteration]: We have 28 unified AI predicates [2018-10-24 12:05:27,352 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-24 12:05:27,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 12:05:27,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 12 [2018-10-24 12:05:27,352 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 12:05:27,353 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-24 12:05:27,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-24 12:05:27,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-10-24 12:05:27,356 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand 9 states. [2018-10-24 12:05:28,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:05:28,821 INFO L93 Difference]: Finished difference Result 98 states and 118 transitions. [2018-10-24 12:05:28,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-24 12:05:28,821 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2018-10-24 12:05:28,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:05:28,824 INFO L225 Difference]: With dead ends: 98 [2018-10-24 12:05:28,825 INFO L226 Difference]: Without dead ends: 73 [2018-10-24 12:05:28,826 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 33 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=75, Invalid=107, Unknown=0, NotChecked=0, Total=182 [2018-10-24 12:05:28,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-10-24 12:05:28,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 60. [2018-10-24 12:05:28,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-10-24 12:05:28,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 68 transitions. [2018-10-24 12:05:28,857 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 68 transitions. Word has length 29 [2018-10-24 12:05:28,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:05:28,859 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 68 transitions. [2018-10-24 12:05:28,859 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-24 12:05:28,859 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 68 transitions. [2018-10-24 12:05:28,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-10-24 12:05:28,862 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:05:28,862 INFO L375 BasicCegarLoop]: trace histogram [4, 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-10-24 12:05:28,862 INFO L424 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:05:28,863 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:05:28,864 INFO L82 PathProgramCache]: Analyzing trace with hash 1288211203, now seen corresponding path program 1 times [2018-10-24 12:05:28,864 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:05:28,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:05:28,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:05:28,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:05:28,866 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:05:28,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:05:29,124 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-10-24 12:05:29,124 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:05:29,125 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:05:29,125 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 52 with the following transitions: [2018-10-24 12:05:29,125 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [17], [19], [21], [25], [29], [32], [34], [38], [41], [54], [58], [62], [65], [67], [71], [73], [77], [81], [86], [96], [99], [101], [107], [108], [109], [111] [2018-10-24 12:05:29,132 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-24 12:05:29,132 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 12:05:30,454 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-24 12:05:30,455 INFO L272 AbstractInterpreter]: Visited 18 different actions 60 times. Merged at 5 different actions 29 times. Widened at 1 different actions 2 times. Found 7 fixpoints after 4 different actions. Largest state had 55 variables. [2018-10-24 12:05:30,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:05:30,493 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-24 12:05:30,805 INFO L232 lantSequenceWeakener]: Weakened 26 states. On average, predicates are now at 61.32% of their original sizes. [2018-10-24 12:05:30,805 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-24 12:05:31,328 INFO L413 sIntCurrentIteration]: We have 50 unified AI predicates [2018-10-24 12:05:31,328 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-24 12:05:31,328 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 12:05:31,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [5] total 13 [2018-10-24 12:05:31,329 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 12:05:31,329 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-24 12:05:31,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-24 12:05:31,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-10-24 12:05:31,330 INFO L87 Difference]: Start difference. First operand 60 states and 68 transitions. Second operand 10 states. [2018-10-24 12:05:32,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:05:32,945 INFO L93 Difference]: Finished difference Result 110 states and 125 transitions. [2018-10-24 12:05:32,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-24 12:05:32,946 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 51 [2018-10-24 12:05:32,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:05:32,947 INFO L225 Difference]: With dead ends: 110 [2018-10-24 12:05:32,947 INFO L226 Difference]: Without dead ends: 73 [2018-10-24 12:05:32,948 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 56 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=96, Invalid=144, Unknown=0, NotChecked=0, Total=240 [2018-10-24 12:05:32,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-10-24 12:05:32,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 62. [2018-10-24 12:05:32,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-10-24 12:05:32,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 70 transitions. [2018-10-24 12:05:32,976 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 70 transitions. Word has length 51 [2018-10-24 12:05:32,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:05:32,977 INFO L481 AbstractCegarLoop]: Abstraction has 62 states and 70 transitions. [2018-10-24 12:05:32,977 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-24 12:05:32,977 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 70 transitions. [2018-10-24 12:05:32,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-10-24 12:05:32,978 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:05:32,979 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:05:32,979 INFO L424 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:05:32,979 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:05:32,979 INFO L82 PathProgramCache]: Analyzing trace with hash -425294966, now seen corresponding path program 1 times [2018-10-24 12:05:32,980 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:05:32,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:05:32,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:05:32,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:05:32,981 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:05:33,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:05:33,301 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-10-24 12:05:33,301 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:05:33,301 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:05:33,302 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 56 with the following transitions: [2018-10-24 12:05:33,302 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [17], [19], [21], [25], [29], [32], [34], [38], [41], [43], [48], [50], [54], [58], [62], [65], [67], [71], [73], [77], [81], [86], [96], [99], [101], [107], [108], [109], [111] [2018-10-24 12:05:33,305 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-24 12:05:33,305 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 12:05:38,893 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-24 12:05:38,893 INFO L272 AbstractInterpreter]: Visited 35 different actions 324 times. Merged at 17 different actions 224 times. Widened at 5 different actions 42 times. Found 16 fixpoints after 9 different actions. Largest state had 61 variables. [2018-10-24 12:05:38,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:05:38,900 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-24 12:05:38,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:05:38,900 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:05:38,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:05:38,910 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 12:05:38,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:05:38,977 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:05:39,118 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-10-24 12:05:39,119 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:05:39,483 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-10-24 12:05:39,514 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:05:39,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2018-10-24 12:05:39,515 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:05:39,515 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-24 12:05:39,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-24 12:05:39,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=46, Unknown=0, NotChecked=0, Total=90 [2018-10-24 12:05:39,516 INFO L87 Difference]: Start difference. First operand 62 states and 70 transitions. Second operand 8 states. [2018-10-24 12:05:40,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:05:40,100 INFO L93 Difference]: Finished difference Result 121 states and 138 transitions. [2018-10-24 12:05:40,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 12:05:40,101 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 55 [2018-10-24 12:05:40,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:05:40,102 INFO L225 Difference]: With dead ends: 121 [2018-10-24 12:05:40,102 INFO L226 Difference]: Without dead ends: 75 [2018-10-24 12:05:40,103 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 105 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=44, Invalid=46, Unknown=0, NotChecked=0, Total=90 [2018-10-24 12:05:40,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-10-24 12:05:40,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 66. [2018-10-24 12:05:40,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-10-24 12:05:40,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 75 transitions. [2018-10-24 12:05:40,133 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 75 transitions. Word has length 55 [2018-10-24 12:05:40,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:05:40,133 INFO L481 AbstractCegarLoop]: Abstraction has 66 states and 75 transitions. [2018-10-24 12:05:40,133 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-24 12:05:40,133 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 75 transitions. [2018-10-24 12:05:40,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-10-24 12:05:40,134 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:05:40,135 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:05:40,135 INFO L424 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:05:40,135 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:05:40,135 INFO L82 PathProgramCache]: Analyzing trace with hash -838188767, now seen corresponding path program 2 times [2018-10-24 12:05:40,136 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:05:40,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:05:40,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:05:40,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:05:40,137 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:05:40,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:05:40,422 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-10-24 12:05:40,423 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:05:40,423 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:05:40,423 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:05:40,424 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:05:40,424 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:05:40,424 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:05:40,442 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-24 12:05:40,443 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-24 12:05:40,641 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-10-24 12:05:40,641 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:05:40,648 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:05:40,704 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-10-24 12:05:40,704 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:05:40,759 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-10-24 12:05:40,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-10-24 12:05:40,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7, 4] total 11 [2018-10-24 12:05:40,781 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 12:05:40,782 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 12:05:40,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 12:05:40,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-10-24 12:05:40,783 INFO L87 Difference]: Start difference. First operand 66 states and 75 transitions. Second operand 4 states. [2018-10-24 12:05:40,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:05:40,899 INFO L93 Difference]: Finished difference Result 106 states and 122 transitions. [2018-10-24 12:05:40,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 12:05:40,899 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2018-10-24 12:05:40,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:05:40,901 INFO L225 Difference]: With dead ends: 106 [2018-10-24 12:05:40,901 INFO L226 Difference]: Without dead ends: 72 [2018-10-24 12:05:40,902 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-10-24 12:05:40,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-10-24 12:05:40,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 68. [2018-10-24 12:05:40,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-10-24 12:05:40,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 77 transitions. [2018-10-24 12:05:40,933 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 77 transitions. Word has length 59 [2018-10-24 12:05:40,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:05:40,933 INFO L481 AbstractCegarLoop]: Abstraction has 68 states and 77 transitions. [2018-10-24 12:05:40,934 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 12:05:40,934 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 77 transitions. [2018-10-24 12:05:40,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-10-24 12:05:40,935 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:05:40,935 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:05:40,935 INFO L424 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:05:40,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:05:40,936 INFO L82 PathProgramCache]: Analyzing trace with hash -348759238, now seen corresponding path program 3 times [2018-10-24 12:05:40,936 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:05:40,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:05:40,937 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:05:40,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:05:40,937 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:05:40,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:05:41,223 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-10-24 12:05:41,224 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:05:41,224 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:05:41,224 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:05:41,224 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:05:41,225 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:05:41,225 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:05:41,236 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-24 12:05:41,237 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-24 12:05:41,288 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-24 12:05:41,288 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:05:41,292 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:05:41,344 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-10-24 12:05:41,344 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:05:41,439 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-10-24 12:05:41,461 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-24 12:05:41,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [7] total 9 [2018-10-24 12:05:41,462 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 12:05:41,462 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 12:05:41,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 12:05:41,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-10-24 12:05:41,463 INFO L87 Difference]: Start difference. First operand 68 states and 77 transitions. Second operand 4 states. [2018-10-24 12:05:41,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:05:41,670 INFO L93 Difference]: Finished difference Result 123 states and 140 transitions. [2018-10-24 12:05:41,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 12:05:41,670 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2018-10-24 12:05:41,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:05:41,671 INFO L225 Difference]: With dead ends: 123 [2018-10-24 12:05:41,671 INFO L226 Difference]: Without dead ends: 68 [2018-10-24 12:05:41,672 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 123 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-10-24 12:05:41,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-10-24 12:05:41,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-10-24 12:05:41,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-10-24 12:05:41,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 75 transitions. [2018-10-24 12:05:41,695 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 75 transitions. Word has length 63 [2018-10-24 12:05:41,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:05:41,695 INFO L481 AbstractCegarLoop]: Abstraction has 68 states and 75 transitions. [2018-10-24 12:05:41,695 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 12:05:41,696 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 75 transitions. [2018-10-24 12:05:41,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-10-24 12:05:41,697 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:05:41,697 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:05:41,697 INFO L424 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:05:41,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:05:41,697 INFO L82 PathProgramCache]: Analyzing trace with hash 1917621948, now seen corresponding path program 4 times [2018-10-24 12:05:41,697 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:05:41,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:05:41,698 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:05:41,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:05:41,699 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:05:41,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:05:42,069 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-10-24 12:05:42,070 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:05:42,070 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:05:42,070 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:05:42,070 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:05:42,070 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:05:42,070 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:05:42,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:05:42,079 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 12:05:42,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:05:42,143 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:05:42,318 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-10-24 12:05:42,319 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:05:42,384 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-10-24 12:05:42,406 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:05:42,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2018-10-24 12:05:42,407 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:05:42,407 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-24 12:05:42,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-24 12:05:42,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=58, Unknown=0, NotChecked=0, Total=110 [2018-10-24 12:05:42,408 INFO L87 Difference]: Start difference. First operand 68 states and 75 transitions. Second operand 10 states. [2018-10-24 12:05:42,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:05:42,913 INFO L93 Difference]: Finished difference Result 122 states and 136 transitions. [2018-10-24 12:05:42,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-24 12:05:42,913 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 63 [2018-10-24 12:05:42,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:05:42,914 INFO L225 Difference]: With dead ends: 122 [2018-10-24 12:05:42,914 INFO L226 Difference]: Without dead ends: 74 [2018-10-24 12:05:42,915 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 119 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=52, Invalid=58, Unknown=0, NotChecked=0, Total=110 [2018-10-24 12:05:42,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-10-24 12:05:42,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 72. [2018-10-24 12:05:42,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-10-24 12:05:42,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 79 transitions. [2018-10-24 12:05:42,940 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 79 transitions. Word has length 63 [2018-10-24 12:05:42,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:05:42,940 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 79 transitions. [2018-10-24 12:05:42,941 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-24 12:05:42,941 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2018-10-24 12:05:42,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-10-24 12:05:42,942 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:05:42,942 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 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] [2018-10-24 12:05:42,942 INFO L424 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:05:42,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:05:42,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1817610283, now seen corresponding path program 5 times [2018-10-24 12:05:42,943 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:05:42,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:05:42,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:05:42,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:05:42,944 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:05:42,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:05:43,062 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-10-24 12:05:43,062 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:05:43,062 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:05:43,062 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:05:43,063 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:05:43,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:05:43,063 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:05:43,076 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-24 12:05:43,076 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-24 12:05:43,328 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-10-24 12:05:43,328 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:05:43,332 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:05:43,400 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-10-24 12:05:43,400 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:05:43,444 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-10-24 12:05:43,466 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:05:43,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 12 [2018-10-24 12:05:43,467 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:05:43,467 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-24 12:05:43,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-24 12:05:43,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2018-10-24 12:05:43,468 INFO L87 Difference]: Start difference. First operand 72 states and 79 transitions. Second operand 11 states. [2018-10-24 12:05:44,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:05:44,066 INFO L93 Difference]: Finished difference Result 185 states and 214 transitions. [2018-10-24 12:05:44,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-24 12:05:44,066 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2018-10-24 12:05:44,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:05:44,068 INFO L225 Difference]: With dead ends: 185 [2018-10-24 12:05:44,068 INFO L226 Difference]: Without dead ends: 137 [2018-10-24 12:05:44,069 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 127 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=105, Unknown=0, NotChecked=0, Total=182 [2018-10-24 12:05:44,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-10-24 12:05:44,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 103. [2018-10-24 12:05:44,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-10-24 12:05:44,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 116 transitions. [2018-10-24 12:05:44,107 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 116 transitions. Word has length 67 [2018-10-24 12:05:44,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:05:44,107 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 116 transitions. [2018-10-24 12:05:44,108 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-24 12:05:44,108 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 116 transitions. [2018-10-24 12:05:44,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-10-24 12:05:44,109 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:05:44,110 INFO L375 BasicCegarLoop]: trace histogram [10, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:05:44,110 INFO L424 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:05:44,110 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:05:44,110 INFO L82 PathProgramCache]: Analyzing trace with hash -1269599739, now seen corresponding path program 6 times [2018-10-24 12:05:44,110 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:05:44,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:05:44,111 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:05:44,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:05:44,112 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:05:44,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:05:44,440 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 50 proven. 2 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2018-10-24 12:05:44,441 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:05:44,441 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:05:44,441 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:05:44,441 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:05:44,441 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:05:44,442 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:05:44,461 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-24 12:05:44,461 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-24 12:05:44,531 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-24 12:05:44,531 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:05:44,538 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:05:45,052 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 24 proven. 42 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2018-10-24 12:05:45,052 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:05:45,101 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 24 proven. 42 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2018-10-24 12:05:45,123 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:05:45,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 12 [2018-10-24 12:05:45,124 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:05:45,124 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-24 12:05:45,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-24 12:05:45,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-10-24 12:05:45,125 INFO L87 Difference]: Start difference. First operand 103 states and 116 transitions. Second operand 10 states. [2018-10-24 12:05:45,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:05:45,415 INFO L93 Difference]: Finished difference Result 199 states and 237 transitions. [2018-10-24 12:05:45,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 12:05:45,416 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 98 [2018-10-24 12:05:45,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:05:45,417 INFO L225 Difference]: With dead ends: 199 [2018-10-24 12:05:45,417 INFO L226 Difference]: Without dead ends: 133 [2018-10-24 12:05:45,419 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 187 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2018-10-24 12:05:45,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-10-24 12:05:45,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 123. [2018-10-24 12:05:45,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-10-24 12:05:45,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 141 transitions. [2018-10-24 12:05:45,452 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 141 transitions. Word has length 98 [2018-10-24 12:05:45,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:05:45,452 INFO L481 AbstractCegarLoop]: Abstraction has 123 states and 141 transitions. [2018-10-24 12:05:45,452 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-24 12:05:45,453 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 141 transitions. [2018-10-24 12:05:45,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-10-24 12:05:45,454 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:05:45,454 INFO L375 BasicCegarLoop]: trace histogram [15, 10, 10, 10, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:05:45,454 INFO L424 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:05:45,454 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:05:45,454 INFO L82 PathProgramCache]: Analyzing trace with hash 744309214, now seen corresponding path program 7 times [2018-10-24 12:05:45,455 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:05:45,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:05:45,455 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:05:45,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:05:45,456 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:05:45,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:05:45,659 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 114 proven. 8 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2018-10-24 12:05:45,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:05:45,660 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:05:45,660 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:05:45,660 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:05:45,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:05:45,660 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:05:45,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:05:45,669 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 12:05:45,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:05:45,754 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:05:45,848 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 114 proven. 8 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2018-10-24 12:05:45,848 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:05:45,951 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 114 proven. 8 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2018-10-24 12:05:45,973 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:05:45,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2018-10-24 12:05:45,973 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:05:45,974 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-24 12:05:45,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-24 12:05:45,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=89, Unknown=0, NotChecked=0, Total=156 [2018-10-24 12:05:45,976 INFO L87 Difference]: Start difference. First operand 123 states and 141 transitions. Second operand 9 states. [2018-10-24 12:05:46,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:05:46,300 INFO L93 Difference]: Finished difference Result 235 states and 282 transitions. [2018-10-24 12:05:46,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-24 12:05:46,300 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2018-10-24 12:05:46,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:05:46,302 INFO L225 Difference]: With dead ends: 235 [2018-10-24 12:05:46,302 INFO L226 Difference]: Without dead ends: 153 [2018-10-24 12:05:46,303 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=89, Unknown=0, NotChecked=0, Total=156 [2018-10-24 12:05:46,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-10-24 12:05:46,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 143. [2018-10-24 12:05:46,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-10-24 12:05:46,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 166 transitions. [2018-10-24 12:05:46,340 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 166 transitions. Word has length 118 [2018-10-24 12:05:46,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:05:46,341 INFO L481 AbstractCegarLoop]: Abstraction has 143 states and 166 transitions. [2018-10-24 12:05:46,341 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-24 12:05:46,341 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 166 transitions. [2018-10-24 12:05:46,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-10-24 12:05:46,342 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:05:46,342 INFO L375 BasicCegarLoop]: trace histogram [20, 15, 15, 15, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:05:46,343 INFO L424 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:05:46,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:05:46,343 INFO L82 PathProgramCache]: Analyzing trace with hash 837643063, now seen corresponding path program 8 times [2018-10-24 12:05:46,343 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:05:46,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:05:46,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:05:46,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:05:46,344 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:05:46,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:05:46,523 INFO L134 CoverageAnalysis]: Checked inductivity of 698 backedges. 210 proven. 18 refuted. 0 times theorem prover too weak. 470 trivial. 0 not checked. [2018-10-24 12:05:46,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:05:46,523 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:05:46,523 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:05:46,524 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:05:46,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:05:46,524 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:05:46,532 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-24 12:05:46,533 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-24 12:05:46,887 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-10-24 12:05:46,887 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:05:46,892 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:05:47,004 INFO L134 CoverageAnalysis]: Checked inductivity of 698 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 680 trivial. 0 not checked. [2018-10-24 12:05:47,005 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:05:47,122 INFO L134 CoverageAnalysis]: Checked inductivity of 698 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 680 trivial. 0 not checked. [2018-10-24 12:05:47,151 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:05:47,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2018-10-24 12:05:47,151 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:05:47,152 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-24 12:05:47,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-24 12:05:47,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2018-10-24 12:05:47,153 INFO L87 Difference]: Start difference. First operand 143 states and 166 transitions. Second operand 11 states. [2018-10-24 12:05:47,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:05:47,823 INFO L93 Difference]: Finished difference Result 297 states and 358 transitions. [2018-10-24 12:05:47,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-24 12:05:47,823 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 138 [2018-10-24 12:05:47,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:05:47,825 INFO L225 Difference]: With dead ends: 297 [2018-10-24 12:05:47,825 INFO L226 Difference]: Without dead ends: 199 [2018-10-24 12:05:47,826 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 268 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=426, Invalid=764, Unknown=0, NotChecked=0, Total=1190 [2018-10-24 12:05:47,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-10-24 12:05:47,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 167. [2018-10-24 12:05:47,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-10-24 12:05:47,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 195 transitions. [2018-10-24 12:05:47,873 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 195 transitions. Word has length 138 [2018-10-24 12:05:47,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:05:47,873 INFO L481 AbstractCegarLoop]: Abstraction has 167 states and 195 transitions. [2018-10-24 12:05:47,874 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-24 12:05:47,874 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 195 transitions. [2018-10-24 12:05:47,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-10-24 12:05:47,875 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:05:47,876 INFO L375 BasicCegarLoop]: trace histogram [25, 20, 20, 20, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:05:47,876 INFO L424 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:05:47,876 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:05:47,876 INFO L82 PathProgramCache]: Analyzing trace with hash -1713657975, now seen corresponding path program 9 times [2018-10-24 12:05:47,876 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:05:47,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:05:47,877 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:05:47,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:05:47,877 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:05:47,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:05:48,043 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 338 proven. 32 refuted. 0 times theorem prover too weak. 732 trivial. 0 not checked. [2018-10-24 12:05:48,043 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:05:48,044 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:05:48,044 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:05:48,044 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:05:48,044 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:05:48,044 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:05:48,053 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-24 12:05:48,053 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-24 12:05:48,215 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-24 12:05:48,215 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:05:48,222 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:05:48,255 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 15 treesize of output 12 [2018-10-24 12:05:48,257 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-10-24 12:05:48,258 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:05:48,259 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:05:48,268 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:05:48,269 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:15 [2018-10-24 12:05:48,333 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2018-10-24 12:05:48,342 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:05:48,345 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 29 [2018-10-24 12:05:48,346 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:05:48,364 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:05:48,374 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:05:48,374 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:12 [2018-10-24 12:05:48,418 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2018-10-24 12:05:48,420 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:05:48,422 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 29 [2018-10-24 12:05:48,423 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:05:48,431 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:05:48,439 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:05:48,440 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:12 [2018-10-24 12:05:48,487 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2018-10-24 12:05:48,505 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:05:48,507 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 29 [2018-10-24 12:05:48,507 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:05:48,516 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:05:48,523 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:05:48,524 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:12 [2018-10-24 12:05:48,557 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2018-10-24 12:05:48,560 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:05:48,562 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 29 [2018-10-24 12:05:48,563 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:05:48,569 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:05:48,581 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:05:48,582 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:16 [2018-10-24 12:05:49,660 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 20 treesize of output 16 [2018-10-24 12:05:49,685 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:05:49,686 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-10-24 12:05:49,686 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:05:49,705 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:05:49,716 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:05:49,716 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:26, output treesize:3 [2018-10-24 12:05:49,912 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 14 proven. 896 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2018-10-24 12:05:49,912 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:05:51,485 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 14 proven. 896 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2018-10-24 12:05:51,507 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:05:51,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 23, 23] total 49 [2018-10-24 12:05:51,508 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:05:51,508 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-24 12:05:51,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-24 12:05:51,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=262, Invalid=2090, Unknown=0, NotChecked=0, Total=2352 [2018-10-24 12:05:51,511 INFO L87 Difference]: Start difference. First operand 167 states and 195 transitions. Second operand 29 states. [2018-10-24 12:05:58,129 WARN L179 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 30 [2018-10-24 12:05:59,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:05:59,776 INFO L93 Difference]: Finished difference Result 640 states and 783 transitions. [2018-10-24 12:05:59,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-10-24 12:05:59,776 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 162 [2018-10-24 12:05:59,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:05:59,782 INFO L225 Difference]: With dead ends: 640 [2018-10-24 12:05:59,782 INFO L226 Difference]: Without dead ends: 522 [2018-10-24 12:05:59,789 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 287 SyntacticMatches, 3 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 4053 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=2153, Invalid=13849, Unknown=0, NotChecked=0, Total=16002 [2018-10-24 12:05:59,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2018-10-24 12:05:59,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 384. [2018-10-24 12:05:59,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2018-10-24 12:05:59,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 457 transitions. [2018-10-24 12:05:59,897 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 457 transitions. Word has length 162 [2018-10-24 12:05:59,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:05:59,897 INFO L481 AbstractCegarLoop]: Abstraction has 384 states and 457 transitions. [2018-10-24 12:05:59,897 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-24 12:05:59,897 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 457 transitions. [2018-10-24 12:05:59,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-10-24 12:05:59,899 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:05:59,900 INFO L375 BasicCegarLoop]: trace histogram [30, 25, 25, 24, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:05:59,900 INFO L424 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:05:59,900 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:05:59,900 INFO L82 PathProgramCache]: Analyzing trace with hash 2043606880, now seen corresponding path program 1 times [2018-10-24 12:05:59,900 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:05:59,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:05:59,901 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:05:59,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:05:59,901 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:05:59,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:06:00,216 INFO L134 CoverageAnalysis]: Checked inductivity of 1592 backedges. 498 proven. 50 refuted. 0 times theorem prover too weak. 1044 trivial. 0 not checked. [2018-10-24 12:06:00,217 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:06:00,217 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:06:00,217 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 183 with the following transitions: [2018-10-24 12:06:00,217 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [17], [19], [21], [25], [29], [32], [34], [38], [41], [43], [46], [48], [50], [54], [58], [62], [65], [67], [71], [73], [77], [81], [86], [96], [99], [101], [107], [108], [109], [111] [2018-10-24 12:06:00,221 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-24 12:06:00,222 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 12:06:08,311 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-24 12:06:08,312 INFO L272 AbstractInterpreter]: Visited 36 different actions 349 times. Merged at 17 different actions 224 times. Widened at 5 different actions 42 times. Found 41 fixpoints after 10 different actions. Largest state had 63 variables. [2018-10-24 12:06:08,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:06:08,348 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-24 12:06:08,348 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:06:08,348 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:06:08,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:06:08,359 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 12:06:08,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:06:08,485 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:06:09,734 INFO L134 CoverageAnalysis]: Checked inductivity of 1592 backedges. 498 proven. 50 refuted. 0 times theorem prover too weak. 1044 trivial. 0 not checked. [2018-10-24 12:06:09,734 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:06:11,393 INFO L134 CoverageAnalysis]: Checked inductivity of 1592 backedges. 498 proven. 50 refuted. 0 times theorem prover too weak. 1044 trivial. 0 not checked. [2018-10-24 12:06:11,423 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:06:11,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2018-10-24 12:06:11,424 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:06:11,424 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-24 12:06:11,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-24 12:06:11,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=263, Unknown=0, NotChecked=0, Total=462 [2018-10-24 12:06:11,425 INFO L87 Difference]: Start difference. First operand 384 states and 457 transitions. Second operand 15 states. [2018-10-24 12:06:12,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:06:12,569 INFO L93 Difference]: Finished difference Result 752 states and 917 transitions. [2018-10-24 12:06:12,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-24 12:06:12,570 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 182 [2018-10-24 12:06:12,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:06:12,576 INFO L225 Difference]: With dead ends: 752 [2018-10-24 12:06:12,576 INFO L226 Difference]: Without dead ends: 450 [2018-10-24 12:06:12,577 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 352 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=199, Invalid=263, Unknown=0, NotChecked=0, Total=462 [2018-10-24 12:06:12,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2018-10-24 12:06:12,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 428. [2018-10-24 12:06:12,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2018-10-24 12:06:12,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 512 transitions. [2018-10-24 12:06:12,704 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 512 transitions. Word has length 182 [2018-10-24 12:06:12,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:06:12,704 INFO L481 AbstractCegarLoop]: Abstraction has 428 states and 512 transitions. [2018-10-24 12:06:12,704 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-24 12:06:12,705 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 512 transitions. [2018-10-24 12:06:12,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-10-24 12:06:12,709 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:06:12,710 INFO L375 BasicCegarLoop]: trace histogram [35, 30, 30, 29, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:06:12,710 INFO L424 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:06:12,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:06:12,710 INFO L82 PathProgramCache]: Analyzing trace with hash -35841863, now seen corresponding path program 2 times [2018-10-24 12:06:12,710 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:06:12,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:06:12,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:06:12,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:06:12,711 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:06:12,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:06:13,735 INFO L134 CoverageAnalysis]: Checked inductivity of 2182 backedges. 690 proven. 72 refuted. 0 times theorem prover too weak. 1420 trivial. 0 not checked. [2018-10-24 12:06:13,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:06:13,736 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:06:13,736 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:06:13,736 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:06:13,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:06:13,737 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-10-24 12:06:13,750 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-24 12:06:13,750 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:06:14,480 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-10-24 12:06:14,480 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:06:14,487 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:06:14,505 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-10-24 12:06:14,513 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2018-10-24 12:06:14,522 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:06:14,528 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:06:14,529 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:06:14,530 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 9 [2018-10-24 12:06:14,530 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-24 12:06:14,542 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:06:14,550 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:06:14,565 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:06:14,565 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:27, output treesize:25 [2018-10-24 12:06:14,631 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-24 12:06:14,642 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-24 12:06:14,643 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:06:14,668 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:06:14,859 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:06:14,859 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:25 [2018-10-24 12:06:15,590 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 120 treesize of output 121 [2018-10-24 12:06:15,769 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 12 case distinctions, treesize of input 109 treesize of output 295 [2018-10-24 12:06:15,769 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-10-24 12:06:15,783 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 27 xjuncts. [2018-10-24 12:06:16,163 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 8 xjuncts. [2018-10-24 12:06:16,349 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 17 dim-0 vars, and 7 xjuncts. [2018-10-24 12:06:16,349 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:152, output treesize:855 [2018-10-24 12:06:37,010 WARN L179 SmtUtils]: Spent 14.42 s on a formula simplification that was a NOOP. DAG size: 195 [2018-10-24 12:07:19,180 WARN L179 SmtUtils]: Spent 33.98 s on a formula simplification that was a NOOP. DAG size: 278 [2018-10-24 12:07:19,509 INFO L134 CoverageAnalysis]: Checked inductivity of 2182 backedges. 679 proven. 148 refuted. 0 times theorem prover too weak. 1355 trivial. 0 not checked. [2018-10-24 12:07:19,509 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:07:20,148 INFO L134 CoverageAnalysis]: Checked inductivity of 2182 backedges. 804 proven. 37 refuted. 0 times theorem prover too weak. 1341 trivial. 0 not checked. [2018-10-24 12:07:20,173 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:07:20,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 27 [2018-10-24 12:07:20,173 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:07:20,174 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-24 12:07:20,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-24 12:07:20,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=532, Unknown=7, NotChecked=0, Total=702 [2018-10-24 12:07:20,175 INFO L87 Difference]: Start difference. First operand 428 states and 512 transitions. Second operand 18 states. [2018-10-24 12:07:35,908 WARN L179 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 73 [2018-10-24 12:07:38,018 WARN L179 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 73 [2018-10-24 12:07:40,792 WARN L179 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 73 [2018-10-24 12:07:42,439 WARN L179 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 73 [2018-10-24 12:07:45,630 WARN L179 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2018-10-24 12:07:46,457 WARN L179 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 55 [2018-10-24 12:07:47,237 WARN L179 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 79 [2018-10-24 12:07:47,952 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 67 [2018-10-24 12:07:49,287 WARN L179 SmtUtils]: Spent 747.00 ms on a formula simplification. DAG size of input: 207 DAG size of output: 201 [2018-10-24 12:07:49,984 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-10-24 12:07:55,571 WARN L179 SmtUtils]: Spent 5.20 s on a formula simplification. DAG size of input: 291 DAG size of output: 291 [2018-10-24 12:07:56,053 WARN L179 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 81 [2018-10-24 12:08:10,244 WARN L179 SmtUtils]: Spent 13.49 s on a formula simplification. DAG size of input: 313 DAG size of output: 312 [2018-10-24 12:08:10,674 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 69 [2018-10-24 12:08:11,874 WARN L179 SmtUtils]: Spent 757.00 ms on a formula simplification. DAG size of input: 208 DAG size of output: 203 [2018-10-24 12:08:13,053 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-10-24 12:08:18,987 WARN L179 SmtUtils]: Spent 5.23 s on a formula simplification. DAG size of input: 291 DAG size of output: 291 [2018-10-24 12:08:19,468 WARN L179 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 81 [2018-10-24 12:08:33,925 WARN L179 SmtUtils]: Spent 13.51 s on a formula simplification. DAG size of input: 313 DAG size of output: 312 [2018-10-24 12:08:34,345 WARN L179 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 69 [2018-10-24 12:08:35,565 WARN L179 SmtUtils]: Spent 739.00 ms on a formula simplification. DAG size of input: 208 DAG size of output: 203 [2018-10-24 12:08:43,503 WARN L179 SmtUtils]: Spent 5.34 s on a formula simplification. DAG size of input: 291 DAG size of output: 291 [2018-10-24 12:08:44,041 WARN L179 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 81 [2018-10-24 12:08:58,818 WARN L179 SmtUtils]: Spent 13.61 s on a formula simplification. DAG size of input: 313 DAG size of output: 312 [2018-10-24 12:08:59,268 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 69 [2018-10-24 12:09:00,575 WARN L179 SmtUtils]: Spent 749.00 ms on a formula simplification. DAG size of input: 208 DAG size of output: 203 [2018-10-24 12:09:01,752 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-10-24 12:09:08,563 WARN L179 SmtUtils]: Spent 4.97 s on a formula simplification. DAG size of input: 291 DAG size of output: 291 [2018-10-24 12:09:09,196 WARN L179 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 81 [2018-10-24 12:09:23,134 WARN L179 SmtUtils]: Spent 12.46 s on a formula simplification. DAG size of input: 313 DAG size of output: 312 [2018-10-24 12:09:23,624 WARN L179 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 69 [2018-10-24 12:09:25,412 WARN L179 SmtUtils]: Spent 920.00 ms on a formula simplification. DAG size of input: 208 DAG size of output: 203 [2018-10-24 12:09:34,188 WARN L179 SmtUtils]: Spent 5.20 s on a formula simplification. DAG size of input: 291 DAG size of output: 291 [2018-10-24 12:09:34,750 WARN L179 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 81 Received shutdown request... [2018-10-24 12:09:35,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-10-24 12:09:35,025 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-24 12:09:35,029 WARN L205 ceAbstractionStarter]: Timeout [2018-10-24 12:09:35,029 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 12:09:35 BoogieIcfgContainer [2018-10-24 12:09:35,029 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-24 12:09:35,030 INFO L168 Benchmark]: Toolchain (without parser) took 256402.24 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.7 GB). Free memory was 1.4 GB in the beginning and 2.8 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2018-10-24 12:09:35,032 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 12:09:35,032 INFO L168 Benchmark]: CACSL2BoogieTranslator took 348.41 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-10-24 12:09:35,033 INFO L168 Benchmark]: Boogie Procedure Inliner took 107.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 12:09:35,033 INFO L168 Benchmark]: Boogie Preprocessor took 161.23 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 733.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -805.0 MB). Peak memory consumption was 28.6 MB. Max. memory is 7.1 GB. [2018-10-24 12:09:35,034 INFO L168 Benchmark]: RCFGBuilder took 1346.84 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 121.3 MB). Peak memory consumption was 121.3 MB. Max. memory is 7.1 GB. [2018-10-24 12:09:35,035 INFO L168 Benchmark]: TraceAbstraction took 254433.63 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 2.1 GB in the beginning and 2.8 GB in the end (delta: -697.4 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2018-10-24 12:09:35,039 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 348.41 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 107.20 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 161.23 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 733.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -805.0 MB). Peak memory consumption was 28.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1346.84 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 121.3 MB). Peak memory consumption was 121.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 254433.63 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 2.1 GB in the beginning and 2.8 GB in the end (delta: -697.4 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 5]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 5). Cancelled while BasicCegarLoop was constructing difference of abstraction (428states) and FLOYD_HOARE automaton (currently 72 states, 18 states before enhancement),while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 93 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 40 locations, 1 error locations. TIMEOUT Result, 254.3s OverallTime, 16 OverallIterations, 35 TraceHistogramMax, 152.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 590 SDtfs, 1868 SDslu, 2584 SDs, 0 SdLazy, 2715 SolverSat, 660 SolverUnsat, 4 SolverUnknown, 0 SolverNotchecked, 25.0s Time, PredicateUnifierStatistics: 6 DeclaredPredicates, 2772 GetRequests, 2387 SyntacticMatches, 17 SemanticMatches, 367 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 7299 ImplicationChecksByTransitivity, 198.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=428occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 17.3s AbstIntTime, 5 AbstIntIterations, 3 AbstIntStrong, 0.971423796791444 AbsIntWeakeningRatio, 1.803921568627451 AbsIntAvgWeakeningVarsNumRemoved, 205.69607843137254 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 15 MinimizatonAttempts, 288 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 2.3s SatisfiabilityAnalysisTime, 78.0s InterpolantComputationTime, 2558 NumberOfCodeBlocks, 2305 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 3727 ConstructedInterpolants, 196 QuantifiedInterpolants, 3775656 SizeOfPredicates, 89 NumberOfNonLiveVariables, 4346 ConjunctsInSsa, 181 ConjunctsInUnsatCore, 38 InterpolantComputations, 5 PerfectInterpolantSequences, 16867/19464 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown