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/nested_1-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c6af20d [2019-09-03 20:37:21,800 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-03 20:37:21,802 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-03 20:37:21,814 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-03 20:37:21,814 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-03 20:37:21,815 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-03 20:37:21,816 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-03 20:37:21,818 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-03 20:37:21,820 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-03 20:37:21,821 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-03 20:37:21,821 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-03 20:37:21,823 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-03 20:37:21,823 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-03 20:37:21,824 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-03 20:37:21,825 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-03 20:37:21,826 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-03 20:37:21,826 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-03 20:37:21,827 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-03 20:37:21,829 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-03 20:37:21,831 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-03 20:37:21,832 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-03 20:37:21,834 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-03 20:37:21,836 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-03 20:37:21,836 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-03 20:37:21,838 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-03 20:37:21,839 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-03 20:37:21,839 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-03 20:37:21,840 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-03 20:37:21,840 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-03 20:37:21,841 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-03 20:37:21,841 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-03 20:37:21,843 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-03 20:37:21,844 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-03 20:37:21,845 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-03 20:37:21,847 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-03 20:37:21,847 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-03 20:37:21,848 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-03 20:37:21,850 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-03 20:37:21,850 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-03 20:37:21,851 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-03 20:37:21,852 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-03 20:37:21,853 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-03 20:37:21,878 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-03 20:37:21,878 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-03 20:37:21,879 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-03 20:37:21,880 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-03 20:37:21,880 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-03 20:37:21,880 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-03 20:37:21,881 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-03 20:37:21,881 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-03 20:37:21,881 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-03 20:37:21,881 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-03 20:37:21,883 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-03 20:37:21,883 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-03 20:37:21,884 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-03 20:37:21,884 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-03 20:37:21,884 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-03 20:37:21,884 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-03 20:37:21,885 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-03 20:37:21,885 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-03 20:37:21,885 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-03 20:37:21,885 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-03 20:37:21,886 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-03 20:37:21,886 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-03 20:37:21,886 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-03 20:37:21,886 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 20:37:21,887 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-03 20:37:21,887 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-03 20:37:21,887 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-03 20:37:21,887 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-03 20:37:21,887 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-03 20:37:21,888 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-03 20:37:21,935 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-03 20:37:21,952 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-03 20:37:21,957 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-03 20:37:21,959 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-03 20:37:21,961 INFO L275 PluginConnector]: CDTParser initialized [2019-09-03 20:37:21,961 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/nested_1-2.c [2019-09-03 20:37:22,035 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47c8cddd9/dab5850fc9f64b6bb152f93b294ef5d2/FLAG1421920f1 [2019-09-03 20:37:22,451 INFO L306 CDTParser]: Found 1 translation units. [2019-09-03 20:37:22,452 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/nested_1-2.c [2019-09-03 20:37:22,458 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47c8cddd9/dab5850fc9f64b6bb152f93b294ef5d2/FLAG1421920f1 [2019-09-03 20:37:22,830 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47c8cddd9/dab5850fc9f64b6bb152f93b294ef5d2 [2019-09-03 20:37:22,843 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-03 20:37:22,844 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-03 20:37:22,848 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-03 20:37:22,848 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-03 20:37:22,852 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-03 20:37:22,853 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 08:37:22" (1/1) ... [2019-09-03 20:37:22,855 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2914a9e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:37:22, skipping insertion in model container [2019-09-03 20:37:22,856 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 08:37:22" (1/1) ... [2019-09-03 20:37:22,863 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-03 20:37:22,878 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-03 20:37:23,018 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 20:37:23,022 INFO L188 MainTranslator]: Completed pre-run [2019-09-03 20:37:23,036 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 20:37:23,047 INFO L192 MainTranslator]: Completed translation [2019-09-03 20:37:23,047 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:37:23 WrapperNode [2019-09-03 20:37:23,048 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-03 20:37:23,048 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-03 20:37:23,048 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-03 20:37:23,048 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-03 20:37:23,140 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:37:23" (1/1) ... [2019-09-03 20:37:23,140 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:37:23" (1/1) ... [2019-09-03 20:37:23,145 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:37:23" (1/1) ... [2019-09-03 20:37:23,145 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:37:23" (1/1) ... [2019-09-03 20:37:23,148 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:37:23" (1/1) ... [2019-09-03 20:37:23,152 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:37:23" (1/1) ... [2019-09-03 20:37:23,153 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:37:23" (1/1) ... [2019-09-03 20:37:23,154 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-03 20:37:23,155 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-03 20:37:23,155 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-03 20:37:23,155 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-03 20:37:23,156 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:37:23" (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-03 20:37:23,211 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-03 20:37:23,212 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-03 20:37:23,212 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-03 20:37:23,212 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-03 20:37:23,212 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-03 20:37:23,212 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-03 20:37:23,212 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-03 20:37:23,212 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-03 20:37:23,213 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-03 20:37:23,368 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-03 20:37:23,369 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-09-03 20:37:23,370 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 08:37:23 BoogieIcfgContainer [2019-09-03 20:37:23,370 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-03 20:37:23,371 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-03 20:37:23,371 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-03 20:37:23,374 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-03 20:37:23,374 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.09 08:37:22" (1/3) ... [2019-09-03 20:37:23,375 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@186a0499 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 08:37:23, skipping insertion in model container [2019-09-03 20:37:23,375 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:37:23" (2/3) ... [2019-09-03 20:37:23,376 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@186a0499 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 08:37:23, skipping insertion in model container [2019-09-03 20:37:23,376 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 08:37:23" (3/3) ... [2019-09-03 20:37:23,377 INFO L109 eAbstractionObserver]: Analyzing ICFG nested_1-2.c [2019-09-03 20:37:23,385 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-03 20:37:23,391 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-03 20:37:23,407 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-03 20:37:23,433 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-03 20:37:23,434 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-03 20:37:23,434 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-03 20:37:23,434 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-03 20:37:23,434 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-03 20:37:23,434 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-03 20:37:23,435 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-03 20:37:23,435 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-03 20:37:23,454 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2019-09-03 20:37:23,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-03 20:37:23,462 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:37:23,463 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:37:23,465 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:37:23,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:37:23,470 INFO L82 PathProgramCache]: Analyzing trace with hash -873786703, now seen corresponding path program 1 times [2019-09-03 20:37:23,471 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:37:23,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:23,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:37:23,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:23,509 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:37:23,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:23,651 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-03 20:37:23,653 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:37:23,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-03 20:37:23,653 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:37:23,657 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-03 20:37:23,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-03 20:37:23,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 20:37:23,675 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 3 states. [2019-09-03 20:37:23,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:37:23,716 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2019-09-03 20:37:23,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-03 20:37:23,719 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-09-03 20:37:23,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:37:23,731 INFO L225 Difference]: With dead ends: 22 [2019-09-03 20:37:23,731 INFO L226 Difference]: Without dead ends: 16 [2019-09-03 20:37:23,733 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-03 20:37:23,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-09-03 20:37:23,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 14. [2019-09-03 20:37:23,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-09-03 20:37:23,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2019-09-03 20:37:23,773 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 10 [2019-09-03 20:37:23,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:37:23,774 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2019-09-03 20:37:23,774 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-03 20:37:23,774 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2019-09-03 20:37:23,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-03 20:37:23,775 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:37:23,775 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:37:23,776 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:37:23,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:37:23,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1621360120, now seen corresponding path program 1 times [2019-09-03 20:37:23,776 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:37:23,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:23,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:37:23,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:23,778 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:37:23,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:23,857 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:23,858 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:37:23,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-03 20:37:23,858 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:37:23,859 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-03 20:37:23,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-03 20:37:23,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 20:37:23,860 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 3 states. [2019-09-03 20:37:23,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:37:23,873 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2019-09-03 20:37:23,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-03 20:37:23,874 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-09-03 20:37:23,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:37:23,875 INFO L225 Difference]: With dead ends: 15 [2019-09-03 20:37:23,875 INFO L226 Difference]: Without dead ends: 15 [2019-09-03 20:37:23,876 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 20:37:23,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-09-03 20:37:23,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-09-03 20:37:23,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-09-03 20:37:23,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2019-09-03 20:37:23,880 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 13 [2019-09-03 20:37:23,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:37:23,880 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-09-03 20:37:23,881 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-03 20:37:23,881 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2019-09-03 20:37:23,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-03 20:37:23,881 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:37:23,882 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:37:23,882 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:37:23,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:37:23,882 INFO L82 PathProgramCache]: Analyzing trace with hash 1574756514, now seen corresponding path program 1 times [2019-09-03 20:37:23,883 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:37:23,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:23,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:37:23,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:23,884 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:37:23,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:23,993 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:23,994 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:23,994 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:37:23,998 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 15 with the following transitions: [2019-09-03 20:37:24,000 INFO L207 CegarAbsIntRunner]: [0], [4], [11], [13], [20], [22], [26], [32], [35], [37], [43], [44], [45], [47] [2019-09-03 20:37:24,029 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-03 20:37:24,030 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-03 20:37:24,092 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-03 20:37:24,764 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-03 20:37:24,769 INFO L272 AbstractInterpreter]: Visited 14 different actions 98 times. Merged at 5 different actions 38 times. Widened at 3 different actions 14 times. Performed 206 root evaluator evaluations with a maximum evaluation depth of 13. Performed 206 inverse root evaluator evaluations with a maximum inverse evaluation depth of 13. Found 12 fixpoints after 3 different actions. Largest state had 4 variables. [2019-09-03 20:37:24,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:37:24,774 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-03 20:37:24,774 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:24,774 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-03 20:37:24,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:37:24,799 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:37:24,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:24,832 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-03 20:37:24,843 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:37:24,893 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:24,893 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:37:24,942 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-03 20:37:24,946 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:37:24,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 4] total 9 [2019-09-03 20:37:24,947 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:37:24,948 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-03 20:37:24,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-03 20:37:24,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-09-03 20:37:24,952 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 7 states. [2019-09-03 20:37:25,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:37:25,114 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2019-09-03 20:37:25,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-03 20:37:25,115 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2019-09-03 20:37:25,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:37:25,116 INFO L225 Difference]: With dead ends: 25 [2019-09-03 20:37:25,116 INFO L226 Difference]: Without dead ends: 25 [2019-09-03 20:37:25,118 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-09-03 20:37:25,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-09-03 20:37:25,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 21. [2019-09-03 20:37:25,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-09-03 20:37:25,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2019-09-03 20:37:25,126 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 14 [2019-09-03 20:37:25,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:37:25,127 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2019-09-03 20:37:25,127 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-03 20:37:25,127 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2019-09-03 20:37:25,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-03 20:37:25,129 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:37:25,130 INFO L399 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:37:25,130 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:37:25,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:37:25,131 INFO L82 PathProgramCache]: Analyzing trace with hash 93409041, now seen corresponding path program 2 times [2019-09-03 20:37:25,131 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:37:25,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:25,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:37:25,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:25,136 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:37:25,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:25,298 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-03 20:37:25,298 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:25,299 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:37:25,299 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:37:25,299 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:37:25,299 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:25,299 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) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:37:25,318 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:37:25,318 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:37:25,348 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-09-03 20:37:25,348 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:37:25,349 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-03 20:37:25,351 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:37:25,445 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:25,445 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:37:25,501 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-03 20:37:25,505 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:37:25,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 5] total 15 [2019-09-03 20:37:25,505 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:37:25,506 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-03 20:37:25,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-03 20:37:25,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2019-09-03 20:37:25,507 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 12 states. [2019-09-03 20:37:25,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:37:25,697 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2019-09-03 20:37:25,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-03 20:37:25,698 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2019-09-03 20:37:25,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:37:25,699 INFO L225 Difference]: With dead ends: 34 [2019-09-03 20:37:25,699 INFO L226 Difference]: Without dead ends: 34 [2019-09-03 20:37:25,700 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2019-09-03 20:37:25,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-09-03 20:37:25,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 29. [2019-09-03 20:37:25,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-09-03 20:37:25,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2019-09-03 20:37:25,708 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 20 [2019-09-03 20:37:25,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:37:25,708 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2019-09-03 20:37:25,708 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-03 20:37:25,709 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2019-09-03 20:37:25,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-03 20:37:25,710 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:37:25,710 INFO L399 BasicCegarLoop]: trace histogram [9, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:37:25,710 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:37:25,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:37:25,711 INFO L82 PathProgramCache]: Analyzing trace with hash 50981508, now seen corresponding path program 3 times [2019-09-03 20:37:25,711 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:37:25,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:25,712 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:37:25,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:25,712 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:37:25,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:25,840 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 35 proven. 6 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-03 20:37:25,840 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:25,840 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:37:25,841 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:37:25,841 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:37:25,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:25,841 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-03 20:37:25,855 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:37:25,856 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-03 20:37:25,876 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:37:25,876 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:37:25,877 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-03 20:37:25,879 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:37:25,981 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-03 20:37:25,982 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:37:26,075 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-03 20:37:26,078 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:37:26,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 6] total 17 [2019-09-03 20:37:26,079 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:37:26,079 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-03 20:37:26,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-03 20:37:26,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2019-09-03 20:37:26,080 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 13 states. [2019-09-03 20:37:26,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:37:26,470 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2019-09-03 20:37:26,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-03 20:37:26,470 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 28 [2019-09-03 20:37:26,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:37:26,472 INFO L225 Difference]: With dead ends: 45 [2019-09-03 20:37:26,472 INFO L226 Difference]: Without dead ends: 45 [2019-09-03 20:37:26,473 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=196, Invalid=674, Unknown=0, NotChecked=0, Total=870 [2019-09-03 20:37:26,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-09-03 20:37:26,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. [2019-09-03 20:37:26,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-03 20:37:26,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2019-09-03 20:37:26,478 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 28 [2019-09-03 20:37:26,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:37:26,479 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2019-09-03 20:37:26,479 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-03 20:37:26,479 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2019-09-03 20:37:26,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-03 20:37:26,480 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:37:26,481 INFO L399 BasicCegarLoop]: trace histogram [16, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:37:26,481 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:37:26,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:37:26,481 INFO L82 PathProgramCache]: Analyzing trace with hash 1027694321, now seen corresponding path program 4 times [2019-09-03 20:37:26,482 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:37:26,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:26,483 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:37:26,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:26,483 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:37:26,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:26,597 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 79 proven. 10 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-09-03 20:37:26,597 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:26,598 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:37:26,598 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:37:26,598 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:37:26,598 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:26,598 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) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:37:26,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:37:26,615 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:37:26,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:26,640 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-03 20:37:26,642 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:37:26,793 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-03 20:37:26,796 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:37:26,911 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 0 proven. 166 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-03 20:37:26,914 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:37:26,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 7] total 21 [2019-09-03 20:37:26,915 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:37:26,915 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-03 20:37:26,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-03 20:37:26,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-09-03 20:37:26,918 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 16 states. [2019-09-03 20:37:27,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:37:27,453 INFO L93 Difference]: Finished difference Result 58 states and 64 transitions. [2019-09-03 20:37:27,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-03 20:37:27,453 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 38 [2019-09-03 20:37:27,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:37:27,454 INFO L225 Difference]: With dead ends: 58 [2019-09-03 20:37:27,454 INFO L226 Difference]: Without dead ends: 58 [2019-09-03 20:37:27,455 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 374 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=325, Invalid=1397, Unknown=0, NotChecked=0, Total=1722 [2019-09-03 20:37:27,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-09-03 20:37:27,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 51. [2019-09-03 20:37:27,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-09-03 20:37:27,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2019-09-03 20:37:27,461 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 38 [2019-09-03 20:37:27,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:37:27,462 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2019-09-03 20:37:27,462 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-03 20:37:27,462 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2019-09-03 20:37:27,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-03 20:37:27,463 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:37:27,463 INFO L399 BasicCegarLoop]: trace histogram [25, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:37:27,464 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:37:27,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:37:27,464 INFO L82 PathProgramCache]: Analyzing trace with hash 79747558, now seen corresponding path program 5 times [2019-09-03 20:37:27,464 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:37:27,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:27,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:37:27,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:27,465 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:37:27,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:27,599 INFO L134 CoverageAnalysis]: Checked inductivity of 460 backedges. 149 proven. 15 refuted. 0 times theorem prover too weak. 296 trivial. 0 not checked. [2019-09-03 20:37:27,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:27,600 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:37:27,600 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:37:27,600 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:37:27,600 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:27,600 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-03 20:37:27,614 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:37:27,615 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:37:27,937 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-09-03 20:37:27,937 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:37:27,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-03 20:37:27,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:37:27,996 INFO L134 CoverageAnalysis]: Checked inductivity of 460 backedges. 149 proven. 15 refuted. 0 times theorem prover too weak. 296 trivial. 0 not checked. [2019-09-03 20:37:27,996 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:37:28,116 INFO L134 CoverageAnalysis]: Checked inductivity of 460 backedges. 149 proven. 15 refuted. 0 times theorem prover too weak. 296 trivial. 0 not checked. [2019-09-03 20:37:28,121 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:37:28,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2019-09-03 20:37:28,121 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:37:28,122 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-03 20:37:28,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-03 20:37:28,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2019-09-03 20:37:28,123 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand 9 states. [2019-09-03 20:37:28,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:37:28,174 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2019-09-03 20:37:28,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-03 20:37:28,177 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 50 [2019-09-03 20:37:28,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:37:28,178 INFO L225 Difference]: With dead ends: 56 [2019-09-03 20:37:28,178 INFO L226 Difference]: Without dead ends: 56 [2019-09-03 20:37:28,179 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2019-09-03 20:37:28,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-09-03 20:37:28,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-09-03 20:37:28,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-09-03 20:37:28,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2019-09-03 20:37:28,191 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 50 [2019-09-03 20:37:28,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:37:28,191 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2019-09-03 20:37:28,191 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-03 20:37:28,191 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2019-09-03 20:37:28,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-03 20:37:28,192 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:37:28,192 INFO L399 BasicCegarLoop]: trace histogram [30, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:37:28,193 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:37:28,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:37:28,193 INFO L82 PathProgramCache]: Analyzing trace with hash -1763701256, now seen corresponding path program 6 times [2019-09-03 20:37:28,194 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:37:28,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:28,195 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:37:28,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:28,195 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:37:28,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:28,362 INFO L134 CoverageAnalysis]: Checked inductivity of 620 backedges. 201 proven. 21 refuted. 0 times theorem prover too weak. 398 trivial. 0 not checked. [2019-09-03 20:37:28,363 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:28,363 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:37:28,363 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:37:28,363 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:37:28,363 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:28,363 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-03 20:37:28,387 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:37:28,387 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:37:28,419 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:37:28,420 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:37:28,421 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-03 20:37:28,427 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:37:28,599 INFO L134 CoverageAnalysis]: Checked inductivity of 620 backedges. 0 proven. 536 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-03 20:37:28,599 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:37:29,044 INFO L134 CoverageAnalysis]: Checked inductivity of 620 backedges. 6 proven. 530 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-03 20:37:29,048 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:37:29,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14, 14] total 33 [2019-09-03 20:37:29,048 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:37:29,049 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-03 20:37:29,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-03 20:37:29,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=818, Unknown=0, NotChecked=0, Total=1056 [2019-09-03 20:37:29,055 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand 21 states. [2019-09-03 20:37:30,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:37:30,294 INFO L93 Difference]: Finished difference Result 80 states and 87 transitions. [2019-09-03 20:37:30,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-09-03 20:37:30,295 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 55 [2019-09-03 20:37:30,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:37:30,296 INFO L225 Difference]: With dead ends: 80 [2019-09-03 20:37:30,296 INFO L226 Difference]: Without dead ends: 80 [2019-09-03 20:37:30,298 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1065 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=880, Invalid=3812, Unknown=0, NotChecked=0, Total=4692 [2019-09-03 20:37:30,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-09-03 20:37:30,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 71. [2019-09-03 20:37:30,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-09-03 20:37:30,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 77 transitions. [2019-09-03 20:37:30,304 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 77 transitions. Word has length 55 [2019-09-03 20:37:30,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:37:30,305 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 77 transitions. [2019-09-03 20:37:30,305 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-03 20:37:30,305 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 77 transitions. [2019-09-03 20:37:30,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-03 20:37:30,306 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:37:30,306 INFO L399 BasicCegarLoop]: trace histogram [42, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:37:30,306 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:37:30,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:37:30,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1703496983, now seen corresponding path program 7 times [2019-09-03 20:37:30,307 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:37:30,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:30,308 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:37:30,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:30,308 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:37:30,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:30,426 INFO L134 CoverageAnalysis]: Checked inductivity of 1164 backedges. 326 proven. 28 refuted. 0 times theorem prover too weak. 810 trivial. 0 not checked. [2019-09-03 20:37:30,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:30,427 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:37:30,427 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:37:30,427 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:37:30,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:30,427 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-03 20:37:30,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:37:30,440 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:37:30,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:30,473 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-03 20:37:30,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:37:30,678 INFO L134 CoverageAnalysis]: Checked inductivity of 1164 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2019-09-03 20:37:30,678 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:37:31,228 INFO L134 CoverageAnalysis]: Checked inductivity of 1164 backedges. 7 proven. 1017 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2019-09-03 20:37:31,231 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:37:31,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 16, 16] total 38 [2019-09-03 20:37:31,232 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:37:31,233 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-03 20:37:31,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-03 20:37:31,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=310, Invalid=1096, Unknown=0, NotChecked=0, Total=1406 [2019-09-03 20:37:31,234 INFO L87 Difference]: Start difference. First operand 71 states and 77 transitions. Second operand 24 states. [2019-09-03 20:37:32,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:37:32,870 INFO L93 Difference]: Finished difference Result 98 states and 106 transitions. [2019-09-03 20:37:32,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-09-03 20:37:32,871 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 70 [2019-09-03 20:37:32,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:37:32,872 INFO L225 Difference]: With dead ends: 98 [2019-09-03 20:37:32,872 INFO L226 Difference]: Without dead ends: 98 [2019-09-03 20:37:32,876 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1813 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1283, Invalid=6199, Unknown=0, NotChecked=0, Total=7482 [2019-09-03 20:37:32,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-09-03 20:37:32,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 88. [2019-09-03 20:37:32,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-09-03 20:37:32,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 95 transitions. [2019-09-03 20:37:32,888 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 95 transitions. Word has length 70 [2019-09-03 20:37:32,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:37:32,889 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 95 transitions. [2019-09-03 20:37:32,889 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-03 20:37:32,889 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2019-09-03 20:37:32,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-03 20:37:32,890 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:37:32,890 INFO L399 BasicCegarLoop]: trace histogram [56, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:37:32,890 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:37:32,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:37:32,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1048409624, now seen corresponding path program 8 times [2019-09-03 20:37:32,891 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:37:32,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:32,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:37:32,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:32,895 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:37:32,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:33,073 INFO L134 CoverageAnalysis]: Checked inductivity of 2002 backedges. 493 proven. 36 refuted. 0 times theorem prover too weak. 1473 trivial. 0 not checked. [2019-09-03 20:37:33,073 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:33,073 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:37:33,073 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:37:33,073 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:37:33,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:33,074 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-03 20:37:33,087 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:37:33,087 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:37:33,256 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-09-03 20:37:33,256 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:37:33,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-03 20:37:33,261 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:37:33,292 INFO L134 CoverageAnalysis]: Checked inductivity of 2002 backedges. 493 proven. 36 refuted. 0 times theorem prover too weak. 1473 trivial. 0 not checked. [2019-09-03 20:37:33,293 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:37:33,449 INFO L134 CoverageAnalysis]: Checked inductivity of 2002 backedges. 493 proven. 36 refuted. 0 times theorem prover too weak. 1473 trivial. 0 not checked. [2019-09-03 20:37:33,453 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:37:33,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2019-09-03 20:37:33,454 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:37:33,454 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-03 20:37:33,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-03 20:37:33,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2019-09-03 20:37:33,455 INFO L87 Difference]: Start difference. First operand 88 states and 95 transitions. Second operand 12 states. [2019-09-03 20:37:33,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:37:33,556 INFO L93 Difference]: Finished difference Result 95 states and 102 transitions. [2019-09-03 20:37:33,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-03 20:37:33,556 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 87 [2019-09-03 20:37:33,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:37:33,558 INFO L225 Difference]: With dead ends: 95 [2019-09-03 20:37:33,558 INFO L226 Difference]: Without dead ends: 95 [2019-09-03 20:37:33,559 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 164 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2019-09-03 20:37:33,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-09-03 20:37:33,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-09-03 20:37:33,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-09-03 20:37:33,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 102 transitions. [2019-09-03 20:37:33,565 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 102 transitions. Word has length 87 [2019-09-03 20:37:33,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:37:33,566 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 102 transitions. [2019-09-03 20:37:33,566 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-03 20:37:33,566 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 102 transitions. [2019-09-03 20:37:33,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-03 20:37:33,567 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:37:33,567 INFO L399 BasicCegarLoop]: trace histogram [63, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:37:33,568 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:37:33,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:37:33,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1289232840, now seen corresponding path program 9 times [2019-09-03 20:37:33,568 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:37:33,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:33,569 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:37:33,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:33,569 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:37:33,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:33,775 INFO L134 CoverageAnalysis]: Checked inductivity of 2464 backedges. 607 proven. 45 refuted. 0 times theorem prover too weak. 1812 trivial. 0 not checked. [2019-09-03 20:37:33,775 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:33,775 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:37:33,775 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:37:33,775 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:37:33,775 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:33,775 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-03 20:37:33,786 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:37:33,786 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:37:33,831 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:37:33,831 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:37:33,832 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-03 20:37:33,835 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:37:34,085 INFO L134 CoverageAnalysis]: Checked inductivity of 2464 backedges. 0 proven. 2193 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2019-09-03 20:37:34,085 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:37:34,820 INFO L134 CoverageAnalysis]: Checked inductivity of 2464 backedges. 16 proven. 2177 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2019-09-03 20:37:34,824 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:37:34,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 18, 18] total 44 [2019-09-03 20:37:34,824 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:37:34,825 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-03 20:37:34,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-03 20:37:34,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=403, Invalid=1489, Unknown=0, NotChecked=0, Total=1892 [2019-09-03 20:37:34,826 INFO L87 Difference]: Start difference. First operand 95 states and 102 transitions. Second operand 28 states. [2019-09-03 20:37:37,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:37:37,576 INFO L93 Difference]: Finished difference Result 127 states and 136 transitions. [2019-09-03 20:37:37,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-09-03 20:37:37,580 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 94 [2019-09-03 20:37:37,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:37:37,581 INFO L225 Difference]: With dead ends: 127 [2019-09-03 20:37:37,581 INFO L226 Difference]: Without dead ends: 127 [2019-09-03 20:37:37,585 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3512 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1979, Invalid=11361, Unknown=0, NotChecked=0, Total=13340 [2019-09-03 20:37:37,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-09-03 20:37:37,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 115. [2019-09-03 20:37:37,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-09-03 20:37:37,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 123 transitions. [2019-09-03 20:37:37,592 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 123 transitions. Word has length 94 [2019-09-03 20:37:37,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:37:37,593 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 123 transitions. [2019-09-03 20:37:37,593 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-03 20:37:37,593 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 123 transitions. [2019-09-03 20:37:37,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-03 20:37:37,594 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:37:37,595 INFO L399 BasicCegarLoop]: trace histogram [80, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:37:37,595 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:37:37,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:37:37,595 INFO L82 PathProgramCache]: Analyzing trace with hash -352579535, now seen corresponding path program 10 times [2019-09-03 20:37:37,595 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:37:37,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:37,596 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:37:37,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:37,597 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:37:37,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:37,838 INFO L134 CoverageAnalysis]: Checked inductivity of 3892 backedges. 0 proven. 3452 refuted. 0 times theorem prover too weak. 440 trivial. 0 not checked. [2019-09-03 20:37:37,838 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:37,838 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:37:37,838 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:37:37,838 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:37:37,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:37,839 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-03 20:37:37,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:37:37,859 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:37:37,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:37,912 INFO L256 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-03 20:37:37,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:37:38,144 INFO L134 CoverageAnalysis]: Checked inductivity of 3892 backedges. 0 proven. 3506 refuted. 0 times theorem prover too weak. 386 trivial. 0 not checked. [2019-09-03 20:37:38,144 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:37:38,958 INFO L134 CoverageAnalysis]: Checked inductivity of 3892 backedges. 18 proven. 3488 refuted. 0 times theorem prover too weak. 386 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (11)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 20:37:38,962 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:37:38,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 20, 20] total 39 [2019-09-03 20:37:38,963 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:37:38,963 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-03 20:37:38,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-03 20:37:38,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=453, Invalid=1029, Unknown=0, NotChecked=0, Total=1482 [2019-09-03 20:37:38,964 INFO L87 Difference]: Start difference. First operand 115 states and 123 transitions. Second operand 21 states. [2019-09-03 20:37:39,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:37:39,458 INFO L93 Difference]: Finished difference Result 140 states and 150 transitions. [2019-09-03 20:37:39,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-03 20:37:39,458 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 114 [2019-09-03 20:37:39,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:37:39,461 INFO L225 Difference]: With dead ends: 140 [2019-09-03 20:37:39,461 INFO L226 Difference]: Without dead ends: 140 [2019-09-03 20:37:39,462 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 200 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 389 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=453, Invalid=1029, Unknown=0, NotChecked=0, Total=1482 [2019-09-03 20:37:39,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-09-03 20:37:39,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 128. [2019-09-03 20:37:39,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-09-03 20:37:39,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 137 transitions. [2019-09-03 20:37:39,469 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 137 transitions. Word has length 114 [2019-09-03 20:37:39,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:37:39,469 INFO L475 AbstractCegarLoop]: Abstraction has 128 states and 137 transitions. [2019-09-03 20:37:39,469 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-03 20:37:39,470 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 137 transitions. [2019-09-03 20:37:39,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-03 20:37:39,471 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:37:39,471 INFO L399 BasicCegarLoop]: trace histogram [90, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:37:39,472 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:37:39,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:37:39,472 INFO L82 PathProgramCache]: Analyzing trace with hash -535987528, now seen corresponding path program 11 times [2019-09-03 20:37:39,472 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:37:39,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:39,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:37:39,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:39,473 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:37:39,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:39,768 INFO L134 CoverageAnalysis]: Checked inductivity of 4932 backedges. 0 proven. 4437 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2019-09-03 20:37:39,769 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:39,769 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:37:39,769 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:37:39,769 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:37:39,769 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:39,769 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-03 20:37:39,788 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:37:39,788 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:39:23,878 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2019-09-03 20:39:23,879 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:39:24,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 62 conjunts are in the unsatisfiable core [2019-09-03 20:39:24,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:39:24,713 INFO L134 CoverageAnalysis]: Checked inductivity of 4932 backedges. 0 proven. 4546 refuted. 0 times theorem prover too weak. 386 trivial. 0 not checked. [2019-09-03 20:39:24,713 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:39:25,458 INFO L134 CoverageAnalysis]: Checked inductivity of 4932 backedges. 10 proven. 4482 refuted. 0 times theorem prover too weak. 440 trivial. 0 not checked. [2019-09-03 20:39:25,466 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:39:25,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 31, 22] total 52 [2019-09-03 20:39:25,466 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:39:25,467 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-03 20:39:25,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-03 20:39:25,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=759, Invalid=1893, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 20:39:25,468 INFO L87 Difference]: Start difference. First operand 128 states and 137 transitions. Second operand 32 states. [2019-09-03 20:39:26,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:39:26,391 INFO L93 Difference]: Finished difference Result 153 states and 164 transitions. [2019-09-03 20:39:26,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-03 20:39:26,392 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 127 [2019-09-03 20:39:26,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:39:26,393 INFO L225 Difference]: With dead ends: 153 [2019-09-03 20:39:26,394 INFO L226 Difference]: Without dead ends: 153 [2019-09-03 20:39:26,395 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 214 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1029 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=759, Invalid=1893, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 20:39:26,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-09-03 20:39:26,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 141. [2019-09-03 20:39:26,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-09-03 20:39:26,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 151 transitions. [2019-09-03 20:39:26,401 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 151 transitions. Word has length 127 [2019-09-03 20:39:26,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:39:26,402 INFO L475 AbstractCegarLoop]: Abstraction has 141 states and 151 transitions. [2019-09-03 20:39:26,402 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-03 20:39:26,402 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 151 transitions. [2019-09-03 20:39:26,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-03 20:39:26,404 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:39:26,404 INFO L399 BasicCegarLoop]: trace histogram [100, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:39:26,404 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:39:26,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:39:26,405 INFO L82 PathProgramCache]: Analyzing trace with hash 1611506577, now seen corresponding path program 12 times [2019-09-03 20:39:26,405 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:39:26,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:39:26,406 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:39:26,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:39:26,406 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:39:26,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:39:26,722 INFO L134 CoverageAnalysis]: Checked inductivity of 6095 backedges. 0 proven. 5545 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked. [2019-09-03 20:39:26,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:39:26,723 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:39:26,723 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:39:26,723 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:39:26,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:39:26,723 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-03 20:39:26,737 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:39:26,737 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:39:26,805 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:39:26,805 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:39:26,807 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 45 conjunts are in the unsatisfiable core [2019-09-03 20:39:26,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:39:27,081 INFO L134 CoverageAnalysis]: Checked inductivity of 6095 backedges. 0 proven. 5600 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2019-09-03 20:39:27,081 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:39:27,385 INFO L134 CoverageAnalysis]: Checked inductivity of 6095 backedges. 0 proven. 5545 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked. [2019-09-03 20:39:27,389 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:39:27,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 23, 13] total 35 [2019-09-03 20:39:27,390 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:39:27,390 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-03 20:39:27,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-03 20:39:27,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=340, Invalid=850, Unknown=0, NotChecked=0, Total=1190 [2019-09-03 20:39:27,391 INFO L87 Difference]: Start difference. First operand 141 states and 151 transitions. Second operand 24 states. [2019-09-03 20:39:27,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:39:27,870 INFO L93 Difference]: Finished difference Result 166 states and 178 transitions. [2019-09-03 20:39:27,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-03 20:39:27,871 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 140 [2019-09-03 20:39:27,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:39:27,872 INFO L225 Difference]: With dead ends: 166 [2019-09-03 20:39:27,872 INFO L226 Difference]: Without dead ends: 166 [2019-09-03 20:39:27,873 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 258 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=340, Invalid=850, Unknown=0, NotChecked=0, Total=1190 [2019-09-03 20:39:27,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-09-03 20:39:27,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 154. [2019-09-03 20:39:27,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-09-03 20:39:27,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 165 transitions. [2019-09-03 20:39:27,878 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 165 transitions. Word has length 140 [2019-09-03 20:39:27,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:39:27,879 INFO L475 AbstractCegarLoop]: Abstraction has 154 states and 165 transitions. [2019-09-03 20:39:27,879 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-03 20:39:27,879 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 165 transitions. [2019-09-03 20:39:27,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-03 20:39:27,881 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:39:27,881 INFO L399 BasicCegarLoop]: trace histogram [110, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:39:27,881 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:39:27,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:39:27,882 INFO L82 PathProgramCache]: Analyzing trace with hash -57777320, now seen corresponding path program 13 times [2019-09-03 20:39:27,882 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:39:27,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:39:27,883 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:39:27,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:39:27,883 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:39:27,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:39:28,221 INFO L134 CoverageAnalysis]: Checked inductivity of 7381 backedges. 0 proven. 6776 refuted. 0 times theorem prover too weak. 605 trivial. 0 not checked. [2019-09-03 20:39:28,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:39:28,221 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:39:28,222 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:39:28,222 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:39:28,222 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:39:28,222 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) [2019-09-03 20:39:28,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:39:28,245 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:39:28,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:39:28,318 INFO L256 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-03 20:39:28,320 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:39:28,374 INFO L134 CoverageAnalysis]: Checked inductivity of 7381 backedges. 0 proven. 6776 refuted. 0 times theorem prover too weak. 605 trivial. 0 not checked. [2019-09-03 20:39:28,375 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:39:28,789 INFO L134 CoverageAnalysis]: Checked inductivity of 7381 backedges. 0 proven. 6776 refuted. 0 times theorem prover too weak. 605 trivial. 0 not checked. [2019-09-03 20:39:28,792 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:39:28,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2019-09-03 20:39:28,793 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:39:28,793 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-03 20:39:28,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-03 20:39:28,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=483, Unknown=0, NotChecked=0, Total=702 [2019-09-03 20:39:28,794 INFO L87 Difference]: Start difference. First operand 154 states and 165 transitions. Second operand 15 states. [2019-09-03 20:39:29,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:39:29,049 INFO L93 Difference]: Finished difference Result 179 states and 192 transitions. [2019-09-03 20:39:29,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-03 20:39:29,050 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 153 [2019-09-03 20:39:29,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:39:29,051 INFO L225 Difference]: With dead ends: 179 [2019-09-03 20:39:29,052 INFO L226 Difference]: Without dead ends: 179 [2019-09-03 20:39:29,053 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 293 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=219, Invalid=483, Unknown=0, NotChecked=0, Total=702 [2019-09-03 20:39:29,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-09-03 20:39:29,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 167. [2019-09-03 20:39:29,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-09-03 20:39:29,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 179 transitions. [2019-09-03 20:39:29,057 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 179 transitions. Word has length 153 [2019-09-03 20:39:29,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:39:29,058 INFO L475 AbstractCegarLoop]: Abstraction has 167 states and 179 transitions. [2019-09-03 20:39:29,058 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-03 20:39:29,058 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 179 transitions. [2019-09-03 20:39:29,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-03 20:39:29,060 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:39:29,060 INFO L399 BasicCegarLoop]: trace histogram [120, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:39:29,060 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:39:29,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:39:29,060 INFO L82 PathProgramCache]: Analyzing trace with hash -1125925135, now seen corresponding path program 14 times [2019-09-03 20:39:29,061 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:39:29,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:39:29,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:39:29,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:39:29,062 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:39:29,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:39:29,472 INFO L134 CoverageAnalysis]: Checked inductivity of 8790 backedges. 0 proven. 8130 refuted. 0 times theorem prover too weak. 660 trivial. 0 not checked. [2019-09-03 20:39:29,473 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:39:29,473 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:39:29,473 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:39:29,473 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:39:29,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:39:29,474 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-03 20:39:29,510 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:39:29,511 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:43:56,863 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 53 check-sat command(s) [2019-09-03 20:43:56,864 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:43:56,921 INFO L256 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-03 20:43:56,924 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:43:57,004 INFO L134 CoverageAnalysis]: Checked inductivity of 8790 backedges. 0 proven. 8130 refuted. 0 times theorem prover too weak. 660 trivial. 0 not checked. [2019-09-03 20:43:57,005 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:43:57,436 INFO L134 CoverageAnalysis]: Checked inductivity of 8790 backedges. 0 proven. 8130 refuted. 0 times theorem prover too weak. 660 trivial. 0 not checked. [2019-09-03 20:43:57,454 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:43:57,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2019-09-03 20:43:57,455 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:43:57,455 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-03 20:43:57,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-03 20:43:57,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=562, Unknown=0, NotChecked=0, Total=812 [2019-09-03 20:43:57,456 INFO L87 Difference]: Start difference. First operand 167 states and 179 transitions. Second operand 16 states. [2019-09-03 20:43:57,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:43:57,731 INFO L93 Difference]: Finished difference Result 192 states and 206 transitions. [2019-09-03 20:43:57,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-03 20:43:57,732 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 166 [2019-09-03 20:43:57,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:43:57,734 INFO L225 Difference]: With dead ends: 192 [2019-09-03 20:43:57,734 INFO L226 Difference]: Without dead ends: 192 [2019-09-03 20:43:57,735 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 318 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=250, Invalid=562, Unknown=0, NotChecked=0, Total=812 [2019-09-03 20:43:57,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-09-03 20:43:57,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 180. [2019-09-03 20:43:57,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-09-03 20:43:57,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 193 transitions. [2019-09-03 20:43:57,739 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 193 transitions. Word has length 166 [2019-09-03 20:43:57,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:43:57,740 INFO L475 AbstractCegarLoop]: Abstraction has 180 states and 193 transitions. [2019-09-03 20:43:57,740 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-03 20:43:57,740 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 193 transitions. [2019-09-03 20:43:57,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-03 20:43:57,742 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:43:57,742 INFO L399 BasicCegarLoop]: trace histogram [130, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:43:57,743 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:43:57,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:43:57,743 INFO L82 PathProgramCache]: Analyzing trace with hash -1024998408, now seen corresponding path program 15 times [2019-09-03 20:43:57,743 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:43:57,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:43:57,744 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:43:57,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:43:57,744 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:43:57,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:43:58,155 INFO L134 CoverageAnalysis]: Checked inductivity of 10322 backedges. 0 proven. 9607 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2019-09-03 20:43:58,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:43:58,156 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:43:58,156 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:43:58,156 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:43:58,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:43:58,156 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) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:43:58,176 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:43:58,176 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:43:58,268 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:43:58,269 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:43:58,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-03 20:43:58,274 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:43:58,366 INFO L134 CoverageAnalysis]: Checked inductivity of 10322 backedges. 0 proven. 9607 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2019-09-03 20:43:58,366 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:43:58,802 INFO L134 CoverageAnalysis]: Checked inductivity of 10322 backedges. 0 proven. 9607 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2019-09-03 20:43:58,805 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:43:58,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 31 [2019-09-03 20:43:58,806 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:43:58,806 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-03 20:43:58,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-03 20:43:58,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=647, Unknown=0, NotChecked=0, Total=930 [2019-09-03 20:43:58,807 INFO L87 Difference]: Start difference. First operand 180 states and 193 transitions. Second operand 17 states. [2019-09-03 20:43:59,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:43:59,136 INFO L93 Difference]: Finished difference Result 205 states and 220 transitions. [2019-09-03 20:43:59,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-03 20:43:59,136 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 179 [2019-09-03 20:43:59,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:43:59,139 INFO L225 Difference]: With dead ends: 205 [2019-09-03 20:43:59,139 INFO L226 Difference]: Without dead ends: 205 [2019-09-03 20:43:59,140 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 343 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=283, Invalid=647, Unknown=0, NotChecked=0, Total=930 [2019-09-03 20:43:59,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-09-03 20:43:59,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 193. [2019-09-03 20:43:59,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-09-03 20:43:59,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 207 transitions. [2019-09-03 20:43:59,145 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 207 transitions. Word has length 179 [2019-09-03 20:43:59,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:43:59,146 INFO L475 AbstractCegarLoop]: Abstraction has 193 states and 207 transitions. [2019-09-03 20:43:59,146 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-03 20:43:59,146 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 207 transitions. [2019-09-03 20:43:59,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-09-03 20:43:59,148 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:43:59,148 INFO L399 BasicCegarLoop]: trace histogram [140, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:43:59,148 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:43:59,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:43:59,149 INFO L82 PathProgramCache]: Analyzing trace with hash 627335761, now seen corresponding path program 16 times [2019-09-03 20:43:59,149 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:43:59,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:43:59,150 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:43:59,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:43:59,150 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:43:59,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:43:59,585 INFO L134 CoverageAnalysis]: Checked inductivity of 11977 backedges. 0 proven. 11207 refuted. 0 times theorem prover too weak. 770 trivial. 0 not checked. [2019-09-03 20:43:59,586 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:43:59,586 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:43:59,586 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:43:59,586 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:43:59,586 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:43:59,586 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) [2019-09-03 20:43:59,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:43:59,615 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:43:59,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:43:59,716 INFO L256 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-03 20:43:59,719 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:43:59,809 INFO L134 CoverageAnalysis]: Checked inductivity of 11977 backedges. 0 proven. 11207 refuted. 0 times theorem prover too weak. 770 trivial. 0 not checked. [2019-09-03 20:43:59,809 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:44:00,379 INFO L134 CoverageAnalysis]: Checked inductivity of 11977 backedges. 0 proven. 11207 refuted. 0 times theorem prover too weak. 770 trivial. 0 not checked. [2019-09-03 20:44:00,382 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:44:00,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2019-09-03 20:44:00,383 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:44:00,383 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-03 20:44:00,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-03 20:44:00,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=318, Invalid=738, Unknown=0, NotChecked=0, Total=1056 [2019-09-03 20:44:00,384 INFO L87 Difference]: Start difference. First operand 193 states and 207 transitions. Second operand 18 states. [2019-09-03 20:44:00,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:44:00,762 INFO L93 Difference]: Finished difference Result 218 states and 234 transitions. [2019-09-03 20:44:00,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-03 20:44:00,763 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 192 [2019-09-03 20:44:00,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:44:00,765 INFO L225 Difference]: With dead ends: 218 [2019-09-03 20:44:00,765 INFO L226 Difference]: Without dead ends: 218 [2019-09-03 20:44:00,766 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 368 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=318, Invalid=738, Unknown=0, NotChecked=0, Total=1056 [2019-09-03 20:44:00,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2019-09-03 20:44:00,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 206. [2019-09-03 20:44:00,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-09-03 20:44:00,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 221 transitions. [2019-09-03 20:44:00,771 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 221 transitions. Word has length 192 [2019-09-03 20:44:00,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:44:00,772 INFO L475 AbstractCegarLoop]: Abstraction has 206 states and 221 transitions. [2019-09-03 20:44:00,772 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-03 20:44:00,772 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 221 transitions. [2019-09-03 20:44:00,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-09-03 20:44:00,774 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:44:00,774 INFO L399 BasicCegarLoop]: trace histogram [150, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:44:00,775 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:44:00,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:44:00,775 INFO L82 PathProgramCache]: Analyzing trace with hash 351509656, now seen corresponding path program 17 times [2019-09-03 20:44:00,775 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:44:00,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:44:00,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:44:00,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:44:00,776 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:44:00,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:44:01,201 INFO L134 CoverageAnalysis]: Checked inductivity of 13755 backedges. 0 proven. 12930 refuted. 0 times theorem prover too weak. 825 trivial. 0 not checked. [2019-09-03 20:44:01,201 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:44:01,201 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:44:01,201 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:44:01,201 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:44:01,201 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:44:01,201 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-03 20:44:01,215 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:44:01,215 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP)