java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf -i ../../../trunk/examples/svcomp/loops/sum03_false-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 12:23:58,391 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 12:23:58,393 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 12:23:58,405 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 12:23:58,405 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 12:23:58,406 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 12:23:58,408 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 12:23:58,409 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 12:23:58,411 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 12:23:58,412 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 12:23:58,413 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 12:23:58,413 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 12:23:58,414 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 12:23:58,415 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 12:23:58,416 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 12:23:58,417 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 12:23:58,418 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 12:23:58,420 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 12:23:58,422 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 12:23:58,424 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 12:23:58,425 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 12:23:58,426 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 12:23:58,429 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 12:23:58,429 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 12:23:58,430 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 12:23:58,431 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 12:23:58,432 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 12:23:58,433 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 12:23:58,433 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 12:23:58,435 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 12:23:58,435 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 12:23:58,436 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 12:23:58,436 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 12:23:58,436 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 12:23:58,437 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 12:23:58,438 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 12:23:58,438 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf [2018-10-24 12:23:58,454 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 12:23:58,454 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 12:23:58,455 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 12:23:58,455 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-24 12:23:58,455 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-24 12:23:58,456 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-24 12:23:58,456 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-24 12:23:58,456 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-24 12:23:58,456 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-24 12:23:58,456 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-24 12:23:58,457 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-24 12:23:58,457 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-24 12:23:58,457 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-24 12:23:58,457 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-24 12:23:58,458 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 12:23:58,458 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 12:23:58,458 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 12:23:58,458 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 12:23:58,459 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 12:23:58,459 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 12:23:58,459 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 12:23:58,459 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 12:23:58,459 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 12:23:58,460 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 12:23:58,460 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 12:23:58,460 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 12:23:58,460 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 12:23:58,460 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 12:23:58,461 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 12:23:58,461 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 12:23:58,461 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-24 12:23:58,461 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 12:23:58,461 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 12:23:58,461 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 12:23:58,462 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 12:23:58,462 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-24 12:23:58,505 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 12:23:58,518 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 12:23:58,521 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 12:23:58,523 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 12:23:58,523 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 12:23:58,524 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/loops/sum03_false-unreach-call_true-termination.i [2018-10-24 12:23:58,580 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/6a0e1213e/d2972e91c4f042c793a1653378943ec7/FLAG59f450f5a [2018-10-24 12:23:59,001 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 12:23:59,002 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum03_false-unreach-call_true-termination.i [2018-10-24 12:23:59,009 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/6a0e1213e/d2972e91c4f042c793a1653378943ec7/FLAG59f450f5a [2018-10-24 12:23:59,024 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/6a0e1213e/d2972e91c4f042c793a1653378943ec7 [2018-10-24 12:23:59,037 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 12:23:59,038 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 12:23:59,039 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 12:23:59,040 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 12:23:59,046 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 12:23:59,046 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:23:59" (1/1) ... [2018-10-24 12:23:59,050 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72305746 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:23:59, skipping insertion in model container [2018-10-24 12:23:59,050 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:23:59" (1/1) ... [2018-10-24 12:23:59,061 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 12:23:59,087 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 12:23:59,292 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 12:23:59,298 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 12:23:59,318 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 12:23:59,336 INFO L193 MainTranslator]: Completed translation [2018-10-24 12:23:59,337 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:23:59 WrapperNode [2018-10-24 12:23:59,337 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 12:23:59,338 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 12:23:59,338 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 12:23:59,338 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 12:23:59,349 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:23:59" (1/1) ... [2018-10-24 12:23:59,356 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:23:59" (1/1) ... [2018-10-24 12:23:59,363 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 12:23:59,364 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 12:23:59,364 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 12:23:59,364 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 12:23:59,374 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:23:59" (1/1) ... [2018-10-24 12:23:59,375 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:23:59" (1/1) ... [2018-10-24 12:23:59,375 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:23:59" (1/1) ... [2018-10-24 12:23:59,376 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:23:59" (1/1) ... [2018-10-24 12:23:59,380 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:23:59" (1/1) ... [2018-10-24 12:23:59,389 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:23:59" (1/1) ... [2018-10-24 12:23:59,390 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:23:59" (1/1) ... [2018-10-24 12:23:59,392 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 12:23:59,392 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 12:23:59,392 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 12:23:59,393 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 12:23:59,394 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:23:59" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 12:23:59,555 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-24 12:23:59,556 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-24 12:23:59,556 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 12:23:59,556 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 12:23:59,556 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-24 12:23:59,556 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-24 12:23:59,557 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-10-24 12:23:59,557 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-10-24 12:23:59,781 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 12:23:59,782 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:23:59 BoogieIcfgContainer [2018-10-24 12:23:59,782 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 12:23:59,789 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 12:23:59,790 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 12:23:59,796 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 12:23:59,797 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 12:23:59" (1/3) ... [2018-10-24 12:23:59,798 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@322d1a00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:23:59, skipping insertion in model container [2018-10-24 12:23:59,798 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:23:59" (2/3) ... [2018-10-24 12:23:59,799 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@322d1a00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:23:59, skipping insertion in model container [2018-10-24 12:23:59,799 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:23:59" (3/3) ... [2018-10-24 12:23:59,801 INFO L112 eAbstractionObserver]: Analyzing ICFG sum03_false-unreach-call_true-termination.i [2018-10-24 12:23:59,823 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 12:23:59,835 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 12:23:59,861 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 12:23:59,928 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 12:23:59,928 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 12:23:59,929 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 12:23:59,929 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 12:23:59,929 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 12:23:59,929 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 12:23:59,929 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 12:23:59,930 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 12:23:59,948 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2018-10-24 12:23:59,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-24 12:23:59,955 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:23:59,956 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:23:59,959 INFO L424 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:23:59,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:23:59,965 INFO L82 PathProgramCache]: Analyzing trace with hash -1231955355, now seen corresponding path program 1 times [2018-10-24 12:23:59,968 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:24:00,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:00,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:24:00,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:00,015 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:24:00,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:24:00,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:24:00,316 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 12:24:00,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-24 12:24:00,317 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 12:24:00,322 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 12:24:00,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 12:24:00,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-24 12:24:00,338 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 6 states. [2018-10-24 12:24:00,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:24:00,540 INFO L93 Difference]: Finished difference Result 41 states and 54 transitions. [2018-10-24 12:24:00,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-24 12:24:00,542 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-10-24 12:24:00,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:24:00,552 INFO L225 Difference]: With dead ends: 41 [2018-10-24 12:24:00,552 INFO L226 Difference]: Without dead ends: 26 [2018-10-24 12:24:00,556 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-24 12:24:00,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-10-24 12:24:00,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2018-10-24 12:24:00,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-10-24 12:24:00,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2018-10-24 12:24:00,598 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 13 [2018-10-24 12:24:00,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:24:00,598 INFO L481 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2018-10-24 12:24:00,599 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 12:24:00,599 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2018-10-24 12:24:00,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-24 12:24:00,600 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:24:00,600 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:24:00,603 INFO L424 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:24:00,604 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:24:00,604 INFO L82 PathProgramCache]: Analyzing trace with hash -1174697053, now seen corresponding path program 1 times [2018-10-24 12:24:00,604 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:24:00,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:00,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:24:00,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:00,608 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:24:00,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:24:00,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:24:00,727 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 12:24:00,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-24 12:24:00,727 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 12:24:00,729 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 12:24:00,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 12:24:00,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-24 12:24:00,730 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 5 states. [2018-10-24 12:24:00,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:24:00,947 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2018-10-24 12:24:00,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 12:24:00,948 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-10-24 12:24:00,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:24:00,951 INFO L225 Difference]: With dead ends: 39 [2018-10-24 12:24:00,951 INFO L226 Difference]: Without dead ends: 37 [2018-10-24 12:24:00,952 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-24 12:24:00,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-24 12:24:00,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-10-24 12:24:00,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-10-24 12:24:00,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2018-10-24 12:24:00,967 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 13 [2018-10-24 12:24:00,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:24:00,967 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-10-24 12:24:00,967 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 12:24:00,967 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-10-24 12:24:00,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-24 12:24:00,968 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:24:00,968 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:24:00,969 INFO L424 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:24:00,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:24:00,969 INFO L82 PathProgramCache]: Analyzing trace with hash -494238111, now seen corresponding path program 1 times [2018-10-24 12:24:00,969 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:24:00,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:00,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:24:00,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:00,971 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:24:00,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:24:01,162 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:24:01,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:24:01,163 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:24:01,164 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 23 with the following transitions: [2018-10-24 12:24:01,170 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [14], [17], [19], [21], [27], [30], [32], [35], [37], [38], [39], [40], [42], [43] [2018-10-24 12:24:01,228 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-24 12:24:01,228 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 12:24:01,563 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-24 12:24:01,564 INFO L272 AbstractInterpreter]: Visited 17 different actions 39 times. Merged at 5 different actions 10 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 7 variables. [2018-10-24 12:24:01,576 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:24:01,577 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-24 12:24:01,577 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:24:01,577 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:24:01,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:24:01,588 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 12:24:01,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:24:01,626 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:24:01,666 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:24:01,666 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:24:01,725 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:24:01,749 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:24:01,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-10-24 12:24:01,750 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:24:01,751 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 12:24:01,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 12:24:01,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-10-24 12:24:01,752 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 4 states. [2018-10-24 12:24:01,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:24:01,792 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2018-10-24 12:24:01,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 12:24:01,792 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-10-24 12:24:01,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:24:01,794 INFO L225 Difference]: With dead ends: 54 [2018-10-24 12:24:01,794 INFO L226 Difference]: Without dead ends: 34 [2018-10-24 12:24:01,795 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-10-24 12:24:01,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-10-24 12:24:01,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-10-24 12:24:01,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-10-24 12:24:01,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2018-10-24 12:24:01,807 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 22 [2018-10-24 12:24:01,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:24:01,807 INFO L481 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2018-10-24 12:24:01,808 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 12:24:01,808 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2018-10-24 12:24:01,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-10-24 12:24:01,810 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:24:01,810 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:24:01,810 INFO L424 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:24:01,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:24:01,811 INFO L82 PathProgramCache]: Analyzing trace with hash -2135506589, now seen corresponding path program 2 times [2018-10-24 12:24:01,811 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:24:01,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:01,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:24:01,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:01,813 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:24:01,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:24:01,982 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-24 12:24:01,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:24:01,983 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:24:01,983 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:24:01,984 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:24:01,984 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:24:01,984 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:24:02,003 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-24 12:24:02,003 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-24 12:24:02,160 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-10-24 12:24:02,161 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:24:02,163 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:24:02,195 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-24 12:24:02,195 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:24:02,262 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-24 12:24:02,282 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:24:02,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2018-10-24 12:24:02,282 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:24:02,283 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 12:24:02,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 12:24:02,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-10-24 12:24:02,285 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand 5 states. [2018-10-24 12:24:02,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:24:02,409 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2018-10-24 12:24:02,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 12:24:02,410 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-10-24 12:24:02,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:24:02,412 INFO L225 Difference]: With dead ends: 50 [2018-10-24 12:24:02,412 INFO L226 Difference]: Without dead ends: 39 [2018-10-24 12:24:02,413 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-10-24 12:24:02,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-24 12:24:02,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2018-10-24 12:24:02,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-10-24 12:24:02,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2018-10-24 12:24:02,422 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 31 [2018-10-24 12:24:02,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:24:02,422 INFO L481 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2018-10-24 12:24:02,422 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 12:24:02,423 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2018-10-24 12:24:02,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-24 12:24:02,424 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:24:02,424 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:24:02,424 INFO L424 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:24:02,425 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:24:02,425 INFO L82 PathProgramCache]: Analyzing trace with hash -374355807, now seen corresponding path program 3 times [2018-10-24 12:24:02,425 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:24:02,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:02,426 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:24:02,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:02,426 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:24:02,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:24:02,765 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 12 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-24 12:24:02,766 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:24:02,766 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:24:02,766 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:24:02,767 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:24:02,767 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:24:02,767 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:24:02,787 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-24 12:24:02,787 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-24 12:24:02,814 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-24 12:24:02,814 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:24:02,817 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:24:02,862 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 12 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-24 12:24:02,863 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:24:03,295 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 12 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-24 12:24:03,317 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:24:03,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2018-10-24 12:24:03,317 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:24:03,318 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 12:24:03,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 12:24:03,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-10-24 12:24:03,318 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 6 states. [2018-10-24 12:24:03,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:24:03,505 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2018-10-24 12:24:03,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-24 12:24:03,506 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2018-10-24 12:24:03,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:24:03,508 INFO L225 Difference]: With dead ends: 55 [2018-10-24 12:24:03,508 INFO L226 Difference]: Without dead ends: 44 [2018-10-24 12:24:03,509 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 76 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-10-24 12:24:03,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-10-24 12:24:03,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2018-10-24 12:24:03,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-10-24 12:24:03,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-10-24 12:24:03,517 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 40 [2018-10-24 12:24:03,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:24:03,517 INFO L481 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-10-24 12:24:03,517 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 12:24:03,518 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-10-24 12:24:03,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-10-24 12:24:03,519 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:24:03,519 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:24:03,520 INFO L424 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:24:03,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:24:03,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1263007965, now seen corresponding path program 4 times [2018-10-24 12:24:03,520 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:24:03,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:03,521 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:24:03,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:03,522 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:24:03,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:24:03,687 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 16 proven. 42 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-10-24 12:24:03,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:24:03,687 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:24:03,688 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:24:03,688 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:24:03,688 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:24:03,688 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:24:03,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:24:03,697 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 12:24:03,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:24:03,731 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:24:03,773 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 16 proven. 42 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-10-24 12:24:03,773 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:24:04,037 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 16 proven. 42 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-10-24 12:24:04,059 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:24:04,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2018-10-24 12:24:04,059 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:24:04,061 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-24 12:24:04,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-24 12:24:04,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-10-24 12:24:04,062 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 7 states. [2018-10-24 12:24:04,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:24:04,176 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2018-10-24 12:24:04,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 12:24:04,177 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 49 [2018-10-24 12:24:04,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:24:04,179 INFO L225 Difference]: With dead ends: 60 [2018-10-24 12:24:04,179 INFO L226 Difference]: Without dead ends: 49 [2018-10-24 12:24:04,180 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 93 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-10-24 12:24:04,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-24 12:24:04,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2018-10-24 12:24:04,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-10-24 12:24:04,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2018-10-24 12:24:04,189 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 49 [2018-10-24 12:24:04,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:24:04,190 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2018-10-24 12:24:04,190 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-24 12:24:04,190 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2018-10-24 12:24:04,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-10-24 12:24:04,192 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:24:04,192 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:24:04,192 INFO L424 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:24:04,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:24:04,193 INFO L82 PathProgramCache]: Analyzing trace with hash -1453262111, now seen corresponding path program 5 times [2018-10-24 12:24:04,193 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:24:04,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:04,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:24:04,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:04,194 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:24:04,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:24:04,553 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 20 proven. 65 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-10-24 12:24:04,554 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:24:04,554 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:24:04,554 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:24:04,554 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:24:04,554 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:24:04,554 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:24:04,564 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-24 12:24:04,564 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-24 12:24:06,554 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-10-24 12:24:06,555 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:24:06,578 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:24:06,768 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 23 proven. 74 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-10-24 12:24:06,768 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:24:07,495 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-10-24 12:24:07,901 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 23 proven. 74 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-10-24 12:24:07,931 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:24:07,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13, 14] total 26 [2018-10-24 12:24:07,931 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:24:07,932 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-24 12:24:07,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-24 12:24:07,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=483, Unknown=0, NotChecked=0, Total=650 [2018-10-24 12:24:07,934 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand 15 states. [2018-10-24 12:24:08,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:24:08,394 INFO L93 Difference]: Finished difference Result 67 states and 76 transitions. [2018-10-24 12:24:08,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-24 12:24:08,395 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 58 [2018-10-24 12:24:08,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:24:08,396 INFO L225 Difference]: With dead ends: 67 [2018-10-24 12:24:08,397 INFO L226 Difference]: Without dead ends: 56 [2018-10-24 12:24:08,398 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 97 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=172, Invalid=530, Unknown=0, NotChecked=0, Total=702 [2018-10-24 12:24:08,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-10-24 12:24:08,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 53. [2018-10-24 12:24:08,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-10-24 12:24:08,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2018-10-24 12:24:08,407 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 58 [2018-10-24 12:24:08,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:24:08,407 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2018-10-24 12:24:08,407 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-24 12:24:08,407 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2018-10-24 12:24:08,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-10-24 12:24:08,409 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:24:08,410 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:24:08,410 INFO L424 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:24:08,410 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:24:08,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1989893347, now seen corresponding path program 6 times [2018-10-24 12:24:08,411 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:24:08,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:08,412 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:24:08,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:08,412 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:24:08,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:24:08,618 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 24 proven. 93 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-10-24 12:24:08,618 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:24:08,619 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:24:08,619 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:24:08,619 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:24:08,619 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:24:08,619 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:24:08,627 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-24 12:24:08,627 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-24 12:24:08,662 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-24 12:24:08,663 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:24:08,668 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:24:08,732 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 24 proven. 93 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-10-24 12:24:08,733 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:24:09,281 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 24 proven. 93 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-10-24 12:24:09,303 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:24:09,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2018-10-24 12:24:09,303 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:24:09,304 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-24 12:24:09,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-24 12:24:09,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2018-10-24 12:24:09,305 INFO L87 Difference]: Start difference. First operand 53 states and 60 transitions. Second operand 9 states. [2018-10-24 12:24:09,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:24:09,454 INFO L93 Difference]: Finished difference Result 70 states and 80 transitions. [2018-10-24 12:24:09,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-24 12:24:09,455 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2018-10-24 12:24:09,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:24:09,457 INFO L225 Difference]: With dead ends: 70 [2018-10-24 12:24:09,457 INFO L226 Difference]: Without dead ends: 59 [2018-10-24 12:24:09,458 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 127 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2018-10-24 12:24:09,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-24 12:24:09,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2018-10-24 12:24:09,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-10-24 12:24:09,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 66 transitions. [2018-10-24 12:24:09,467 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 66 transitions. Word has length 67 [2018-10-24 12:24:09,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:24:09,468 INFO L481 AbstractCegarLoop]: Abstraction has 58 states and 66 transitions. [2018-10-24 12:24:09,468 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-24 12:24:09,468 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions. [2018-10-24 12:24:09,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-10-24 12:24:09,469 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:24:09,470 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:24:09,470 INFO L424 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:24:09,470 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:24:09,470 INFO L82 PathProgramCache]: Analyzing trace with hash -259908319, now seen corresponding path program 7 times [2018-10-24 12:24:09,470 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:24:09,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:09,471 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:24:09,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:09,472 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:24:09,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:24:09,711 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 28 proven. 126 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-10-24 12:24:09,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:24:09,711 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:24:09,712 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:24:09,712 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:24:09,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:24:09,712 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:24:09,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:24:09,722 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 12:24:09,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:24:09,749 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:24:09,799 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 28 proven. 126 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-10-24 12:24:09,800 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:24:10,148 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 28 proven. 126 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-10-24 12:24:10,171 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:24:10,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 18 [2018-10-24 12:24:10,172 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:24:10,173 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-24 12:24:10,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-24 12:24:10,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2018-10-24 12:24:10,174 INFO L87 Difference]: Start difference. First operand 58 states and 66 transitions. Second operand 10 states. [2018-10-24 12:24:10,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:24:10,502 INFO L93 Difference]: Finished difference Result 75 states and 86 transitions. [2018-10-24 12:24:10,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-24 12:24:10,503 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 76 [2018-10-24 12:24:10,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:24:10,505 INFO L225 Difference]: With dead ends: 75 [2018-10-24 12:24:10,505 INFO L226 Difference]: Without dead ends: 64 [2018-10-24 12:24:10,506 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 144 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2018-10-24 12:24:10,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-10-24 12:24:10,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2018-10-24 12:24:10,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-10-24 12:24:10,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 72 transitions. [2018-10-24 12:24:10,516 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 72 transitions. Word has length 76 [2018-10-24 12:24:10,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:24:10,517 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 72 transitions. [2018-10-24 12:24:10,517 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-24 12:24:10,517 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 72 transitions. [2018-10-24 12:24:10,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-10-24 12:24:10,519 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:24:10,519 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:24:10,519 INFO L424 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:24:10,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:24:10,520 INFO L82 PathProgramCache]: Analyzing trace with hash 2013053603, now seen corresponding path program 8 times [2018-10-24 12:24:10,520 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:24:10,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:10,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:24:10,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:10,521 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:24:10,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:24:11,096 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 32 proven. 164 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-10-24 12:24:11,097 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:24:11,097 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:24:11,097 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:24:11,097 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:24:11,097 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:24:11,097 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:24:11,113 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-24 12:24:11,114 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-24 12:24:16,288 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-10-24 12:24:16,288 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:24:16,310 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:24:16,376 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 32 proven. 164 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-10-24 12:24:16,376 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:24:16,669 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 32 proven. 164 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-10-24 12:24:16,690 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:24:16,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 20 [2018-10-24 12:24:16,691 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:24:16,691 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-24 12:24:16,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-24 12:24:16,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2018-10-24 12:24:16,692 INFO L87 Difference]: Start difference. First operand 63 states and 72 transitions. Second operand 11 states. [2018-10-24 12:24:16,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:24:16,951 INFO L93 Difference]: Finished difference Result 80 states and 92 transitions. [2018-10-24 12:24:16,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-24 12:24:16,952 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 85 [2018-10-24 12:24:16,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:24:16,954 INFO L225 Difference]: With dead ends: 80 [2018-10-24 12:24:16,954 INFO L226 Difference]: Without dead ends: 69 [2018-10-24 12:24:16,955 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 161 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2018-10-24 12:24:16,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-10-24 12:24:16,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2018-10-24 12:24:16,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-10-24 12:24:16,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 78 transitions. [2018-10-24 12:24:16,964 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 78 transitions. Word has length 85 [2018-10-24 12:24:16,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:24:16,965 INFO L481 AbstractCegarLoop]: Abstraction has 68 states and 78 transitions. [2018-10-24 12:24:16,965 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-24 12:24:16,965 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 78 transitions. [2018-10-24 12:24:16,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-10-24 12:24:16,967 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:24:16,967 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:24:16,968 INFO L424 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:24:16,968 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:24:16,968 INFO L82 PathProgramCache]: Analyzing trace with hash 485961569, now seen corresponding path program 9 times [2018-10-24 12:24:16,968 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:24:16,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:16,969 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:24:16,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:16,969 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:24:16,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:24:17,261 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 36 proven. 207 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-10-24 12:24:17,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:24:17,262 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:24:17,262 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:24:17,263 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:24:17,263 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:24:17,263 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:24:17,270 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-24 12:24:17,271 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-24 12:24:17,323 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-24 12:24:17,323 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:24:17,327 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:24:17,361 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 36 proven. 207 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-10-24 12:24:17,362 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:24:17,715 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 36 proven. 207 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-10-24 12:24:17,737 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:24:17,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 22 [2018-10-24 12:24:17,738 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:24:17,738 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-24 12:24:17,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-24 12:24:17,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2018-10-24 12:24:17,739 INFO L87 Difference]: Start difference. First operand 68 states and 78 transitions. Second operand 12 states. [2018-10-24 12:24:18,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:24:18,082 INFO L93 Difference]: Finished difference Result 85 states and 98 transitions. [2018-10-24 12:24:18,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-24 12:24:18,083 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 94 [2018-10-24 12:24:18,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:24:18,084 INFO L225 Difference]: With dead ends: 85 [2018-10-24 12:24:18,085 INFO L226 Difference]: Without dead ends: 74 [2018-10-24 12:24:18,086 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 178 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2018-10-24 12:24:18,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-10-24 12:24:18,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2018-10-24 12:24:18,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-10-24 12:24:18,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 84 transitions. [2018-10-24 12:24:18,096 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 84 transitions. Word has length 94 [2018-10-24 12:24:18,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:24:18,097 INFO L481 AbstractCegarLoop]: Abstraction has 73 states and 84 transitions. [2018-10-24 12:24:18,097 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-24 12:24:18,097 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 84 transitions. [2018-10-24 12:24:18,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-10-24 12:24:18,099 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:24:18,099 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:24:18,099 INFO L424 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:24:18,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:24:18,100 INFO L82 PathProgramCache]: Analyzing trace with hash -1149749149, now seen corresponding path program 10 times [2018-10-24 12:24:18,100 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:24:18,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:18,101 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:24:18,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:24:18,101 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:24:18,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-24 12:24:18,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-24 12:24:18,201 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-10-24 12:24:18,272 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 12:24:18 BoogieIcfgContainer [2018-10-24 12:24:18,272 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-24 12:24:18,273 INFO L168 Benchmark]: Toolchain (without parser) took 19235.87 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 888.1 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -701.6 MB). Peak memory consumption was 186.6 MB. Max. memory is 7.1 GB. [2018-10-24 12:24:18,274 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 12:24:18,275 INFO L168 Benchmark]: CACSL2BoogieTranslator took 297.58 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-10-24 12:24:18,276 INFO L168 Benchmark]: Boogie Procedure Inliner took 25.89 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 12:24:18,277 INFO L168 Benchmark]: Boogie Preprocessor took 28.17 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 12:24:18,278 INFO L168 Benchmark]: RCFGBuilder took 390.26 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 780.7 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -830.6 MB). Peak memory consumption was 26.6 MB. Max. memory is 7.1 GB. [2018-10-24 12:24:18,281 INFO L168 Benchmark]: TraceAbstraction took 18482.80 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 107.5 MB). Free memory was 2.3 GB in the beginning and 2.1 GB in the end (delta: 118.5 MB). Peak memory consumption was 226.0 MB. Max. memory is 7.1 GB. [2018-10-24 12:24:18,287 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.19 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 297.58 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 25.89 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 28.17 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 390.26 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 780.7 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -830.6 MB). Peak memory consumption was 26.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 18482.80 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 107.5 MB). Free memory was 2.3 GB in the beginning and 2.1 GB in the end (delta: 118.5 MB). Peak memory consumption was 226.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L10] int sn=0; [L11] unsigned int loop1=__VERIFIER_nondet_uint(), n1=__VERIFIER_nondet_uint(); [L11] unsigned int loop1=__VERIFIER_nondet_uint(), n1=__VERIFIER_nondet_uint(); [L12] unsigned int x=0; VAL [loop1=2, n1=3, sn=0, x=0] [L13] COND TRUE 1 VAL [loop1=2, n1=3, sn=0, x=0] [L14] COND TRUE x<10 [L15] sn = sn + (2) VAL [loop1=2, n1=3, sn=2, x=0] [L17] x++ VAL [loop1=2, n1=3, sn=2, x=1] [L18] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L3] COND FALSE, RET !(!(cond)) VAL [\old(cond)=1, cond=1] [L18] __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=2, n1=3, sn=2, x=1] [L13] COND TRUE 1 VAL [loop1=2, n1=3, sn=2, x=1] [L14] COND TRUE x<10 [L15] sn = sn + (2) VAL [loop1=2, n1=3, sn=4, x=1] [L17] x++ VAL [loop1=2, n1=3, sn=4, x=2] [L18] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L3] COND FALSE, RET !(!(cond)) VAL [\old(cond)=1, cond=1] [L18] __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=2, n1=3, sn=4, x=2] [L13] COND TRUE 1 VAL [loop1=2, n1=3, sn=4, x=2] [L14] COND TRUE x<10 [L15] sn = sn + (2) VAL [loop1=2, n1=3, sn=6, x=2] [L17] x++ VAL [loop1=2, n1=3, sn=6, x=3] [L18] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L3] COND FALSE, RET !(!(cond)) VAL [\old(cond)=1, cond=1] [L18] __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=2, n1=3, sn=6, x=3] [L13] COND TRUE 1 VAL [loop1=2, n1=3, sn=6, x=3] [L14] COND TRUE x<10 [L15] sn = sn + (2) VAL [loop1=2, n1=3, sn=8, x=3] [L17] x++ VAL [loop1=2, n1=3, sn=8, x=4] [L18] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L3] COND FALSE, RET !(!(cond)) VAL [\old(cond)=1, cond=1] [L18] __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=2, n1=3, sn=8, x=4] [L13] COND TRUE 1 VAL [loop1=2, n1=3, sn=8, x=4] [L14] COND TRUE x<10 [L15] sn = sn + (2) VAL [loop1=2, n1=3, sn=10, x=4] [L17] x++ VAL [loop1=2, n1=3, sn=10, x=5] [L18] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L3] COND FALSE, RET !(!(cond)) VAL [\old(cond)=1, cond=1] [L18] __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=2, n1=3, sn=10, x=5] [L13] COND TRUE 1 VAL [loop1=2, n1=3, sn=10, x=5] [L14] COND TRUE x<10 [L15] sn = sn + (2) VAL [loop1=2, n1=3, sn=12, x=5] [L17] x++ VAL [loop1=2, n1=3, sn=12, x=6] [L18] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L3] COND FALSE, RET !(!(cond)) VAL [\old(cond)=1, cond=1] [L18] __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=2, n1=3, sn=12, x=6] [L13] COND TRUE 1 VAL [loop1=2, n1=3, sn=12, x=6] [L14] COND TRUE x<10 [L15] sn = sn + (2) VAL [loop1=2, n1=3, sn=14, x=6] [L17] x++ VAL [loop1=2, n1=3, sn=14, x=7] [L18] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L3] COND FALSE, RET !(!(cond)) VAL [\old(cond)=1, cond=1] [L18] __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=2, n1=3, sn=14, x=7] [L13] COND TRUE 1 VAL [loop1=2, n1=3, sn=14, x=7] [L14] COND TRUE x<10 [L15] sn = sn + (2) VAL [loop1=2, n1=3, sn=16, x=7] [L17] x++ VAL [loop1=2, n1=3, sn=16, x=8] [L18] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L3] COND FALSE, RET !(!(cond)) VAL [\old(cond)=1, cond=1] [L18] __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=2, n1=3, sn=16, x=8] [L13] COND TRUE 1 VAL [loop1=2, n1=3, sn=16, x=8] [L14] COND TRUE x<10 [L15] sn = sn + (2) VAL [loop1=2, n1=3, sn=18, x=8] [L17] x++ VAL [loop1=2, n1=3, sn=18, x=9] [L18] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L3] COND FALSE, RET !(!(cond)) VAL [\old(cond)=1, cond=1] [L18] __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=2, n1=3, sn=18, x=9] [L13] COND TRUE 1 VAL [loop1=2, n1=3, sn=18, x=9] [L14] COND TRUE x<10 [L15] sn = sn + (2) VAL [loop1=2, n1=3, sn=20, x=9] [L17] x++ VAL [loop1=2, n1=3, sn=20, x=10] [L18] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L3] COND FALSE, RET !(!(cond)) VAL [\old(cond)=1, cond=1] [L18] __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=2, n1=3, sn=20, x=10] [L13] COND TRUE 1 VAL [loop1=2, n1=3, sn=20, x=10] [L14] COND FALSE !(x<10) VAL [loop1=2, n1=3, sn=20, x=10] [L17] x++ VAL [loop1=2, n1=3, sn=20, x=11] [L18] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=0] [L3] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L4] __VERIFIER_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 20 locations, 1 error locations. UNSAFE Result, 18.3s OverallTime, 12 OverallIterations, 11 TraceHistogramMax, 2.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 328 SDtfs, 28 SDslu, 1681 SDs, 0 SdLazy, 1338 SolverSat, 3 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1131 GetRequests, 982 SyntacticMatches, 19 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 5.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=73occurred in iteration=11, 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.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 12 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 7.7s SatisfiabilityAnalysisTime, 6.7s InterpolantComputationTime, 1173 NumberOfCodeBlocks, 1173 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 1563 ConstructedInterpolants, 0 QuantifiedInterpolants, 433008 SizeOfPredicates, 11 NumberOfNonLiveVariables, 1008 ConjunctsInSsa, 129 ConjunctsInUnsatCore, 29 InterpolantComputations, 2 PerfectInterpolantSequences, 1962/4185 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...