java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT.epf -i ../../../trunk/examples/svcomp/loops/linear_sea.ch_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 16:33:56,028 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 16:33:56,031 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 16:33:56,046 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 16:33:56,046 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 16:33:56,047 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 16:33:56,049 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 16:33:56,050 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 16:33:56,052 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 16:33:56,053 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 16:33:56,054 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 16:33:56,054 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 16:33:56,055 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 16:33:56,058 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 16:33:56,059 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 16:33:56,063 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 16:33:56,064 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 16:33:56,070 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 16:33:56,072 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 16:33:56,073 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 16:33:56,077 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 16:33:56,078 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 16:33:56,082 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 16:33:56,083 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 16:33:56,083 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 16:33:56,084 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 16:33:56,088 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 16:33:56,089 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 16:33:56,089 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 16:33:56,093 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 16:33:56,093 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 16:33:56,094 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 16:33:56,094 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 16:33:56,094 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 16:33:56,096 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 16:33:56,097 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 16:33:56,097 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT.epf [2018-11-07 16:33:56,118 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 16:33:56,119 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 16:33:56,119 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 16:33:56,120 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 16:33:56,120 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 16:33:56,120 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 16:33:56,120 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 16:33:56,121 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 16:33:56,121 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 16:33:56,121 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 16:33:56,121 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 16:33:56,121 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 16:33:56,122 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 16:33:56,122 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 16:33:56,122 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 16:33:56,123 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 16:33:56,123 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 16:33:56,123 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 16:33:56,123 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 16:33:56,123 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 16:33:56,124 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 16:33:56,124 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 16:33:56,124 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 16:33:56,124 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 16:33:56,124 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 16:33:56,125 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 16:33:56,125 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 16:33:56,125 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 16:33:56,125 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 16:33:56,126 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 16:33:56,126 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 16:33:56,126 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 16:33:56,126 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 16:33:56,126 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 16:33:56,169 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 16:33:56,182 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 16:33:56,186 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 16:33:56,187 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 16:33:56,188 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 16:33:56,188 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/linear_sea.ch_true-unreach-call.i [2018-11-07 16:33:56,252 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b174c49e/53220a7f64b94cc09ea55f16103085c4/FLAGad68ec178 [2018-11-07 16:33:56,644 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 16:33:56,645 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/linear_sea.ch_true-unreach-call.i [2018-11-07 16:33:56,652 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b174c49e/53220a7f64b94cc09ea55f16103085c4/FLAGad68ec178 [2018-11-07 16:33:56,667 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b174c49e/53220a7f64b94cc09ea55f16103085c4 [2018-11-07 16:33:56,679 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 16:33:56,680 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 16:33:56,681 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 16:33:56,681 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 16:33:56,684 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 16:33:56,685 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:33:56" (1/1) ... [2018-11-07 16:33:56,687 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c988de2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:33:56, skipping insertion in model container [2018-11-07 16:33:56,688 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:33:56" (1/1) ... [2018-11-07 16:33:56,697 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 16:33:56,721 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 16:33:56,967 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 16:33:56,985 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 16:33:57,009 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 16:33:57,030 INFO L193 MainTranslator]: Completed translation [2018-11-07 16:33:57,030 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:33:57 WrapperNode [2018-11-07 16:33:57,031 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 16:33:57,031 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 16:33:57,032 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 16:33:57,032 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 16:33:57,044 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:33:57" (1/1) ... [2018-11-07 16:33:57,055 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:33:57" (1/1) ... [2018-11-07 16:33:57,063 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 16:33:57,064 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 16:33:57,064 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 16:33:57,064 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 16:33:57,074 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:33:57" (1/1) ... [2018-11-07 16:33:57,075 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:33:57" (1/1) ... [2018-11-07 16:33:57,077 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:33:57" (1/1) ... [2018-11-07 16:33:57,077 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:33:57" (1/1) ... [2018-11-07 16:33:57,092 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:33:57" (1/1) ... [2018-11-07 16:33:57,100 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:33:57" (1/1) ... [2018-11-07 16:33:57,104 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:33:57" (1/1) ... [2018-11-07 16:33:57,107 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 16:33:57,107 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 16:33:57,108 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 16:33:57,108 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 16:33:57,109 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:33:57" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 16:33:57,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-07 16:33:57,274 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 16:33:57,274 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 16:33:57,274 INFO L130 BoogieDeclarations]: Found specification of procedure linear_search [2018-11-07 16:33:57,275 INFO L138 BoogieDeclarations]: Found implementation of procedure linear_search [2018-11-07 16:33:57,275 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-07 16:33:57,275 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 16:33:57,275 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 16:33:57,275 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 16:33:57,277 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 16:33:57,277 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-07 16:33:57,277 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-07 16:33:57,277 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-07 16:33:57,277 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-07 16:33:57,710 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 16:33:57,711 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:33:57 BoogieIcfgContainer [2018-11-07 16:33:57,711 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 16:33:57,712 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 16:33:57,712 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 16:33:57,715 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 16:33:57,716 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:33:56" (1/3) ... [2018-11-07 16:33:57,717 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@782a9fb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:33:57, skipping insertion in model container [2018-11-07 16:33:57,717 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:33:57" (2/3) ... [2018-11-07 16:33:57,717 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@782a9fb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:33:57, skipping insertion in model container [2018-11-07 16:33:57,718 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:33:57" (3/3) ... [2018-11-07 16:33:57,719 INFO L112 eAbstractionObserver]: Analyzing ICFG linear_sea.ch_true-unreach-call.i [2018-11-07 16:33:57,730 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 16:33:57,739 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 16:33:57,758 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 16:33:57,794 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 16:33:57,795 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 16:33:57,795 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 16:33:57,795 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 16:33:57,795 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 16:33:57,796 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 16:33:57,796 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 16:33:57,796 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 16:33:57,817 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2018-11-07 16:33:57,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-07 16:33:57,824 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:33:57,825 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:33:57,828 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:33:57,834 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:33:57,834 INFO L82 PathProgramCache]: Analyzing trace with hash -519389311, now seen corresponding path program 1 times [2018-11-07 16:33:57,837 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:33:57,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:33:57,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:33:57,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:33:57,899 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:33:57,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:33:58,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:33:58,065 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 16:33:58,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-07 16:33:58,066 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 16:33:58,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-07 16:33:58,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-07 16:33:58,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 16:33:58,092 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 2 states. [2018-11-07 16:33:58,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:33:58,119 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2018-11-07 16:33:58,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-07 16:33:58,121 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2018-11-07 16:33:58,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:33:58,131 INFO L225 Difference]: With dead ends: 52 [2018-11-07 16:33:58,132 INFO L226 Difference]: Without dead ends: 25 [2018-11-07 16:33:58,137 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 16:33:58,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-07 16:33:58,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-11-07 16:33:58,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-07 16:33:58,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2018-11-07 16:33:58,185 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 19 [2018-11-07 16:33:58,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:33:58,186 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2018-11-07 16:33:58,187 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-07 16:33:58,188 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2018-11-07 16:33:58,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-07 16:33:58,189 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:33:58,191 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, 1] [2018-11-07 16:33:58,191 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:33:58,192 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:33:58,192 INFO L82 PathProgramCache]: Analyzing trace with hash -277831210, now seen corresponding path program 1 times [2018-11-07 16:33:58,192 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:33:58,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:33:58,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:33:58,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:33:58,194 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:33:58,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:33:58,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:33:58,420 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 16:33:58,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 16:33:58,420 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 16:33:58,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 16:33:58,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 16:33:58,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-07 16:33:58,423 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 6 states. [2018-11-07 16:33:58,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:33:58,519 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2018-11-07 16:33:58,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-07 16:33:58,521 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-11-07 16:33:58,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:33:58,522 INFO L225 Difference]: With dead ends: 33 [2018-11-07 16:33:58,522 INFO L226 Difference]: Without dead ends: 25 [2018-11-07 16:33:58,524 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-07 16:33:58,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-07 16:33:58,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-11-07 16:33:58,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-07 16:33:58,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-11-07 16:33:58,533 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 22 [2018-11-07 16:33:58,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:33:58,534 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-11-07 16:33:58,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 16:33:58,534 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-11-07 16:33:58,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-07 16:33:58,537 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:33:58,537 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, 1] [2018-11-07 16:33:58,537 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:33:58,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:33:58,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1464979125, now seen corresponding path program 1 times [2018-11-07 16:33:58,538 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:33:58,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:33:58,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:33:58,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:33:58,541 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:33:58,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:33:59,029 WARN L179 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 8 [2018-11-07 16:33:59,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:33:59,032 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 16:33:59,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 16:33:59,033 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 16:33:59,033 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 16:33:59,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 16:33:59,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-07 16:33:59,034 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 6 states. [2018-11-07 16:33:59,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:33:59,152 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2018-11-07 16:33:59,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 16:33:59,152 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-11-07 16:33:59,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:33:59,154 INFO L225 Difference]: With dead ends: 40 [2018-11-07 16:33:59,154 INFO L226 Difference]: Without dead ends: 31 [2018-11-07 16:33:59,154 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-07 16:33:59,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-07 16:33:59,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-11-07 16:33:59,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-07 16:33:59,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2018-11-07 16:33:59,162 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 22 [2018-11-07 16:33:59,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:33:59,163 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2018-11-07 16:33:59,163 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 16:33:59,163 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2018-11-07 16:33:59,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-07 16:33:59,164 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:33:59,164 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:33:59,164 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:33:59,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:33:59,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1882483549, now seen corresponding path program 1 times [2018-11-07 16:33:59,165 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:33:59,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:33:59,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:33:59,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:33:59,167 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:33:59,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:33:59,238 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:33:59,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 16:33:59,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 16:33:59,239 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 16:33:59,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 16:33:59,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 16:33:59,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 16:33:59,240 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 3 states. [2018-11-07 16:33:59,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:33:59,264 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2018-11-07 16:33:59,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 16:33:59,265 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-07 16:33:59,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:33:59,266 INFO L225 Difference]: With dead ends: 48 [2018-11-07 16:33:59,266 INFO L226 Difference]: Without dead ends: 32 [2018-11-07 16:33:59,267 INFO L604 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-11-07 16:33:59,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-07 16:33:59,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-11-07 16:33:59,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-07 16:33:59,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2018-11-07 16:33:59,274 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 26 [2018-11-07 16:33:59,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:33:59,274 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2018-11-07 16:33:59,274 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 16:33:59,275 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2018-11-07 16:33:59,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-07 16:33:59,276 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:33:59,276 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:33:59,276 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:33:59,277 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:33:59,277 INFO L82 PathProgramCache]: Analyzing trace with hash -1265780096, now seen corresponding path program 1 times [2018-11-07 16:33:59,277 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:33:59,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:33:59,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:33:59,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:33:59,279 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:33:59,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:33:59,550 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 3 [2018-11-07 16:34:02,016 WARN L179 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 27 [2018-11-07 16:34:02,229 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 18 [2018-11-07 16:34:02,400 WARN L179 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 17 [2018-11-07 16:34:02,783 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:34:02,783 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:34:02,783 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:34:02,785 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-11-07 16:34:02,787 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [8], [11], [12], [13], [15], [19], [21], [28], [29], [33], [34], [35], [37], [43], [46], [48], [54], [55], [56], [58], [59], [60] [2018-11-07 16:34:02,828 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 16:34:02,828 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 16:34:02,988 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 16:34:03,375 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 16:34:03,376 INFO L272 AbstractInterpreter]: Visited 26 different actions 125 times. Merged at 10 different actions 76 times. Widened at 1 different actions 4 times. Found 24 fixpoints after 5 different actions. Largest state had 25 variables. [2018-11-07 16:34:03,424 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:34:03,426 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 16:34:03,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:34:03,426 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:34:03,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:34:03,444 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:34:03,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:34:03,495 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:34:03,577 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 24 [2018-11-07 16:34:03,580 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 18 treesize of output 17 [2018-11-07 16:34:03,581 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 16:34:03,610 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:34:03,621 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 25 [2018-11-07 16:34:03,629 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 18 treesize of output 17 [2018-11-07 16:34:03,629 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-07 16:34:03,636 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:34:05,683 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:34:05,684 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:91, output treesize:17 [2018-11-07 16:34:06,436 WARN L179 SmtUtils]: Spent 315.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-11-07 16:34:06,885 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-11-07 16:34:07,532 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:34:07,532 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:34:07,803 WARN L179 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 43 [2018-11-07 16:34:08,914 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:34:08,936 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:34:08,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 30 [2018-11-07 16:34:08,936 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:34:08,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-07 16:34:08,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-07 16:34:08,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=746, Unknown=1, NotChecked=0, Total=870 [2018-11-07 16:34:08,940 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 20 states. [2018-11-07 16:34:11,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:34:11,256 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2018-11-07 16:34:11,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-07 16:34:11,262 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 28 [2018-11-07 16:34:11,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:34:11,264 INFO L225 Difference]: With dead ends: 48 [2018-11-07 16:34:11,264 INFO L226 Difference]: Without dead ends: 38 [2018-11-07 16:34:11,265 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 34 SyntacticMatches, 4 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=192, Invalid=997, Unknown=1, NotChecked=0, Total=1190 [2018-11-07 16:34:11,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-07 16:34:11,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-11-07 16:34:11,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-07 16:34:11,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2018-11-07 16:34:11,276 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 28 [2018-11-07 16:34:11,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:34:11,276 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2018-11-07 16:34:11,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-07 16:34:11,276 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2018-11-07 16:34:11,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-07 16:34:11,277 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:34:11,278 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-07 16:34:11,278 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:34:11,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:34:11,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1149133323, now seen corresponding path program 2 times [2018-11-07 16:34:11,279 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:34:11,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:34:11,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:34:11,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:34:11,280 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:34:11,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:34:12,217 WARN L179 SmtUtils]: Spent 436.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 24 [2018-11-07 16:34:12,592 WARN L179 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 36 [2018-11-07 16:34:12,765 WARN L179 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 68 [2018-11-07 16:34:12,971 WARN L179 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 53 [2018-11-07 16:34:13,140 WARN L179 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 47 [2018-11-07 16:34:13,357 WARN L179 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 54 [2018-11-07 16:34:13,691 WARN L179 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 54 [2018-11-07 16:34:14,379 WARN L179 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 53 [2018-11-07 16:34:14,561 WARN L179 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2018-11-07 16:34:14,821 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 39 [2018-11-07 16:34:14,831 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:34:14,831 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:34:14,831 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:34:14,831 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:34:14,831 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:34:14,832 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:34:14,832 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:34:14,841 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:34:14,841 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:34:14,999 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-07 16:34:14,999 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:34:15,004 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:34:25,167 WARN L179 SmtUtils]: Spent 2.02 s on a formula simplification. DAG size of input: 35 DAG size of output: 13 [2018-11-07 16:34:25,234 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-07 16:34:25,234 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-07 16:34:25,274 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 18 [2018-11-07 16:34:25,293 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 18 treesize of output 17 [2018-11-07 16:34:25,293 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-07 16:34:25,315 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:34:25,328 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-07 16:34:25,329 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:142, output treesize:30 [2018-11-07 16:34:28,869 WARN L179 SmtUtils]: Spent 2.11 s on a formula simplification that was a NOOP. DAG size: 45 [2018-11-07 16:34:29,266 WARN L179 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 48 [2018-11-07 16:34:29,520 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:34:29,520 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:34:29,707 WARN L179 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 48 [2018-11-07 16:34:31,203 WARN L179 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2018-11-07 16:34:32,312 WARN L179 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 51 [2018-11-07 16:34:32,536 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2018-11-07 16:34:32,555 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-07 16:34:32,556 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-07 16:34:32,564 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:34:32,565 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:181, output treesize:1 [2018-11-07 16:34:32,581 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:34:32,602 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:34:32,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 13] total 41 [2018-11-07 16:34:32,602 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:34:32,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-07 16:34:32,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-07 16:34:32,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=1451, Unknown=4, NotChecked=0, Total=1640 [2018-11-07 16:34:32,606 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 30 states. [2018-11-07 16:34:33,214 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2018-11-07 16:34:33,485 WARN L179 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 83 [2018-11-07 16:34:34,143 WARN L179 SmtUtils]: Spent 387.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2018-11-07 16:34:35,113 WARN L179 SmtUtils]: Spent 796.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 88 [2018-11-07 16:34:36,963 WARN L179 SmtUtils]: Spent 1.76 s on a formula simplification. DAG size of input: 86 DAG size of output: 43 [2018-11-07 16:34:37,145 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 49 [2018-11-07 16:34:37,389 WARN L179 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 54 [2018-11-07 16:34:40,794 WARN L179 SmtUtils]: Spent 3.29 s on a formula simplification. DAG size of input: 53 DAG size of output: 52 [2018-11-07 16:34:42,988 WARN L179 SmtUtils]: Spent 2.11 s on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2018-11-07 16:34:45,535 WARN L179 SmtUtils]: Spent 2.10 s on a formula simplification. DAG size of input: 72 DAG size of output: 51 [2018-11-07 16:34:45,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:34:45,658 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2018-11-07 16:34:45,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-07 16:34:45,659 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 34 [2018-11-07 16:34:45,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:34:45,661 INFO L225 Difference]: With dead ends: 57 [2018-11-07 16:34:45,661 INFO L226 Difference]: Without dead ends: 44 [2018-11-07 16:34:45,663 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 599 ImplicationChecksByTransitivity, 32.1s TimeCoverageRelationStatistics Valid=391, Invalid=2467, Unknown=4, NotChecked=0, Total=2862 [2018-11-07 16:34:45,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-07 16:34:45,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-11-07 16:34:45,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-07 16:34:45,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2018-11-07 16:34:45,670 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 34 [2018-11-07 16:34:45,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:34:45,671 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2018-11-07 16:34:45,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-07 16:34:45,671 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2018-11-07 16:34:45,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-07 16:34:45,672 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:34:45,672 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:34:45,672 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:34:45,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:34:45,673 INFO L82 PathProgramCache]: Analyzing trace with hash 169342294, now seen corresponding path program 3 times [2018-11-07 16:34:45,673 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:34:45,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:34:45,674 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:34:45,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:34:45,674 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:34:45,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:34:46,271 WARN L179 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 27 [2018-11-07 16:34:46,574 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 34 [2018-11-07 16:34:46,769 WARN L179 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 49 [2018-11-07 16:34:46,918 WARN L179 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 29 [2018-11-07 16:34:47,233 WARN L179 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 41 [2018-11-07 16:34:47,372 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 42 [2018-11-07 16:34:47,553 WARN L179 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 43 [2018-11-07 16:34:47,929 WARN L179 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 59 [2018-11-07 16:34:48,155 WARN L179 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 57 [2018-11-07 16:34:48,350 WARN L179 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 43 [2018-11-07 16:34:50,909 WARN L179 SmtUtils]: Spent 2.16 s on a formula simplification. DAG size of input: 116 DAG size of output: 48 [2018-11-07 16:34:50,923 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:34:50,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:34:50,923 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:34:50,923 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:34:50,924 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:34:50,924 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:34:50,924 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:34:50,933 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:34:50,933 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:34:50,999 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:34:51,000 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:34:51,006 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:34:51,016 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 28 [2018-11-07 16:34:51,022 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 18 treesize of output 17 [2018-11-07 16:34:51,023 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 16:34:51,032 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:34:51,036 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 27 [2018-11-07 16:34:51,040 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 18 treesize of output 17 [2018-11-07 16:34:51,041 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-07 16:34:51,053 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:34:53,092 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:34:53,093 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:100, output treesize:21 [2018-11-07 16:34:54,199 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:34:54,199 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:34:54,580 WARN L179 SmtUtils]: Spent 378.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 58 [2018-11-07 16:34:56,076 WARN L179 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2018-11-07 16:34:56,938 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2018-11-07 16:34:56,987 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-07 16:34:56,987 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-07 16:34:59,107 INFO L267 ElimStorePlain]: Start of recursive call 1: 20 dim-0 vars, 10 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:34:59,107 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 30 variables, input treesize:798, output treesize:1 [2018-11-07 16:34:59,124 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:34:59,143 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:34:59,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 16] total 47 [2018-11-07 16:34:59,143 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:34:59,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-07 16:34:59,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-07 16:34:59,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=1983, Unknown=0, NotChecked=0, Total=2162 [2018-11-07 16:34:59,146 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand 33 states. [2018-11-07 16:34:59,859 WARN L179 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 64 [2018-11-07 16:35:00,212 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 71 [2018-11-07 16:35:00,450 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2018-11-07 16:35:00,735 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 78 [2018-11-07 16:35:01,207 WARN L179 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 73 [2018-11-07 16:35:01,499 WARN L179 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 49 [2018-11-07 16:35:01,741 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 54 [2018-11-07 16:35:02,024 WARN L179 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 59 [2018-11-07 16:35:02,468 WARN L179 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 102 [2018-11-07 16:35:02,734 WARN L179 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 100 [2018-11-07 16:35:03,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:35:03,505 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2018-11-07 16:35:03,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-07 16:35:03,505 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 40 [2018-11-07 16:35:03,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:35:03,507 INFO L225 Difference]: With dead ends: 60 [2018-11-07 16:35:03,507 INFO L226 Difference]: Without dead ends: 50 [2018-11-07 16:35:03,509 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 867 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=397, Invalid=3509, Unknown=0, NotChecked=0, Total=3906 [2018-11-07 16:35:03,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-07 16:35:03,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-11-07 16:35:03,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-07 16:35:03,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2018-11-07 16:35:03,519 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 40 [2018-11-07 16:35:03,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:35:03,519 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2018-11-07 16:35:03,519 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-07 16:35:03,519 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2018-11-07 16:35:03,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-07 16:35:03,520 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:35:03,521 INFO L375 BasicCegarLoop]: trace histogram [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-11-07 16:35:03,521 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:35:03,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:35:03,521 INFO L82 PathProgramCache]: Analyzing trace with hash 745186401, now seen corresponding path program 4 times [2018-11-07 16:35:03,521 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:35:03,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:35:03,522 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:35:03,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:35:03,523 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:35:03,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:35:04,698 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:35:04,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:35:04,699 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:35:04,699 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:35:04,699 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:35:04,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:35:04,699 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:35:04,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:35:04,708 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:35:04,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:35:04,792 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:35:15,112 WARN L179 SmtUtils]: Spent 2.02 s on a formula simplification. DAG size of input: 35 DAG size of output: 13 [2018-11-07 16:35:15,164 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 45 treesize of output 42 [2018-11-07 16:35:15,167 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 18 treesize of output 17 [2018-11-07 16:35:15,168 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 16:35:15,180 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:35:15,186 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 44 treesize of output 41 [2018-11-07 16:35:15,190 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 18 treesize of output 17 [2018-11-07 16:35:15,190 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-07 16:35:15,204 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:35:15,236 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-07 16:35:15,236 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:142, output treesize:30 [2018-11-07 16:35:16,042 WARN L179 SmtUtils]: Spent 531.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2018-11-07 16:35:16,709 WARN L179 SmtUtils]: Spent 621.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2018-11-07 16:35:17,209 WARN L179 SmtUtils]: Spent 311.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2018-11-07 16:35:19,295 WARN L179 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 49 [2018-11-07 16:35:21,446 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 55 [2018-11-07 16:35:21,655 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2018-11-07 16:35:24,295 WARN L179 SmtUtils]: Spent 2.40 s on a formula simplification. DAG size of input: 64 DAG size of output: 64 [2018-11-07 16:35:24,786 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2018-11-07 16:35:25,691 WARN L179 SmtUtils]: Spent 594.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 66 [2018-11-07 16:35:27,971 WARN L179 SmtUtils]: Spent 2.06 s on a formula simplification that was a NOOP. DAG size: 46 [2018-11-07 16:35:28,232 WARN L179 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 48 [2018-11-07 16:35:28,428 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:35:28,428 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:35:28,726 WARN L179 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 71 [2018-11-07 16:35:29,586 WARN L179 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2018-11-07 16:35:30,407 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2018-11-07 16:35:30,705 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2018-11-07 16:35:31,061 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2018-11-07 16:35:31,449 WARN L179 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2018-11-07 16:35:31,786 WARN L179 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2018-11-07 16:35:33,266 WARN L179 SmtUtils]: Spent 1.28 s on a formula simplification that was a NOOP. DAG size: 63 [2018-11-07 16:35:33,821 WARN L179 SmtUtils]: Spent 288.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2018-11-07 16:35:34,403 WARN L179 SmtUtils]: Spent 246.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2018-11-07 16:35:42,500 WARN L179 SmtUtils]: Spent 6.51 s on a formula simplification that was a NOOP. DAG size: 69 [2018-11-07 16:35:50,955 WARN L179 SmtUtils]: Spent 6.12 s on a formula simplification that was a NOOP. DAG size: 73 [2018-11-07 16:35:57,495 WARN L179 SmtUtils]: Spent 3.47 s on a formula simplification that was a NOOP. DAG size: 72 [2018-11-07 16:36:18,259 WARN L179 SmtUtils]: Spent 9.64 s on a formula simplification that was a NOOP. DAG size: 75 [2018-11-07 16:36:46,853 WARN L179 SmtUtils]: Spent 22.57 s on a formula simplification that was a NOOP. DAG size: 78 [2018-11-07 16:38:29,089 WARN L179 SmtUtils]: Spent 1.60 m on a formula simplification. DAG size of input: 76 DAG size of output: 75 [2018-11-07 16:38:29,210 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-07 16:38:29,210 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-07 16:38:29,548 INFO L267 ElimStorePlain]: Start of recursive call 1: 34 dim-0 vars, 34 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:38:29,549 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 68 variables, input treesize:3701, output treesize:1 [2018-11-07 16:38:29,585 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 4 proven. 47 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:38:29,605 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:38:29,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 25, 22] total 59 [2018-11-07 16:38:29,605 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:38:29,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-07 16:38:29,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-07 16:38:29,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=289, Invalid=3121, Unknown=12, NotChecked=0, Total=3422 [2018-11-07 16:38:29,608 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand 39 states. [2018-11-07 16:38:32,831 WARN L179 SmtUtils]: Spent 2.59 s on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2018-11-07 16:38:33,185 WARN L179 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 55 Received shutdown request... [2018-11-07 16:38:35,920 WARN L179 SmtUtils]: Spent 2.30 s on a formula simplification. DAG size of input: 62 DAG size of output: 62 [2018-11-07 16:38:35,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-07 16:38:35,922 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-07 16:38:35,929 WARN L205 ceAbstractionStarter]: Timeout [2018-11-07 16:38:35,929 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 04:38:35 BoogieIcfgContainer [2018-11-07 16:38:35,929 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 16:38:35,930 INFO L168 Benchmark]: Toolchain (without parser) took 279250.85 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.0 GB). Free memory was 1.4 GB in the beginning and 2.5 GB in the end (delta: -1.1 GB). Peak memory consumption was 885.3 MB. Max. memory is 7.1 GB. [2018-11-07 16:38:35,931 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 16:38:35,932 INFO L168 Benchmark]: CACSL2BoogieTranslator took 350.07 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-07 16:38:35,932 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.88 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 16:38:35,933 INFO L168 Benchmark]: Boogie Preprocessor took 43.47 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 16:38:35,933 INFO L168 Benchmark]: RCFGBuilder took 603.55 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 753.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -784.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. [2018-11-07 16:38:35,934 INFO L168 Benchmark]: TraceAbstraction took 278217.50 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 279.4 MB). Free memory was 2.2 GB in the beginning and 2.5 GB in the end (delta: -316.4 MB). Peak memory consumption was 905.6 MB. Max. memory is 7.1 GB. [2018-11-07 16:38:35,938 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.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 350.07 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 31.88 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 43.47 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 603.55 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 753.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -784.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 278217.50 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 279.4 MB). Free memory was 2.2 GB in the beginning and 2.5 GB in the end (delta: -316.4 MB). Peak memory consumption was 905.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 5]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 5). Cancelled while BasicCegarLoop was constructing difference of abstraction (50states) and FLOYD_HOARE automaton (currently 14 states, 39 states before enhancement),while ReachableStatesComputation was computing reachable states (21 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 34 locations, 1 error locations. TIMEOUT Result, 278.1s OverallTime, 8 OverallIterations, 5 TraceHistogramMax, 26.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 180 SDtfs, 280 SDslu, 1112 SDs, 0 SdLazy, 1469 SolverSat, 81 SolverUnsat, 10 SolverUnknown, 0 SolverNotchecked, 4.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 415 GetRequests, 187 SyntacticMatches, 10 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2861 ImplicationChecksByTransitivity, 260.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.6s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 249.9s InterpolantComputationTime, 385 NumberOfCodeBlocks, 385 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 517 ConstructedInterpolants, 108 QuantifiedInterpolants, 1097834 SizeOfPredicates, 73 NumberOfNonLiveVariables, 442 ConjunctsInSsa, 155 ConjunctsInUnsatCore, 16 InterpolantComputations, 4 PerfectInterpolantSequences, 8/304 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown