java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/Mono1_false-unreach-call1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 10:42:39,367 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 10:42:39,369 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 10:42:39,382 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 10:42:39,382 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 10:42:39,384 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 10:42:39,385 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 10:42:39,387 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 10:42:39,389 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 10:42:39,390 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 10:42:39,391 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 10:42:39,391 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 10:42:39,392 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 10:42:39,393 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 10:42:39,394 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 10:42:39,395 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 10:42:39,396 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 10:42:39,397 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 10:42:39,399 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 10:42:39,401 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 10:42:39,402 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 10:42:39,404 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 10:42:39,406 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 10:42:39,406 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 10:42:39,406 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 10:42:39,407 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 10:42:39,408 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 10:42:39,409 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 10:42:39,410 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 10:42:39,411 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 10:42:39,411 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 10:42:39,412 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 10:42:39,412 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 10:42:39,412 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 10:42:39,413 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 10:42:39,414 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 10:42:39,414 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf [2018-11-07 10:42:39,438 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 10:42:39,439 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 10:42:39,439 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 10:42:39,440 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 10:42:39,440 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 10:42:39,440 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 10:42:39,440 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-07 10:42:39,441 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 10:42:39,441 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 10:42:39,441 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 10:42:39,441 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 10:42:39,441 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 10:42:39,442 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 10:42:39,442 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-07 10:42:39,443 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 10:42:39,443 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 10:42:39,443 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 10:42:39,443 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 10:42:39,443 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 10:42:39,443 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 10:42:39,444 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 10:42:39,444 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 10:42:39,444 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 10:42:39,444 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 10:42:39,444 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 10:42:39,445 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 10:42:39,445 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 10:42:39,445 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 10:42:39,445 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 10:42:39,445 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 10:42:39,446 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 10:42:39,446 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 10:42:39,446 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 10:42:39,446 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 10:42:39,446 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 10:42:39,446 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 10:42:39,506 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 10:42:39,519 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 10:42:39,523 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 10:42:39,525 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 10:42:39,525 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 10:42:39,526 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/Mono1_false-unreach-call1.c [2018-11-07 10:42:39,591 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a10d39f7a/7ceca4ee2c1d4dd98235aac72184e78a/FLAG4bcd65014 [2018-11-07 10:42:40,087 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 10:42:40,088 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/Mono1_false-unreach-call1.c [2018-11-07 10:42:40,094 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a10d39f7a/7ceca4ee2c1d4dd98235aac72184e78a/FLAG4bcd65014 [2018-11-07 10:42:40,109 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a10d39f7a/7ceca4ee2c1d4dd98235aac72184e78a [2018-11-07 10:42:40,121 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 10:42:40,123 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 10:42:40,124 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 10:42:40,124 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 10:42:40,129 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 10:42:40,130 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:42:40" (1/1) ... [2018-11-07 10:42:40,134 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5df28fad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:42:40, skipping insertion in model container [2018-11-07 10:42:40,134 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:42:40" (1/1) ... [2018-11-07 10:42:40,146 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 10:42:40,168 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 10:42:40,364 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 10:42:40,369 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 10:42:40,386 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 10:42:40,403 INFO L193 MainTranslator]: Completed translation [2018-11-07 10:42:40,403 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:42:40 WrapperNode [2018-11-07 10:42:40,403 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 10:42:40,404 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 10:42:40,404 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 10:42:40,405 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 10:42:40,414 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:42:40" (1/1) ... [2018-11-07 10:42:40,420 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:42:40" (1/1) ... [2018-11-07 10:42:40,427 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 10:42:40,427 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 10:42:40,427 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 10:42:40,428 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 10:42:40,438 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:42:40" (1/1) ... [2018-11-07 10:42:40,438 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:42:40" (1/1) ... [2018-11-07 10:42:40,439 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:42:40" (1/1) ... [2018-11-07 10:42:40,439 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:42:40" (1/1) ... [2018-11-07 10:42:40,442 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:42:40" (1/1) ... [2018-11-07 10:42:40,448 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:42:40" (1/1) ... [2018-11-07 10:42:40,449 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:42:40" (1/1) ... [2018-11-07 10:42:40,451 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 10:42:40,452 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 10:42:40,452 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 10:42:40,452 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 10:42:40,453 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:42:40" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 10:42:40,596 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 10:42:40,596 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 10:42:40,597 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 10:42:40,597 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 10:42:40,597 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 10:42:40,597 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 10:42:40,597 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-07 10:42:40,597 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-07 10:42:40,823 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 10:42:40,824 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:42:40 BoogieIcfgContainer [2018-11-07 10:42:40,824 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 10:42:40,825 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 10:42:40,825 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 10:42:40,828 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 10:42:40,829 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:42:40" (1/3) ... [2018-11-07 10:42:40,830 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fcaf1e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:42:40, skipping insertion in model container [2018-11-07 10:42:40,830 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:42:40" (2/3) ... [2018-11-07 10:42:40,830 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fcaf1e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:42:40, skipping insertion in model container [2018-11-07 10:42:40,830 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:42:40" (3/3) ... [2018-11-07 10:42:40,832 INFO L112 eAbstractionObserver]: Analyzing ICFG Mono1_false-unreach-call1.c [2018-11-07 10:42:40,843 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 10:42:40,852 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 10:42:40,872 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 10:42:40,910 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 10:42:40,910 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 10:42:40,910 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 10:42:40,910 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 10:42:40,911 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 10:42:40,911 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 10:42:40,911 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 10:42:40,911 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 10:42:40,932 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2018-11-07 10:42:40,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-07 10:42:40,940 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:42:40,941 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:42:40,944 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:42:40,951 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:42:40,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1713253442, now seen corresponding path program 1 times [2018-11-07 10:42:40,955 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:42:41,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:42:41,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:42:41,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:42:41,010 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:42:41,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:42:41,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:42:41,068 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:42:41,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-07 10:42:41,069 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:42:41,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-07 10:42:41,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-07 10:42:41,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 10:42:41,089 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2018-11-07 10:42:41,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:42:41,116 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2018-11-07 10:42:41,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-07 10:42:41,117 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-07 10:42:41,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:42:41,127 INFO L225 Difference]: With dead ends: 30 [2018-11-07 10:42:41,127 INFO L226 Difference]: Without dead ends: 13 [2018-11-07 10:42:41,131 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 10:42:41,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-11-07 10:42:41,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-07 10:42:41,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-07 10:42:41,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2018-11-07 10:42:41,175 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2018-11-07 10:42:41,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:42:41,176 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2018-11-07 10:42:41,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-07 10:42:41,176 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2018-11-07 10:42:41,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-07 10:42:41,177 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:42:41,177 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:42:41,177 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:42:41,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:42:41,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1144102878, now seen corresponding path program 1 times [2018-11-07 10:42:41,178 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:42:41,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:42:41,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:42:41,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:42:41,180 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:42:41,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:42:41,387 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 5 [2018-11-07 10:42:41,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:42:41,421 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:42:41,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 10:42:41,421 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:42:41,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 10:42:41,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 10:42:41,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 10:42:41,426 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 3 states. [2018-11-07 10:42:41,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:42:41,580 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2018-11-07 10:42:41,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 10:42:41,584 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-07 10:42:41,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:42:41,585 INFO L225 Difference]: With dead ends: 24 [2018-11-07 10:42:41,586 INFO L226 Difference]: Without dead ends: 16 [2018-11-07 10:42:41,587 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 10:42:41,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-11-07 10:42:41,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-07 10:42:41,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-07 10:42:41,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2018-11-07 10:42:41,593 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 11 [2018-11-07 10:42:41,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:42:41,593 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2018-11-07 10:42:41,593 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 10:42:41,593 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2018-11-07 10:42:41,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-07 10:42:41,594 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:42:41,594 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:42:41,594 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:42:41,594 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:42:41,595 INFO L82 PathProgramCache]: Analyzing trace with hash -2056921797, now seen corresponding path program 1 times [2018-11-07 10:42:41,595 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:42:41,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:42:41,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:42:41,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:42:41,598 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:42:41,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:42:41,721 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:42:41,722 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:42:41,725 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:42:41,726 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 15 with the following transitions: [2018-11-07 10:42:41,730 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [14], [17], [26], [29], [31], [37], [38], [39], [41] [2018-11-07 10:42:41,768 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 10:42:41,768 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 10:42:41,916 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 10:42:41,917 INFO L272 AbstractInterpreter]: Visited 13 different actions 21 times. Merged at 3 different actions 6 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 2 variables. [2018-11-07 10:42:41,945 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:42:41,947 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 10:42:41,947 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:42:41,947 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:42:41,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:42:41,965 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:42:41,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:42:41,996 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:42:42,035 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:42:42,035 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:42:42,345 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:42:42,367 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:42:42,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 7] total 9 [2018-11-07 10:42:42,367 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:42:42,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 10:42:42,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 10:42:42,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-11-07 10:42:42,370 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand 4 states. [2018-11-07 10:42:42,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:42:42,501 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2018-11-07 10:42:42,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 10:42:42,501 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-11-07 10:42:42,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:42:42,502 INFO L225 Difference]: With dead ends: 27 [2018-11-07 10:42:42,503 INFO L226 Difference]: Without dead ends: 19 [2018-11-07 10:42:42,503 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-11-07 10:42:42,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-11-07 10:42:42,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-11-07 10:42:42,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-07 10:42:42,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-11-07 10:42:42,509 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 14 [2018-11-07 10:42:42,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:42:42,509 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-11-07 10:42:42,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 10:42:42,510 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-11-07 10:42:42,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-07 10:42:42,510 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:42:42,511 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:42:42,511 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:42:42,511 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:42:42,512 INFO L82 PathProgramCache]: Analyzing trace with hash 1670825662, now seen corresponding path program 2 times [2018-11-07 10:42:42,512 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:42:42,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:42:42,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:42:42,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:42:42,514 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:42:42,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:42:42,703 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:42:42,703 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:42:42,704 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:42:42,704 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:42:42,704 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:42:42,704 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:42:42,705 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:42:42,717 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:42:42,717 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:42:42,754 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-07 10:42:42,754 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:42:42,756 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:42:42,794 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-07 10:42:42,794 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:42:42,973 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-07 10:42:42,993 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-07 10:42:42,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 6] imperfect sequences [5] total 10 [2018-11-07 10:42:42,994 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:42:42,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 10:42:42,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 10:42:42,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-11-07 10:42:42,995 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 3 states. [2018-11-07 10:42:43,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:42:43,035 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2018-11-07 10:42:43,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 10:42:43,038 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-07 10:42:43,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:42:43,040 INFO L225 Difference]: With dead ends: 27 [2018-11-07 10:42:43,040 INFO L226 Difference]: Without dead ends: 22 [2018-11-07 10:42:43,043 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-11-07 10:42:43,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-07 10:42:43,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-11-07 10:42:43,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-07 10:42:43,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-11-07 10:42:43,051 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 17 [2018-11-07 10:42:43,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:42:43,051 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-11-07 10:42:43,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 10:42:43,051 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-11-07 10:42:43,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-07 10:42:43,052 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:42:43,052 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:42:43,054 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:42:43,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:42:43,054 INFO L82 PathProgramCache]: Analyzing trace with hash 1801011421, now seen corresponding path program 1 times [2018-11-07 10:42:43,054 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:42:43,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:42:43,056 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:42:43,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:42:43,056 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:42:43,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:42:43,307 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:42:43,307 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:42:43,307 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:42:43,308 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2018-11-07 10:42:43,308 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [14], [17], [19], [26], [29], [31], [37], [38], [39], [41] [2018-11-07 10:42:43,310 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 10:42:43,310 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 10:42:43,341 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 10:42:43,341 INFO L272 AbstractInterpreter]: Visited 14 different actions 24 times. Merged at 3 different actions 6 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 2 variables. [2018-11-07 10:42:43,369 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:42:43,369 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 10:42:43,369 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:42:43,369 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:42:43,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:42:43,380 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:42:43,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:42:43,392 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:42:43,495 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:42:43,495 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:42:43,669 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:42:43,689 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:42:43,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 10 [2018-11-07 10:42:43,690 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:42:43,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 10:42:43,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 10:42:43,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2018-11-07 10:42:43,691 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 6 states. [2018-11-07 10:42:44,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:42:44,084 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2018-11-07 10:42:44,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 10:42:44,085 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-11-07 10:42:44,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:42:44,086 INFO L225 Difference]: With dead ends: 34 [2018-11-07 10:42:44,086 INFO L226 Difference]: Without dead ends: 24 [2018-11-07 10:42:44,087 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2018-11-07 10:42:44,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-07 10:42:44,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-11-07 10:42:44,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-07 10:42:44,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2018-11-07 10:42:44,093 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 20 [2018-11-07 10:42:44,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:42:44,094 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2018-11-07 10:42:44,094 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 10:42:44,094 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-11-07 10:42:44,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-07 10:42:44,096 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:42:44,096 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:42:44,096 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:42:44,097 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:42:44,097 INFO L82 PathProgramCache]: Analyzing trace with hash -2092450784, now seen corresponding path program 2 times [2018-11-07 10:42:44,097 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:42:44,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:42:44,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:42:44,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:42:44,099 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:42:44,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:42:44,245 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:42:44,246 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:42:44,246 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:42:44,246 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:42:44,246 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:42:44,246 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:42:44,246 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:42:44,256 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:42:44,257 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:42:44,276 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-07 10:42:44,277 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:42:44,279 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:42:44,381 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-07 10:42:44,381 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:42:44,658 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-07 10:42:44,677 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:42:44,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 8] total 15 [2018-11-07 10:42:44,678 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:42:44,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 10:42:44,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 10:42:44,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2018-11-07 10:42:44,679 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 9 states. [2018-11-07 10:42:44,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:42:44,827 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2018-11-07 10:42:44,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 10:42:44,828 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2018-11-07 10:42:44,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:42:44,829 INFO L225 Difference]: With dead ends: 41 [2018-11-07 10:42:44,829 INFO L226 Difference]: Without dead ends: 31 [2018-11-07 10:42:44,830 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2018-11-07 10:42:44,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-07 10:42:44,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-11-07 10:42:44,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-07 10:42:44,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2018-11-07 10:42:44,836 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 23 [2018-11-07 10:42:44,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:42:44,836 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2018-11-07 10:42:44,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 10:42:44,837 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2018-11-07 10:42:44,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-07 10:42:44,838 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:42:44,838 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:42:44,838 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:42:44,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:42:44,839 INFO L82 PathProgramCache]: Analyzing trace with hash -1050905282, now seen corresponding path program 3 times [2018-11-07 10:42:44,839 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:42:44,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:42:44,840 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:42:44,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:42:44,840 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:42:44,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:42:45,164 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:42:45,165 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:42:45,165 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:42:45,165 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:42:45,165 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:42:45,165 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:42:45,165 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:42:45,174 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:42:45,174 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:42:45,187 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:42:45,187 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:42:45,189 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:42:45,227 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 25 proven. 30 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-07 10:42:45,227 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:42:45,523 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 25 proven. 30 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-07 10:42:45,552 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:42:45,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 8] total 15 [2018-11-07 10:42:45,553 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:42:45,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 10:42:45,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 10:42:45,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2018-11-07 10:42:45,555 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 9 states. [2018-11-07 10:42:45,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:42:45,698 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2018-11-07 10:42:45,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 10:42:45,699 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2018-11-07 10:42:45,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:42:45,700 INFO L225 Difference]: With dead ends: 48 [2018-11-07 10:42:45,700 INFO L226 Difference]: Without dead ends: 34 [2018-11-07 10:42:45,702 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2018-11-07 10:42:45,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-07 10:42:45,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-11-07 10:42:45,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-07 10:42:45,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2018-11-07 10:42:45,709 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 29 [2018-11-07 10:42:45,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:42:45,709 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2018-11-07 10:42:45,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 10:42:45,709 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2018-11-07 10:42:45,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-07 10:42:45,711 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:42:45,711 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:42:45,712 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:42:45,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:42:45,712 INFO L82 PathProgramCache]: Analyzing trace with hash -306121381, now seen corresponding path program 4 times [2018-11-07 10:42:45,712 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:42:45,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:42:45,713 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:42:45,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:42:45,714 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:42:45,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:42:45,939 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:42:45,939 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:42:45,940 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:42:45,940 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:42:45,940 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:42:45,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:42:45,940 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:42:45,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:42:45,952 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:42:45,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:42:45,964 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:42:46,008 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 30 proven. 45 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-07 10:42:46,008 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:42:46,374 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 30 proven. 45 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-07 10:42:46,394 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:42:46,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 9] total 17 [2018-11-07 10:42:46,395 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:42:46,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-07 10:42:46,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-07 10:42:46,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2018-11-07 10:42:46,396 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand 10 states. [2018-11-07 10:42:46,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:42:46,549 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2018-11-07 10:42:46,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 10:42:46,551 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2018-11-07 10:42:46,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:42:46,552 INFO L225 Difference]: With dead ends: 51 [2018-11-07 10:42:46,552 INFO L226 Difference]: Without dead ends: 37 [2018-11-07 10:42:46,553 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 56 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2018-11-07 10:42:46,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-07 10:42:46,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-11-07 10:42:46,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-07 10:42:46,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2018-11-07 10:42:46,559 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 32 [2018-11-07 10:42:46,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:42:46,559 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2018-11-07 10:42:46,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-07 10:42:46,560 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2018-11-07 10:42:46,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-07 10:42:46,561 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:42:46,561 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:42:46,561 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:42:46,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:42:46,562 INFO L82 PathProgramCache]: Analyzing trace with hash -249977826, now seen corresponding path program 5 times [2018-11-07 10:42:46,562 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:42:46,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:42:46,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:42:46,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:42:46,563 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:42:46,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:42:46,956 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:42:46,956 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:42:46,957 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:42:46,957 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:42:46,957 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:42:46,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:42:46,957 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:42:46,967 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:42:46,967 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:42:46,978 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-07 10:42:46,979 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:42:46,982 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:42:47,586 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 48 proven. 7 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-07 10:42:47,587 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:42:47,828 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 48 proven. 7 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-07 10:42:47,848 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:42:47,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5, 9] total 21 [2018-11-07 10:42:47,849 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:42:47,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-07 10:42:47,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-07 10:42:47,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=315, Unknown=0, NotChecked=0, Total=420 [2018-11-07 10:42:47,851 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 14 states. [2018-11-07 10:42:52,635 WARN L179 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 12 [2018-11-07 10:42:53,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:42:53,733 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2018-11-07 10:42:53,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-07 10:42:53,736 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 35 [2018-11-07 10:42:53,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:42:53,737 INFO L225 Difference]: With dead ends: 60 [2018-11-07 10:42:53,737 INFO L226 Difference]: Without dead ends: 46 [2018-11-07 10:42:53,738 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 60 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=127, Invalid=378, Unknown=1, NotChecked=0, Total=506 [2018-11-07 10:42:53,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-07 10:42:53,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2018-11-07 10:42:53,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-07 10:42:53,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 45 transitions. [2018-11-07 10:42:53,751 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 45 transitions. Word has length 35 [2018-11-07 10:42:53,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:42:53,752 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 45 transitions. [2018-11-07 10:42:53,752 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-07 10:42:53,752 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2018-11-07 10:42:53,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-07 10:42:53,753 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:42:53,753 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 7, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:42:53,754 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:42:53,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:42:53,756 INFO L82 PathProgramCache]: Analyzing trace with hash 607533056, now seen corresponding path program 6 times [2018-11-07 10:42:53,756 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:42:53,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:42:53,757 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:42:53,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:42:53,758 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:42:53,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:42:54,020 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:42:54,021 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:42:54,021 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:42:54,021 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:42:54,021 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:42:54,022 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:42:54,022 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:42:54,043 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:42:54,043 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:42:54,062 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:42:54,062 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:42:54,065 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:42:54,134 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 20 proven. 135 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:42:54,135 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:42:54,585 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 20 proven. 135 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:42:54,606 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:42:54,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 24 [2018-11-07 10:42:54,606 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:42:54,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-07 10:42:54,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-07 10:42:54,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=385, Unknown=0, NotChecked=0, Total=552 [2018-11-07 10:42:54,608 INFO L87 Difference]: Start difference. First operand 43 states and 45 transitions. Second operand 13 states. [2018-11-07 10:42:54,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:42:54,865 INFO L93 Difference]: Finished difference Result 63 states and 68 transitions. [2018-11-07 10:42:54,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-07 10:42:54,866 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 41 [2018-11-07 10:42:54,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:42:54,867 INFO L225 Difference]: With dead ends: 63 [2018-11-07 10:42:54,867 INFO L226 Difference]: Without dead ends: 46 [2018-11-07 10:42:54,868 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 70 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=167, Invalid=385, Unknown=0, NotChecked=0, Total=552 [2018-11-07 10:42:54,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-07 10:42:54,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-11-07 10:42:54,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-07 10:42:54,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2018-11-07 10:42:54,874 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 41 [2018-11-07 10:42:54,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:42:54,875 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 48 transitions. [2018-11-07 10:42:54,875 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-07 10:42:54,875 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2018-11-07 10:42:54,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-07 10:42:54,876 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:42:54,876 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 8, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:42:54,877 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:42:54,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:42:54,877 INFO L82 PathProgramCache]: Analyzing trace with hash 1655862429, now seen corresponding path program 7 times [2018-11-07 10:42:54,877 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:42:54,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:42:54,878 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:42:54,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:42:54,879 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:42:54,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:42:55,185 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:42:55,185 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:42:55,185 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:42:55,185 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:42:55,186 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:42:55,186 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:42:55,186 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:42:55,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:42:55,195 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:42:55,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:42:55,222 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:42:55,558 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 72 proven. 108 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-07 10:42:55,558 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:42:56,460 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 72 proven. 108 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-07 10:42:56,480 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:42:56,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 12] total 24 [2018-11-07 10:42:56,481 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:42:56,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-07 10:42:56,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-07 10:42:56,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-11-07 10:42:56,482 INFO L87 Difference]: Start difference. First operand 46 states and 48 transitions. Second operand 14 states. [2018-11-07 10:42:56,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:42:56,727 INFO L93 Difference]: Finished difference Result 66 states and 71 transitions. [2018-11-07 10:42:56,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-07 10:42:56,728 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 44 [2018-11-07 10:42:56,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:42:56,729 INFO L225 Difference]: With dead ends: 66 [2018-11-07 10:42:56,729 INFO L226 Difference]: Without dead ends: 49 [2018-11-07 10:42:56,730 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 77 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-11-07 10:42:56,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-07 10:42:56,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-11-07 10:42:56,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-07 10:42:56,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 51 transitions. [2018-11-07 10:42:56,736 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 51 transitions. Word has length 44 [2018-11-07 10:42:56,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:42:56,737 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 51 transitions. [2018-11-07 10:42:56,737 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-07 10:42:56,737 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2018-11-07 10:42:56,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-07 10:42:56,738 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:42:56,739 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 9, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:42:56,739 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:42:56,739 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:42:56,739 INFO L82 PathProgramCache]: Analyzing trace with hash -565963040, now seen corresponding path program 8 times [2018-11-07 10:42:56,739 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:42:56,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:42:56,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:42:56,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:42:56,741 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:42:56,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:42:57,005 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:42:57,006 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:42:57,006 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:42:57,006 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:42:57,006 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:42:57,007 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:42:57,007 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:42:57,025 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:42:57,026 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:42:57,045 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-07 10:42:57,046 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:42:57,048 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:42:57,249 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 99 proven. 15 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2018-11-07 10:42:57,249 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:42:57,626 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 99 proven. 15 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2018-11-07 10:42:57,647 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:42:57,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 6, 10] total 27 [2018-11-07 10:42:57,647 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:42:57,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-07 10:42:57,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-07 10:42:57,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=531, Unknown=0, NotChecked=0, Total=702 [2018-11-07 10:42:57,648 INFO L87 Difference]: Start difference. First operand 49 states and 51 transitions. Second operand 19 states. [2018-11-07 10:43:00,497 WARN L179 SmtUtils]: Spent 2.27 s on a formula simplification that was a NOOP. DAG size: 16 [2018-11-07 10:43:08,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:43:08,739 INFO L93 Difference]: Finished difference Result 75 states and 83 transitions. [2018-11-07 10:43:08,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-07 10:43:08,739 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 47 [2018-11-07 10:43:08,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:43:08,741 INFO L225 Difference]: With dead ends: 75 [2018-11-07 10:43:08,741 INFO L226 Difference]: Without dead ends: 58 [2018-11-07 10:43:08,742 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 83 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=209, Invalid=661, Unknown=0, NotChecked=0, Total=870 [2018-11-07 10:43:08,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-07 10:43:08,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 54. [2018-11-07 10:43:08,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-07 10:43:08,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions. [2018-11-07 10:43:08,749 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 56 transitions. Word has length 47 [2018-11-07 10:43:08,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:43:08,750 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 56 transitions. [2018-11-07 10:43:08,750 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-07 10:43:08,750 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2018-11-07 10:43:08,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-07 10:43:08,751 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:43:08,751 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 10, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:43:08,751 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:43:08,752 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:43:08,752 INFO L82 PathProgramCache]: Analyzing trace with hash -829748866, now seen corresponding path program 9 times [2018-11-07 10:43:08,752 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:43:08,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:43:08,753 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:43:08,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:43:08,753 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:43:08,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:43:09,035 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 28 proven. 273 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:43:09,035 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:43:09,035 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:43:09,035 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:43:09,036 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:43:09,036 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:43:09,036 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:43:09,044 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:43:09,044 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:43:09,088 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:43:09,088 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:43:09,091 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:43:09,140 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 121 proven. 165 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-07 10:43:09,141 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:43:09,870 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 121 proven. 165 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-07 10:43:09,890 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:43:09,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 14] total 29 [2018-11-07 10:43:09,890 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:43:09,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-07 10:43:09,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-07 10:43:09,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=562, Unknown=0, NotChecked=0, Total=812 [2018-11-07 10:43:09,891 INFO L87 Difference]: Start difference. First operand 54 states and 56 transitions. Second operand 17 states. [2018-11-07 10:43:10,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:43:10,198 INFO L93 Difference]: Finished difference Result 79 states and 85 transitions. [2018-11-07 10:43:10,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-07 10:43:10,199 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 53 [2018-11-07 10:43:10,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:43:10,200 INFO L225 Difference]: With dead ends: 79 [2018-11-07 10:43:10,200 INFO L226 Difference]: Without dead ends: 60 [2018-11-07 10:43:10,201 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 93 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=250, Invalid=562, Unknown=0, NotChecked=0, Total=812 [2018-11-07 10:43:10,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-07 10:43:10,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-11-07 10:43:10,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-07 10:43:10,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2018-11-07 10:43:10,208 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 53 [2018-11-07 10:43:10,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:43:10,208 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2018-11-07 10:43:10,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-07 10:43:10,208 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2018-11-07 10:43:10,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-07 10:43:10,210 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:43:10,210 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 12, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:43:10,211 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:43:10,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:43:10,211 INFO L82 PathProgramCache]: Analyzing trace with hash 794925150, now seen corresponding path program 10 times [2018-11-07 10:43:10,211 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:43:10,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:43:10,212 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:43:10,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:43:10,212 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:43:10,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:43:10,974 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 32 proven. 360 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:43:10,974 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:43:10,975 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:43:10,975 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:43:10,975 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:43:10,975 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:43:10,975 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:43:10,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:43:10,984 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:43:10,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:43:11,002 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:43:11,298 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 143 proven. 234 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-07 10:43:11,298 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:43:12,176 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 143 proven. 234 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-07 10:43:12,197 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:43:12,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15, 16] total 33 [2018-11-07 10:43:12,197 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:43:12,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-07 10:43:12,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-07 10:43:12,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=318, Invalid=738, Unknown=0, NotChecked=0, Total=1056 [2018-11-07 10:43:12,199 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 19 states. [2018-11-07 10:43:12,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:43:12,580 INFO L93 Difference]: Finished difference Result 85 states and 91 transitions. [2018-11-07 10:43:12,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-07 10:43:12,581 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 59 [2018-11-07 10:43:12,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:43:12,582 INFO L225 Difference]: With dead ends: 85 [2018-11-07 10:43:12,582 INFO L226 Difference]: Without dead ends: 66 [2018-11-07 10:43:12,583 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 103 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=318, Invalid=738, Unknown=0, NotChecked=0, Total=1056 [2018-11-07 10:43:12,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-07 10:43:12,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-11-07 10:43:12,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-07 10:43:12,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 68 transitions. [2018-11-07 10:43:12,591 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 68 transitions. Word has length 59 [2018-11-07 10:43:12,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:43:12,591 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 68 transitions. [2018-11-07 10:43:12,591 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-07 10:43:12,591 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 68 transitions. [2018-11-07 10:43:12,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-07 10:43:12,593 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:43:12,593 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 14, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:43:12,593 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:43:12,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:43:12,594 INFO L82 PathProgramCache]: Analyzing trace with hash 369721150, now seen corresponding path program 11 times [2018-11-07 10:43:12,594 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:43:12,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:43:12,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:43:12,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:43:12,595 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:43:12,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:43:13,070 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 36 proven. 459 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:43:13,070 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:43:13,070 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:43:13,070 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:43:13,071 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:43:13,071 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:43:13,071 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:43:13,079 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:43:13,080 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:43:13,157 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-11-07 10:43:13,157 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:43:13,160 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:43:13,435 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 196 proven. 26 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2018-11-07 10:43:13,436 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:43:13,913 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 196 proven. 26 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2018-11-07 10:43:13,933 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:43:13,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 7, 11] total 35 [2018-11-07 10:43:13,934 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:43:13,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-07 10:43:13,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-07 10:43:13,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=291, Invalid=899, Unknown=0, NotChecked=0, Total=1190 [2018-11-07 10:43:13,936 INFO L87 Difference]: Start difference. First operand 66 states and 68 transitions. Second operand 26 states. [2018-11-07 10:43:16,891 WARN L179 SmtUtils]: Spent 1.90 s on a formula simplification. DAG size of input: 20 DAG size of output: 12 [2018-11-07 10:43:23,588 WARN L179 SmtUtils]: Spent 2.19 s on a formula simplification. DAG size of input: 24 DAG size of output: 12 [2018-11-07 10:43:31,548 WARN L179 SmtUtils]: Spent 2.18 s on a formula simplification that was a NOOP. DAG size: 16 [2018-11-07 10:43:36,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:43:36,005 INFO L93 Difference]: Finished difference Result 98 states and 108 transitions. [2018-11-07 10:43:36,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-07 10:43:36,005 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 65 [2018-11-07 10:43:36,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:43:36,006 INFO L225 Difference]: With dead ends: 98 [2018-11-07 10:43:36,006 INFO L226 Difference]: Without dead ends: 79 [2018-11-07 10:43:36,007 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 118 SyntacticMatches, 4 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 17.7s TimeCoverageRelationStatistics Valid=374, Invalid=1185, Unknown=1, NotChecked=0, Total=1560 [2018-11-07 10:43:36,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-11-07 10:43:36,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 76. [2018-11-07 10:43:36,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-07 10:43:36,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 78 transitions. [2018-11-07 10:43:36,014 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 78 transitions. Word has length 65 [2018-11-07 10:43:36,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:43:36,015 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 78 transitions. [2018-11-07 10:43:36,015 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-07 10:43:36,015 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2018-11-07 10:43:36,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-07 10:43:36,016 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:43:36,016 INFO L375 BasicCegarLoop]: trace histogram [22, 21, 16, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:43:36,017 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:43:36,017 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:43:36,017 INFO L82 PathProgramCache]: Analyzing trace with hash 10718589, now seen corresponding path program 12 times [2018-11-07 10:43:36,017 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:43:36,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:43:36,018 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:43:36,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:43:36,018 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:43:36,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:43:36,501 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:43:36,501 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:43:36,501 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:43:36,502 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:43:36,502 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:43:36,502 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:43:36,502 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:43:36,512 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:43:36,513 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:43:36,544 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:43:36,544 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:43:36,547 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:43:36,664 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 100 proven. 570 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-07 10:43:36,665 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:43:38,648 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 100 proven. 570 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-07 10:43:38,667 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:43:38,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 22, 23] total 45 [2018-11-07 10:43:38,668 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:43:38,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-07 10:43:38,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-07 10:43:38,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=550, Invalid=1430, Unknown=0, NotChecked=0, Total=1980 [2018-11-07 10:43:38,669 INFO L87 Difference]: Start difference. First operand 76 states and 78 transitions. Second operand 24 states. [2018-11-07 10:43:39,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:43:39,262 INFO L93 Difference]: Finished difference Result 102 states and 107 transitions. [2018-11-07 10:43:39,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-07 10:43:39,266 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 74 [2018-11-07 10:43:39,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:43:39,267 INFO L225 Difference]: With dead ends: 102 [2018-11-07 10:43:39,267 INFO L226 Difference]: Without dead ends: 79 [2018-11-07 10:43:39,269 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 126 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=550, Invalid=1430, Unknown=0, NotChecked=0, Total=1980 [2018-11-07 10:43:39,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-11-07 10:43:39,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-11-07 10:43:39,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-11-07 10:43:39,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 81 transitions. [2018-11-07 10:43:39,283 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 81 transitions. Word has length 74 [2018-11-07 10:43:39,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:43:39,286 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 81 transitions. [2018-11-07 10:43:39,286 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-07 10:43:39,286 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 81 transitions. [2018-11-07 10:43:39,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-07 10:43:39,290 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:43:39,290 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 17, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:43:39,290 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:43:39,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:43:39,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1880758400, now seen corresponding path program 13 times [2018-11-07 10:43:39,290 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:43:39,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:43:39,291 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:43:39,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:43:39,295 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:43:39,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:43:39,865 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:43:39,866 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:43:39,866 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:43:39,866 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:43:39,866 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:43:39,866 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:43:39,866 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:43:39,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:43:39,875 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:43:39,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:43:39,905 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:43:39,952 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 252 proven. 459 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-07 10:43:39,953 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:43:41,750 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 252 proven. 459 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-07 10:43:41,769 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:43:41,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 20, 21] total 44 [2018-11-07 10:43:41,770 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:43:41,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-07 10:43:41,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-07 10:43:41,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=523, Invalid=1369, Unknown=0, NotChecked=0, Total=1892 [2018-11-07 10:43:41,771 INFO L87 Difference]: Start difference. First operand 79 states and 81 transitions. Second operand 25 states. [2018-11-07 10:43:42,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:43:42,536 INFO L93 Difference]: Finished difference Result 105 states and 110 transitions. [2018-11-07 10:43:42,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-07 10:43:42,537 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 77 [2018-11-07 10:43:42,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:43:42,538 INFO L225 Difference]: With dead ends: 105 [2018-11-07 10:43:42,538 INFO L226 Difference]: Without dead ends: 82 [2018-11-07 10:43:42,540 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 134 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=523, Invalid=1369, Unknown=0, NotChecked=0, Total=1892 [2018-11-07 10:43:42,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-11-07 10:43:42,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-11-07 10:43:42,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-07 10:43:42,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 84 transitions. [2018-11-07 10:43:42,548 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 84 transitions. Word has length 77 [2018-11-07 10:43:42,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:43:42,548 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 84 transitions. [2018-11-07 10:43:42,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-07 10:43:42,549 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 84 transitions. [2018-11-07 10:43:42,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-07 10:43:42,549 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:43:42,550 INFO L375 BasicCegarLoop]: trace histogram [24, 23, 18, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:43:42,550 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:43:42,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:43:42,550 INFO L82 PathProgramCache]: Analyzing trace with hash -2078995811, now seen corresponding path program 14 times [2018-11-07 10:43:42,550 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:43:42,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:43:42,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:43:42,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:43:42,551 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:43:42,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:43:43,044 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 0 proven. 805 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:43:43,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:43:43,045 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:43:43,045 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:43:43,045 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:43:43,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:43:43,045 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:43:43,054 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:43:43,054 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:43:43,093 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-07 10:43:43,094 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:43:43,096 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:43:43,575 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 306 proven. 40 refuted. 0 times theorem prover too weak. 459 trivial. 0 not checked. [2018-11-07 10:43:43,576 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:43:44,101 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 306 proven. 40 refuted. 0 times theorem prover too weak. 459 trivial. 0 not checked. [2018-11-07 10:43:44,131 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:43:44,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 8, 11] total 41 [2018-11-07 10:43:44,131 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:43:44,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-07 10:43:44,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-07 10:43:44,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=368, Invalid=1272, Unknown=0, NotChecked=0, Total=1640 [2018-11-07 10:43:44,133 INFO L87 Difference]: Start difference. First operand 82 states and 84 transitions. Second operand 32 states. [2018-11-07 10:43:51,527 WARN L179 SmtUtils]: Spent 462.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 12 [2018-11-07 10:44:11,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:44:11,263 INFO L93 Difference]: Finished difference Result 117 states and 126 transitions. [2018-11-07 10:44:11,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-07 10:44:11,265 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 80 [2018-11-07 10:44:11,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:44:11,266 INFO L225 Difference]: With dead ends: 117 [2018-11-07 10:44:11,266 INFO L226 Difference]: Without dead ends: 94 [2018-11-07 10:44:11,267 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 149 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 20.5s TimeCoverageRelationStatistics Valid=529, Invalid=1626, Unknown=7, NotChecked=0, Total=2162 [2018-11-07 10:44:11,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-11-07 10:44:11,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 87. [2018-11-07 10:44:11,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-11-07 10:44:11,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 89 transitions. [2018-11-07 10:44:11,282 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 89 transitions. Word has length 80 [2018-11-07 10:44:11,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:44:11,282 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 89 transitions. [2018-11-07 10:44:11,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-07 10:44:11,282 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 89 transitions. [2018-11-07 10:44:11,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-07 10:44:11,283 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:44:11,283 INFO L375 BasicCegarLoop]: trace histogram [26, 25, 19, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:44:11,284 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:44:11,284 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:44:11,284 INFO L82 PathProgramCache]: Analyzing trace with hash 59221243, now seen corresponding path program 15 times [2018-11-07 10:44:11,284 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:44:11,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:44:11,289 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:44:11,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:44:11,290 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:44:11,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:44:12,308 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 50 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:44:12,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:44:12,308 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:44:12,308 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:44:12,308 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:44:12,309 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:44:12,309 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:44:12,318 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:44:12,318 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:44:12,354 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:44:12,354 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:44:12,356 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:44:12,405 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 340 proven. 570 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 10:44:12,405 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:44:15,156 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 340 proven. 570 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 10:44:15,176 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:44:15,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 22, 23] total 49 [2018-11-07 10:44:15,176 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:44:15,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-07 10:44:15,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-07 10:44:15,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=667, Invalid=1685, Unknown=0, NotChecked=0, Total=2352 [2018-11-07 10:44:15,178 INFO L87 Difference]: Start difference. First operand 87 states and 89 transitions. Second operand 28 states. [2018-11-07 10:44:15,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:44:15,895 INFO L93 Difference]: Finished difference Result 118 states and 124 transitions. [2018-11-07 10:44:15,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-07 10:44:15,895 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 86 [2018-11-07 10:44:15,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:44:15,896 INFO L225 Difference]: With dead ends: 118 [2018-11-07 10:44:15,896 INFO L226 Difference]: Without dead ends: 93 [2018-11-07 10:44:15,901 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 150 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=667, Invalid=1685, Unknown=0, NotChecked=0, Total=2352 [2018-11-07 10:44:15,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-11-07 10:44:15,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-11-07 10:44:15,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-11-07 10:44:15,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 95 transitions. [2018-11-07 10:44:15,908 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 95 transitions. Word has length 86 [2018-11-07 10:44:15,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:44:15,909 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 95 transitions. [2018-11-07 10:44:15,909 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-07 10:44:15,909 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 95 transitions. [2018-11-07 10:44:15,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-07 10:44:15,910 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:44:15,910 INFO L375 BasicCegarLoop]: trace histogram [28, 27, 21, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:44:15,910 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:44:15,910 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:44:15,910 INFO L82 PathProgramCache]: Analyzing trace with hash -1341754853, now seen corresponding path program 16 times [2018-11-07 10:44:15,911 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:44:15,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:44:15,911 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:44:15,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:44:15,912 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:44:15,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:44:17,165 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 54 proven. 1053 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:44:17,165 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:44:17,165 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:44:17,165 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:44:17,165 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:44:17,165 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:44:17,165 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:44:17,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:44:17,175 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:44:17,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:44:17,198 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:44:17,355 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 374 proven. 693 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 10:44:17,356 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:44:20,060 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 374 proven. 693 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 10:44:20,080 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:44:20,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 24, 25] total 53 [2018-11-07 10:44:20,080 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:44:20,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-07 10:44:20,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-07 10:44:20,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=775, Invalid=1981, Unknown=0, NotChecked=0, Total=2756 [2018-11-07 10:44:20,082 INFO L87 Difference]: Start difference. First operand 93 states and 95 transitions. Second operand 30 states. [2018-11-07 10:44:20,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:44:20,950 INFO L93 Difference]: Finished difference Result 124 states and 130 transitions. [2018-11-07 10:44:20,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-07 10:44:20,950 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 92 [2018-11-07 10:44:20,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:44:20,951 INFO L225 Difference]: With dead ends: 124 [2018-11-07 10:44:20,951 INFO L226 Difference]: Without dead ends: 99 [2018-11-07 10:44:20,952 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 160 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=775, Invalid=1981, Unknown=0, NotChecked=0, Total=2756 [2018-11-07 10:44:20,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-11-07 10:44:20,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-11-07 10:44:20,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-07 10:44:20,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 101 transitions. [2018-11-07 10:44:20,959 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 101 transitions. Word has length 92 [2018-11-07 10:44:20,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:44:20,959 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 101 transitions. [2018-11-07 10:44:20,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-07 10:44:20,960 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 101 transitions. [2018-11-07 10:44:20,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-11-07 10:44:20,960 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:44:20,960 INFO L375 BasicCegarLoop]: trace histogram [30, 29, 23, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:44:20,961 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:44:20,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:44:20,961 INFO L82 PathProgramCache]: Analyzing trace with hash -2143361221, now seen corresponding path program 17 times [2018-11-07 10:44:20,961 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:44:20,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:44:20,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:44:20,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:44:20,962 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:44:20,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:44:22,511 INFO L134 CoverageAnalysis]: Checked inductivity of 1276 backedges. 58 proven. 1218 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:44:22,512 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:44:22,512 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:44:22,512 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:44:22,512 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:44:22,512 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:44:22,512 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:44:22,521 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:44:22,521 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:44:22,566 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-11-07 10:44:22,567 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:44:22,569 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:44:23,101 INFO L134 CoverageAnalysis]: Checked inductivity of 1276 backedges. 460 proven. 57 refuted. 0 times theorem prover too weak. 759 trivial. 0 not checked. [2018-11-07 10:44:23,101 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:44:23,710 INFO L134 CoverageAnalysis]: Checked inductivity of 1276 backedges. 460 proven. 57 refuted. 0 times theorem prover too weak. 759 trivial. 0 not checked. [2018-11-07 10:44:23,731 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:44:23,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 9, 12] total 49 [2018-11-07 10:44:23,731 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:44:23,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-07 10:44:23,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-07 10:44:23,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=538, Invalid=1814, Unknown=0, NotChecked=0, Total=2352 [2018-11-07 10:44:23,733 INFO L87 Difference]: Start difference. First operand 99 states and 101 transitions. Second operand 39 states. [2018-11-07 10:44:25,503 WARN L179 SmtUtils]: Spent 465.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 12 [2018-11-07 10:44:37,614 WARN L832 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 4294967289) 4294967296) 10000000) (< (mod (+ c_main_~x~0 4294967283) 4294967296) 10000000) (< (mod (+ c_main_~x~0 4294967291) 4294967296) 10000000) (< (mod (+ c_main_~x~0 4294967293) 4294967296) 10000000) (< (mod (+ c_main_~x~0 4294967287) 4294967296) 10000000) (< (mod (+ c_main_~x~0 4294967285) 4294967296) 10000000)) is different from false [2018-11-07 10:44:44,621 WARN L179 SmtUtils]: Spent 3.75 s on a formula simplification. DAG size of input: 24 DAG size of output: 12 [2018-11-07 10:44:53,596 WARN L179 SmtUtils]: Spent 4.22 s on a formula simplification. DAG size of input: 24 DAG size of output: 12 [2018-11-07 10:44:58,206 WARN L179 SmtUtils]: Spent 2.08 s on a formula simplification. DAG size of input: 20 DAG size of output: 12 [2018-11-07 10:45:38,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:45:38,061 INFO L93 Difference]: Finished difference Result 141 states and 152 transitions. [2018-11-07 10:45:38,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-07 10:45:38,061 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 98 [2018-11-07 10:45:38,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:45:38,062 INFO L225 Difference]: With dead ends: 141 [2018-11-07 10:45:38,062 INFO L226 Difference]: Without dead ends: 116 [2018-11-07 10:45:38,063 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 184 SyntacticMatches, 4 SemanticMatches, 57 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 59.9s TimeCoverageRelationStatistics Valid=837, Invalid=2465, Unknown=8, NotChecked=112, Total=3422 [2018-11-07 10:45:38,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-11-07 10:45:38,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 108. [2018-11-07 10:45:38,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-11-07 10:45:38,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 111 transitions. [2018-11-07 10:45:38,070 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 111 transitions. Word has length 98 [2018-11-07 10:45:38,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:45:38,070 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 111 transitions. [2018-11-07 10:45:38,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-11-07 10:45:38,071 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 111 transitions. [2018-11-07 10:45:38,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-07 10:45:38,071 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:45:38,071 INFO L375 BasicCegarLoop]: trace histogram [33, 32, 25, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:45:38,072 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:45:38,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:45:38,072 INFO L82 PathProgramCache]: Analyzing trace with hash 1159676448, now seen corresponding path program 18 times [2018-11-07 10:45:38,072 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:45:38,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:45:38,073 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:45:38,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:45:38,073 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:45:38,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:45:39,210 INFO L134 CoverageAnalysis]: Checked inductivity of 1552 backedges. 155 proven. 1395 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-07 10:45:39,210 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:45:39,210 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:45:39,210 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:45:39,211 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:45:39,211 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:45:39,211 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:45:39,219 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:45:39,219 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:45:39,247 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:45:39,247 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:45:39,250 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:45:39,313 INFO L134 CoverageAnalysis]: Checked inductivity of 1552 backedges. 520 proven. 975 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-11-07 10:45:39,314 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:45:42,287 INFO L134 CoverageAnalysis]: Checked inductivity of 1552 backedges. 520 proven. 975 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-11-07 10:45:42,307 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:45:42,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 28, 29] total 61 [2018-11-07 10:45:42,307 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:45:42,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-07 10:45:42,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-07 10:45:42,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1015, Invalid=2645, Unknown=0, NotChecked=0, Total=3660 [2018-11-07 10:45:42,309 INFO L87 Difference]: Start difference. First operand 108 states and 111 transitions. Second operand 34 states. [2018-11-07 10:45:43,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:45:43,405 INFO L93 Difference]: Finished difference Result 142 states and 150 transitions. [2018-11-07 10:45:43,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-07 10:45:43,408 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 107 [2018-11-07 10:45:43,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:45:43,412 INFO L225 Difference]: With dead ends: 142 [2018-11-07 10:45:43,412 INFO L226 Difference]: Without dead ends: 114 [2018-11-07 10:45:43,414 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 186 SyntacticMatches, 2 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=1015, Invalid=2645, Unknown=0, NotChecked=0, Total=3660 [2018-11-07 10:45:43,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-11-07 10:45:43,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-11-07 10:45:43,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-11-07 10:45:43,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 117 transitions. [2018-11-07 10:45:43,423 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 117 transitions. Word has length 107 [2018-11-07 10:45:43,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:45:43,424 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 117 transitions. [2018-11-07 10:45:43,424 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-07 10:45:43,424 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 117 transitions. [2018-11-07 10:45:43,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-11-07 10:45:43,425 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:45:43,425 INFO L375 BasicCegarLoop]: trace histogram [35, 34, 27, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:45:43,425 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:45:43,425 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:45:43,425 INFO L82 PathProgramCache]: Analyzing trace with hash -628496128, now seen corresponding path program 19 times [2018-11-07 10:45:43,426 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:45:43,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:45:43,426 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:45:43,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:45:43,426 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:45:43,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:45:44,164 INFO L134 CoverageAnalysis]: Checked inductivity of 1751 backedges. 165 proven. 1584 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-07 10:45:44,164 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:45:44,164 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:45:44,164 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:45:44,164 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:45:44,164 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:45:44,165 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:45:44,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:45:44,173 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:45:44,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:45:44,201 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:45:44,280 INFO L134 CoverageAnalysis]: Checked inductivity of 1751 backedges. 560 proven. 1134 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-11-07 10:45:44,280 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:45:48,494 INFO L134 CoverageAnalysis]: Checked inductivity of 1751 backedges. 560 proven. 1134 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-11-07 10:45:48,514 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:45:48,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 30, 31] total 65 [2018-11-07 10:45:48,514 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:45:48,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-07 10:45:48,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-07 10:45:48,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1147, Invalid=3013, Unknown=0, NotChecked=0, Total=4160 [2018-11-07 10:45:48,516 INFO L87 Difference]: Start difference. First operand 114 states and 117 transitions. Second operand 36 states. [2018-11-07 10:45:50,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:45:50,222 INFO L93 Difference]: Finished difference Result 148 states and 156 transitions. [2018-11-07 10:45:50,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-07 10:45:50,223 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 113 [2018-11-07 10:45:50,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:45:50,225 INFO L225 Difference]: With dead ends: 148 [2018-11-07 10:45:50,225 INFO L226 Difference]: Without dead ends: 120 [2018-11-07 10:45:50,227 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 196 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=1147, Invalid=3013, Unknown=0, NotChecked=0, Total=4160 [2018-11-07 10:45:50,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-11-07 10:45:50,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2018-11-07 10:45:50,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-11-07 10:45:50,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 123 transitions. [2018-11-07 10:45:50,235 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 123 transitions. Word has length 113 [2018-11-07 10:45:50,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:45:50,235 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 123 transitions. [2018-11-07 10:45:50,235 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-07 10:45:50,235 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 123 transitions. [2018-11-07 10:45:50,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-07 10:45:50,236 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:45:50,236 INFO L375 BasicCegarLoop]: trace histogram [37, 36, 29, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:45:50,236 INFO L423 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:45:50,236 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:45:50,237 INFO L82 PathProgramCache]: Analyzing trace with hash -866916384, now seen corresponding path program 20 times [2018-11-07 10:45:50,237 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:45:50,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:45:50,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:45:50,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:45:50,238 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:45:50,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:45:51,326 INFO L134 CoverageAnalysis]: Checked inductivity of 1962 backedges. 175 proven. 1785 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-07 10:45:51,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:45:51,327 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:45:51,327 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:45:51,327 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:45:51,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:45:51,327 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:45:51,337 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:45:51,337 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:45:51,374 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-11-07 10:45:51,374 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:45:51,377 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:45:51,751 INFO L134 CoverageAnalysis]: Checked inductivity of 1962 backedges. 667 proven. 77 refuted. 0 times theorem prover too weak. 1218 trivial. 0 not checked. [2018-11-07 10:45:51,751 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:45:52,400 INFO L134 CoverageAnalysis]: Checked inductivity of 1962 backedges. 667 proven. 77 refuted. 0 times theorem prover too weak. 1218 trivial. 0 not checked. [2018-11-07 10:45:52,419 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:45:52,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 10, 13] total 57 [2018-11-07 10:45:52,419 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:45:52,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-11-07 10:45:52,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-11-07 10:45:52,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=715, Invalid=2477, Unknown=0, NotChecked=0, Total=3192 [2018-11-07 10:45:52,421 INFO L87 Difference]: Start difference. First operand 120 states and 123 transitions. Second operand 46 states. [2018-11-07 10:46:02,406 WARN L179 SmtUtils]: Spent 899.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 12 [2018-11-07 10:46:25,512 WARN L179 SmtUtils]: Spent 9.05 s on a formula simplification. DAG size of input: 32 DAG size of output: 12 [2018-11-07 10:46:27,598 WARN L832 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 4294967289) 4294967296) 10000000) (< (mod (+ c_main_~x~0 4294967283) 4294967296) 10000000) (< (mod (+ c_main_~x~0 4294967291) 4294967296) 10000000) (< (mod (+ c_main_~x~0 4294967281) 4294967296) 10000000) (< (mod (+ c_main_~x~0 4294967293) 4294967296) 10000000) (< (mod (+ c_main_~x~0 4294967287) 4294967296) 10000000) (< (mod (+ c_main_~x~0 4294967285) 4294967296) 10000000)) is different from false [2018-11-07 10:46:36,891 WARN L179 SmtUtils]: Spent 2.64 s on a formula simplification. DAG size of input: 28 DAG size of output: 12 [2018-11-07 10:46:39,588 WARN L179 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 12 [2018-11-07 10:46:48,097 WARN L179 SmtUtils]: Spent 3.75 s on a formula simplification. DAG size of input: 24 DAG size of output: 12 [2018-11-07 10:47:08,013 WARN L179 SmtUtils]: Spent 2.16 s on a formula simplification. DAG size of input: 28 DAG size of output: 12 Received shutdown request... [2018-11-07 10:47:15,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-11-07 10:47:15,904 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-07 10:47:15,907 WARN L205 ceAbstractionStarter]: Timeout [2018-11-07 10:47:15,908 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 10:47:15 BoogieIcfgContainer [2018-11-07 10:47:15,908 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 10:47:15,909 INFO L168 Benchmark]: Toolchain (without parser) took 275787.37 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 910.7 MB). Free memory was 1.4 GB in the beginning and 2.4 GB in the end (delta: -949.6 MB). Peak memory consumption was 789.1 MB. Max. memory is 7.1 GB. [2018-11-07 10:47:15,910 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 10:47:15,910 INFO L168 Benchmark]: CACSL2BoogieTranslator took 279.83 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-07 10:47:15,911 INFO L168 Benchmark]: Boogie Procedure Inliner took 22.76 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 10:47:15,911 INFO L168 Benchmark]: Boogie Preprocessor took 23.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-11-07 10:47:15,911 INFO L168 Benchmark]: RCFGBuilder took 372.39 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 730.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -780.8 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. [2018-11-07 10:47:15,912 INFO L168 Benchmark]: TraceAbstraction took 275082.99 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 180.4 MB). Free memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: -179.4 MB). Peak memory consumption was 829.0 MB. Max. memory is 7.1 GB. [2018-11-07 10:47:15,916 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 279.83 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 22.76 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 23.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. * RCFGBuilder took 372.39 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 730.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -780.8 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 275082.99 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 180.4 MB). Free memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: -179.4 MB). Peak memory consumption was 829.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 2]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 2). Cancelled while BasicCegarLoop was constructing difference of abstraction (120states) and FLOYD_HOARE automaton (currently 44 states, 46 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 68 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 19 locations, 1 error locations. TIMEOUT Result, 275.0s OverallTime, 24 OverallIterations, 37 TraceHistogramMax, 232.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 567 SDtfs, 468 SDslu, 8435 SDs, 0 SdLazy, 13851 SolverSat, 667 SolverUnsat, 17 SolverUnknown, 0 SolverNotchecked, 52.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3134 GetRequests, 2348 SyntacticMatches, 58 SemanticMatches, 727 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 598 ImplicationChecksByTransitivity, 206.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=120occurred in iteration=23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 23 MinimizatonAttempts, 26 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 40.1s InterpolantComputationTime, 2671 NumberOfCodeBlocks, 2419 NumberOfCodeBlocksAsserted, 100 NumberOfCheckSat, 3928 ConstructedInterpolants, 0 QuantifiedInterpolants, 1874038 SizeOfPredicates, 8 NumberOfNonLiveVariables, 1891 ConjunctsInSsa, 563 ConjunctsInUnsatCore, 68 InterpolantComputations, 4 PerfectInterpolantSequences, 15755/38544 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown