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/recursive-simple/id_o20.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 03:08:56,720 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 03:08:56,722 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 03:08:56,734 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 03:08:56,735 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 03:08:56,736 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 03:08:56,737 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 03:08:56,739 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 03:08:56,741 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 03:08:56,742 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 03:08:56,743 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 03:08:56,744 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 03:08:56,745 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 03:08:56,749 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 03:08:56,752 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 03:08:56,753 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 03:08:56,754 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 03:08:56,757 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 03:08:56,759 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 03:08:56,763 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 03:08:56,767 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 03:08:56,769 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 03:08:56,771 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 03:08:56,772 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 03:08:56,775 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 03:08:56,776 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 03:08:56,776 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 03:08:56,778 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 03:08:56,778 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 03:08:56,780 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 03:08:56,780 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 03:08:56,781 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 03:08:56,782 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 03:08:56,784 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 03:08:56,785 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 03:08:56,786 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 03:08:56,786 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 03:08:56,786 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 03:08:56,787 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 03:08:56,791 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 03:08:56,792 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 03:08:56,792 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 03:08:56,809 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 03:08:56,809 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 03:08:56,809 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 03:08:56,809 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 03:08:56,810 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 03:08:56,810 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 03:08:56,811 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 03:08:56,811 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 03:08:56,811 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 03:08:56,811 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 03:08:56,812 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 03:08:56,812 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 03:08:56,812 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 03:08:56,813 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 03:08:56,813 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 03:08:56,813 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 03:08:56,813 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 03:08:56,814 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 03:08:56,814 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 03:08:56,814 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 03:08:56,814 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 03:08:56,814 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 03:08:56,815 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 03:08:56,815 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 03:08:56,815 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 03:08:56,815 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 03:08:56,815 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 03:08:56,816 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 03:08:56,816 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 03:08:56,816 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 03:08:56,849 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 03:08:56,863 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 03:08:56,867 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 03:08:56,869 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 03:08:56,869 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 03:08:56,870 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/id_o20.c [2019-09-10 03:08:56,935 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74ea319ce/d0698ec34b184e278be0f42121360534/FLAG824481f28 [2019-09-10 03:08:57,379 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 03:08:57,380 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/id_o20.c [2019-09-10 03:08:57,388 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74ea319ce/d0698ec34b184e278be0f42121360534/FLAG824481f28 [2019-09-10 03:08:57,739 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74ea319ce/d0698ec34b184e278be0f42121360534 [2019-09-10 03:08:57,750 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 03:08:57,751 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 03:08:57,752 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 03:08:57,753 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 03:08:57,756 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 03:08:57,757 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 03:08:57" (1/1) ... [2019-09-10 03:08:57,760 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b0b1624 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:08:57, skipping insertion in model container [2019-09-10 03:08:57,760 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 03:08:57" (1/1) ... [2019-09-10 03:08:57,768 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 03:08:57,786 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 03:08:57,971 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 03:08:57,979 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 03:08:58,002 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 03:08:58,018 INFO L192 MainTranslator]: Completed translation [2019-09-10 03:08:58,018 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:08:58 WrapperNode [2019-09-10 03:08:58,018 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 03:08:58,019 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 03:08:58,019 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 03:08:58,019 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 03:08:58,034 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:08:58" (1/1) ... [2019-09-10 03:08:58,034 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:08:58" (1/1) ... [2019-09-10 03:08:58,128 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:08:58" (1/1) ... [2019-09-10 03:08:58,128 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:08:58" (1/1) ... [2019-09-10 03:08:58,133 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:08:58" (1/1) ... [2019-09-10 03:08:58,136 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:08:58" (1/1) ... [2019-09-10 03:08:58,136 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:08:58" (1/1) ... [2019-09-10 03:08:58,137 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 03:08:58,138 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 03:08:58,138 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 03:08:58,138 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 03:08:58,139 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:08:58" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 03:08:58,188 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 03:08:58,188 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 03:08:58,188 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2019-09-10 03:08:58,189 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 03:08:58,189 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2019-09-10 03:08:58,189 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 03:08:58,189 INFO L130 BoogieDeclarations]: Found specification of procedure id [2019-09-10 03:08:58,189 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 03:08:58,189 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 03:08:58,190 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 03:08:58,336 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 03:08:58,337 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 03:08:58,338 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 03:08:58 BoogieIcfgContainer [2019-09-10 03:08:58,338 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 03:08:58,339 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 03:08:58,340 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 03:08:58,342 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 03:08:58,342 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 03:08:57" (1/3) ... [2019-09-10 03:08:58,343 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@174bcc6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 03:08:58, skipping insertion in model container [2019-09-10 03:08:58,343 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:08:58" (2/3) ... [2019-09-10 03:08:58,344 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@174bcc6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 03:08:58, skipping insertion in model container [2019-09-10 03:08:58,344 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 03:08:58" (3/3) ... [2019-09-10 03:08:58,345 INFO L109 eAbstractionObserver]: Analyzing ICFG id_o20.c [2019-09-10 03:08:58,353 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 03:08:58,359 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 03:08:58,374 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 03:08:58,402 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 03:08:58,403 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 03:08:58,403 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 03:08:58,403 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 03:08:58,403 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 03:08:58,404 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 03:08:58,404 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 03:08:58,404 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 03:08:58,420 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2019-09-10 03:08:58,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-10 03:08:58,430 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:08:58,431 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:08:58,433 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:08:58,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:08:58,438 INFO L82 PathProgramCache]: Analyzing trace with hash -872342019, now seen corresponding path program 1 times [2019-09-10 03:08:58,440 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:08:58,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:08:58,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:08:58,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:08:58,479 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:08:58,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:08:58,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:08:58,682 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:08:58,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:08:58,683 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:08:58,689 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:08:58,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:08:58,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:08:58,711 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 5 states. [2019-09-10 03:08:58,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:08:58,840 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2019-09-10 03:08:58,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:08:58,842 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-09-10 03:08:58,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:08:58,855 INFO L225 Difference]: With dead ends: 26 [2019-09-10 03:08:58,855 INFO L226 Difference]: Without dead ends: 18 [2019-09-10 03:08:58,858 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:08:58,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-09-10 03:08:58,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-09-10 03:08:58,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-09-10 03:08:58,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2019-09-10 03:08:58,917 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2019-09-10 03:08:58,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:08:58,918 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2019-09-10 03:08:58,918 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:08:58,919 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2019-09-10 03:08:58,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-10 03:08:58,923 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:08:58,925 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:08:58,926 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:08:58,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:08:58,928 INFO L82 PathProgramCache]: Analyzing trace with hash -953570577, now seen corresponding path program 1 times [2019-09-10 03:08:58,928 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:08:58,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:08:58,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:08:58,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:08:58,932 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:08:58,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:08:59,118 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 03:08:59,119 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:08:59,119 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:08:59,120 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 20 with the following transitions: [2019-09-10 03:08:59,122 INFO L207 CegarAbsIntRunner]: [0], [4], [6], [9], [11], [17], [20], [21], [23], [24], [25], [26], [27], [29], [30], [31], [32] [2019-09-10 03:08:59,163 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:08:59,163 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:08:59,229 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 03:08:59,289 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:08:59,292 INFO L272 AbstractInterpreter]: Visited 16 different actions 56 times. Merged at 5 different actions 21 times. Never widened. Performed 45 root evaluator evaluations with a maximum evaluation depth of 4. Performed 45 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 4 variables. [2019-09-10 03:08:59,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:08:59,296 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:08:59,343 INFO L219 lantSequenceWeakener]: Could never weaken! [2019-09-10 03:08:59,343 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:08:59,399 INFO L420 sIntCurrentIteration]: We unified 18 AI predicates to 18 [2019-09-10 03:08:59,400 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:08:59,401 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:08:59,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2019-09-10 03:08:59,401 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:08:59,403 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 03:08:59,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 03:08:59,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-10 03:08:59,404 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 7 states. [2019-09-10 03:08:59,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:08:59,480 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2019-09-10 03:08:59,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 03:08:59,483 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-09-10 03:08:59,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:08:59,484 INFO L225 Difference]: With dead ends: 23 [2019-09-10 03:08:59,484 INFO L226 Difference]: Without dead ends: 21 [2019-09-10 03:08:59,486 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-10 03:08:59,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-09-10 03:08:59,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-09-10 03:08:59,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-09-10 03:08:59,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2019-09-10 03:08:59,496 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 19 [2019-09-10 03:08:59,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:08:59,497 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-09-10 03:08:59,497 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 03:08:59,497 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2019-09-10 03:08:59,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-10 03:08:59,499 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:08:59,499 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:08:59,501 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:08:59,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:08:59,502 INFO L82 PathProgramCache]: Analyzing trace with hash 397359997, now seen corresponding path program 2 times [2019-09-10 03:08:59,502 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:08:59,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:08:59,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:08:59,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:08:59,505 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:08:59,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:08:59,701 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 03:08:59,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:08:59,702 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:08:59,702 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:08:59,704 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 03:08:59,704 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:08:59,704 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:08:59,723 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 03:08:59,723 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 03:08:59,744 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-10 03:08:59,745 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 03:08:59,747 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-10 03:08:59,754 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:08:59,812 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 03:08:59,813 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:09:00,121 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 03:09:00,126 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:09:00,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2019-09-10 03:09:00,126 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:09:00,127 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 03:09:00,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 03:09:00,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2019-09-10 03:09:00,128 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 10 states. [2019-09-10 03:09:00,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:09:00,171 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2019-09-10 03:09:00,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 03:09:00,172 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2019-09-10 03:09:00,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:09:00,173 INFO L225 Difference]: With dead ends: 26 [2019-09-10 03:09:00,173 INFO L226 Difference]: Without dead ends: 24 [2019-09-10 03:09:00,174 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2019-09-10 03:09:00,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-09-10 03:09:00,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-09-10 03:09:00,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-09-10 03:09:00,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2019-09-10 03:09:00,184 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 25 [2019-09-10 03:09:00,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:09:00,185 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2019-09-10 03:09:00,185 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 03:09:00,185 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2019-09-10 03:09:00,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-10 03:09:00,187 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:09:00,187 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:09:00,187 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:09:00,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:09:00,188 INFO L82 PathProgramCache]: Analyzing trace with hash 1198310127, now seen corresponding path program 3 times [2019-09-10 03:09:00,188 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:09:00,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:09:00,195 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 03:09:00,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:09:00,195 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:09:00,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:09:00,422 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-10 03:09:00,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:09:00,422 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:09:00,423 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:09:00,423 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 03:09:00,423 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:09:00,423 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-10 03:09:00,438 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 03:09:00,439 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 03:09:00,458 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 03:09:00,458 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 03:09:00,459 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-10 03:09:00,461 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:09:00,496 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-10 03:09:00,496 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:09:00,906 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-10 03:09:00,910 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:09:00,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2019-09-10 03:09:00,911 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:09:00,911 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 03:09:00,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 03:09:00,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2019-09-10 03:09:00,912 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 12 states. [2019-09-10 03:09:00,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:09:00,972 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2019-09-10 03:09:00,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 03:09:00,973 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2019-09-10 03:09:00,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:09:00,974 INFO L225 Difference]: With dead ends: 29 [2019-09-10 03:09:00,975 INFO L226 Difference]: Without dead ends: 27 [2019-09-10 03:09:00,975 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2019-09-10 03:09:00,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-09-10 03:09:00,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-09-10 03:09:00,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-09-10 03:09:00,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-09-10 03:09:00,981 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 31 [2019-09-10 03:09:00,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:09:00,982 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-09-10 03:09:00,982 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 03:09:00,982 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2019-09-10 03:09:00,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-09-10 03:09:00,984 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:09:00,984 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:09:00,984 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:09:00,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:09:00,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1080764669, now seen corresponding path program 4 times [2019-09-10 03:09:00,985 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:09:00,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:09:00,986 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 03:09:00,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:09:00,986 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:09:01,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:09:01,239 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-10 03:09:01,240 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:09:01,240 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:09:01,240 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:09:01,240 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 03:09:01,240 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:09:01,241 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) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:09:01,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:09:01,258 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 03:09:01,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:09:01,275 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-10 03:09:01,277 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:09:01,309 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-10 03:09:01,309 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:09:01,805 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-10 03:09:01,810 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:09:01,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2019-09-10 03:09:01,810 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:09:01,811 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-10 03:09:01,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-10 03:09:01,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=508, Unknown=0, NotChecked=0, Total=600 [2019-09-10 03:09:01,812 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 14 states. [2019-09-10 03:09:01,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:09:01,909 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2019-09-10 03:09:01,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 03:09:01,909 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 37 [2019-09-10 03:09:01,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:09:01,911 INFO L225 Difference]: With dead ends: 32 [2019-09-10 03:09:01,911 INFO L226 Difference]: Without dead ends: 30 [2019-09-10 03:09:01,912 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=92, Invalid=508, Unknown=0, NotChecked=0, Total=600 [2019-09-10 03:09:01,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-09-10 03:09:01,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-09-10 03:09:01,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-09-10 03:09:01,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2019-09-10 03:09:01,918 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 37 [2019-09-10 03:09:01,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:09:01,918 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2019-09-10 03:09:01,919 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-10 03:09:01,919 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2019-09-10 03:09:01,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-09-10 03:09:01,920 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:09:01,920 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:09:01,921 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:09:01,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:09:01,921 INFO L82 PathProgramCache]: Analyzing trace with hash -1752970513, now seen corresponding path program 5 times [2019-09-10 03:09:01,921 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:09:01,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:09:01,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:09:01,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:09:01,922 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:09:01,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:09:02,139 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-10 03:09:02,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:09:02,140 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:09:02,140 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:09:02,140 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 03:09:02,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:09:02,140 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 03:09:02,161 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 03:09:02,162 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:09:02,188 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-09-10 03:09:02,188 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 03:09:02,190 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-10 03:09:02,192 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:09:02,242 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-10 03:09:02,243 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:09:02,918 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-10 03:09:02,921 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:09:02,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2019-09-10 03:09:02,922 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:09:02,922 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 03:09:02,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 03:09:02,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=692, Unknown=0, NotChecked=0, Total=812 [2019-09-10 03:09:02,925 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 16 states. [2019-09-10 03:09:03,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:09:03,028 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2019-09-10 03:09:03,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 03:09:03,029 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 43 [2019-09-10 03:09:03,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:09:03,030 INFO L225 Difference]: With dead ends: 35 [2019-09-10 03:09:03,030 INFO L226 Difference]: Without dead ends: 33 [2019-09-10 03:09:03,031 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=120, Invalid=692, Unknown=0, NotChecked=0, Total=812 [2019-09-10 03:09:03,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-09-10 03:09:03,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-09-10 03:09:03,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-10 03:09:03,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2019-09-10 03:09:03,037 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 43 [2019-09-10 03:09:03,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:09:03,038 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2019-09-10 03:09:03,038 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 03:09:03,038 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2019-09-10 03:09:03,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-09-10 03:09:03,040 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:09:03,040 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:09:03,040 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:09:03,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:09:03,041 INFO L82 PathProgramCache]: Analyzing trace with hash -1590630787, now seen corresponding path program 6 times [2019-09-10 03:09:03,041 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:09:03,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:09:03,042 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 03:09:03,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:09:03,042 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:09:03,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:09:03,330 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-09-10 03:09:03,330 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:09:03,330 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:09:03,331 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:09:03,331 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 03:09:03,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:09:03,331 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:09:03,344 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 03:09:03,345 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 03:09:03,360 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 03:09:03,360 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 03:09:03,361 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-10 03:09:03,364 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:09:03,411 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-09-10 03:09:03,411 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:09:04,283 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-09-10 03:09:04,295 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:09:04,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2019-09-10 03:09:04,295 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:09:04,296 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 03:09:04,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 03:09:04,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=904, Unknown=0, NotChecked=0, Total=1056 [2019-09-10 03:09:04,297 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 18 states. [2019-09-10 03:09:04,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:09:04,429 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2019-09-10 03:09:04,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 03:09:04,429 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 49 [2019-09-10 03:09:04,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:09:04,430 INFO L225 Difference]: With dead ends: 38 [2019-09-10 03:09:04,431 INFO L226 Difference]: Without dead ends: 36 [2019-09-10 03:09:04,431 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=152, Invalid=904, Unknown=0, NotChecked=0, Total=1056 [2019-09-10 03:09:04,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-09-10 03:09:04,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-09-10 03:09:04,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-09-10 03:09:04,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2019-09-10 03:09:04,437 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 49 [2019-09-10 03:09:04,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:09:04,438 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2019-09-10 03:09:04,438 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 03:09:04,438 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2019-09-10 03:09:04,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-10 03:09:04,439 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:09:04,439 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:09:04,439 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:09:04,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:09:04,440 INFO L82 PathProgramCache]: Analyzing trace with hash 1532150511, now seen corresponding path program 7 times [2019-09-10 03:09:04,440 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:09:04,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:09:04,441 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 03:09:04,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:09:04,441 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:09:04,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:09:04,731 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-09-10 03:09:04,731 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:09:04,732 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:09:04,732 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:09:04,732 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 03:09:04,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:09:04,732 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:09:04,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:09:04,745 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 03:09:04,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:09:04,764 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-10 03:09:04,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:09:04,828 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-09-10 03:09:04,828 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:09:05,837 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-09-10 03:09:05,840 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:09:05,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2019-09-10 03:09:05,840 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:09:05,840 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 03:09:05,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 03:09:05,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=1144, Unknown=0, NotChecked=0, Total=1332 [2019-09-10 03:09:05,842 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 20 states. [2019-09-10 03:09:06,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:09:06,017 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2019-09-10 03:09:06,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 03:09:06,018 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 55 [2019-09-10 03:09:06,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:09:06,020 INFO L225 Difference]: With dead ends: 41 [2019-09-10 03:09:06,020 INFO L226 Difference]: Without dead ends: 39 [2019-09-10 03:09:06,021 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=188, Invalid=1144, Unknown=0, NotChecked=0, Total=1332 [2019-09-10 03:09:06,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-09-10 03:09:06,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-09-10 03:09:06,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-10 03:09:06,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2019-09-10 03:09:06,027 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 55 [2019-09-10 03:09:06,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:09:06,027 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2019-09-10 03:09:06,027 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 03:09:06,027 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2019-09-10 03:09:06,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-10 03:09:06,029 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:09:06,029 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:09:06,029 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:09:06,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:09:06,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1140618237, now seen corresponding path program 8 times [2019-09-10 03:09:06,030 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:09:06,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:09:06,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:09:06,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:09:06,031 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:09:06,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:09:06,357 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-09-10 03:09:06,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:09:06,358 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:09:06,358 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:09:06,358 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 03:09:06,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:09:06,358 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:09:06,369 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 03:09:06,369 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 03:09:06,400 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-09-10 03:09:06,401 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 03:09:06,402 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-10 03:09:06,404 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:09:06,449 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-09-10 03:09:06,450 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:09:07,825 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-09-10 03:09:07,832 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:09:07,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2019-09-10 03:09:07,832 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:09:07,835 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 03:09:07,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 03:09:07,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=1412, Unknown=0, NotChecked=0, Total=1640 [2019-09-10 03:09:07,837 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 22 states. [2019-09-10 03:09:08,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:09:08,037 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2019-09-10 03:09:08,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 03:09:08,038 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 61 [2019-09-10 03:09:08,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:09:08,040 INFO L225 Difference]: With dead ends: 44 [2019-09-10 03:09:08,040 INFO L226 Difference]: Without dead ends: 42 [2019-09-10 03:09:08,041 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=228, Invalid=1412, Unknown=0, NotChecked=0, Total=1640 [2019-09-10 03:09:08,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-09-10 03:09:08,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-09-10 03:09:08,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-09-10 03:09:08,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2019-09-10 03:09:08,048 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 61 [2019-09-10 03:09:08,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:09:08,048 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2019-09-10 03:09:08,048 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 03:09:08,049 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2019-09-10 03:09:08,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-10 03:09:08,050 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:09:08,050 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:09:08,050 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:09:08,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:09:08,051 INFO L82 PathProgramCache]: Analyzing trace with hash -1749177617, now seen corresponding path program 9 times [2019-09-10 03:09:08,051 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:09:08,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:09:08,052 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 03:09:08,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:09:08,052 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:09:08,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:09:08,434 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-09-10 03:09:08,435 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:09:08,435 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:09:08,435 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:09:08,435 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 03:09:08,436 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:09:08,436 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) [2019-09-10 03:09:08,454 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 03:09:08,455 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:09:08,478 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 03:09:08,478 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 03:09:08,480 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-10 03:09:08,482 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:09:08,550 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-09-10 03:09:08,550 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:09:10,081 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-09-10 03:09:10,085 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:09:10,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2019-09-10 03:09:10,086 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:09:10,086 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-10 03:09:10,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-10 03:09:10,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=272, Invalid=1708, Unknown=0, NotChecked=0, Total=1980 [2019-09-10 03:09:10,088 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 24 states. [2019-09-10 03:09:10,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:09:10,344 INFO L93 Difference]: Finished difference Result 47 states and 48 transitions. [2019-09-10 03:09:10,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 03:09:10,345 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 67 [2019-09-10 03:09:10,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:09:10,346 INFO L225 Difference]: With dead ends: 47 [2019-09-10 03:09:10,347 INFO L226 Difference]: Without dead ends: 45 [2019-09-10 03:09:10,348 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 112 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=272, Invalid=1708, Unknown=0, NotChecked=0, Total=1980 [2019-09-10 03:09:10,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-09-10 03:09:10,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-09-10 03:09:10,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-09-10 03:09:10,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2019-09-10 03:09:10,354 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 67 [2019-09-10 03:09:10,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:09:10,354 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2019-09-10 03:09:10,355 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-10 03:09:10,355 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2019-09-10 03:09:10,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-10 03:09:10,356 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:09:10,356 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:09:10,357 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:09:10,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:09:10,357 INFO L82 PathProgramCache]: Analyzing trace with hash -1580609155, now seen corresponding path program 10 times [2019-09-10 03:09:10,357 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:09:10,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:09:10,358 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 03:09:10,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:09:10,358 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:09:10,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:09:10,764 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-09-10 03:09:10,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:09:10,765 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:09:10,765 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:09:10,765 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 03:09:10,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:09:10,765 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:09:10,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:09:10,777 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 03:09:10,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:09:10,808 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 48 conjunts are in the unsatisfiable core [2019-09-10 03:09:10,810 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:09:10,860 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-09-10 03:09:10,860 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:09:12,638 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-09-10 03:09:12,641 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:09:12,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2019-09-10 03:09:12,642 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:09:12,643 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-10 03:09:12,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-10 03:09:12,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=319, Invalid=2033, Unknown=0, NotChecked=0, Total=2352 [2019-09-10 03:09:12,645 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 26 states. [2019-09-10 03:09:12,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:09:12,895 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2019-09-10 03:09:12,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-10 03:09:12,896 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 73 [2019-09-10 03:09:12,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:09:12,897 INFO L225 Difference]: With dead ends: 50 [2019-09-10 03:09:12,897 INFO L226 Difference]: Without dead ends: 48 [2019-09-10 03:09:12,898 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 122 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=319, Invalid=2033, Unknown=0, NotChecked=0, Total=2352 [2019-09-10 03:09:12,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-09-10 03:09:12,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-09-10 03:09:12,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-09-10 03:09:12,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2019-09-10 03:09:12,905 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 73 [2019-09-10 03:09:12,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:09:12,905 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2019-09-10 03:09:12,905 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-10 03:09:12,905 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2019-09-10 03:09:12,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-10 03:09:12,907 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:09:12,907 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:09:12,907 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:09:12,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:09:12,908 INFO L82 PathProgramCache]: Analyzing trace with hash -223837457, now seen corresponding path program 11 times [2019-09-10 03:09:12,908 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:09:12,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:09:12,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:09:12,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:09:12,909 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:09:12,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:09:13,375 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2019-09-10 03:09:13,375 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:09:13,375 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:09:13,375 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:09:13,375 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 03:09:13,375 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:09:13,376 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) [2019-09-10 03:09:13,395 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 03:09:13,395 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:09:13,472 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-09-10 03:09:13,473 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 03:09:13,474 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 52 conjunts are in the unsatisfiable core [2019-09-10 03:09:13,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:09:13,516 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2019-09-10 03:09:13,516 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:09:15,705 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2019-09-10 03:09:15,711 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:09:15,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 53 [2019-09-10 03:09:15,712 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:09:15,712 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-10 03:09:15,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-10 03:09:15,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=367, Invalid=2389, Unknown=0, NotChecked=0, Total=2756 [2019-09-10 03:09:15,714 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 28 states. [2019-09-10 03:09:16,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:09:16,083 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2019-09-10 03:09:16,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-10 03:09:16,084 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 79 [2019-09-10 03:09:16,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:09:16,086 INFO L225 Difference]: With dead ends: 53 [2019-09-10 03:09:16,086 INFO L226 Difference]: Without dead ends: 51 [2019-09-10 03:09:16,089 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 132 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=367, Invalid=2389, Unknown=0, NotChecked=0, Total=2756 [2019-09-10 03:09:16,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-09-10 03:09:16,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-09-10 03:09:16,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-09-10 03:09:16,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2019-09-10 03:09:16,094 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 79 [2019-09-10 03:09:16,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:09:16,095 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2019-09-10 03:09:16,095 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-10 03:09:16,095 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2019-09-10 03:09:16,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 03:09:16,096 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:09:16,097 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:09:16,097 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:09:16,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:09:16,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1653931773, now seen corresponding path program 12 times [2019-09-10 03:09:16,097 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:09:16,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:09:16,098 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 03:09:16,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:09:16,098 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:09:16,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:09:16,621 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2019-09-10 03:09:16,621 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:09:16,621 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:09:16,622 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:09:16,622 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 03:09:16,622 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:09:16,622 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:09:16,634 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 03:09:16,634 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 03:09:16,661 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 03:09:16,661 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 03:09:16,662 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 56 conjunts are in the unsatisfiable core [2019-09-10 03:09:16,664 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:09:16,724 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2019-09-10 03:09:16,724 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:09:19,355 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (12)] Exception during sending of exit command (exit): Stream closed [2019-09-10 03:09:19,359 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:09:19,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 57 [2019-09-10 03:09:19,360 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:09:19,360 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-10 03:09:19,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-10 03:09:19,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=419, Invalid=2773, Unknown=0, NotChecked=0, Total=3192 [2019-09-10 03:09:19,363 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 30 states. [2019-09-10 03:09:19,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:09:19,726 INFO L93 Difference]: Finished difference Result 56 states and 57 transitions. [2019-09-10 03:09:19,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-10 03:09:19,726 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 85 [2019-09-10 03:09:19,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:09:19,727 INFO L225 Difference]: With dead ends: 56 [2019-09-10 03:09:19,727 INFO L226 Difference]: Without dead ends: 54 [2019-09-10 03:09:19,731 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 142 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=419, Invalid=2773, Unknown=0, NotChecked=0, Total=3192 [2019-09-10 03:09:19,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-09-10 03:09:19,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-09-10 03:09:19,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-09-10 03:09:19,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2019-09-10 03:09:19,748 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 85 [2019-09-10 03:09:19,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:09:19,748 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2019-09-10 03:09:19,748 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-10 03:09:19,748 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2019-09-10 03:09:19,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-10 03:09:19,750 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:09:19,750 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:09:19,750 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:09:19,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:09:19,750 INFO L82 PathProgramCache]: Analyzing trace with hash -218674449, now seen corresponding path program 13 times [2019-09-10 03:09:19,751 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:09:19,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:09:19,755 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 03:09:19,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:09:19,755 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:09:19,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:09:20,433 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2019-09-10 03:09:20,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:09:20,433 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:09:20,434 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:09:20,434 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 03:09:20,434 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:09:20,434 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) [2019-09-10 03:09:20,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:09:20,455 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:09:20,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:09:20,497 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 60 conjunts are in the unsatisfiable core [2019-09-10 03:09:20,499 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:09:20,576 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2019-09-10 03:09:20,576 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:09:23,604 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2019-09-10 03:09:23,607 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:09:23,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 61 [2019-09-10 03:09:23,608 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:09:23,608 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-10 03:09:23,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-10 03:09:23,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=475, Invalid=3185, Unknown=0, NotChecked=0, Total=3660 [2019-09-10 03:09:23,611 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand 32 states. [2019-09-10 03:09:24,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:09:24,074 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2019-09-10 03:09:24,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-10 03:09:24,074 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 91 [2019-09-10 03:09:24,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:09:24,076 INFO L225 Difference]: With dead ends: 59 [2019-09-10 03:09:24,076 INFO L226 Difference]: Without dead ends: 57 [2019-09-10 03:09:24,078 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 152 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 394 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=475, Invalid=3185, Unknown=0, NotChecked=0, Total=3660 [2019-09-10 03:09:24,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-09-10 03:09:24,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-09-10 03:09:24,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-09-10 03:09:24,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2019-09-10 03:09:24,083 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 91 [2019-09-10 03:09:24,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:09:24,084 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2019-09-10 03:09:24,084 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-10 03:09:24,084 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2019-09-10 03:09:24,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 03:09:24,085 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:09:24,085 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:09:24,086 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:09:24,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:09:24,086 INFO L82 PathProgramCache]: Analyzing trace with hash 492436605, now seen corresponding path program 14 times [2019-09-10 03:09:24,086 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:09:24,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:09:24,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:09:24,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:09:24,087 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:09:24,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:09:24,758 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2019-09-10 03:09:24,758 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:09:24,758 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:09:24,758 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:09:24,758 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 03:09:24,758 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:09:24,759 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:09:24,769 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 03:09:24,769 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 03:09:24,920 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-09-10 03:09:24,920 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 03:09:24,922 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 64 conjunts are in the unsatisfiable core [2019-09-10 03:09:24,923 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:09:24,994 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2019-09-10 03:09:24,994 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:09:28,067 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2019-09-10 03:09:28,071 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:09:28,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 65 [2019-09-10 03:09:28,072 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:09:28,072 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-10 03:09:28,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-10 03:09:28,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=535, Invalid=3625, Unknown=0, NotChecked=0, Total=4160 [2019-09-10 03:09:28,074 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 34 states. [2019-09-10 03:09:28,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:09:28,630 INFO L93 Difference]: Finished difference Result 62 states and 63 transitions. [2019-09-10 03:09:28,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-10 03:09:28,630 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 97 [2019-09-10 03:09:28,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:09:28,632 INFO L225 Difference]: With dead ends: 62 [2019-09-10 03:09:28,632 INFO L226 Difference]: Without dead ends: 60 [2019-09-10 03:09:28,634 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 162 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 467 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=535, Invalid=3625, Unknown=0, NotChecked=0, Total=4160 [2019-09-10 03:09:28,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-09-10 03:09:28,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-09-10 03:09:28,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-09-10 03:09:28,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2019-09-10 03:09:28,640 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 97 [2019-09-10 03:09:28,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:09:28,640 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2019-09-10 03:09:28,640 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-10 03:09:28,640 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2019-09-10 03:09:28,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 03:09:28,641 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:09:28,641 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:09:28,642 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:09:28,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:09:28,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1083048687, now seen corresponding path program 15 times [2019-09-10 03:09:28,642 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:09:28,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:09:28,643 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 03:09:28,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:09:28,643 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:09:28,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:09:29,315 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2019-09-10 03:09:29,315 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:09:29,315 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:09:29,316 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:09:29,316 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 03:09:29,316 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:09:29,316 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:09:29,327 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 03:09:29,327 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 03:09:29,356 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 03:09:29,356 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 03:09:29,358 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 68 conjunts are in the unsatisfiable core [2019-09-10 03:09:29,360 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:09:29,413 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2019-09-10 03:09:29,413 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:09:32,832 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2019-09-10 03:09:32,836 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:09:32,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 69 [2019-09-10 03:09:32,836 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:09:32,836 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-10 03:09:32,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-10 03:09:32,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=599, Invalid=4093, Unknown=0, NotChecked=0, Total=4692 [2019-09-10 03:09:32,841 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 36 states. [2019-09-10 03:09:33,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:09:33,413 INFO L93 Difference]: Finished difference Result 65 states and 66 transitions. [2019-09-10 03:09:33,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-10 03:09:33,415 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 103 [2019-09-10 03:09:33,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:09:33,416 INFO L225 Difference]: With dead ends: 65 [2019-09-10 03:09:33,417 INFO L226 Difference]: Without dead ends: 63 [2019-09-10 03:09:33,419 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 172 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 542 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=599, Invalid=4093, Unknown=0, NotChecked=0, Total=4692 [2019-09-10 03:09:33,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-09-10 03:09:33,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-09-10 03:09:33,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-09-10 03:09:33,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2019-09-10 03:09:33,424 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 103 [2019-09-10 03:09:33,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:09:33,424 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2019-09-10 03:09:33,424 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-10 03:09:33,424 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2019-09-10 03:09:33,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-10 03:09:33,425 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:09:33,426 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:09:33,426 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:09:33,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:09:33,426 INFO L82 PathProgramCache]: Analyzing trace with hash 404015613, now seen corresponding path program 16 times [2019-09-10 03:09:33,426 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:09:33,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:09:33,427 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 03:09:33,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:09:33,427 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:09:33,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:09:34,310 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2019-09-10 03:09:34,311 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:09:34,311 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:09:34,311 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:09:34,311 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 03:09:34,311 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:09:34,311 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-10 03:09:34,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:09:34,322 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 03:09:34,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:09:34,355 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 72 conjunts are in the unsatisfiable core [2019-09-10 03:09:34,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:09:34,420 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2019-09-10 03:09:34,420 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:09:38,267 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2019-09-10 03:09:38,270 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:09:38,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 73 [2019-09-10 03:09:38,270 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:09:38,271 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-10 03:09:38,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-10 03:09:38,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=667, Invalid=4589, Unknown=0, NotChecked=0, Total=5256 [2019-09-10 03:09:38,274 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 38 states. [2019-09-10 03:09:38,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:09:38,889 INFO L93 Difference]: Finished difference Result 68 states and 69 transitions. [2019-09-10 03:09:38,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-10 03:09:38,889 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 109 [2019-09-10 03:09:38,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:09:38,891 INFO L225 Difference]: With dead ends: 68 [2019-09-10 03:09:38,891 INFO L226 Difference]: Without dead ends: 66 [2019-09-10 03:09:38,893 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 182 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 619 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=667, Invalid=4589, Unknown=0, NotChecked=0, Total=5256 [2019-09-10 03:09:38,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-09-10 03:09:38,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-09-10 03:09:38,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-09-10 03:09:38,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 67 transitions. [2019-09-10 03:09:38,898 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 67 transitions. Word has length 109 [2019-09-10 03:09:38,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:09:38,898 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 67 transitions. [2019-09-10 03:09:38,898 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-10 03:09:38,898 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 67 transitions. [2019-09-10 03:09:38,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-10 03:09:38,899 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:09:38,899 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:09:38,899 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:09:38,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:09:38,900 INFO L82 PathProgramCache]: Analyzing trace with hash -464475409, now seen corresponding path program 17 times [2019-09-10 03:09:38,900 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:09:38,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:09:38,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:09:38,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:09:38,901 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:09:38,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:09:39,711 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2019-09-10 03:09:39,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:09:39,711 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:09:39,711 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:09:39,711 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 03:09:39,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:09:39,712 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:09:39,722 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 03:09:39,722 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 03:09:53,931 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-09-10 03:09:53,931 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 03:09:53,995 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 76 conjunts are in the unsatisfiable core [2019-09-10 03:09:53,997 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:09:54,069 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2019-09-10 03:09:54,069 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:09:58,440 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2019-09-10 03:09:58,445 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:09:58,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 77 [2019-09-10 03:09:58,445 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:09:58,446 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-09-10 03:09:58,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-09-10 03:09:58,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=739, Invalid=5113, Unknown=0, NotChecked=0, Total=5852 [2019-09-10 03:09:58,447 INFO L87 Difference]: Start difference. First operand 66 states and 67 transitions. Second operand 40 states. [2019-09-10 03:09:59,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:09:59,067 INFO L93 Difference]: Finished difference Result 71 states and 72 transitions. [2019-09-10 03:09:59,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-10 03:09:59,068 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 115 [2019-09-10 03:09:59,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:09:59,070 INFO L225 Difference]: With dead ends: 71 [2019-09-10 03:09:59,070 INFO L226 Difference]: Without dead ends: 69 [2019-09-10 03:09:59,071 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 192 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 698 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=739, Invalid=5113, Unknown=0, NotChecked=0, Total=5852 [2019-09-10 03:09:59,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-09-10 03:09:59,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-09-10 03:09:59,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-09-10 03:09:59,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2019-09-10 03:09:59,076 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 115 [2019-09-10 03:09:59,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:09:59,076 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2019-09-10 03:09:59,077 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-09-10 03:09:59,077 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2019-09-10 03:09:59,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-10 03:09:59,078 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:09:59,078 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:09:59,078 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:09:59,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:09:59,078 INFO L82 PathProgramCache]: Analyzing trace with hash 130115453, now seen corresponding path program 18 times [2019-09-10 03:09:59,078 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:09:59,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:09:59,079 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 03:09:59,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:09:59,079 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:09:59,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:10:00,207 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2019-09-10 03:10:00,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:10:00,207 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:10:00,207 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:10:00,207 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 03:10:00,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:10:00,207 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:10:00,218 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 03:10:00,218 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 03:10:00,249 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 03:10:00,249 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 03:10:00,251 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 80 conjunts are in the unsatisfiable core [2019-09-10 03:10:00,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:10:00,308 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2019-09-10 03:10:00,308 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:10:05,509 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2019-09-10 03:10:05,512 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:10:05,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 81 [2019-09-10 03:10:05,513 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:10:05,513 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-09-10 03:10:05,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-09-10 03:10:05,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=815, Invalid=5665, Unknown=0, NotChecked=0, Total=6480 [2019-09-10 03:10:05,514 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 42 states. [2019-09-10 03:10:06,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:10:06,306 INFO L93 Difference]: Finished difference Result 74 states and 75 transitions. [2019-09-10 03:10:06,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-10 03:10:06,306 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 121 [2019-09-10 03:10:06,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:10:06,308 INFO L225 Difference]: With dead ends: 74 [2019-09-10 03:10:06,308 INFO L226 Difference]: Without dead ends: 72 [2019-09-10 03:10:06,309 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 202 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 779 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=815, Invalid=5665, Unknown=0, NotChecked=0, Total=6480 [2019-09-10 03:10:06,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-09-10 03:10:06,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-09-10 03:10:06,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-09-10 03:10:06,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2019-09-10 03:10:06,314 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 121 [2019-09-10 03:10:06,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:10:06,314 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2019-09-10 03:10:06,315 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-09-10 03:10:06,315 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2019-09-10 03:10:06,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-10 03:10:06,316 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:10:06,316 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:10:06,316 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:10:06,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:10:06,316 INFO L82 PathProgramCache]: Analyzing trace with hash -2010955025, now seen corresponding path program 19 times [2019-09-10 03:10:06,316 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:10:06,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:10:06,317 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 03:10:06,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:10:06,317 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:10:06,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:10:07,718 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2019-09-10 03:10:07,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:10:07,719 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:10:07,719 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:10:07,719 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 03:10:07,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:10:07,719 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:10:07,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:10:07,733 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 03:10:07,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:10:07,772 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 84 conjunts are in the unsatisfiable core [2019-09-10 03:10:07,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:10:07,844 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2019-09-10 03:10:07,844 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:10:13,147 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2019-09-10 03:10:13,150 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:10:13,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 85 [2019-09-10 03:10:13,150 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:10:13,151 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-09-10 03:10:13,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-09-10 03:10:13,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=895, Invalid=6245, Unknown=0, NotChecked=0, Total=7140 [2019-09-10 03:10:13,153 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand 44 states. [2019-09-10 03:10:14,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:10:14,055 INFO L93 Difference]: Finished difference Result 77 states and 78 transitions. [2019-09-10 03:10:14,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-10 03:10:14,056 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 127 [2019-09-10 03:10:14,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:10:14,058 INFO L225 Difference]: With dead ends: 77 [2019-09-10 03:10:14,058 INFO L226 Difference]: Without dead ends: 75 [2019-09-10 03:10:14,059 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 212 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 862 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=895, Invalid=6245, Unknown=0, NotChecked=0, Total=7140 [2019-09-10 03:10:14,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-09-10 03:10:14,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-09-10 03:10:14,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-09-10 03:10:14,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2019-09-10 03:10:14,063 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 127 [2019-09-10 03:10:14,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:10:14,064 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2019-09-10 03:10:14,064 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-09-10 03:10:14,064 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2019-09-10 03:10:14,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-10 03:10:14,065 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:10:14,065 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:10:14,065 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:10:14,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:10:14,066 INFO L82 PathProgramCache]: Analyzing trace with hash -799288067, now seen corresponding path program 20 times [2019-09-10 03:10:14,066 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:10:14,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:10:14,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:10:14,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:10:14,067 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:10:14,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-10 03:10:14,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-10 03:10:14,281 INFO L466 BasicCegarLoop]: Counterexample might be feasible [2019-09-10 03:10:14,355 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 03:10:14 BoogieIcfgContainer [2019-09-10 03:10:14,355 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-10 03:10:14,358 INFO L168 Benchmark]: Toolchain (without parser) took 76605.65 ms. Allocated memory was 134.7 MB in the beginning and 576.7 MB in the end (delta: 442.0 MB). Free memory was 91.2 MB in the beginning and 383.5 MB in the end (delta: -292.3 MB). Peak memory consumption was 149.7 MB. Max. memory is 7.1 GB. [2019-09-10 03:10:14,359 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 134.7 MB. Free memory was 109.3 MB in the beginning and 109.1 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-10 03:10:14,365 INFO L168 Benchmark]: CACSL2BoogieTranslator took 266.46 ms. Allocated memory is still 134.7 MB. Free memory was 90.8 MB in the beginning and 82.0 MB in the end (delta: 8.9 MB). Peak memory consumption was 8.9 MB. Max. memory is 7.1 GB. [2019-09-10 03:10:14,367 INFO L168 Benchmark]: Boogie Preprocessor took 118.52 ms. Allocated memory was 134.7 MB in the beginning and 201.3 MB in the end (delta: 66.6 MB). Free memory was 82.0 MB in the beginning and 179.0 MB in the end (delta: -97.0 MB). Peak memory consumption was 16.6 MB. Max. memory is 7.1 GB. [2019-09-10 03:10:14,367 INFO L168 Benchmark]: RCFGBuilder took 200.66 ms. Allocated memory is still 201.3 MB. Free memory was 179.0 MB in the beginning and 168.4 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2019-09-10 03:10:14,368 INFO L168 Benchmark]: TraceAbstraction took 76016.23 ms. Allocated memory was 201.3 MB in the beginning and 576.7 MB in the end (delta: 375.4 MB). Free memory was 167.8 MB in the beginning and 383.5 MB in the end (delta: -215.8 MB). Peak memory consumption was 159.6 MB. Max. memory is 7.1 GB. [2019-09-10 03:10:14,381 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 134.7 MB. Free memory was 109.3 MB in the beginning and 109.1 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 266.46 ms. Allocated memory is still 134.7 MB. Free memory was 90.8 MB in the beginning and 82.0 MB in the end (delta: 8.9 MB). Peak memory consumption was 8.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 118.52 ms. Allocated memory was 134.7 MB in the beginning and 201.3 MB in the end (delta: 66.6 MB). Free memory was 82.0 MB in the beginning and 179.0 MB in the end (delta: -97.0 MB). Peak memory consumption was 16.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 200.66 ms. Allocated memory is still 201.3 MB. Free memory was 179.0 MB in the beginning and 168.4 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 76016.23 ms. Allocated memory was 201.3 MB in the beginning and 576.7 MB in the end (delta: 375.4 MB). Free memory was 167.8 MB in the beginning and 383.5 MB in the end (delta: -215.8 MB). Peak memory consumption was 159.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 13]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L10] unsigned int input = __VERIFIER_nondet_uint(); [L11] CALL, EXPR id(input) VAL [\old(x)=20] [L5] COND FALSE !(x==0) VAL [\old(x)=20, x=20] [L6] CALL, EXPR id(x-1) VAL [\old(x)=19] [L5] COND FALSE !(x==0) VAL [\old(x)=19, x=19] [L6] CALL, EXPR id(x-1) VAL [\old(x)=18] [L5] COND FALSE !(x==0) VAL [\old(x)=18, x=18] [L6] CALL, EXPR id(x-1) VAL [\old(x)=17] [L5] COND FALSE !(x==0) VAL [\old(x)=17, x=17] [L6] CALL, EXPR id(x-1) VAL [\old(x)=16] [L5] COND FALSE !(x==0) VAL [\old(x)=16, x=16] [L6] CALL, EXPR id(x-1) VAL [\old(x)=15] [L5] COND FALSE !(x==0) VAL [\old(x)=15, x=15] [L6] CALL, EXPR id(x-1) VAL [\old(x)=14] [L5] COND FALSE !(x==0) VAL [\old(x)=14, x=14] [L6] CALL, EXPR id(x-1) VAL [\old(x)=13] [L5] COND FALSE !(x==0) VAL [\old(x)=13, x=13] [L6] CALL, EXPR id(x-1) VAL [\old(x)=12] [L5] COND FALSE !(x==0) VAL [\old(x)=12, x=12] [L6] CALL, EXPR id(x-1) VAL [\old(x)=11] [L5] COND FALSE !(x==0) VAL [\old(x)=11, x=11] [L6] CALL, EXPR id(x-1) VAL [\old(x)=10] [L5] COND FALSE !(x==0) VAL [\old(x)=10, x=10] [L6] CALL, EXPR id(x-1) VAL [\old(x)=9] [L5] COND FALSE !(x==0) VAL [\old(x)=9, x=9] [L6] CALL, EXPR id(x-1) VAL [\old(x)=8] [L5] COND FALSE !(x==0) VAL [\old(x)=8, x=8] [L6] CALL, EXPR id(x-1) VAL [\old(x)=7] [L5] COND FALSE !(x==0) VAL [\old(x)=7, x=7] [L6] CALL, EXPR id(x-1) VAL [\old(x)=6] [L5] COND FALSE !(x==0) VAL [\old(x)=6, x=6] [L6] CALL, EXPR id(x-1) VAL [\old(x)=5] [L5] COND FALSE !(x==0) VAL [\old(x)=5, x=5] [L6] CALL, EXPR id(x-1) VAL [\old(x)=4] [L5] COND FALSE !(x==0) VAL [\old(x)=4, x=4] [L6] CALL, EXPR id(x-1) VAL [\old(x)=3] [L5] COND FALSE !(x==0) VAL [\old(x)=3, x=3] [L6] CALL, EXPR id(x-1) VAL [\old(x)=2] [L5] COND FALSE !(x==0) VAL [\old(x)=2, x=2] [L6] CALL, EXPR id(x-1) VAL [\old(x)=1] [L5] COND FALSE !(x==0) VAL [\old(x)=1, x=1] [L6] CALL, EXPR id(x-1) VAL [\old(x)=0] [L5] COND TRUE x==0 [L5] return 0; VAL [\old(x)=0, \result=0, x=0] [L6] RET, EXPR id(x-1) VAL [\old(x)=1, id(x-1)=0, x=1] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=2, id(x-1)=1, x=2] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=3, id(x-1)=2, x=3] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=4, id(x-1)=3, x=4] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=5, id(x-1)=4, x=5] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=6, id(x-1)=5, x=6] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=7, id(x-1)=6, x=7] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=8, id(x-1)=7, x=8] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=9, id(x-1)=8, x=9] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=10, id(x-1)=9, x=10] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=11, id(x-1)=10, x=11] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=12, id(x-1)=11, x=12] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=13, id(x-1)=12, x=13] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=14, id(x-1)=13, x=14] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=15, id(x-1)=14, x=15] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=16, id(x-1)=15, x=16] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=17, id(x-1)=16, x=17] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=18, id(x-1)=17, x=18] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=19, id(x-1)=18, x=19] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=20, id(x-1)=19, x=20] [L6] return id(x-1) + 1; [L11] RET, EXPR id(input) VAL [id(input)=20, input=20] [L11] unsigned int result = id(input); [L12] COND TRUE result == 20 VAL [input=20, result=20] [L13] __VERIFIER_error() VAL [input=20, result=20] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 20 locations, 1 error locations. UNSAFE Result, 75.9s OverallTime, 21 OverallIterations, 21 TraceHistogramMax, 6.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 682 SDtfs, 2 SDslu, 14692 SDs, 0 SdLazy, 8703 SolverSat, 1 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3209 GetRequests, 2301 SyntacticMatches, 18 SemanticMatches, 890 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5775 ImplicationChecksByTransitivity, 29.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=75occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 0.7777777777777778 AbsIntWeakeningRatio, 0.5555555555555556 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 20 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 15.2s SatisfiabilityAnalysisTime, 52.2s InterpolantComputationTime, 2901 NumberOfCodeBlocks, 2901 NumberOfCodeBlocksAsserted, 102 NumberOfCheckSat, 4080 ConstructedInterpolants, 0 QuantifiedInterpolants, 1428582 SizeOfPredicates, 18 NumberOfNonLiveVariables, 2808 ConjunctsInSsa, 900 ConjunctsInUnsatCore, 56 InterpolantComputations, 1 PerfectInterpolantSequences, 11396/22792 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...