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_o10.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 03:08:18,934 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 03:08:18,936 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 03:08:18,947 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 03:08:18,948 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 03:08:18,949 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 03:08:18,950 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 03:08:18,952 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 03:08:18,954 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 03:08:18,955 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 03:08:18,956 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 03:08:18,957 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 03:08:18,957 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 03:08:18,958 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 03:08:18,959 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 03:08:18,960 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 03:08:18,961 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 03:08:18,962 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 03:08:18,964 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 03:08:18,966 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 03:08:18,968 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 03:08:18,969 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 03:08:18,970 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 03:08:18,971 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 03:08:18,976 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 03:08:18,976 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 03:08:18,977 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 03:08:18,978 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 03:08:18,978 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 03:08:18,979 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 03:08:18,981 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 03:08:18,982 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 03:08:18,983 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 03:08:18,984 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 03:08:18,986 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 03:08:18,987 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 03:08:18,988 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 03:08:18,988 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 03:08:18,989 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 03:08:18,990 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 03:08:18,990 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 03:08:18,991 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:19,018 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 03:08:19,018 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 03:08:19,018 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 03:08:19,019 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 03:08:19,019 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 03:08:19,019 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 03:08:19,020 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 03:08:19,020 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 03:08:19,020 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 03:08:19,020 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 03:08:19,021 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 03:08:19,021 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 03:08:19,021 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 03:08:19,022 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 03:08:19,022 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 03:08:19,022 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 03:08:19,022 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 03:08:19,022 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 03:08:19,023 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 03:08:19,023 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 03:08:19,023 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 03:08:19,023 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 03:08:19,023 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 03:08:19,024 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 03:08:19,024 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 03:08:19,024 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 03:08:19,024 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 03:08:19,024 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 03:08:19,025 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 03:08:19,025 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 03:08:19,065 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 03:08:19,080 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 03:08:19,085 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 03:08:19,087 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 03:08:19,088 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 03:08:19,089 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/id_o10.c [2019-09-10 03:08:19,163 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db5ecb878/709e3001d6174a19a320c5231b128bdd/FLAG712e024fe [2019-09-10 03:08:19,606 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 03:08:19,607 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/id_o10.c [2019-09-10 03:08:19,614 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db5ecb878/709e3001d6174a19a320c5231b128bdd/FLAG712e024fe [2019-09-10 03:08:19,976 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db5ecb878/709e3001d6174a19a320c5231b128bdd [2019-09-10 03:08:19,987 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 03:08:19,989 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 03:08:19,990 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 03:08:19,991 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 03:08:19,995 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 03:08:19,999 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 03:08:19" (1/1) ... [2019-09-10 03:08:20,002 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6370b32a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:08:19, skipping insertion in model container [2019-09-10 03:08:20,002 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 03:08:19" (1/1) ... [2019-09-10 03:08:20,010 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 03:08:20,025 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 03:08:20,168 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 03:08:20,174 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 03:08:20,191 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 03:08:20,209 INFO L192 MainTranslator]: Completed translation [2019-09-10 03:08:20,210 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:08:20 WrapperNode [2019-09-10 03:08:20,210 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 03:08:20,211 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 03:08:20,211 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 03:08:20,211 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 03:08:20,225 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:20" (1/1) ... [2019-09-10 03:08:20,228 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:20" (1/1) ... [2019-09-10 03:08:20,237 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:20" (1/1) ... [2019-09-10 03:08:20,237 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:20" (1/1) ... [2019-09-10 03:08:20,240 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:20" (1/1) ... [2019-09-10 03:08:20,242 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:20" (1/1) ... [2019-09-10 03:08:20,243 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:20" (1/1) ... [2019-09-10 03:08:20,244 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 03:08:20,244 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 03:08:20,244 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 03:08:20,244 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 03:08:20,245 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:08:20" (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:20,385 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 03:08:20,386 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 03:08:20,386 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2019-09-10 03:08:20,386 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 03:08:20,386 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2019-09-10 03:08:20,386 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 03:08:20,386 INFO L130 BoogieDeclarations]: Found specification of procedure id [2019-09-10 03:08:20,387 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 03:08:20,387 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 03:08:20,387 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 03:08:20,528 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 03:08:20,528 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 03:08:20,530 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 03:08:20 BoogieIcfgContainer [2019-09-10 03:08:20,530 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 03:08:20,531 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 03:08:20,531 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 03:08:20,534 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 03:08:20,534 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 03:08:19" (1/3) ... [2019-09-10 03:08:20,534 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45dbde1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 03:08:20, skipping insertion in model container [2019-09-10 03:08:20,535 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:08:20" (2/3) ... [2019-09-10 03:08:20,535 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45dbde1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 03:08:20, skipping insertion in model container [2019-09-10 03:08:20,535 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 03:08:20" (3/3) ... [2019-09-10 03:08:20,537 INFO L109 eAbstractionObserver]: Analyzing ICFG id_o10.c [2019-09-10 03:08:20,544 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 03:08:20,550 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 03:08:20,562 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 03:08:20,589 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 03:08:20,590 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 03:08:20,590 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 03:08:20,590 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 03:08:20,590 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 03:08:20,590 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 03:08:20,590 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 03:08:20,591 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 03:08:20,606 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2019-09-10 03:08:20,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-10 03:08:20,616 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:08:20,617 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:08:20,619 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:08:20,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:08:20,625 INFO L82 PathProgramCache]: Analyzing trace with hash -872342019, now seen corresponding path program 1 times [2019-09-10 03:08:20,628 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:08:20,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:08:20,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:08:20,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:08:20,670 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:08:20,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:08:20,907 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:20,910 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:08:20,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:08:20,911 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:08:20,916 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:08:20,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:08:20,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:08:20,929 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 5 states. [2019-09-10 03:08:20,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:08:20,987 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2019-09-10 03:08:20,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:08:20,989 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-09-10 03:08:20,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:08:21,000 INFO L225 Difference]: With dead ends: 26 [2019-09-10 03:08:21,000 INFO L226 Difference]: Without dead ends: 18 [2019-09-10 03:08:21,003 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:21,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-09-10 03:08:21,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-09-10 03:08:21,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-09-10 03:08:21,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2019-09-10 03:08:21,038 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2019-09-10 03:08:21,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:08:21,038 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2019-09-10 03:08:21,039 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:08:21,039 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2019-09-10 03:08:21,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-10 03:08:21,041 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:08:21,041 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:21,042 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:08:21,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:08:21,043 INFO L82 PathProgramCache]: Analyzing trace with hash -953570577, now seen corresponding path program 1 times [2019-09-10 03:08:21,043 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:08:21,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:08:21,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:08:21,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:08:21,045 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:08:21,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:08:21,224 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:21,224 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:08:21,225 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:08:21,229 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 20 with the following transitions: [2019-09-10 03:08:21,231 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:21,264 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:08:21,264 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:08:21,329 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 03:08:21,388 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:08:21,390 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:21,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:08:21,394 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:08:21,443 INFO L219 lantSequenceWeakener]: Could never weaken! [2019-09-10 03:08:21,444 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:08:21,501 INFO L420 sIntCurrentIteration]: We unified 18 AI predicates to 18 [2019-09-10 03:08:21,501 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:08:21,502 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:08:21,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2019-09-10 03:08:21,502 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:08:21,504 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 03:08:21,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 03:08:21,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-10 03:08:21,505 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 7 states. [2019-09-10 03:08:21,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:08:21,571 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2019-09-10 03:08:21,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 03:08:21,571 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-09-10 03:08:21,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:08:21,574 INFO L225 Difference]: With dead ends: 23 [2019-09-10 03:08:21,575 INFO L226 Difference]: Without dead ends: 21 [2019-09-10 03:08:21,576 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:21,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-09-10 03:08:21,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-09-10 03:08:21,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-09-10 03:08:21,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2019-09-10 03:08:21,586 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 19 [2019-09-10 03:08:21,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:08:21,587 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-09-10 03:08:21,587 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 03:08:21,587 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2019-09-10 03:08:21,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-10 03:08:21,590 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:08:21,590 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:21,590 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:08:21,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:08:21,591 INFO L82 PathProgramCache]: Analyzing trace with hash 397359997, now seen corresponding path program 2 times [2019-09-10 03:08:21,591 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:08:21,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:08:21,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:08:21,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:08:21,593 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:08:21,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:08:21,811 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:21,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:08:21,812 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:08:21,812 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:08:21,814 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:21,814 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:08:21,814 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) [2019-09-10 03:08:21,834 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 03:08:21,835 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:08:21,864 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-10 03:08:21,865 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 03:08:21,867 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-10 03:08:21,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:08:21,964 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:21,965 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:08:22,292 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:22,297 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:08:22,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2019-09-10 03:08:22,298 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:08:22,299 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 03:08:22,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 03:08:22,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2019-09-10 03:08:22,300 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 10 states. [2019-09-10 03:08:22,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:08:22,346 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2019-09-10 03:08:22,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 03:08:22,347 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2019-09-10 03:08:22,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:08:22,349 INFO L225 Difference]: With dead ends: 26 [2019-09-10 03:08:22,349 INFO L226 Difference]: Without dead ends: 24 [2019-09-10 03:08:22,350 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:08:22,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-09-10 03:08:22,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-09-10 03:08:22,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-09-10 03:08:22,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2019-09-10 03:08:22,356 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 25 [2019-09-10 03:08:22,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:08:22,356 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2019-09-10 03:08:22,356 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 03:08:22,356 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2019-09-10 03:08:22,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-10 03:08:22,358 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:08:22,358 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:08:22,358 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:08:22,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:08:22,359 INFO L82 PathProgramCache]: Analyzing trace with hash 1198310127, now seen corresponding path program 3 times [2019-09-10 03:08:22,359 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:08:22,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:08:22,360 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 03:08:22,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:08:22,360 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:08:22,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:08:22,546 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:08:22,546 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:08:22,546 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:08:22,546 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:08:22,547 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:22,547 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:08:22,547 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 03:08:22,563 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 03:08:22,563 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:08:22,583 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 03:08:22,583 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 03:08:22,584 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-10 03:08:22,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:08:22,626 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:08:22,626 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:08:23,024 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:08:23,029 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:08:23,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2019-09-10 03:08:23,029 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:08:23,030 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 03:08:23,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 03:08:23,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2019-09-10 03:08:23,032 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 12 states. [2019-09-10 03:08:23,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:08:23,089 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2019-09-10 03:08:23,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 03:08:23,090 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2019-09-10 03:08:23,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:08:23,091 INFO L225 Difference]: With dead ends: 29 [2019-09-10 03:08:23,092 INFO L226 Difference]: Without dead ends: 27 [2019-09-10 03:08:23,092 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:08:23,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-09-10 03:08:23,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-09-10 03:08:23,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-09-10 03:08:23,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-09-10 03:08:23,099 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 31 [2019-09-10 03:08:23,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:08:23,099 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-09-10 03:08:23,099 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 03:08:23,099 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2019-09-10 03:08:23,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-09-10 03:08:23,101 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:08:23,101 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:08:23,101 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:08:23,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:08:23,102 INFO L82 PathProgramCache]: Analyzing trace with hash 1080764669, now seen corresponding path program 4 times [2019-09-10 03:08:23,102 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:08:23,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:08:23,104 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 03:08:23,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:08:23,104 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:08:23,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:08:23,356 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:08:23,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:08:23,356 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:08:23,357 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:08:23,357 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:23,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:08:23,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 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 03:08:23,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:08:23,373 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:08:23,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:08:23,397 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-10 03:08:23,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:08:23,435 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:08:23,436 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:08:23,934 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:08:23,938 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:08:23,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2019-09-10 03:08:23,938 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:08:23,939 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-10 03:08:23,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-10 03:08:23,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=508, Unknown=0, NotChecked=0, Total=600 [2019-09-10 03:08:23,940 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 14 states. [2019-09-10 03:08:24,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:08:24,041 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2019-09-10 03:08:24,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 03:08:24,042 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 37 [2019-09-10 03:08:24,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:08:24,043 INFO L225 Difference]: With dead ends: 32 [2019-09-10 03:08:24,043 INFO L226 Difference]: Without dead ends: 30 [2019-09-10 03:08:24,044 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:08:24,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-09-10 03:08:24,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-09-10 03:08:24,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-09-10 03:08:24,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2019-09-10 03:08:24,050 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 37 [2019-09-10 03:08:24,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:08:24,050 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2019-09-10 03:08:24,051 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-10 03:08:24,051 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2019-09-10 03:08:24,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-09-10 03:08:24,052 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:08:24,052 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:08:24,053 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:08:24,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:08:24,053 INFO L82 PathProgramCache]: Analyzing trace with hash -1752970513, now seen corresponding path program 5 times [2019-09-10 03:08:24,053 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:08:24,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:08:24,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:08:24,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:08:24,055 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:08:24,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:08:24,318 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:08:24,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:08:24,319 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:08:24,319 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:08:24,320 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:24,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:08:24,320 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:08:24,349 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 03:08:24,349 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 03:08:24,377 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-09-10 03:08:24,377 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 03:08:24,378 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-10 03:08:24,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:08:24,414 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:08:24,414 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:08:25,085 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (5)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 03:08:25,089 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:08:25,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2019-09-10 03:08:25,089 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:08:25,090 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 03:08:25,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 03:08:25,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=693, Unknown=0, NotChecked=0, Total=812 [2019-09-10 03:08:25,091 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 16 states. [2019-09-10 03:08:25,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:08:25,213 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2019-09-10 03:08:25,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 03:08:25,214 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 43 [2019-09-10 03:08:25,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:08:25,217 INFO L225 Difference]: With dead ends: 35 [2019-09-10 03:08:25,217 INFO L226 Difference]: Without dead ends: 33 [2019-09-10 03:08:25,218 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=119, Invalid=693, Unknown=0, NotChecked=0, Total=812 [2019-09-10 03:08:25,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-09-10 03:08:25,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-09-10 03:08:25,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-10 03:08:25,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2019-09-10 03:08:25,231 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 43 [2019-09-10 03:08:25,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:08:25,231 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2019-09-10 03:08:25,231 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 03:08:25,231 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2019-09-10 03:08:25,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-09-10 03:08:25,233 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:08:25,233 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:08:25,233 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:08:25,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:08:25,234 INFO L82 PathProgramCache]: Analyzing trace with hash -1590630787, now seen corresponding path program 6 times [2019-09-10 03:08:25,234 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:08:25,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:08:25,237 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 03:08:25,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:08:25,238 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:08:25,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:08:25,565 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:08:25,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:08:25,566 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:08:25,566 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:08:25,566 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:25,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:08:25,567 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) [2019-09-10 03:08:25,581 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 03:08:25,581 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:08:25,613 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 03:08:25,614 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 03:08:25,615 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-10 03:08:25,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:08:25,659 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:08:25,659 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:08:26,569 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:08:26,573 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:08:26,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2019-09-10 03:08:26,573 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:08:26,574 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 03:08:26,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 03:08:26,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=909, Unknown=0, NotChecked=0, Total=1056 [2019-09-10 03:08:26,576 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 18 states. [2019-09-10 03:08:26,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:08:26,737 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2019-09-10 03:08:26,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 03:08:26,738 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 49 [2019-09-10 03:08:26,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:08:26,739 INFO L225 Difference]: With dead ends: 38 [2019-09-10 03:08:26,739 INFO L226 Difference]: Without dead ends: 36 [2019-09-10 03:08:26,740 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=147, Invalid=909, Unknown=0, NotChecked=0, Total=1056 [2019-09-10 03:08:26,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-09-10 03:08:26,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-09-10 03:08:26,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-09-10 03:08:26,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2019-09-10 03:08:26,746 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 49 [2019-09-10 03:08:26,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:08:26,747 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2019-09-10 03:08:26,747 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 03:08:26,747 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2019-09-10 03:08:26,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-10 03:08:26,749 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:08:26,749 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:08:26,749 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:08:26,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:08:26,750 INFO L82 PathProgramCache]: Analyzing trace with hash 1532150511, now seen corresponding path program 7 times [2019-09-10 03:08:26,750 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:08:26,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:08:26,751 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 03:08:26,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:08:26,752 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:08:26,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:08:27,072 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:08:27,073 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:08:27,073 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:08:27,073 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:08:27,073 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:27,073 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:08:27,073 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:08:27,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:08:27,087 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 03:08:27,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:08:27,106 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-10 03:08:27,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:08:27,176 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:08:27,176 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:08:28,171 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:08:28,174 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:08:28,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2019-09-10 03:08:28,175 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:08:28,175 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 03:08:28,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 03:08:28,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=1153, Unknown=0, NotChecked=0, Total=1332 [2019-09-10 03:08:28,177 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 20 states. [2019-09-10 03:08:28,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:08:28,361 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2019-09-10 03:08:28,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 03:08:28,362 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 55 [2019-09-10 03:08:28,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:08:28,363 INFO L225 Difference]: With dead ends: 41 [2019-09-10 03:08:28,363 INFO L226 Difference]: Without dead ends: 39 [2019-09-10 03:08:28,364 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=179, Invalid=1153, Unknown=0, NotChecked=0, Total=1332 [2019-09-10 03:08:28,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-09-10 03:08:28,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-09-10 03:08:28,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-10 03:08:28,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2019-09-10 03:08:28,369 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 55 [2019-09-10 03:08:28,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:08:28,370 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2019-09-10 03:08:28,370 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 03:08:28,370 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2019-09-10 03:08:28,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-10 03:08:28,371 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:08:28,371 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:08:28,372 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:08:28,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:08:28,372 INFO L82 PathProgramCache]: Analyzing trace with hash 1140618237, now seen corresponding path program 8 times [2019-09-10 03:08:28,372 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:08:28,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:08:28,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:08:28,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:08:28,373 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:08:28,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:08:28,673 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:08:28,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:08:28,673 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:08:28,673 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:08:28,674 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:28,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:08:28,674 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:08:28,685 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 03:08:28,685 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 03:08:28,717 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-09-10 03:08:28,717 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 03:08:28,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-10 03:08:28,720 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:08:28,781 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:08:28,781 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:08:30,154 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:08:30,161 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:08:30,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2019-09-10 03:08:30,161 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:08:30,163 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 03:08:30,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 03:08:30,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=1425, Unknown=0, NotChecked=0, Total=1640 [2019-09-10 03:08:30,164 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 22 states. [2019-09-10 03:08:30,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:08:30,377 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2019-09-10 03:08:30,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 03:08:30,378 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 61 [2019-09-10 03:08:30,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:08:30,380 INFO L225 Difference]: With dead ends: 44 [2019-09-10 03:08:30,380 INFO L226 Difference]: Without dead ends: 42 [2019-09-10 03:08:30,381 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=215, Invalid=1425, Unknown=0, NotChecked=0, Total=1640 [2019-09-10 03:08:30,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-09-10 03:08:30,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-09-10 03:08:30,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-09-10 03:08:30,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2019-09-10 03:08:30,387 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 61 [2019-09-10 03:08:30,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:08:30,387 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2019-09-10 03:08:30,387 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 03:08:30,387 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2019-09-10 03:08:30,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-10 03:08:30,389 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:08:30,389 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:08:30,389 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:08:30,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:08:30,389 INFO L82 PathProgramCache]: Analyzing trace with hash -1749177617, now seen corresponding path program 9 times [2019-09-10 03:08:30,389 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:08:30,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:08:30,390 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 03:08:30,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:08:30,391 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:08:30,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:08:30,775 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:08:30,775 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:08:30,775 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:08:30,775 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:08:30,776 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:30,776 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:08:30,776 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:08:30,792 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 03:08:30,792 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 03:08:30,822 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 03:08:30,823 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 03:08:30,824 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-10 03:08:30,826 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:08:30,884 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:08:30,884 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:08:32,396 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:08:32,399 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:08:32,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2019-09-10 03:08:32,400 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:08:32,400 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-10 03:08:32,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-10 03:08:32,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=1725, Unknown=0, NotChecked=0, Total=1980 [2019-09-10 03:08:32,402 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 24 states. [2019-09-10 03:08:32,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:08:32,657 INFO L93 Difference]: Finished difference Result 47 states and 48 transitions. [2019-09-10 03:08:32,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 03:08:32,662 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 67 [2019-09-10 03:08:32,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:08:32,663 INFO L225 Difference]: With dead ends: 47 [2019-09-10 03:08:32,663 INFO L226 Difference]: Without dead ends: 45 [2019-09-10 03:08:32,664 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 112 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=255, Invalid=1725, Unknown=0, NotChecked=0, Total=1980 [2019-09-10 03:08:32,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-09-10 03:08:32,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-09-10 03:08:32,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-09-10 03:08:32,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2019-09-10 03:08:32,678 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 67 [2019-09-10 03:08:32,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:08:32,681 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2019-09-10 03:08:32,681 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-10 03:08:32,681 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2019-09-10 03:08:32,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-10 03:08:32,683 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:08:32,683 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:08:32,683 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:08:32,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:08:32,684 INFO L82 PathProgramCache]: Analyzing trace with hash -1580609155, now seen corresponding path program 10 times [2019-09-10 03:08:32,684 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:08:32,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:08:32,685 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 03:08:32,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:08:32,685 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:08:32,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-10 03:08:32,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-10 03:08:32,768 INFO L466 BasicCegarLoop]: Counterexample might be feasible [2019-09-10 03:08:32,804 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 03:08:32 BoogieIcfgContainer [2019-09-10 03:08:32,804 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-10 03:08:32,807 INFO L168 Benchmark]: Toolchain (without parser) took 12816.69 ms. Allocated memory was 134.2 MB in the beginning and 355.5 MB in the end (delta: 221.2 MB). Free memory was 89.5 MB in the beginning and 254.6 MB in the end (delta: -165.1 MB). Peak memory consumption was 56.1 MB. Max. memory is 7.1 GB. [2019-09-10 03:08:32,808 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 134.2 MB. Free memory is still 107.1 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-09-10 03:08:32,810 INFO L168 Benchmark]: CACSL2BoogieTranslator took 220.07 ms. Allocated memory is still 134.2 MB. Free memory was 89.1 MB in the beginning and 80.2 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:08:32,814 INFO L168 Benchmark]: Boogie Preprocessor took 32.84 ms. Allocated memory is still 134.2 MB. Free memory was 80.2 MB in the beginning and 78.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-09-10 03:08:32,815 INFO L168 Benchmark]: RCFGBuilder took 286.17 ms. Allocated memory was 134.2 MB in the beginning and 201.3 MB in the end (delta: 67.1 MB). Free memory was 78.9 MB in the beginning and 168.6 MB in the end (delta: -89.6 MB). Peak memory consumption was 16.1 MB. Max. memory is 7.1 GB. [2019-09-10 03:08:32,817 INFO L168 Benchmark]: TraceAbstraction took 12272.96 ms. Allocated memory was 201.3 MB in the beginning and 355.5 MB in the end (delta: 154.1 MB). Free memory was 168.6 MB in the beginning and 254.6 MB in the end (delta: -86.1 MB). Peak memory consumption was 68.1 MB. Max. memory is 7.1 GB. [2019-09-10 03:08:32,822 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.2 MB. Free memory is still 107.1 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 220.07 ms. Allocated memory is still 134.2 MB. Free memory was 89.1 MB in the beginning and 80.2 MB in the end (delta: 8.9 MB). Peak memory consumption was 8.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 32.84 ms. Allocated memory is still 134.2 MB. Free memory was 80.2 MB in the beginning and 78.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 286.17 ms. Allocated memory was 134.2 MB in the beginning and 201.3 MB in the end (delta: 67.1 MB). Free memory was 78.9 MB in the beginning and 168.6 MB in the end (delta: -89.6 MB). Peak memory consumption was 16.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12272.96 ms. Allocated memory was 201.3 MB in the beginning and 355.5 MB in the end (delta: 154.1 MB). Free memory was 168.6 MB in the beginning and 254.6 MB in the end (delta: -86.1 MB). Peak memory consumption was 68.1 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)=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; [L11] RET, EXPR id(input) VAL [id(input)=10, input=10] [L11] unsigned int result = id(input); [L12] COND TRUE result == 10 VAL [input=10, result=10] [L13] __VERIFIER_error() VAL [input=10, result=10] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 20 locations, 1 error locations. UNSAFE Result, 12.2s OverallTime, 11 OverallIterations, 11 TraceHistogramMax, 1.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 242 SDtfs, 2 SDslu, 2846 SDs, 0 SdLazy, 1195 SolverSat, 1 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 879 GetRequests, 631 SyntacticMatches, 8 SemanticMatches, 240 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 865 ImplicationChecksByTransitivity, 5.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred in iteration=10, 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.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 9.5s InterpolantComputationTime, 841 NumberOfCodeBlocks, 841 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 1110 ConstructedInterpolants, 0 QuantifiedInterpolants, 207912 SizeOfPredicates, 8 NumberOfNonLiveVariables, 768 ConjunctsInSsa, 240 ConjunctsInUnsatCore, 26 InterpolantComputations, 1 PerfectInterpolantSequences, 1346/2692 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...