java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/loop-acceleration/overflow_1-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 01:51:49,782 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 01:51:49,785 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 01:51:49,799 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 01:51:49,799 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 01:51:49,800 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 01:51:49,801 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 01:51:49,803 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 01:51:49,804 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 01:51:49,805 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 01:51:49,806 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 01:51:49,807 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 01:51:49,808 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 01:51:49,808 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 01:51:49,809 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 01:51:49,810 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 01:51:49,811 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 01:51:49,812 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 01:51:49,815 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 01:51:49,817 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 01:51:49,821 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 01:51:49,825 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 01:51:49,826 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 01:51:49,828 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 01:51:49,831 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 01:51:49,831 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 01:51:49,832 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 01:51:49,833 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 01:51:49,833 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 01:51:49,834 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 01:51:49,835 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 01:51:49,836 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 01:51:49,837 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 01:51:49,837 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 01:51:49,840 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 01:51:49,841 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 01:51:49,842 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 01:51:49,842 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 01:51:49,842 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 01:51:49,843 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 01:51:49,843 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 01:51:49,845 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 01:51:49,868 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 01:51:49,868 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 01:51:49,868 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 01:51:49,869 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 01:51:49,869 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 01:51:49,870 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 01:51:49,870 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 01:51:49,870 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 01:51:49,871 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 01:51:49,871 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 01:51:49,872 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 01:51:49,873 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 01:51:49,873 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 01:51:49,874 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 01:51:49,874 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 01:51:49,874 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 01:51:49,874 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 01:51:49,874 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 01:51:49,874 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 01:51:49,875 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 01:51:49,875 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 01:51:49,876 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 01:51:49,876 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 01:51:49,876 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 01:51:49,876 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 01:51:49,876 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 01:51:49,877 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 01:51:49,877 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 01:51:49,877 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 01:51:49,877 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 01:51:49,929 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 01:51:49,945 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 01:51:49,949 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 01:51:49,951 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 01:51:49,951 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 01:51:49,952 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/overflow_1-1.c [2019-09-10 01:51:50,020 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/167b122e1/93c9afd708164a1592a5fee8e56552d4/FLAG54d6717aa [2019-09-10 01:51:50,396 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 01:51:50,396 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/overflow_1-1.c [2019-09-10 01:51:50,402 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/167b122e1/93c9afd708164a1592a5fee8e56552d4/FLAG54d6717aa [2019-09-10 01:51:50,796 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/167b122e1/93c9afd708164a1592a5fee8e56552d4 [2019-09-10 01:51:50,804 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 01:51:50,805 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 01:51:50,806 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 01:51:50,806 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 01:51:50,810 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 01:51:50,811 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 01:51:50" (1/1) ... [2019-09-10 01:51:50,813 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c1140be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:51:50, skipping insertion in model container [2019-09-10 01:51:50,813 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 01:51:50" (1/1) ... [2019-09-10 01:51:50,821 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 01:51:50,834 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 01:51:50,998 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 01:51:51,002 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 01:51:51,016 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 01:51:51,029 INFO L192 MainTranslator]: Completed translation [2019-09-10 01:51:51,029 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:51:51 WrapperNode [2019-09-10 01:51:51,029 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 01:51:51,030 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 01:51:51,030 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 01:51:51,030 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 01:51:51,125 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:51:51" (1/1) ... [2019-09-10 01:51:51,125 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:51:51" (1/1) ... [2019-09-10 01:51:51,130 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:51:51" (1/1) ... [2019-09-10 01:51:51,130 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:51:51" (1/1) ... [2019-09-10 01:51:51,135 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:51:51" (1/1) ... [2019-09-10 01:51:51,140 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:51:51" (1/1) ... [2019-09-10 01:51:51,141 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:51:51" (1/1) ... [2019-09-10 01:51:51,142 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 01:51:51,142 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 01:51:51,142 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 01:51:51,142 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 01:51:51,143 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:51:51" (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 [2019-09-10 01:51:51,189 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 01:51:51,189 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 01:51:51,189 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-10 01:51:51,190 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 01:51:51,190 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 01:51:51,190 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-10 01:51:51,190 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 01:51:51,190 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 01:51:51,190 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 01:51:51,322 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 01:51:51,322 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-10 01:51:51,323 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 01:51:51 BoogieIcfgContainer [2019-09-10 01:51:51,323 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 01:51:51,324 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 01:51:51,324 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 01:51:51,327 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 01:51:51,327 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 01:51:50" (1/3) ... [2019-09-10 01:51:51,328 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d7effd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 01:51:51, skipping insertion in model container [2019-09-10 01:51:51,328 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:51:51" (2/3) ... [2019-09-10 01:51:51,328 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d7effd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 01:51:51, skipping insertion in model container [2019-09-10 01:51:51,329 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 01:51:51" (3/3) ... [2019-09-10 01:51:51,330 INFO L109 eAbstractionObserver]: Analyzing ICFG overflow_1-1.c [2019-09-10 01:51:51,339 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 01:51:51,346 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 01:51:51,362 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 01:51:51,388 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 01:51:51,388 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 01:51:51,388 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 01:51:51,388 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 01:51:51,389 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 01:51:51,389 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 01:51:51,389 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 01:51:51,389 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 01:51:51,404 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2019-09-10 01:51:51,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-10 01:51:51,412 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:51:51,413 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:51:51,415 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:51:51,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:51:51,419 INFO L82 PathProgramCache]: Analyzing trace with hash 1846144830, now seen corresponding path program 1 times [2019-09-10 01:51:51,421 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:51:51,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:51:51,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:51:51,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:51:51,458 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:51:51,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:51:51,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:51:51,640 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:51:51,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 01:51:51,640 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:51:51,646 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 01:51:51,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 01:51:51,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 01:51:51,675 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 3 states. [2019-09-10 01:51:51,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:51:51,701 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-09-10 01:51:51,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 01:51:51,703 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-09-10 01:51:51,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:51:51,712 INFO L225 Difference]: With dead ends: 18 [2019-09-10 01:51:51,712 INFO L226 Difference]: Without dead ends: 12 [2019-09-10 01:51:51,714 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 01:51:51,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-09-10 01:51:51,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-09-10 01:51:51,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-09-10 01:51:51,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-09-10 01:51:51,754 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-09-10 01:51:51,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:51:51,755 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-09-10 01:51:51,755 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 01:51:51,755 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-09-10 01:51:51,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-09-10 01:51:51,756 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:51:51,756 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:51:51,756 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:51:51,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:51:51,757 INFO L82 PathProgramCache]: Analyzing trace with hash 1432376145, now seen corresponding path program 1 times [2019-09-10 01:51:51,757 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:51:51,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:51:51,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:51:51,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:51:51,758 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:51:51,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:51:51,871 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:51:51,871 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:51:51,871 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:51:51,872 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 12 with the following transitions: [2019-09-10 01:51:51,874 INFO L207 CegarAbsIntRunner]: [0], [4], [11], [13], [19], [22], [24], [30], [31], [32], [34] [2019-09-10 01:51:51,904 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 01:51:51,904 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 01:51:51,960 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 01:51:52,394 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 01:51:52,397 INFO L272 AbstractInterpreter]: Visited 11 different actions 35 times. Merged at 2 different actions 8 times. Widened at 1 different actions 2 times. Performed 48 root evaluator evaluations with a maximum evaluation depth of 13. Performed 48 inverse root evaluator evaluations with a maximum inverse evaluation depth of 13. Found 1 fixpoints after 1 different actions. Largest state had 2 variables. [2019-09-10 01:51:52,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:51:52,402 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 01:51:52,403 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:51:52,403 INFO L193 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 [2019-09-10 01:51:52,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:51:52,423 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 01:51:52,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:51:52,439 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-10 01:51:52,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:51:52,501 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:51:52,501 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:51:52,542 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:51:52,547 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:51:52,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2019-09-10 01:51:52,548 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:51:52,549 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 01:51:52,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 01:51:52,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 01:51:52,550 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 5 states. [2019-09-10 01:51:52,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:51:52,584 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-09-10 01:51:52,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 01:51:52,586 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-09-10 01:51:52,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:51:52,587 INFO L225 Difference]: With dead ends: 14 [2019-09-10 01:51:52,587 INFO L226 Difference]: Without dead ends: 14 [2019-09-10 01:51:52,589 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 01:51:52,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-09-10 01:51:52,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-09-10 01:51:52,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-09-10 01:51:52,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-09-10 01:51:52,596 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 11 [2019-09-10 01:51:52,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:51:52,596 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-09-10 01:51:52,597 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 01:51:52,597 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-09-10 01:51:52,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-10 01:51:52,598 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:51:52,598 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:51:52,599 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:51:52,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:51:52,599 INFO L82 PathProgramCache]: Analyzing trace with hash -1004266255, now seen corresponding path program 2 times [2019-09-10 01:51:52,600 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:51:52,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:51:52,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:51:52,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:51:52,604 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:51:52,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:51:52,701 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:51:52,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:51:52,702 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:51:52,702 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:51:52,702 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:51:52,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:51:52,703 INFO L193 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) [2019-09-10 01:51:52,725 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 01:51:52,725 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:51:52,738 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-10 01:51:52,739 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:51:52,739 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-10 01:51:52,741 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:51:52,764 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:51:52,764 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:51:52,854 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:51:52,857 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:51:52,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2019-09-10 01:51:52,858 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:51:52,859 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 01:51:52,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 01:51:52,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-09-10 01:51:52,860 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 7 states. [2019-09-10 01:51:52,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:51:52,893 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-09-10 01:51:52,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 01:51:52,894 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2019-09-10 01:51:52,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:51:52,895 INFO L225 Difference]: With dead ends: 16 [2019-09-10 01:51:52,895 INFO L226 Difference]: Without dead ends: 16 [2019-09-10 01:51:52,896 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-09-10 01:51:52,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-09-10 01:51:52,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-09-10 01:51:52,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-09-10 01:51:52,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-09-10 01:51:52,899 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 13 [2019-09-10 01:51:52,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:51:52,900 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-09-10 01:51:52,900 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 01:51:52,900 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-09-10 01:51:52,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-10 01:51:52,900 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:51:52,901 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:51:52,901 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:51:52,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:51:52,901 INFO L82 PathProgramCache]: Analyzing trace with hash -1860436335, now seen corresponding path program 3 times [2019-09-10 01:51:52,901 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:51:52,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:51:52,902 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:51:52,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:51:52,903 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:51:52,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:51:53,063 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:51:53,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:51:53,063 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:51:53,064 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:51:53,064 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:51:53,064 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:51:53,064 INFO L193 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) [2019-09-10 01:51:53,085 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 01:51:53,086 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:51:53,097 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 01:51:53,097 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:51:53,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-10 01:51:53,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:51:53,126 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:51:53,126 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:51:53,308 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:51:53,312 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:51:53,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2019-09-10 01:51:53,313 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:51:53,314 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 01:51:53,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 01:51:53,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2019-09-10 01:51:53,315 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 9 states. [2019-09-10 01:51:53,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:51:53,384 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-09-10 01:51:53,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 01:51:53,385 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2019-09-10 01:51:53,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:51:53,386 INFO L225 Difference]: With dead ends: 18 [2019-09-10 01:51:53,386 INFO L226 Difference]: Without dead ends: 18 [2019-09-10 01:51:53,387 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2019-09-10 01:51:53,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-09-10 01:51:53,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-09-10 01:51:53,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-09-10 01:51:53,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-09-10 01:51:53,390 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 15 [2019-09-10 01:51:53,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:51:53,391 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-09-10 01:51:53,391 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 01:51:53,391 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-09-10 01:51:53,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-10 01:51:53,392 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:51:53,392 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:51:53,392 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:51:53,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:51:53,393 INFO L82 PathProgramCache]: Analyzing trace with hash -6162383, now seen corresponding path program 4 times [2019-09-10 01:51:53,393 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:51:53,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:51:53,394 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:51:53,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:51:53,394 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:51:53,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:51:53,600 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:51:53,601 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:51:53,601 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:51:53,601 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:51:53,601 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:51:53,601 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:51:53,602 INFO L193 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) [2019-09-10 01:51:53,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:51:53,625 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:51:53,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:51:53,642 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-10 01:51:53,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:51:53,669 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:51:53,670 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:51:53,903 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:51:53,907 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:51:53,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2019-09-10 01:51:53,907 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:51:53,908 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 01:51:53,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 01:51:53,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2019-09-10 01:51:53,909 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 11 states. [2019-09-10 01:51:53,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:51:53,982 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-09-10 01:51:53,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 01:51:53,983 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 17 [2019-09-10 01:51:53,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:51:53,984 INFO L225 Difference]: With dead ends: 20 [2019-09-10 01:51:53,984 INFO L226 Difference]: Without dead ends: 20 [2019-09-10 01:51:53,984 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2019-09-10 01:51:53,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-09-10 01:51:53,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-09-10 01:51:53,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-09-10 01:51:53,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-09-10 01:51:53,987 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 17 [2019-09-10 01:51:53,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:51:53,988 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-09-10 01:51:53,988 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 01:51:53,988 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-09-10 01:51:53,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-10 01:51:53,989 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:51:53,989 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:51:53,989 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:51:53,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:51:53,990 INFO L82 PathProgramCache]: Analyzing trace with hash -460322351, now seen corresponding path program 5 times [2019-09-10 01:51:53,990 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:51:53,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:51:53,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:51:53,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:51:53,991 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:51:54,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:51:54,171 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:51:54,171 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:51:54,171 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:51:54,172 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:51:54,172 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:51:54,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:51:54,172 INFO L193 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 [2019-09-10 01:51:54,186 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 01:51:54,186 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 01:51:54,210 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-09-10 01:51:54,210 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:51:54,211 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-10 01:51:54,213 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:51:54,240 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:51:54,240 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:51:54,560 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:51:54,565 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:51:54,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2019-09-10 01:51:54,566 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:51:54,566 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 01:51:54,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 01:51:54,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=361, Unknown=0, NotChecked=0, Total=506 [2019-09-10 01:51:54,567 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 13 states. [2019-09-10 01:51:54,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:51:54,688 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-09-10 01:51:54,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 01:51:54,689 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 19 [2019-09-10 01:51:54,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:51:54,689 INFO L225 Difference]: With dead ends: 22 [2019-09-10 01:51:54,690 INFO L226 Difference]: Without dead ends: 22 [2019-09-10 01:51:54,691 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=145, Invalid=361, Unknown=0, NotChecked=0, Total=506 [2019-09-10 01:51:54,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-09-10 01:51:54,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-09-10 01:51:54,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-09-10 01:51:54,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-09-10 01:51:54,696 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 19 [2019-09-10 01:51:54,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:51:54,696 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-09-10 01:51:54,696 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 01:51:54,696 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-09-10 01:51:54,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-10 01:51:54,697 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:51:54,697 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:51:54,698 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:51:54,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:51:54,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1178612593, now seen corresponding path program 6 times [2019-09-10 01:51:54,700 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:51:54,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:51:54,702 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:51:54,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:51:54,702 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:51:54,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:51:54,968 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:51:54,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:51:54,969 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:51:54,969 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:51:54,969 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:51:54,969 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:51:54,969 INFO L193 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 [2019-09-10 01:51:54,992 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 01:51:54,992 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 01:51:55,007 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 01:51:55,007 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:51:55,009 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-10 01:51:55,010 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:51:55,047 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:51:55,047 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:51:55,509 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:51:55,517 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:51:55,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2019-09-10 01:51:55,517 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:51:55,518 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 01:51:55,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 01:51:55,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=505, Unknown=0, NotChecked=0, Total=702 [2019-09-10 01:51:55,519 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 15 states. [2019-09-10 01:51:55,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:51:55,680 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-09-10 01:51:55,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 01:51:55,681 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 21 [2019-09-10 01:51:55,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:51:55,682 INFO L225 Difference]: With dead ends: 24 [2019-09-10 01:51:55,682 INFO L226 Difference]: Without dead ends: 24 [2019-09-10 01:51:55,683 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=197, Invalid=505, Unknown=0, NotChecked=0, Total=702 [2019-09-10 01:51:55,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-09-10 01:51:55,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-09-10 01:51:55,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-09-10 01:51:55,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-09-10 01:51:55,687 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 21 [2019-09-10 01:51:55,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:51:55,687 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-09-10 01:51:55,687 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 01:51:55,687 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-09-10 01:51:55,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-10 01:51:55,688 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:51:55,688 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:51:55,688 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:51:55,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:51:55,689 INFO L82 PathProgramCache]: Analyzing trace with hash -57903855, now seen corresponding path program 7 times [2019-09-10 01:51:55,689 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:51:55,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:51:55,690 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:51:55,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:51:55,690 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:51:55,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:51:55,928 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:51:55,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:51:55,928 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:51:55,928 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:51:55,929 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:51:55,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:51:55,929 INFO L193 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 [2019-09-10 01:51:55,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:51:55,945 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 01:51:55,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:51:55,965 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-10 01:51:55,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:51:56,011 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:51:56,011 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:51:56,527 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:51:56,532 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:51:56,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 31 [2019-09-10 01:51:56,532 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:51:56,533 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 01:51:56,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 01:51:56,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=673, Unknown=0, NotChecked=0, Total=930 [2019-09-10 01:51:56,534 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 17 states. [2019-09-10 01:51:56,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:51:56,784 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-09-10 01:51:56,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 01:51:56,784 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 23 [2019-09-10 01:51:56,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:51:56,785 INFO L225 Difference]: With dead ends: 26 [2019-09-10 01:51:56,785 INFO L226 Difference]: Without dead ends: 26 [2019-09-10 01:51:56,786 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=257, Invalid=673, Unknown=0, NotChecked=0, Total=930 [2019-09-10 01:51:56,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-09-10 01:51:56,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-09-10 01:51:56,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-09-10 01:51:56,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-09-10 01:51:56,790 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 23 [2019-09-10 01:51:56,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:51:56,790 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-09-10 01:51:56,790 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 01:51:56,790 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-09-10 01:51:56,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-10 01:51:56,791 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:51:56,791 INFO L399 BasicCegarLoop]: trace histogram [15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:51:56,791 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:51:56,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:51:56,792 INFO L82 PathProgramCache]: Analyzing trace with hash 1355730609, now seen corresponding path program 8 times [2019-09-10 01:51:56,792 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:51:56,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:51:56,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:51:56,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:51:56,793 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:51:56,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:51:57,091 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:51:57,092 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:51:57,092 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:51:57,092 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:51:57,092 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:51:57,092 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:51:57,092 INFO L193 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 [2019-09-10 01:51:57,103 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 01:51:57,103 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 01:52:04,262 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-09-10 01:52:04,262 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:52:04,277 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-10 01:52:04,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:52:04,313 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:52:04,314 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:52:04,925 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:52:04,930 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:52:04,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2019-09-10 01:52:04,931 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:52:04,931 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 01:52:04,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 01:52:04,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=865, Unknown=0, NotChecked=0, Total=1190 [2019-09-10 01:52:04,932 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 19 states. [2019-09-10 01:52:05,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:52:05,215 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-09-10 01:52:05,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 01:52:05,217 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 25 [2019-09-10 01:52:05,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:52:05,217 INFO L225 Difference]: With dead ends: 28 [2019-09-10 01:52:05,218 INFO L226 Difference]: Without dead ends: 28 [2019-09-10 01:52:05,219 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=325, Invalid=865, Unknown=0, NotChecked=0, Total=1190 [2019-09-10 01:52:05,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-09-10 01:52:05,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-09-10 01:52:05,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-09-10 01:52:05,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-09-10 01:52:05,225 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 25 [2019-09-10 01:52:05,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:52:05,225 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-09-10 01:52:05,226 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 01:52:05,226 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-09-10 01:52:05,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-10 01:52:05,226 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:52:05,227 INFO L399 BasicCegarLoop]: trace histogram [17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:52:05,227 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:52:05,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:52:05,227 INFO L82 PathProgramCache]: Analyzing trace with hash -1646182319, now seen corresponding path program 9 times [2019-09-10 01:52:05,227 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:52:05,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:52:05,228 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:52:05,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:52:05,228 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:52:05,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:52:05,531 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:52:05,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:52:05,532 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:52:05,532 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:52:05,532 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:52:05,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:52:05,532 INFO L193 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 [2019-09-10 01:52:05,544 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 01:52:05,545 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 01:52:05,558 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 01:52:05,559 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:52:05,560 WARN L254 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 37 conjunts are in the unsatisfiable core [2019-09-10 01:52:05,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:52:05,609 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:52:05,610 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:52:06,394 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:52:06,402 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:52:06,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2019-09-10 01:52:06,402 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:52:06,402 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 01:52:06,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 01:52:06,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=401, Invalid=1081, Unknown=0, NotChecked=0, Total=1482 [2019-09-10 01:52:06,404 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 21 states. [2019-09-10 01:52:06,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:52:06,756 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-09-10 01:52:06,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 01:52:06,757 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 27 [2019-09-10 01:52:06,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:52:06,758 INFO L225 Difference]: With dead ends: 30 [2019-09-10 01:52:06,758 INFO L226 Difference]: Without dead ends: 30 [2019-09-10 01:52:06,759 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=401, Invalid=1081, Unknown=0, NotChecked=0, Total=1482 [2019-09-10 01:52:06,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-09-10 01:52:06,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-09-10 01:52:06,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-09-10 01:52:06,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-09-10 01:52:06,762 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 27 [2019-09-10 01:52:06,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:52:06,762 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-09-10 01:52:06,762 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 01:52:06,762 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-09-10 01:52:06,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-10 01:52:06,763 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:52:06,763 INFO L399 BasicCegarLoop]: trace histogram [19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:52:06,763 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:52:06,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:52:06,764 INFO L82 PathProgramCache]: Analyzing trace with hash -266483215, now seen corresponding path program 10 times [2019-09-10 01:52:06,764 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:52:06,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:52:06,765 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:52:06,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:52:06,765 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:52:06,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:52:07,142 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:52:07,142 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:52:07,143 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:52:07,143 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:52:07,143 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:52:07,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:52:07,143 INFO L193 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 [2019-09-10 01:52:07,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:52:07,155 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 01:52:07,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:52:07,172 WARN L254 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 41 conjunts are in the unsatisfiable core [2019-09-10 01:52:07,174 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:52:07,218 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:52:07,218 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:52:08,175 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:52:08,178 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:52:08,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 43 [2019-09-10 01:52:08,179 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:52:08,179 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-10 01:52:08,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-10 01:52:08,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=485, Invalid=1321, Unknown=0, NotChecked=0, Total=1806 [2019-09-10 01:52:08,180 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 23 states. [2019-09-10 01:52:08,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:52:08,597 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-09-10 01:52:08,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 01:52:08,598 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 29 [2019-09-10 01:52:08,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:52:08,599 INFO L225 Difference]: With dead ends: 32 [2019-09-10 01:52:08,599 INFO L226 Difference]: Without dead ends: 32 [2019-09-10 01:52:08,599 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=485, Invalid=1321, Unknown=0, NotChecked=0, Total=1806 [2019-09-10 01:52:08,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-09-10 01:52:08,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-09-10 01:52:08,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-09-10 01:52:08,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-09-10 01:52:08,604 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 29 [2019-09-10 01:52:08,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:52:08,605 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-09-10 01:52:08,605 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-10 01:52:08,605 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-09-10 01:52:08,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-10 01:52:08,606 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:52:08,606 INFO L399 BasicCegarLoop]: trace histogram [21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:52:08,606 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:52:08,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:52:08,607 INFO L82 PathProgramCache]: Analyzing trace with hash -1520538735, now seen corresponding path program 11 times [2019-09-10 01:52:08,607 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:52:08,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:52:08,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:52:08,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:52:08,608 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:52:08,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:52:09,068 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:52:09,068 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:52:09,068 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:52:09,068 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:52:09,069 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:52:09,069 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:52:09,069 INFO L193 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 [2019-09-10 01:52:09,090 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 01:52:09,090 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 01:53:13,399 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-09-10 01:53:13,399 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:53:14,386 WARN L254 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 45 conjunts are in the unsatisfiable core [2019-09-10 01:53:14,388 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:53:14,426 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:53:14,426 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:53:15,473 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:53:15,479 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:53:15,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2019-09-10 01:53:15,479 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:53:15,480 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-10 01:53:15,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-10 01:53:15,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=577, Invalid=1585, Unknown=0, NotChecked=0, Total=2162 [2019-09-10 01:53:15,482 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 25 states. [2019-09-10 01:53:15,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:53:15,944 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-09-10 01:53:15,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-10 01:53:15,946 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 31 [2019-09-10 01:53:15,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:53:15,947 INFO L225 Difference]: With dead ends: 34 [2019-09-10 01:53:15,948 INFO L226 Difference]: Without dead ends: 34 [2019-09-10 01:53:15,949 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=577, Invalid=1585, Unknown=0, NotChecked=0, Total=2162 [2019-09-10 01:53:15,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-09-10 01:53:15,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-09-10 01:53:15,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-09-10 01:53:15,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-09-10 01:53:15,952 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 31 [2019-09-10 01:53:15,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:53:15,953 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-09-10 01:53:15,953 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-10 01:53:15,953 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-09-10 01:53:15,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-09-10 01:53:15,954 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:53:15,954 INFO L399 BasicCegarLoop]: trace histogram [23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:53:15,954 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:53:15,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:53:15,954 INFO L82 PathProgramCache]: Analyzing trace with hash 217916721, now seen corresponding path program 12 times [2019-09-10 01:53:15,955 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:53:15,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:53:15,955 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:53:15,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:53:15,956 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:53:15,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:53:16,464 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:53:16,464 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:53:16,464 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:53:16,464 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:53:16,465 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:53:16,465 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:53:16,465 INFO L193 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 [2019-09-10 01:53:16,478 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 01:53:16,479 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 01:53:16,493 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 01:53:16,493 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:53:16,494 WARN L254 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 49 conjunts are in the unsatisfiable core [2019-09-10 01:53:16,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:53:16,546 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:53:16,546 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:53:17,958 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:53:17,966 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:53:17,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2019-09-10 01:53:17,966 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:53:17,967 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-10 01:53:17,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-10 01:53:17,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=677, Invalid=1873, Unknown=0, NotChecked=0, Total=2550 [2019-09-10 01:53:17,968 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 27 states. [2019-09-10 01:53:18,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:53:18,494 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-09-10 01:53:18,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-10 01:53:18,494 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 33 [2019-09-10 01:53:18,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:53:18,495 INFO L225 Difference]: With dead ends: 36 [2019-09-10 01:53:18,496 INFO L226 Difference]: Without dead ends: 36 [2019-09-10 01:53:18,497 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=677, Invalid=1873, Unknown=0, NotChecked=0, Total=2550 [2019-09-10 01:53:18,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-09-10 01:53:18,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-09-10 01:53:18,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-09-10 01:53:18,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-09-10 01:53:18,501 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 33 [2019-09-10 01:53:18,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:53:18,501 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-09-10 01:53:18,502 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-10 01:53:18,502 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-09-10 01:53:18,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-09-10 01:53:18,502 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:53:18,502 INFO L399 BasicCegarLoop]: trace histogram [25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:53:18,503 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:53:18,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:53:18,503 INFO L82 PathProgramCache]: Analyzing trace with hash 131331793, now seen corresponding path program 13 times [2019-09-10 01:53:18,503 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:53:18,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:53:18,504 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:53:18,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:53:18,504 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:53:18,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:53:19,010 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:53:19,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:53:19,010 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:53:19,010 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:53:19,010 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:53:19,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:53:19,010 INFO L193 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 [2019-09-10 01:53:19,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:53:19,021 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 01:53:19,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:53:19,039 WARN L254 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 53 conjunts are in the unsatisfiable core [2019-09-10 01:53:19,040 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:53:19,088 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:53:19,089 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:53:20,965 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:53:20,967 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:53:20,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 55 [2019-09-10 01:53:20,968 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:53:20,968 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-10 01:53:20,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-10 01:53:20,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=785, Invalid=2185, Unknown=0, NotChecked=0, Total=2970 [2019-09-10 01:53:20,970 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 29 states. [2019-09-10 01:53:21,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:53:21,601 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-09-10 01:53:21,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-10 01:53:21,602 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 35 [2019-09-10 01:53:21,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:53:21,603 INFO L225 Difference]: With dead ends: 38 [2019-09-10 01:53:21,603 INFO L226 Difference]: Without dead ends: 38 [2019-09-10 01:53:21,604 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=785, Invalid=2185, Unknown=0, NotChecked=0, Total=2970 [2019-09-10 01:53:21,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-09-10 01:53:21,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-09-10 01:53:21,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-09-10 01:53:21,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-09-10 01:53:21,608 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 35 [2019-09-10 01:53:21,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:53:21,608 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-09-10 01:53:21,608 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-10 01:53:21,608 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-09-10 01:53:21,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-09-10 01:53:21,609 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:53:21,609 INFO L399 BasicCegarLoop]: trace histogram [27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:53:21,609 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:53:21,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:53:21,610 INFO L82 PathProgramCache]: Analyzing trace with hash -1472405391, now seen corresponding path program 14 times [2019-09-10 01:53:21,610 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:53:21,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:53:21,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:53:21,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:53:21,611 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:53:21,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:53:22,247 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:53:22,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:53:22,248 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:53:22,248 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:53:22,248 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:53:22,248 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:53:22,248 INFO L193 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 [2019-09-10 01:53:22,263 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 01:53:22,263 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 01:54:52,288 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-09-10 01:54:52,288 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:54:52,451 WARN L254 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 57 conjunts are in the unsatisfiable core [2019-09-10 01:54:52,454 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:54:52,519 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:54:52,519 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:54:54,120 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:54:54,126 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:54:54,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 59 [2019-09-10 01:54:54,127 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:54:54,127 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-10 01:54:54,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-10 01:54:54,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=901, Invalid=2521, Unknown=0, NotChecked=0, Total=3422 [2019-09-10 01:54:54,128 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 31 states. [2019-09-10 01:54:54,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:54:54,879 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-09-10 01:54:54,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-10 01:54:54,882 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 37 [2019-09-10 01:54:54,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:54:54,883 INFO L225 Difference]: With dead ends: 40 [2019-09-10 01:54:54,883 INFO L226 Difference]: Without dead ends: 40 [2019-09-10 01:54:54,885 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=901, Invalid=2521, Unknown=0, NotChecked=0, Total=3422 [2019-09-10 01:54:54,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-09-10 01:54:54,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-09-10 01:54:54,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-09-10 01:54:54,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-09-10 01:54:54,888 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 37 [2019-09-10 01:54:54,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:54:54,888 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-09-10 01:54:54,888 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-10 01:54:54,888 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-09-10 01:54:54,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-10 01:54:54,889 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:54:54,889 INFO L399 BasicCegarLoop]: trace histogram [29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:54:54,889 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:54:54,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:54:54,890 INFO L82 PathProgramCache]: Analyzing trace with hash -770579951, now seen corresponding path program 15 times [2019-09-10 01:54:54,890 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:54:54,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:54:54,891 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:54:54,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:54:54,891 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:54:54,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:54:55,555 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:54:55,556 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:54:55,556 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:54:55,556 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:54:55,556 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:54:55,556 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:54:55,556 INFO L193 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) [2019-09-10 01:54:55,583 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 01:54:55,583 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:54:55,608 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 01:54:55,608 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:54:55,609 WARN L254 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 61 conjunts are in the unsatisfiable core [2019-09-10 01:54:55,611 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:54:55,676 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:54:55,676 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:54:57,616 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:54:57,620 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:54:57,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 63 [2019-09-10 01:54:57,620 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:54:57,621 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-10 01:54:57,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-10 01:54:57,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1025, Invalid=2881, Unknown=0, NotChecked=0, Total=3906 [2019-09-10 01:54:57,622 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 33 states. [2019-09-10 01:54:58,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:54:58,480 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-09-10 01:54:58,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-10 01:54:58,480 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 39 [2019-09-10 01:54:58,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:54:58,481 INFO L225 Difference]: With dead ends: 42 [2019-09-10 01:54:58,481 INFO L226 Difference]: Without dead ends: 42 [2019-09-10 01:54:58,484 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1025, Invalid=2881, Unknown=0, NotChecked=0, Total=3906 [2019-09-10 01:54:58,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-09-10 01:54:58,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-09-10 01:54:58,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-09-10 01:54:58,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-09-10 01:54:58,487 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 39 [2019-09-10 01:54:58,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:54:58,488 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-09-10 01:54:58,488 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-10 01:54:58,488 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-09-10 01:54:58,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-09-10 01:54:58,489 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:54:58,489 INFO L399 BasicCegarLoop]: trace histogram [31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:54:58,489 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:54:58,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:54:58,490 INFO L82 PathProgramCache]: Analyzing trace with hash -626197583, now seen corresponding path program 16 times [2019-09-10 01:54:58,490 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:54:58,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:54:58,491 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:54:58,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:54:58,491 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:54:58,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:54:59,532 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:54:59,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:54:59,532 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:54:59,533 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:54:59,533 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:54:59,533 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:54:59,533 INFO L193 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 [2019-09-10 01:54:59,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:54:59,560 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 01:54:59,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:54:59,586 WARN L254 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 65 conjunts are in the unsatisfiable core [2019-09-10 01:54:59,587 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:54:59,653 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:54:59,653 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:55:01,782 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:55:01,784 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:55:01,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 67 [2019-09-10 01:55:01,785 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:55:01,785 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-10 01:55:01,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-10 01:55:01,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1157, Invalid=3265, Unknown=0, NotChecked=0, Total=4422 [2019-09-10 01:55:01,788 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 35 states. [2019-09-10 01:55:02,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:55:02,688 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-09-10 01:55:02,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-10 01:55:02,689 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 41 [2019-09-10 01:55:02,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:55:02,690 INFO L225 Difference]: With dead ends: 44 [2019-09-10 01:55:02,690 INFO L226 Difference]: Without dead ends: 44 [2019-09-10 01:55:02,692 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1157, Invalid=3265, Unknown=0, NotChecked=0, Total=4422 [2019-09-10 01:55:02,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-09-10 01:55:02,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-09-10 01:55:02,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-09-10 01:55:02,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-09-10 01:55:02,695 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 41 [2019-09-10 01:55:02,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:55:02,695 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-09-10 01:55:02,695 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-10 01:55:02,695 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-09-10 01:55:02,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-09-10 01:55:02,696 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:55:02,696 INFO L399 BasicCegarLoop]: trace histogram [33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:55:02,696 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:55:02,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:55:02,697 INFO L82 PathProgramCache]: Analyzing trace with hash 686304593, now seen corresponding path program 17 times [2019-09-10 01:55:02,697 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:55:02,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:55:02,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:55:02,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:55:02,698 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:55:02,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:55:03,534 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:55:03,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:55:03,534 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:55:03,535 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:55:03,535 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:55:03,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:55:03,535 INFO L193 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 [2019-09-10 01:55:03,549 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 01:55:03,550 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 01:55:29,515 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-09-10 01:55:29,516 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:55:29,535 WARN L254 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 77 conjunts are in the unsatisfiable core [2019-09-10 01:55:29,536 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:55:29,656 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:55:29,656 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:55:38,816 WARN L188 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 16 [2019-09-10 01:55:45,005 WARN L188 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 16 [2019-09-10 01:56:03,766 WARN L188 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 16 [2019-09-10 01:56:11,255 WARN L188 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 16 [2019-09-10 01:56:13,799 WARN L188 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 16 [2019-09-10 01:56:53,958 WARN L860 $PredicateComparison]: unable to prove that (or (< (mod (+ c_main_~x~0 54) 4294967296) 10) (= 0 (mod c_main_~x~0 2)) (<= 10 (mod (+ c_main_~x~0 56) 4294967296))) is different from true [2019-09-10 01:56:56,415 WARN L860 $PredicateComparison]: unable to prove that (or (<= 10 (mod (+ c_main_~x~0 60) 4294967296)) (= 0 (mod c_main_~x~0 2)) (< (mod (+ c_main_~x~0 58) 4294967296) 10)) is different from true [2019-09-10 01:56:58,423 WARN L860 $PredicateComparison]: unable to prove that (or (= 0 (mod c_main_~x~0 2)) (< (mod (+ c_main_~x~0 60) 4294967296) 10) (<= 10 (mod (+ c_main_~x~0 62) 4294967296))) is different from true [2019-09-10 01:57:05,808 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 453 refuted. 12 times theorem prover too weak. 0 trivial. 96 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (18)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 01:57:05,821 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:57:05,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 39] total 74 [2019-09-10 01:57:05,821 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:57:05,822 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-10 01:57:05,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-10 01:57:05,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1266, Invalid=3687, Unknown=29, NotChecked=420, Total=5402 [2019-09-10 01:57:05,824 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 37 states. [2019-09-10 01:57:06,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:57:06,848 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-09-10 01:57:06,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-10 01:57:06,855 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 43 [2019-09-10 01:57:06,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:57:06,855 INFO L225 Difference]: With dead ends: 46 [2019-09-10 01:57:06,855 INFO L226 Difference]: Without dead ends: 46 [2019-09-10 01:57:06,857 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 46 SyntacticMatches, 4 SemanticMatches, 72 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 97.0s TimeCoverageRelationStatistics Valid=1266, Invalid=3687, Unknown=29, NotChecked=420, Total=5402 [2019-09-10 01:57:06,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-09-10 01:57:06,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-09-10 01:57:06,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-09-10 01:57:06,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-09-10 01:57:06,861 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 43 [2019-09-10 01:57:06,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:57:06,861 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-09-10 01:57:06,861 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-10 01:57:06,861 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-09-10 01:57:06,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-09-10 01:57:06,862 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:57:06,862 INFO L399 BasicCegarLoop]: trace histogram [35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:57:06,862 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:57:06,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:57:06,863 INFO L82 PathProgramCache]: Analyzing trace with hash -719489295, now seen corresponding path program 18 times [2019-09-10 01:57:06,863 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:57:06,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:57:06,864 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:57:06,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:57:06,864 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:57:06,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:57:07,732 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:57:07,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:57:07,732 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:57:07,732 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:57:07,732 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:57:07,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:57:07,732 INFO L193 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 [2019-09-10 01:57:07,742 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 01:57:07,742 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 01:57:07,772 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 01:57:07,772 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:57:07,773 WARN L254 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 73 conjunts are in the unsatisfiable core [2019-09-10 01:57:07,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:57:07,827 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:57:07,827 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:57:10,704 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:57:10,707 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:57:10,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 75 [2019-09-10 01:57:10,708 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:57:10,709 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-10 01:57:10,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-10 01:57:10,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1445, Invalid=4105, Unknown=0, NotChecked=0, Total=5550 [2019-09-10 01:57:10,710 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 39 states. [2019-09-10 01:57:11,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:57:11,886 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-09-10 01:57:11,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-10 01:57:11,886 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 45 [2019-09-10 01:57:11,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:57:11,887 INFO L225 Difference]: With dead ends: 48 [2019-09-10 01:57:11,887 INFO L226 Difference]: Without dead ends: 48 [2019-09-10 01:57:11,888 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=1445, Invalid=4105, Unknown=0, NotChecked=0, Total=5550 [2019-09-10 01:57:11,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-09-10 01:57:11,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-09-10 01:57:11,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-09-10 01:57:11,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-09-10 01:57:11,892 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 45 [2019-09-10 01:57:11,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:57:11,892 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-09-10 01:57:11,892 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-09-10 01:57:11,892 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-09-10 01:57:11,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-09-10 01:57:11,893 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:57:11,893 INFO L399 BasicCegarLoop]: trace histogram [37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:57:11,893 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:57:11,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:57:11,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1227282577, now seen corresponding path program 19 times [2019-09-10 01:57:11,894 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:57:11,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:57:11,895 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:57:11,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:57:11,895 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:57:11,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:57:12,926 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:57:12,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:57:12,926 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:57:12,926 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:57:12,927 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:57:12,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:57:12,927 INFO L193 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 [2019-09-10 01:57:12,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:57:12,937 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 01:57:12,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:57:12,962 WARN L254 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 77 conjunts are in the unsatisfiable core [2019-09-10 01:57:12,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:57:13,014 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:57:13,014 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:57:15,976 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:57:15,979 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:57:15,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 79 [2019-09-10 01:57:15,979 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:57:15,980 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-09-10 01:57:15,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-09-10 01:57:15,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1601, Invalid=4561, Unknown=0, NotChecked=0, Total=6162 [2019-09-10 01:57:15,981 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 41 states. [2019-09-10 01:57:17,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:57:17,219 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-09-10 01:57:17,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-10 01:57:17,219 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 47 [2019-09-10 01:57:17,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:57:17,220 INFO L225 Difference]: With dead ends: 50 [2019-09-10 01:57:17,220 INFO L226 Difference]: Without dead ends: 50 [2019-09-10 01:57:17,221 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 55 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=1601, Invalid=4561, Unknown=0, NotChecked=0, Total=6162 [2019-09-10 01:57:17,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-09-10 01:57:17,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-09-10 01:57:17,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-09-10 01:57:17,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-09-10 01:57:17,224 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 47 [2019-09-10 01:57:17,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:57:17,224 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-09-10 01:57:17,224 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-09-10 01:57:17,225 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-09-10 01:57:17,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-09-10 01:57:17,225 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:57:17,225 INFO L399 BasicCegarLoop]: trace histogram [39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:57:17,226 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:57:17,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:57:17,226 INFO L82 PathProgramCache]: Analyzing trace with hash -530689487, now seen corresponding path program 20 times [2019-09-10 01:57:17,226 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:57:17,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:57:17,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:57:17,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:57:17,227 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:57:17,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:57:18,274 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:57:18,275 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:57:18,275 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:57:18,275 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:57:18,275 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:57:18,275 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:57:18,275 INFO L193 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 [2019-09-10 01:57:18,286 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 01:57:18,287 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:00:21,506 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2019-09-10 02:00:21,506 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:00:25,979 WARN L254 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 82 conjunts are in the unsatisfiable core [2019-09-10 02:00:25,980 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:00:26,060 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:00:26,061 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:01:00,952 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 776 refuted. 4 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:01:00,959 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:01:00,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 83 [2019-09-10 02:01:00,960 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:01:00,960 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-10 02:01:00,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-10 02:01:00,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1765, Invalid=5033, Unknown=8, NotChecked=0, Total=6806 [2019-09-10 02:01:00,961 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 43 states. [2019-09-10 02:01:02,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:01:02,504 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-09-10 02:01:02,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-10 02:01:02,504 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 49 [2019-09-10 02:01:02,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:01:02,505 INFO L225 Difference]: With dead ends: 52 [2019-09-10 02:01:02,506 INFO L226 Difference]: Without dead ends: 52 [2019-09-10 02:01:02,507 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 35.9s TimeCoverageRelationStatistics Valid=1765, Invalid=5033, Unknown=8, NotChecked=0, Total=6806 [2019-09-10 02:01:02,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-09-10 02:01:02,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-09-10 02:01:02,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-09-10 02:01:02,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-09-10 02:01:02,511 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 49 [2019-09-10 02:01:02,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:01:02,511 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-09-10 02:01:02,511 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-10 02:01:02,511 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-09-10 02:01:02,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-10 02:01:02,512 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:01:02,512 INFO L399 BasicCegarLoop]: trace histogram [41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:01:02,512 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:01:02,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:01:02,513 INFO L82 PathProgramCache]: Analyzing trace with hash -2019695663, now seen corresponding path program 21 times [2019-09-10 02:01:02,513 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:01:02,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:01:02,514 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:01:02,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:01:02,514 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:01:02,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:01:03,677 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:01:03,678 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:01:03,678 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:01:03,678 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:01:03,678 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:01:03,678 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:01:03,678 INFO L193 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 [2019-09-10 02:01:03,690 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:01:03,690 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:01:03,717 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:01:03,718 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:01:03,719 WARN L254 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 85 conjunts are in the unsatisfiable core [2019-09-10 02:01:03,720 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:01:03,794 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:01:03,794 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:01:07,408 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:01:07,411 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:01:07,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 87 [2019-09-10 02:01:07,411 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:01:07,412 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-09-10 02:01:07,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-09-10 02:01:07,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1937, Invalid=5545, Unknown=0, NotChecked=0, Total=7482 [2019-09-10 02:01:07,413 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 45 states. [2019-09-10 02:01:08,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:01:08,949 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-09-10 02:01:08,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-10 02:01:08,953 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 51 [2019-09-10 02:01:08,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:01:08,953 INFO L225 Difference]: With dead ends: 54 [2019-09-10 02:01:08,954 INFO L226 Difference]: Without dead ends: 54 [2019-09-10 02:01:08,955 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=1937, Invalid=5545, Unknown=0, NotChecked=0, Total=7482 [2019-09-10 02:01:08,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-09-10 02:01:08,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-09-10 02:01:08,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-09-10 02:01:08,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-09-10 02:01:08,958 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 51 [2019-09-10 02:01:08,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:01:08,959 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-09-10 02:01:08,959 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-09-10 02:01:08,959 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-09-10 02:01:08,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-09-10 02:01:08,960 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:01:08,960 INFO L399 BasicCegarLoop]: trace histogram [43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:01:08,960 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:01:08,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:01:08,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1564446065, now seen corresponding path program 22 times [2019-09-10 02:01:08,960 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:01:08,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:01:08,961 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:01:08,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:01:08,961 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:01:08,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:01:10,164 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:01:10,165 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:01:10,165 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:01:10,165 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:01:10,165 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:01:10,165 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:01:10,165 INFO L193 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 [2019-09-10 02:01:10,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:01:10,176 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:01:10,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:01:10,207 WARN L254 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 89 conjunts are in the unsatisfiable core [2019-09-10 02:01:10,207 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:01:10,272 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:01:10,272 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:01:14,271 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:01:14,274 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:01:14,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 91 [2019-09-10 02:01:14,275 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:01:14,275 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-09-10 02:01:14,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-09-10 02:01:14,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2117, Invalid=6073, Unknown=0, NotChecked=0, Total=8190 [2019-09-10 02:01:14,276 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 47 states. [2019-09-10 02:01:15,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:01:15,958 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-09-10 02:01:15,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-10 02:01:15,959 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 53 [2019-09-10 02:01:15,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:01:15,960 INFO L225 Difference]: With dead ends: 56 [2019-09-10 02:01:15,960 INFO L226 Difference]: Without dead ends: 56 [2019-09-10 02:01:15,961 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=2117, Invalid=6073, Unknown=0, NotChecked=0, Total=8190 [2019-09-10 02:01:15,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-09-10 02:01:15,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-09-10 02:01:15,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-09-10 02:01:15,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-09-10 02:01:15,964 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 53 [2019-09-10 02:01:15,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:01:15,966 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-09-10 02:01:15,966 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-09-10 02:01:15,966 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-09-10 02:01:15,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-10 02:01:15,967 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:01:15,967 INFO L399 BasicCegarLoop]: trace histogram [45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:01:15,967 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:01:15,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:01:15,968 INFO L82 PathProgramCache]: Analyzing trace with hash 1360875281, now seen corresponding path program 23 times [2019-09-10 02:01:15,968 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:01:15,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:01:15,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:01:15,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:01:15,969 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:01:16,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:01:17,371 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:01:17,372 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:01:17,372 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:01:17,372 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:01:17,372 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:01:17,372 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:01:17,372 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:01:17,385 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:01:17,385 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:04:56,741 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-09-10 02:04:56,741 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:04:57,393 WARN L254 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 93 conjunts are in the unsatisfiable core [2019-09-10 02:04:57,394 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:04:57,469 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:04:57,469 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:05:01,981 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:05:01,991 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:05:01,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2019-09-10 02:05:01,991 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:05:01,992 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-09-10 02:05:01,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-09-10 02:05:01,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2305, Invalid=6625, Unknown=0, NotChecked=0, Total=8930 [2019-09-10 02:05:01,993 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 49 states. [2019-09-10 02:05:03,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:05:03,866 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-09-10 02:05:03,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-10 02:05:03,866 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 55 [2019-09-10 02:05:03,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:05:03,867 INFO L225 Difference]: With dead ends: 58 [2019-09-10 02:05:03,867 INFO L226 Difference]: Without dead ends: 58 [2019-09-10 02:05:03,868 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 63 SyntacticMatches, 2 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=2305, Invalid=6625, Unknown=0, NotChecked=0, Total=8930 [2019-09-10 02:05:03,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-09-10 02:05:03,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-09-10 02:05:03,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-09-10 02:05:03,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-09-10 02:05:03,872 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 55 [2019-09-10 02:05:03,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:05:03,872 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-09-10 02:05:03,872 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-09-10 02:05:03,872 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-09-10 02:05:03,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-10 02:05:03,873 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:05:03,873 INFO L399 BasicCegarLoop]: trace histogram [47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:05:03,874 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:05:03,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:05:03,874 INFO L82 PathProgramCache]: Analyzing trace with hash -997119823, now seen corresponding path program 24 times [2019-09-10 02:05:03,874 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:05:03,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:05:03,875 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:05:03,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:05:03,875 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:05:03,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:05:05,734 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:05:05,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:05:05,734 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:05:05,734 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:05:05,735 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:05:05,735 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:05:05,735 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:05:05,746 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:05:05,746 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:05:05,779 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:05:05,779 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:05:05,781 WARN L254 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 97 conjunts are in the unsatisfiable core [2019-09-10 02:05:05,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:05:05,854 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:05:05,854 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:05:10,687 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:05:10,690 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:05:10,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 99 [2019-09-10 02:05:10,691 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:05:10,691 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-09-10 02:05:10,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-09-10 02:05:10,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2501, Invalid=7201, Unknown=0, NotChecked=0, Total=9702 [2019-09-10 02:05:10,692 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 51 states. [2019-09-10 02:05:12,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:05:12,719 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-09-10 02:05:12,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-10 02:05:12,720 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 57 [2019-09-10 02:05:12,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:05:12,721 INFO L225 Difference]: With dead ends: 60 [2019-09-10 02:05:12,721 INFO L226 Difference]: Without dead ends: 60 [2019-09-10 02:05:12,721 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 65 SyntacticMatches, 2 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=2501, Invalid=7201, Unknown=0, NotChecked=0, Total=9702 [2019-09-10 02:05:12,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-09-10 02:05:12,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-09-10 02:05:12,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-09-10 02:05:12,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-09-10 02:05:12,724 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 57 [2019-09-10 02:05:12,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:05:12,725 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-09-10 02:05:12,725 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-09-10 02:05:12,725 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-09-10 02:05:12,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-10 02:05:12,726 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:05:12,726 INFO L399 BasicCegarLoop]: trace histogram [49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:05:12,726 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:05:12,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:05:12,727 INFO L82 PathProgramCache]: Analyzing trace with hash 712317521, now seen corresponding path program 25 times [2019-09-10 02:05:12,727 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:05:12,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:05:12,727 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:05:12,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:05:12,728 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:05:12,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:05:14,205 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:05:14,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:05:14,205 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:05:14,205 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:05:14,205 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:05:14,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:05:14,206 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:05:14,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:05:14,216 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:05:14,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:05:14,251 WARN L254 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 101 conjunts are in the unsatisfiable core [2019-09-10 02:05:14,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:05:14,422 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:05:14,422 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:05:19,631 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:05:19,634 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:05:19,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 103 [2019-09-10 02:05:19,634 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:05:19,634 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-09-10 02:05:19,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-09-10 02:05:19,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2705, Invalid=7801, Unknown=0, NotChecked=0, Total=10506 [2019-09-10 02:05:19,636 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 53 states. [2019-09-10 02:05:21,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:05:21,773 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-09-10 02:05:21,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-09-10 02:05:21,773 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 59 [2019-09-10 02:05:21,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:05:21,774 INFO L225 Difference]: With dead ends: 62 [2019-09-10 02:05:21,775 INFO L226 Difference]: Without dead ends: 62 [2019-09-10 02:05:21,775 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 67 SyntacticMatches, 2 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=2705, Invalid=7801, Unknown=0, NotChecked=0, Total=10506 [2019-09-10 02:05:21,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-09-10 02:05:21,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-09-10 02:05:21,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-09-10 02:05:21,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-09-10 02:05:21,778 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 59 [2019-09-10 02:05:21,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:05:21,778 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-09-10 02:05:21,778 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-09-10 02:05:21,778 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-09-10 02:05:21,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-10 02:05:21,779 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:05:21,779 INFO L399 BasicCegarLoop]: trace histogram [51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:05:21,779 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:05:21,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:05:21,779 INFO L82 PathProgramCache]: Analyzing trace with hash -1490869263, now seen corresponding path program 26 times [2019-09-10 02:05:21,780 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:05:21,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:05:21,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:05:21,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:05:21,781 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:05:21,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:05:23,664 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:05:23,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:05:23,665 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:05:23,665 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:05:23,665 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:05:23,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:05:23,665 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:05:23,675 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:05:23,675 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP)