java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf -i ../../../trunk/examples/svcomp/loop-crafted/simple_array_index_value_true-unreach-call3_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 22:10:07,212 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 22:10:07,214 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 22:10:07,226 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 22:10:07,226 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 22:10:07,227 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 22:10:07,229 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 22:10:07,231 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 22:10:07,233 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 22:10:07,234 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 22:10:07,236 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 22:10:07,237 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 22:10:07,237 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 22:10:07,239 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 22:10:07,240 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 22:10:07,240 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 22:10:07,241 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 22:10:07,243 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 22:10:07,252 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 22:10:07,258 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 22:10:07,259 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 22:10:07,261 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 22:10:07,266 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 22:10:07,266 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 22:10:07,267 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 22:10:07,267 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 22:10:07,270 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 22:10:07,271 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 22:10:07,272 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 22:10:07,274 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 22:10:07,276 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 22:10:07,276 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 22:10:07,277 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 22:10:07,277 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 22:10:07,278 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 22:10:07,279 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 22:10:07,280 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf [2018-11-07 22:10:07,304 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 22:10:07,304 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 22:10:07,305 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 22:10:07,305 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 22:10:07,305 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 22:10:07,306 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 22:10:07,306 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-07 22:10:07,306 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 22:10:07,306 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 22:10:07,306 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 22:10:07,307 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 22:10:07,307 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 22:10:07,307 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 22:10:07,308 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 22:10:07,308 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 22:10:07,308 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 22:10:07,308 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 22:10:07,308 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 22:10:07,308 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 22:10:07,309 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 22:10:07,309 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 22:10:07,309 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 22:10:07,309 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 22:10:07,309 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 22:10:07,310 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 22:10:07,310 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 22:10:07,310 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 22:10:07,310 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 22:10:07,310 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 22:10:07,311 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 22:10:07,311 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 22:10:07,311 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 22:10:07,311 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 22:10:07,311 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 22:10:07,312 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 22:10:07,355 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 22:10:07,368 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 22:10:07,372 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 22:10:07,373 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 22:10:07,374 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 22:10:07,374 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-crafted/simple_array_index_value_true-unreach-call3_true-termination.i [2018-11-07 22:10:07,436 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ba8b088d/86e74558134146b59bbf15b34e438cad/FLAGc7fc07107 [2018-11-07 22:10:07,889 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 22:10:07,889 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_true-unreach-call3_true-termination.i [2018-11-07 22:10:07,896 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ba8b088d/86e74558134146b59bbf15b34e438cad/FLAGc7fc07107 [2018-11-07 22:10:07,910 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ba8b088d/86e74558134146b59bbf15b34e438cad [2018-11-07 22:10:07,919 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 22:10:07,920 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 22:10:07,921 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 22:10:07,922 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 22:10:07,925 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 22:10:07,926 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:10:07" (1/1) ... [2018-11-07 22:10:07,930 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12ef9e86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:10:07, skipping insertion in model container [2018-11-07 22:10:07,930 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:10:07" (1/1) ... [2018-11-07 22:10:07,940 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 22:10:07,968 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 22:10:08,198 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 22:10:08,205 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 22:10:08,227 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 22:10:08,249 INFO L193 MainTranslator]: Completed translation [2018-11-07 22:10:08,249 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:10:08 WrapperNode [2018-11-07 22:10:08,249 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 22:10:08,250 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 22:10:08,250 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 22:10:08,250 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 22:10:08,259 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:10:08" (1/1) ... [2018-11-07 22:10:08,267 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:10:08" (1/1) ... [2018-11-07 22:10:08,274 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 22:10:08,274 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 22:10:08,274 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 22:10:08,275 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 22:10:08,284 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:10:08" (1/1) ... [2018-11-07 22:10:08,284 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:10:08" (1/1) ... [2018-11-07 22:10:08,286 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:10:08" (1/1) ... [2018-11-07 22:10:08,286 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:10:08" (1/1) ... [2018-11-07 22:10:08,292 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:10:08" (1/1) ... [2018-11-07 22:10:08,297 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:10:08" (1/1) ... [2018-11-07 22:10:08,298 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:10:08" (1/1) ... [2018-11-07 22:10:08,300 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 22:10:08,301 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 22:10:08,301 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 22:10:08,301 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 22:10:08,302 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:10:08" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 22:10:08,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-07 22:10:08,431 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 22:10:08,431 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 22:10:08,431 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-07 22:10:08,432 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 22:10:08,432 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 22:10:08,432 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 22:10:08,432 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 22:10:08,432 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-07 22:10:08,432 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-07 22:10:08,433 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-07 22:10:08,433 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-07 22:10:08,839 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 22:10:08,840 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:10:08 BoogieIcfgContainer [2018-11-07 22:10:08,840 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 22:10:08,842 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 22:10:08,842 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 22:10:08,845 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 22:10:08,845 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:10:07" (1/3) ... [2018-11-07 22:10:08,846 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d3b8644 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:10:08, skipping insertion in model container [2018-11-07 22:10:08,846 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:10:08" (2/3) ... [2018-11-07 22:10:08,847 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d3b8644 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:10:08, skipping insertion in model container [2018-11-07 22:10:08,847 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:10:08" (3/3) ... [2018-11-07 22:10:08,849 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_true-unreach-call3_true-termination.i [2018-11-07 22:10:08,858 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 22:10:08,867 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 22:10:08,883 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 22:10:08,920 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 22:10:08,921 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 22:10:08,921 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 22:10:08,921 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 22:10:08,921 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 22:10:08,921 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 22:10:08,921 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 22:10:08,921 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 22:10:08,940 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2018-11-07 22:10:08,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-07 22:10:08,947 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:10:08,948 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:10:08,949 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:10:08,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:10:08,956 INFO L82 PathProgramCache]: Analyzing trace with hash -794956242, now seen corresponding path program 1 times [2018-11-07 22:10:08,959 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:10:09,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:10:09,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:10:09,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:10:09,005 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:10:09,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:10:09,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:10:09,088 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 22:10:09,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-07 22:10:09,089 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 22:10:09,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-07 22:10:09,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-07 22:10:09,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 22:10:09,111 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 2 states. [2018-11-07 22:10:09,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:10:09,133 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2018-11-07 22:10:09,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-07 22:10:09,134 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2018-11-07 22:10:09,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:10:09,143 INFO L225 Difference]: With dead ends: 57 [2018-11-07 22:10:09,143 INFO L226 Difference]: Without dead ends: 28 [2018-11-07 22:10:09,147 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 22:10:09,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-07 22:10:09,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-07 22:10:09,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-07 22:10:09,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2018-11-07 22:10:09,187 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 18 [2018-11-07 22:10:09,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:10:09,188 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2018-11-07 22:10:09,188 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-07 22:10:09,188 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2018-11-07 22:10:09,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-07 22:10:09,189 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:10:09,189 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:10:09,189 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:10:09,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:10:09,190 INFO L82 PathProgramCache]: Analyzing trace with hash -184952832, now seen corresponding path program 1 times [2018-11-07 22:10:09,190 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:10:09,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:10:09,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:10:09,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:10:09,192 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:10:09,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:10:09,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:10:09,513 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 22:10:09,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 22:10:09,514 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 22:10:09,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 22:10:09,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 22:10:09,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-07 22:10:09,516 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 5 states. [2018-11-07 22:10:09,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:10:09,657 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-11-07 22:10:09,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 22:10:09,658 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-11-07 22:10:09,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:10:09,660 INFO L225 Difference]: With dead ends: 36 [2018-11-07 22:10:09,660 INFO L226 Difference]: Without dead ends: 34 [2018-11-07 22:10:09,662 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-07 22:10:09,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-07 22:10:09,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-11-07 22:10:09,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-07 22:10:09,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2018-11-07 22:10:09,673 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 19 [2018-11-07 22:10:09,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:10:09,675 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2018-11-07 22:10:09,676 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 22:10:09,676 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2018-11-07 22:10:09,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-07 22:10:09,677 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:10:09,677 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-11-07 22:10:09,678 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:10:09,679 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:10:09,679 INFO L82 PathProgramCache]: Analyzing trace with hash -683349085, now seen corresponding path program 1 times [2018-11-07 22:10:09,679 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:10:09,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:10:09,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:10:09,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:10:09,681 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:10:09,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:10:09,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:10:09,737 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 22:10:09,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 22:10:09,738 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 22:10:09,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 22:10:09,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 22:10:09,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 22:10:09,739 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand 3 states. [2018-11-07 22:10:09,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:10:09,853 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2018-11-07 22:10:09,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 22:10:09,853 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-07 22:10:09,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:10:09,857 INFO L225 Difference]: With dead ends: 70 [2018-11-07 22:10:09,858 INFO L226 Difference]: Without dead ends: 48 [2018-11-07 22:10:09,860 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 22:10:09,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-07 22:10:09,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 35. [2018-11-07 22:10:09,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-07 22:10:09,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2018-11-07 22:10:09,871 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 21 [2018-11-07 22:10:09,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:10:09,872 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2018-11-07 22:10:09,872 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 22:10:09,872 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2018-11-07 22:10:09,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-07 22:10:09,873 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:10:09,873 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-11-07 22:10:09,874 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:10:09,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:10:09,874 INFO L82 PathProgramCache]: Analyzing trace with hash 1268837578, now seen corresponding path program 1 times [2018-11-07 22:10:09,874 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:10:09,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:10:09,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:10:09,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:10:09,876 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:10:09,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:10:09,979 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:10:09,979 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:10:09,979 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:10:09,980 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 26 with the following transitions: [2018-11-07 22:10:09,982 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [6], [10], [14], [16], [17], [18], [22], [26], [31], [32], [33], [38], [39], [40], [52], [55], [57], [63], [64], [65], [67] [2018-11-07 22:10:10,018 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 22:10:10,018 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 22:10:10,133 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 22:10:10,397 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 22:10:10,398 INFO L272 AbstractInterpreter]: Visited 24 different actions 119 times. Merged at 13 different actions 73 times. Widened at 2 different actions 4 times. Found 1 fixpoints after 1 different actions. Largest state had 17 variables. [2018-11-07 22:10:10,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:10:10,433 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 22:10:10,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:10:10,433 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:10:10,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:10:10,455 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:10:10,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:10:10,498 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:10:10,626 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 11 treesize of output 8 [2018-11-07 22:10:10,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 8 treesize of output 7 [2018-11-07 22:10:10,630 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 22:10:10,632 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:10:10,638 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:10:10,638 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-11-07 22:10:10,823 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 21 treesize of output 17 [2018-11-07 22:10:10,850 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:10:10,851 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-07 22:10:10,852 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 22:10:10,912 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:10:10,965 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:10:10,966 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:7 [2018-11-07 22:10:11,005 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:10:11,005 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:10:11,249 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 18 treesize of output 16 [2018-11-07 22:10:11,280 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-11-07 22:10:11,283 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 22:10:11,294 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-07 22:10:11,300 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-07 22:10:11,301 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:18, output treesize:13 [2018-11-07 22:10:11,355 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:10:11,383 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:10:11,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 13 [2018-11-07 22:10:11,384 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:10:11,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 22:10:11,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 22:10:11,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2018-11-07 22:10:11,388 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 9 states. [2018-11-07 22:10:12,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:10:12,185 INFO L93 Difference]: Finished difference Result 124 states and 143 transitions. [2018-11-07 22:10:12,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-07 22:10:12,185 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2018-11-07 22:10:12,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:10:12,189 INFO L225 Difference]: With dead ends: 124 [2018-11-07 22:10:12,189 INFO L226 Difference]: Without dead ends: 102 [2018-11-07 22:10:12,191 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2018-11-07 22:10:12,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-11-07 22:10:12,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 49. [2018-11-07 22:10:12,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-07 22:10:12,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2018-11-07 22:10:12,205 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 25 [2018-11-07 22:10:12,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:10:12,205 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2018-11-07 22:10:12,205 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 22:10:12,206 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2018-11-07 22:10:12,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-07 22:10:12,207 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:10:12,207 INFO L375 BasicCegarLoop]: trace histogram [4, 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 22:10:12,207 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:10:12,208 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:10:12,208 INFO L82 PathProgramCache]: Analyzing trace with hash 1970400408, now seen corresponding path program 2 times [2018-11-07 22:10:12,208 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:10:12,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:10:12,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:10:12,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:10:12,210 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:10:12,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:10:12,324 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:10:12,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:10:12,324 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:10:12,325 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:10:12,325 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:10:12,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:10:12,325 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:10:12,334 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:10:12,335 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:10:13,237 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-07 22:10:13,237 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:10:13,242 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:10:13,267 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:10:13,268 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:10:13,356 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:10:13,384 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:10:13,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2018-11-07 22:10:13,384 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:10:13,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 22:10:13,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 22:10:13,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-11-07 22:10:13,390 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand 6 states. [2018-11-07 22:10:13,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:10:13,890 INFO L93 Difference]: Finished difference Result 121 states and 138 transitions. [2018-11-07 22:10:13,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-07 22:10:13,891 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2018-11-07 22:10:13,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:10:13,893 INFO L225 Difference]: With dead ends: 121 [2018-11-07 22:10:13,893 INFO L226 Difference]: Without dead ends: 93 [2018-11-07 22:10:13,894 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-11-07 22:10:13,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-11-07 22:10:13,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 47. [2018-11-07 22:10:13,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-07 22:10:13,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2018-11-07 22:10:13,907 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 33 [2018-11-07 22:10:13,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:10:13,907 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2018-11-07 22:10:13,907 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 22:10:13,908 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2018-11-07 22:10:13,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-07 22:10:13,908 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:10:13,909 INFO L375 BasicCegarLoop]: trace histogram [5, 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 22:10:13,909 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:10:13,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:10:13,909 INFO L82 PathProgramCache]: Analyzing trace with hash 415918911, now seen corresponding path program 3 times [2018-11-07 22:10:13,910 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:10:13,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:10:13,910 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:10:13,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:10:13,911 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:10:13,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:10:14,168 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:10:14,169 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:10:14,169 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:10:14,169 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:10:14,169 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:10:14,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:10:14,170 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:10:14,179 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:10:14,180 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:10:14,201 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:10:14,201 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:10:14,203 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:10:14,246 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:10:14,246 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:10:14,372 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:10:14,393 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:10:14,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2018-11-07 22:10:14,393 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:10:14,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-07 22:10:14,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-07 22:10:14,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-07 22:10:14,394 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand 7 states. [2018-11-07 22:10:14,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:10:14,643 INFO L93 Difference]: Finished difference Result 130 states and 149 transitions. [2018-11-07 22:10:14,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 22:10:14,644 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 37 [2018-11-07 22:10:14,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:10:14,645 INFO L225 Difference]: With dead ends: 130 [2018-11-07 22:10:14,646 INFO L226 Difference]: Without dead ends: 108 [2018-11-07 22:10:14,646 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 68 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-07 22:10:14,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-11-07 22:10:14,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 51. [2018-11-07 22:10:14,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-07 22:10:14,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions. [2018-11-07 22:10:14,656 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 53 transitions. Word has length 37 [2018-11-07 22:10:14,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:10:14,656 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 53 transitions. [2018-11-07 22:10:14,656 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-07 22:10:14,656 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2018-11-07 22:10:14,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-07 22:10:14,658 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:10:14,658 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:10:14,658 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:10:14,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:10:14,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1222983270, now seen corresponding path program 4 times [2018-11-07 22:10:14,659 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:10:14,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:10:14,659 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:10:14,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:10:14,660 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:10:14,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:10:14,802 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:10:14,803 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:10:14,803 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:10:14,803 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:10:14,803 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:10:14,803 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:10:14,803 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:10:14,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:10:14,812 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:10:14,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:10:14,839 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:10:14,870 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:10:14,871 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:10:14,989 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:10:15,009 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:10:15,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2018-11-07 22:10:15,009 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:10:15,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-07 22:10:15,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-07 22:10:15,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2018-11-07 22:10:15,010 INFO L87 Difference]: Start difference. First operand 51 states and 53 transitions. Second operand 8 states. [2018-11-07 22:10:15,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:10:15,439 INFO L93 Difference]: Finished difference Result 145 states and 167 transitions. [2018-11-07 22:10:15,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 22:10:15,440 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2018-11-07 22:10:15,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:10:15,442 INFO L225 Difference]: With dead ends: 145 [2018-11-07 22:10:15,442 INFO L226 Difference]: Without dead ends: 123 [2018-11-07 22:10:15,443 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 75 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2018-11-07 22:10:15,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-11-07 22:10:15,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 55. [2018-11-07 22:10:15,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-07 22:10:15,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2018-11-07 22:10:15,455 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 41 [2018-11-07 22:10:15,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:10:15,455 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2018-11-07 22:10:15,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-07 22:10:15,455 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2018-11-07 22:10:15,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-07 22:10:15,457 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:10:15,457 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:10:15,457 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:10:15,457 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:10:15,458 INFO L82 PathProgramCache]: Analyzing trace with hash 2072258061, now seen corresponding path program 5 times [2018-11-07 22:10:15,458 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:10:15,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:10:15,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:10:15,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:10:15,459 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:10:15,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:10:15,712 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:10:15,713 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:10:15,713 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:10:15,713 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:10:15,713 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:10:15,713 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:10:15,714 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:10:15,724 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:10:15,724 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:10:18,972 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-11-07 22:10:18,973 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:10:18,976 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:10:19,020 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:10:19,020 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:10:19,231 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:10:19,252 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:10:19,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2018-11-07 22:10:19,252 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:10:19,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 22:10:19,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 22:10:19,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2018-11-07 22:10:19,253 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand 9 states. [2018-11-07 22:10:19,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:10:19,785 INFO L93 Difference]: Finished difference Result 160 states and 185 transitions. [2018-11-07 22:10:19,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-07 22:10:19,787 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 45 [2018-11-07 22:10:19,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:10:19,789 INFO L225 Difference]: With dead ends: 160 [2018-11-07 22:10:19,789 INFO L226 Difference]: Without dead ends: 138 [2018-11-07 22:10:19,790 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 82 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2018-11-07 22:10:19,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-11-07 22:10:19,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 59. [2018-11-07 22:10:19,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-07 22:10:19,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2018-11-07 22:10:19,799 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 45 [2018-11-07 22:10:19,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:10:19,800 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2018-11-07 22:10:19,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 22:10:19,800 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2018-11-07 22:10:19,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-07 22:10:19,801 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:10:19,801 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:10:19,801 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:10:19,801 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:10:19,802 INFO L82 PathProgramCache]: Analyzing trace with hash -276241868, now seen corresponding path program 6 times [2018-11-07 22:10:19,802 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:10:19,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:10:19,803 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:10:19,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:10:19,803 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:10:19,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:10:20,189 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:10:20,190 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:10:20,190 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:10:20,190 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:10:20,190 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:10:20,190 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:10:20,190 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:10:20,199 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:10:20,199 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:10:20,231 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:10:20,231 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:10:20,234 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:10:20,277 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:10:20,277 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:10:20,508 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:10:20,528 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:10:20,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 18 [2018-11-07 22:10:20,528 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:10:20,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-07 22:10:20,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-07 22:10:20,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2018-11-07 22:10:20,530 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 10 states. [2018-11-07 22:10:21,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:10:21,455 INFO L93 Difference]: Finished difference Result 175 states and 203 transitions. [2018-11-07 22:10:21,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-07 22:10:21,456 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 49 [2018-11-07 22:10:21,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:10:21,458 INFO L225 Difference]: With dead ends: 175 [2018-11-07 22:10:21,458 INFO L226 Difference]: Without dead ends: 153 [2018-11-07 22:10:21,460 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 89 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2018-11-07 22:10:21,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-11-07 22:10:21,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 63. [2018-11-07 22:10:21,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-07 22:10:21,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2018-11-07 22:10:21,471 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 49 [2018-11-07 22:10:21,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:10:21,471 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions. [2018-11-07 22:10:21,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-07 22:10:21,472 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2018-11-07 22:10:21,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-07 22:10:21,473 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:10:21,473 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:10:21,473 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:10:21,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:10:21,474 INFO L82 PathProgramCache]: Analyzing trace with hash 485831387, now seen corresponding path program 7 times [2018-11-07 22:10:21,474 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:10:21,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:10:21,475 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:10:21,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:10:21,475 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:10:21,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:10:21,996 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:10:21,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:10:21,997 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:10:21,997 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:10:21,997 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:10:21,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:10:21,997 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:10:22,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:10:22,007 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:10:22,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:10:22,038 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:10:22,090 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:10:22,090 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:10:22,464 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:10:22,494 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:10:22,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 20 [2018-11-07 22:10:22,494 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:10:22,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 22:10:22,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 22:10:22,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2018-11-07 22:10:22,500 INFO L87 Difference]: Start difference. First operand 63 states and 65 transitions. Second operand 11 states. [2018-11-07 22:10:24,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:10:24,009 INFO L93 Difference]: Finished difference Result 190 states and 221 transitions. [2018-11-07 22:10:24,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-07 22:10:24,009 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 53 [2018-11-07 22:10:24,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:10:24,011 INFO L225 Difference]: With dead ends: 190 [2018-11-07 22:10:24,011 INFO L226 Difference]: Without dead ends: 168 [2018-11-07 22:10:24,012 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 96 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2018-11-07 22:10:24,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-11-07 22:10:24,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 67. [2018-11-07 22:10:24,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-07 22:10:24,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 69 transitions. [2018-11-07 22:10:24,023 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 69 transitions. Word has length 53 [2018-11-07 22:10:24,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:10:24,023 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 69 transitions. [2018-11-07 22:10:24,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 22:10:24,023 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 69 transitions. [2018-11-07 22:10:24,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-07 22:10:24,024 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:10:24,024 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:10:24,025 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:10:24,025 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:10:24,025 INFO L82 PathProgramCache]: Analyzing trace with hash 619370498, now seen corresponding path program 8 times [2018-11-07 22:10:24,025 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:10:24,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:10:24,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:10:24,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:10:24,026 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:10:24,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:10:24,280 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:10:24,281 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:10:24,281 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:10:24,281 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:10:24,281 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:10:24,281 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:10:24,281 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:10:24,290 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:10:24,291 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:10:26,424 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-07 22:10:26,425 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:10:26,429 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:10:26,463 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:10:26,463 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:10:26,897 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:10:26,918 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:10:26,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 22 [2018-11-07 22:10:26,918 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:10:26,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-07 22:10:26,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-07 22:10:26,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=321, Unknown=0, NotChecked=0, Total=462 [2018-11-07 22:10:26,921 INFO L87 Difference]: Start difference. First operand 67 states and 69 transitions. Second operand 12 states. [2018-11-07 22:10:27,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:10:27,914 INFO L93 Difference]: Finished difference Result 205 states and 239 transitions. [2018-11-07 22:10:27,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-07 22:10:27,914 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 57 [2018-11-07 22:10:27,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:10:27,916 INFO L225 Difference]: With dead ends: 205 [2018-11-07 22:10:27,916 INFO L226 Difference]: Without dead ends: 183 [2018-11-07 22:10:27,917 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 103 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=141, Invalid=321, Unknown=0, NotChecked=0, Total=462 [2018-11-07 22:10:27,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-11-07 22:10:27,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 71. [2018-11-07 22:10:27,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-11-07 22:10:27,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 73 transitions. [2018-11-07 22:10:27,928 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 73 transitions. Word has length 57 [2018-11-07 22:10:27,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:10:27,928 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 73 transitions. [2018-11-07 22:10:27,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-07 22:10:27,929 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2018-11-07 22:10:27,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-07 22:10:27,930 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:10:27,930 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:10:27,930 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:10:27,930 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:10:27,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1101762985, now seen corresponding path program 9 times [2018-11-07 22:10:27,930 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:10:27,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:10:27,931 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:10:27,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:10:27,932 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:10:27,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:10:28,325 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:10:28,326 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:10:28,326 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:10:28,326 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:10:28,326 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:10:28,326 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:10:28,327 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:10:28,342 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:10:28,343 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:10:28,388 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:10:28,388 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:10:28,391 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:10:28,526 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:10:28,526 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:10:28,875 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:10:28,895 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:10:28,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 24 [2018-11-07 22:10:28,896 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:10:28,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-07 22:10:28,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-07 22:10:28,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-11-07 22:10:28,897 INFO L87 Difference]: Start difference. First operand 71 states and 73 transitions. Second operand 13 states. [2018-11-07 22:10:30,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:10:30,178 INFO L93 Difference]: Finished difference Result 220 states and 257 transitions. [2018-11-07 22:10:30,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-07 22:10:30,180 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 61 [2018-11-07 22:10:30,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:10:30,182 INFO L225 Difference]: With dead ends: 220 [2018-11-07 22:10:30,182 INFO L226 Difference]: Without dead ends: 198 [2018-11-07 22:10:30,183 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 110 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-11-07 22:10:30,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-11-07 22:10:30,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 75. [2018-11-07 22:10:30,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-07 22:10:30,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 77 transitions. [2018-11-07 22:10:30,192 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 77 transitions. Word has length 61 [2018-11-07 22:10:30,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:10:30,193 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 77 transitions. [2018-11-07 22:10:30,193 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-07 22:10:30,193 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 77 transitions. [2018-11-07 22:10:30,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-07 22:10:30,194 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:10:30,194 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:10:30,194 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:10:30,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:10:30,194 INFO L82 PathProgramCache]: Analyzing trace with hash 916004816, now seen corresponding path program 10 times [2018-11-07 22:10:30,195 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:10:30,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:10:30,195 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:10:30,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:10:30,196 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:10:30,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:10:31,248 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 0 proven. 242 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:10:31,248 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:10:31,249 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:10:31,249 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:10:31,249 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:10:31,249 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:10:31,249 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:10:31,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:10:31,262 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:10:31,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:10:31,294 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:10:31,320 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 0 proven. 242 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:10:31,320 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:10:31,724 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 0 proven. 242 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:10:31,744 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:10:31,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 26 [2018-11-07 22:10:31,744 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:10:31,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-07 22:10:31,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-07 22:10:31,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2018-11-07 22:10:31,745 INFO L87 Difference]: Start difference. First operand 75 states and 77 transitions. Second operand 14 states. [2018-11-07 22:10:32,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:10:32,949 INFO L93 Difference]: Finished difference Result 235 states and 275 transitions. [2018-11-07 22:10:32,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-07 22:10:32,951 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 65 [2018-11-07 22:10:32,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:10:32,953 INFO L225 Difference]: With dead ends: 235 [2018-11-07 22:10:32,953 INFO L226 Difference]: Without dead ends: 213 [2018-11-07 22:10:32,954 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 117 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2018-11-07 22:10:32,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-11-07 22:10:32,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 79. [2018-11-07 22:10:32,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-11-07 22:10:32,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 81 transitions. [2018-11-07 22:10:32,965 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 81 transitions. Word has length 65 [2018-11-07 22:10:32,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:10:32,966 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 81 transitions. [2018-11-07 22:10:32,966 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-07 22:10:32,966 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 81 transitions. [2018-11-07 22:10:32,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-07 22:10:32,967 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:10:32,967 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:10:32,968 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:10:32,968 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:10:32,968 INFO L82 PathProgramCache]: Analyzing trace with hash -1070251401, now seen corresponding path program 11 times [2018-11-07 22:10:32,968 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:10:32,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:10:32,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:10:32,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:10:32,969 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:10:32,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:10:33,252 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 0 proven. 288 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:10:33,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:10:33,253 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:10:33,253 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:10:33,253 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:10:33,254 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:10:33,254 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:10:33,263 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:10:33,264 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:11:28,503 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2018-11-07 22:11:28,503 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:11:28,518 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:11:28,544 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 0 proven. 288 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:11:28,544 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:11:28,904 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 0 proven. 288 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:11:28,927 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:11:28,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 28 [2018-11-07 22:11:28,927 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:11:28,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-07 22:11:28,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-07 22:11:28,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=534, Unknown=0, NotChecked=0, Total=756 [2018-11-07 22:11:28,928 INFO L87 Difference]: Start difference. First operand 79 states and 81 transitions. Second operand 15 states. [2018-11-07 22:11:30,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:11:30,425 INFO L93 Difference]: Finished difference Result 250 states and 293 transitions. [2018-11-07 22:11:30,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-07 22:11:30,426 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 69 [2018-11-07 22:11:30,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:11:30,427 INFO L225 Difference]: With dead ends: 250 [2018-11-07 22:11:30,428 INFO L226 Difference]: Without dead ends: 228 [2018-11-07 22:11:30,428 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 124 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=222, Invalid=534, Unknown=0, NotChecked=0, Total=756 [2018-11-07 22:11:30,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2018-11-07 22:11:30,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 83. [2018-11-07 22:11:30,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-11-07 22:11:30,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 85 transitions. [2018-11-07 22:11:30,437 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 85 transitions. Word has length 69 [2018-11-07 22:11:30,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:11:30,438 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 85 transitions. [2018-11-07 22:11:30,438 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-07 22:11:30,438 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 85 transitions. [2018-11-07 22:11:30,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-07 22:11:30,439 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:11:30,439 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:11:30,439 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:11:30,439 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:11:30,439 INFO L82 PathProgramCache]: Analyzing trace with hash 69319070, now seen corresponding path program 12 times [2018-11-07 22:11:30,440 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:11:30,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:11:30,440 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:11:30,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:11:30,441 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:11:30,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:11:30,737 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 0 proven. 338 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:11:30,738 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:11:30,738 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:11:30,738 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:11:30,738 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:11:30,738 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:11:30,738 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:11:30,747 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:11:30,747 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:11:30,770 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:11:30,770 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:11:30,773 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:11:30,797 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 0 proven. 338 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:11:30,797 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:11:31,249 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 0 proven. 338 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:11:31,269 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:11:31,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 30 [2018-11-07 22:11:31,270 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:11:31,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-07 22:11:31,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-07 22:11:31,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=617, Unknown=0, NotChecked=0, Total=870 [2018-11-07 22:11:31,271 INFO L87 Difference]: Start difference. First operand 83 states and 85 transitions. Second operand 16 states. [2018-11-07 22:11:32,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:11:32,551 INFO L93 Difference]: Finished difference Result 265 states and 311 transitions. [2018-11-07 22:11:32,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-07 22:11:32,552 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 73 [2018-11-07 22:11:32,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:11:32,553 INFO L225 Difference]: With dead ends: 265 [2018-11-07 22:11:32,553 INFO L226 Difference]: Without dead ends: 243 [2018-11-07 22:11:32,554 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 131 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=253, Invalid=617, Unknown=0, NotChecked=0, Total=870 [2018-11-07 22:11:32,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-11-07 22:11:32,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 87. [2018-11-07 22:11:32,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-11-07 22:11:32,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 89 transitions. [2018-11-07 22:11:32,565 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 89 transitions. Word has length 73 [2018-11-07 22:11:32,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:11:32,566 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 89 transitions. [2018-11-07 22:11:32,566 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-07 22:11:32,566 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 89 transitions. [2018-11-07 22:11:32,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-07 22:11:32,567 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:11:32,567 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:11:32,567 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:11:32,568 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:11:32,568 INFO L82 PathProgramCache]: Analyzing trace with hash 18892101, now seen corresponding path program 13 times [2018-11-07 22:11:32,568 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:11:32,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:11:32,569 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:11:32,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:11:32,569 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:11:32,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:11:33,127 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:11:33,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:11:33,128 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:11:33,128 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:11:33,128 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:11:33,128 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:11:33,128 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:11:33,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:11:33,137 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:11:33,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:11:33,166 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:11:33,181 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:11:33,182 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:11:33,684 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:11:33,704 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:11:33,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 32 [2018-11-07 22:11:33,704 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:11:33,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-07 22:11:33,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-07 22:11:33,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=706, Unknown=0, NotChecked=0, Total=992 [2018-11-07 22:11:33,706 INFO L87 Difference]: Start difference. First operand 87 states and 89 transitions. Second operand 17 states. [2018-11-07 22:11:35,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:11:35,585 INFO L93 Difference]: Finished difference Result 280 states and 329 transitions. [2018-11-07 22:11:35,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-07 22:11:35,585 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 77 [2018-11-07 22:11:35,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:11:35,588 INFO L225 Difference]: With dead ends: 280 [2018-11-07 22:11:35,588 INFO L226 Difference]: Without dead ends: 258 [2018-11-07 22:11:35,589 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 138 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=286, Invalid=706, Unknown=0, NotChecked=0, Total=992 [2018-11-07 22:11:35,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-11-07 22:11:35,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 91. [2018-11-07 22:11:35,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-11-07 22:11:35,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 93 transitions. [2018-11-07 22:11:35,599 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 93 transitions. Word has length 77 [2018-11-07 22:11:35,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:11:35,599 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 93 transitions. [2018-11-07 22:11:35,600 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-07 22:11:35,600 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 93 transitions. [2018-11-07 22:11:35,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-07 22:11:35,601 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:11:35,601 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:11:35,601 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:11:35,601 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:11:35,601 INFO L82 PathProgramCache]: Analyzing trace with hash -15555220, now seen corresponding path program 14 times [2018-11-07 22:11:35,602 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:11:35,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:11:35,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:11:35,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:11:35,603 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:11:35,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:11:36,416 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 0 proven. 450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:11:36,416 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:11:36,416 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:11:36,416 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:11:36,417 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:11:36,417 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:11:36,417 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:11:36,426 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:11:36,426 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:14:00,839 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-11-07 22:14:00,839 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:14:00,870 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:14:00,939 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 0 proven. 450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:14:00,939 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:14:41,639 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 0 proven. 442 refuted. 8 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:14:41,662 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:14:41,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 19] total 35 [2018-11-07 22:14:41,663 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:14:41,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-07 22:14:41,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-07 22:14:41,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=340, Invalid=838, Unknown=12, NotChecked=0, Total=1190 [2018-11-07 22:14:41,664 INFO L87 Difference]: Start difference. First operand 91 states and 93 transitions. Second operand 18 states. [2018-11-07 22:14:43,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:14:43,415 INFO L93 Difference]: Finished difference Result 295 states and 347 transitions. [2018-11-07 22:14:43,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-07 22:14:43,417 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 81 [2018-11-07 22:14:43,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:14:43,418 INFO L225 Difference]: With dead ends: 295 [2018-11-07 22:14:43,418 INFO L226 Difference]: Without dead ends: 273 [2018-11-07 22:14:43,419 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 141 SyntacticMatches, 5 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 41.4s TimeCoverageRelationStatistics Valid=340, Invalid=838, Unknown=12, NotChecked=0, Total=1190 [2018-11-07 22:14:43,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-11-07 22:14:43,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 95. [2018-11-07 22:14:43,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-11-07 22:14:43,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 97 transitions. [2018-11-07 22:14:43,429 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 97 transitions. Word has length 81 [2018-11-07 22:14:43,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:14:43,430 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 97 transitions. [2018-11-07 22:14:43,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-07 22:14:43,430 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 97 transitions. [2018-11-07 22:14:43,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-07 22:14:43,430 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:14:43,430 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:14:43,431 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:14:43,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:14:43,431 INFO L82 PathProgramCache]: Analyzing trace with hash -17130989, now seen corresponding path program 15 times [2018-11-07 22:14:43,431 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:14:43,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:43,432 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:14:43,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:43,432 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:14:43,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:14:43,962 INFO L134 CoverageAnalysis]: Checked inductivity of 512 backedges. 0 proven. 512 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:14:43,962 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:43,962 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:14:43,963 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:14:43,963 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:14:43,963 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:43,963 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:14:43,971 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:14:43,971 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:14:44,000 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:14:44,000 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:14:44,002 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:14:44,074 INFO L134 CoverageAnalysis]: Checked inductivity of 512 backedges. 0 proven. 512 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:14:44,074 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:14:44,688 INFO L134 CoverageAnalysis]: Checked inductivity of 512 backedges. 0 proven. 512 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:14:44,708 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:14:44,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 36 [2018-11-07 22:14:44,708 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:14:44,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-07 22:14:44,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-07 22:14:44,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=358, Invalid=902, Unknown=0, NotChecked=0, Total=1260 [2018-11-07 22:14:44,710 INFO L87 Difference]: Start difference. First operand 95 states and 97 transitions. Second operand 19 states. [2018-11-07 22:14:47,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:14:47,358 INFO L93 Difference]: Finished difference Result 310 states and 365 transitions. [2018-11-07 22:14:47,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-07 22:14:47,358 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 85 [2018-11-07 22:14:47,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:14:47,360 INFO L225 Difference]: With dead ends: 310 [2018-11-07 22:14:47,361 INFO L226 Difference]: Without dead ends: 288 [2018-11-07 22:14:47,362 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 152 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=358, Invalid=902, Unknown=0, NotChecked=0, Total=1260 [2018-11-07 22:14:47,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2018-11-07 22:14:47,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 99. [2018-11-07 22:14:47,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-07 22:14:47,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 101 transitions. [2018-11-07 22:14:47,375 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 101 transitions. Word has length 85 [2018-11-07 22:14:47,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:14:47,376 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 101 transitions. [2018-11-07 22:14:47,376 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-07 22:14:47,376 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 101 transitions. [2018-11-07 22:14:47,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-07 22:14:47,377 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:14:47,377 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:14:47,377 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:14:47,377 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:14:47,377 INFO L82 PathProgramCache]: Analyzing trace with hash 721019706, now seen corresponding path program 16 times [2018-11-07 22:14:47,378 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:14:47,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:47,378 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:14:47,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:47,379 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:14:47,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:14:47,757 INFO L134 CoverageAnalysis]: Checked inductivity of 578 backedges. 0 proven. 578 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:14:47,758 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:47,758 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:14:47,758 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:14:47,758 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:14:47,758 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:47,758 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:14:47,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:14:47,770 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:14:47,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:14:47,803 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:14:47,832 INFO L134 CoverageAnalysis]: Checked inductivity of 578 backedges. 0 proven. 578 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:14:47,833 INFO L316 TraceCheckSpWp]: Computing backward predicates... Received shutdown request... [2018-11-07 22:14:48,263 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2018-11-07 22:14:48,464 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:14:48,464 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-07 22:14:48,469 WARN L205 ceAbstractionStarter]: Timeout [2018-11-07 22:14:48,469 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 10:14:48 BoogieIcfgContainer [2018-11-07 22:14:48,469 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 22:14:48,470 INFO L168 Benchmark]: Toolchain (without parser) took 280550.71 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 971.0 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -886.0 MB). Peak memory consumption was 85.0 MB. Max. memory is 7.1 GB. [2018-11-07 22:14:48,472 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 22:14:48,472 INFO L168 Benchmark]: CACSL2BoogieTranslator took 328.04 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-07 22:14:48,473 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.08 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 22:14:48,473 INFO L168 Benchmark]: Boogie Preprocessor took 26.33 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 22:14:48,474 INFO L168 Benchmark]: RCFGBuilder took 539.72 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 739.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -775.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 7.1 GB. [2018-11-07 22:14:48,474 INFO L168 Benchmark]: TraceAbstraction took 279627.93 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 231.7 MB). Free memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: -120.9 MB). Peak memory consumption was 110.9 MB. Max. memory is 7.1 GB. [2018-11-07 22:14:48,478 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 328.04 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 24.08 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 26.33 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 539.72 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 739.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -775.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 279627.93 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 231.7 MB). Free memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: -120.9 MB). Peak memory consumption was 110.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 13]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 13). Cancelled while BasicCegarLoop was analyzing trace of length 90 with TraceHistMax 18,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 33 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 34 locations, 1 error locations. TIMEOUT Result, 279.5s OverallTime, 19 OverallIterations, 18 TraceHistogramMax, 17.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1512 SDtfs, 1432 SDslu, 13563 SDs, 0 SdLazy, 16442 SolverSat, 176 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1885 GetRequests, 1535 SyntacticMatches, 31 SemanticMatches, 319 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 51.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=99occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.4s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 18 MinimizatonAttempts, 1712 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 206.4s SatisfiabilityAnalysisTime, 52.5s InterpolantComputationTime, 1760 NumberOfCodeBlocks, 1760 NumberOfCodeBlocksAsserted, 83 NumberOfCheckSat, 2563 ConstructedInterpolants, 0 QuantifiedInterpolants, 818301 SizeOfPredicates, 24 NumberOfNonLiveVariables, 1838 ConjunctsInSsa, 321 ConjunctsInUnsatCore, 48 InterpolantComputations, 3 PerfectInterpolantSequences, 0/8952 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown