/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf -tc ../../../trunk/examples/toolchains/AutomizerC.xml --sifa.abstract.domain EqDomain -i ../sv-benchmarks/c/recursive-simple/id_i25_o25-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-f954360 [2023-04-01 12:13:56,624 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-04-01 12:13:56,625 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-04-01 12:13:56,643 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-04-01 12:13:56,644 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-04-01 12:13:56,645 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-04-01 12:13:56,645 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-04-01 12:13:56,646 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-04-01 12:13:56,647 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-04-01 12:13:56,648 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-04-01 12:13:56,649 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-04-01 12:13:56,649 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-04-01 12:13:56,650 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-04-01 12:13:56,650 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-04-01 12:13:56,651 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-04-01 12:13:56,652 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-04-01 12:13:56,652 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-04-01 12:13:56,653 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-04-01 12:13:56,654 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-04-01 12:13:56,655 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-04-01 12:13:56,655 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-04-01 12:13:56,656 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-04-01 12:13:56,657 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-04-01 12:13:56,657 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-04-01 12:13:56,660 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-04-01 12:13:56,660 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-04-01 12:13:56,660 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-04-01 12:13:56,661 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-04-01 12:13:56,661 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-04-01 12:13:56,662 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-04-01 12:13:56,662 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-04-01 12:13:56,662 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-04-01 12:13:56,663 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-04-01 12:13:56,663 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-04-01 12:13:56,664 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-04-01 12:13:56,664 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-04-01 12:13:56,665 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-04-01 12:13:56,665 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-04-01 12:13:56,665 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-04-01 12:13:56,666 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-04-01 12:13:56,666 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-04-01 12:13:56,667 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf [2023-04-01 12:13:56,681 INFO L113 SettingsManager]: Loading preferences was successful [2023-04-01 12:13:56,681 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-04-01 12:13:56,682 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-04-01 12:13:56,682 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-04-01 12:13:56,682 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-04-01 12:13:56,682 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-04-01 12:13:56,683 INFO L138 SettingsManager]: * User list type=DISABLED [2023-04-01 12:13:56,683 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-04-01 12:13:56,683 INFO L138 SettingsManager]: * Explicit value domain=true [2023-04-01 12:13:56,683 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-04-01 12:13:56,683 INFO L138 SettingsManager]: * Octagon Domain=false [2023-04-01 12:13:56,683 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2023-04-01 12:13:56,683 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-04-01 12:13:56,683 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-04-01 12:13:56,683 INFO L138 SettingsManager]: * Interval Domain=false [2023-04-01 12:13:56,684 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-04-01 12:13:56,684 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-04-01 12:13:56,684 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2023-04-01 12:13:56,684 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-04-01 12:13:56,684 INFO L138 SettingsManager]: * sizeof long=4 [2023-04-01 12:13:56,684 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-04-01 12:13:56,685 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-04-01 12:13:56,685 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-04-01 12:13:56,685 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-04-01 12:13:56,685 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-04-01 12:13:56,685 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-04-01 12:13:56,685 INFO L138 SettingsManager]: * sizeof long double=12 [2023-04-01 12:13:56,685 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-04-01 12:13:56,685 INFO L138 SettingsManager]: * Use constant arrays=true [2023-04-01 12:13:56,686 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-04-01 12:13:56,686 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-04-01 12:13:56,686 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-04-01 12:13:56,686 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-01 12:13:56,686 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-04-01 12:13:56,686 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2023-04-01 12:13:56,686 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-04-01 12:13:56,686 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-04-01 12:13:56,686 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-04-01 12:13:56,687 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-04-01 12:13:56,687 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-04-01 12:13:56,687 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-04-01 12:13:56,687 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> EqDomain [2023-04-01 12:13:56,819 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-04-01 12:13:56,832 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-04-01 12:13:56,833 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-04-01 12:13:56,834 INFO L271 PluginConnector]: Initializing CDTParser... [2023-04-01 12:13:56,834 INFO L275 PluginConnector]: CDTParser initialized [2023-04-01 12:13:56,835 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/id_i25_o25-2.c [2023-04-01 12:13:57,817 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-04-01 12:13:58,079 INFO L351 CDTParser]: Found 1 translation units. [2023-04-01 12:13:58,080 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/id_i25_o25-2.c [2023-04-01 12:13:58,084 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dfb20f297/87485008499745398d85eaceb8b8e115/FLAGb1947dfab [2023-04-01 12:13:58,100 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dfb20f297/87485008499745398d85eaceb8b8e115 [2023-04-01 12:13:58,102 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-04-01 12:13:58,103 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2023-04-01 12:13:58,107 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-04-01 12:13:58,107 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-04-01 12:13:58,109 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-04-01 12:13:58,110 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.04 12:13:58" (1/1) ... [2023-04-01 12:13:58,110 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53c7193b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:13:58, skipping insertion in model container [2023-04-01 12:13:58,111 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.04 12:13:58" (1/1) ... [2023-04-01 12:13:58,115 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-04-01 12:13:58,123 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-04-01 12:13:58,231 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/id_i25_o25-2.c[454,467] [2023-04-01 12:13:58,234 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-01 12:13:58,244 INFO L203 MainTranslator]: Completed pre-run [2023-04-01 12:13:58,253 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/id_i25_o25-2.c[454,467] [2023-04-01 12:13:58,253 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-01 12:13:58,262 INFO L208 MainTranslator]: Completed translation [2023-04-01 12:13:58,262 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:13:58 WrapperNode [2023-04-01 12:13:58,262 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-04-01 12:13:58,263 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-04-01 12:13:58,263 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-04-01 12:13:58,263 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-04-01 12:13:58,270 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:13:58" (1/1) ... [2023-04-01 12:13:58,271 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:13:58" (1/1) ... [2023-04-01 12:13:58,275 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:13:58" (1/1) ... [2023-04-01 12:13:58,275 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:13:58" (1/1) ... [2023-04-01 12:13:58,278 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:13:58" (1/1) ... [2023-04-01 12:13:58,280 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:13:58" (1/1) ... [2023-04-01 12:13:58,283 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:13:58" (1/1) ... [2023-04-01 12:13:58,284 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:13:58" (1/1) ... [2023-04-01 12:13:58,285 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-04-01 12:13:58,286 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-04-01 12:13:58,286 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-04-01 12:13:58,286 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-04-01 12:13:58,286 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:13:58" (1/1) ... [2023-04-01 12:13:58,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-01 12:13:58,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 12:13:58,308 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-04-01 12:13:58,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-04-01 12:13:58,359 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2023-04-01 12:13:58,360 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-04-01 12:13:58,360 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-04-01 12:13:58,360 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2023-04-01 12:13:58,360 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2023-04-01 12:13:58,360 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2023-04-01 12:13:58,360 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2023-04-01 12:13:58,360 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2023-04-01 12:13:58,360 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-04-01 12:13:58,360 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-04-01 12:13:58,360 INFO L130 BoogieDeclarations]: Found specification of procedure id [2023-04-01 12:13:58,361 INFO L130 BoogieDeclarations]: Found specification of procedure main [2023-04-01 12:13:58,361 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2023-04-01 12:13:58,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-04-01 12:13:58,361 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-04-01 12:13:58,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-04-01 12:13:58,361 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-04-01 12:13:58,361 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-04-01 12:13:58,427 INFO L236 CfgBuilder]: Building ICFG [2023-04-01 12:13:58,429 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-04-01 12:13:58,525 INFO L277 CfgBuilder]: Performing block encoding [2023-04-01 12:13:58,536 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-04-01 12:13:58,536 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-04-01 12:13:58,538 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.04 12:13:58 BoogieIcfgContainer [2023-04-01 12:13:58,538 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-04-01 12:13:58,540 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-04-01 12:13:58,540 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-04-01 12:13:58,542 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-04-01 12:13:58,542 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.04 12:13:58" (1/3) ... [2023-04-01 12:13:58,542 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20cdcc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.04 12:13:58, skipping insertion in model container [2023-04-01 12:13:58,542 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:13:58" (2/3) ... [2023-04-01 12:13:58,543 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20cdcc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.04 12:13:58, skipping insertion in model container [2023-04-01 12:13:58,543 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.04 12:13:58" (3/3) ... [2023-04-01 12:13:58,557 INFO L112 eAbstractionObserver]: Analyzing ICFG id_i25_o25-2.c [2023-04-01 12:13:58,583 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-04-01 12:13:58,583 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-04-01 12:13:58,632 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-04-01 12:13:58,637 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@64916f1c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-04-01 12:13:58,637 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-04-01 12:13:58,640 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-04-01 12:13:58,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-04-01 12:13:58,645 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 12:13:58,645 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 12:13:58,646 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 12:13:58,652 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 12:13:58,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1387582398, now seen corresponding path program 1 times [2023-04-01 12:13:58,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 12:13:58,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348649756] [2023-04-01 12:13:58,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 12:13:58,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 12:13:58,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 12:13:58,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 12:13:58,810 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 12:13:58,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348649756] [2023-04-01 12:13:58,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348649756] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 12:13:58,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-01 12:13:58,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-04-01 12:13:58,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49693643] [2023-04-01 12:13:58,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 12:13:58,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-04-01 12:13:58,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 12:13:58,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-04-01 12:13:58,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-04-01 12:13:58,835 INFO L87 Difference]: Start difference. First operand has 20 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-01 12:13:58,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 12:13:58,865 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2023-04-01 12:13:58,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-04-01 12:13:58,867 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 13 [2023-04-01 12:13:58,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 12:13:58,872 INFO L225 Difference]: With dead ends: 32 [2023-04-01 12:13:58,872 INFO L226 Difference]: Without dead ends: 18 [2023-04-01 12:13:58,874 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-04-01 12:13:58,876 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 2 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-01 12:13:58,877 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 67 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-01 12:13:58,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2023-04-01 12:13:58,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2023-04-01 12:13:58,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 10 states have (on average 1.1) internal successors, (11), 11 states have internal predecessors, (11), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-04-01 12:13:58,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2023-04-01 12:13:58,901 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2023-04-01 12:13:58,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 12:13:58,901 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2023-04-01 12:13:58,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-01 12:13:58,901 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2023-04-01 12:13:58,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-04-01 12:13:58,902 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 12:13:58,902 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 12:13:58,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-04-01 12:13:58,903 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 12:13:58,903 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 12:13:58,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1329751984, now seen corresponding path program 1 times [2023-04-01 12:13:58,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 12:13:58,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822801490] [2023-04-01 12:13:58,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 12:13:58,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 12:13:58,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 12:13:58,997 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-04-01 12:13:58,997 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 12:13:58,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822801490] [2023-04-01 12:13:58,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822801490] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 12:13:58,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1923058636] [2023-04-01 12:13:58,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 12:13:58,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 12:13:58,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 12:13:59,030 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 12:13:59,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-04-01 12:13:59,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 12:13:59,101 INFO L262 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 6 conjunts are in the unsatisfiable core [2023-04-01 12:13:59,104 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 12:13:59,150 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-04-01 12:13:59,150 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 12:13:59,275 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-01 12:13:59,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1923058636] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 12:13:59,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [338408906] [2023-04-01 12:13:59,306 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-04-01 12:13:59,306 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 12:13:59,309 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-01 12:13:59,310 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 12:13:59,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 9 [2023-04-01 12:13:59,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757335842] [2023-04-01 12:13:59,310 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 12:13:59,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-04-01 12:13:59,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 12:13:59,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-04-01 12:13:59,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-04-01 12:13:59,312 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand has 9 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 9 states have internal predecessors, (16), 5 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) [2023-04-01 12:13:59,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 12:13:59,355 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2023-04-01 12:13:59,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-04-01 12:13:59,356 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 9 states have internal predecessors, (16), 5 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) Word has length 19 [2023-04-01 12:13:59,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 12:13:59,357 INFO L225 Difference]: With dead ends: 25 [2023-04-01 12:13:59,357 INFO L226 Difference]: Without dead ends: 21 [2023-04-01 12:13:59,357 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2023-04-01 12:13:59,358 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 18 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-01 12:13:59,358 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 36 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-01 12:13:59,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2023-04-01 12:13:59,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2023-04-01 12:13:59,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 13 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2023-04-01 12:13:59,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2023-04-01 12:13:59,362 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 19 [2023-04-01 12:13:59,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 12:13:59,362 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2023-04-01 12:13:59,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 9 states have internal predecessors, (16), 5 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) [2023-04-01 12:13:59,363 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2023-04-01 12:13:59,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-04-01 12:13:59,363 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 12:13:59,363 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 12:13:59,371 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-04-01 12:13:59,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 12:13:59,569 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 12:13:59,569 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 12:13:59,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1120086142, now seen corresponding path program 2 times [2023-04-01 12:13:59,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 12:13:59,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861359885] [2023-04-01 12:13:59,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 12:13:59,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 12:13:59,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 12:13:59,668 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-04-01 12:13:59,668 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 12:13:59,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861359885] [2023-04-01 12:13:59,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861359885] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 12:13:59,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1356833505] [2023-04-01 12:13:59,668 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-01 12:13:59,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 12:13:59,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 12:13:59,670 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 12:13:59,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-04-01 12:13:59,715 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-04-01 12:13:59,715 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 12:13:59,715 INFO L262 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 8 conjunts are in the unsatisfiable core [2023-04-01 12:13:59,717 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 12:13:59,745 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-04-01 12:13:59,745 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 12:13:59,947 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-04-01 12:13:59,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1356833505] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 12:13:59,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [960541880] [2023-04-01 12:13:59,949 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-04-01 12:13:59,949 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 12:13:59,949 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-01 12:13:59,950 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 12:13:59,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 9] total 11 [2023-04-01 12:13:59,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943585408] [2023-04-01 12:13:59,950 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 12:13:59,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-04-01 12:13:59,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 12:13:59,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-04-01 12:13:59,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2023-04-01 12:13:59,952 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 11 states have internal predecessors, (20), 6 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (7), 4 states have call predecessors, (7), 6 states have call successors, (7) [2023-04-01 12:13:59,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 12:13:59,993 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2023-04-01 12:13:59,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-04-01 12:13:59,994 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 11 states have internal predecessors, (20), 6 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (7), 4 states have call predecessors, (7), 6 states have call successors, (7) Word has length 25 [2023-04-01 12:13:59,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 12:13:59,994 INFO L225 Difference]: With dead ends: 28 [2023-04-01 12:13:59,994 INFO L226 Difference]: Without dead ends: 24 [2023-04-01 12:13:59,995 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 46 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2023-04-01 12:13:59,996 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 19 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-01 12:13:59,996 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 65 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-01 12:13:59,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-04-01 12:13:59,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2023-04-01 12:13:59,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 15 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2023-04-01 12:14:00,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2023-04-01 12:14:00,000 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 25 [2023-04-01 12:14:00,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 12:14:00,000 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2023-04-01 12:14:00,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 11 states have internal predecessors, (20), 6 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (7), 4 states have call predecessors, (7), 6 states have call successors, (7) [2023-04-01 12:14:00,000 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2023-04-01 12:14:00,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-04-01 12:14:00,001 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 12:14:00,001 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 12:14:00,008 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-04-01 12:14:00,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2023-04-01 12:14:00,206 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 12:14:00,207 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 12:14:00,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1112901744, now seen corresponding path program 3 times [2023-04-01 12:14:00,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 12:14:00,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260957784] [2023-04-01 12:14:00,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 12:14:00,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 12:14:00,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 12:14:00,380 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-04-01 12:14:00,381 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 12:14:00,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260957784] [2023-04-01 12:14:00,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260957784] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 12:14:00,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1349952635] [2023-04-01 12:14:00,385 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-04-01 12:14:00,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 12:14:00,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 12:14:00,386 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 12:14:00,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-04-01 12:14:00,444 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-04-01 12:14:00,444 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 12:14:00,445 INFO L262 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 10 conjunts are in the unsatisfiable core [2023-04-01 12:14:00,446 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 12:14:00,492 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-04-01 12:14:00,493 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 12:14:00,922 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-04-01 12:14:00,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1349952635] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 12:14:00,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2122190766] [2023-04-01 12:14:00,925 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-04-01 12:14:00,925 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 12:14:00,926 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-01 12:14:00,927 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 12:14:00,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 11] total 13 [2023-04-01 12:14:00,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319618150] [2023-04-01 12:14:00,927 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 12:14:00,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-04-01 12:14:00,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 12:14:00,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-04-01 12:14:00,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2023-04-01 12:14:00,933 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand has 13 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 13 states have internal predecessors, (24), 7 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) [2023-04-01 12:14:00,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 12:14:00,989 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2023-04-01 12:14:00,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-04-01 12:14:00,990 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 13 states have internal predecessors, (24), 7 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) Word has length 31 [2023-04-01 12:14:00,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 12:14:00,991 INFO L225 Difference]: With dead ends: 31 [2023-04-01 12:14:00,991 INFO L226 Difference]: Without dead ends: 27 [2023-04-01 12:14:00,992 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 57 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2023-04-01 12:14:00,994 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 24 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-01 12:14:00,997 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 68 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-01 12:14:01,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-04-01 12:14:01,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2023-04-01 12:14:01,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 16 states have (on average 1.0625) internal successors, (17), 17 states have internal predecessors, (17), 4 states have call successors, (4), 3 states have call predecessors, (4), 6 states have return successors, (7), 6 states have call predecessors, (7), 3 states have call successors, (7) [2023-04-01 12:14:01,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2023-04-01 12:14:01,004 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 31 [2023-04-01 12:14:01,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 12:14:01,004 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2023-04-01 12:14:01,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 13 states have internal predecessors, (24), 7 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) [2023-04-01 12:14:01,004 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2023-04-01 12:14:01,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-04-01 12:14:01,005 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 12:14:01,005 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 12:14:01,012 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-04-01 12:14:01,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 12:14:01,210 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 12:14:01,210 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 12:14:01,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1191603518, now seen corresponding path program 4 times [2023-04-01 12:14:01,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 12:14:01,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837096623] [2023-04-01 12:14:01,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 12:14:01,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 12:14:01,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 12:14:01,354 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-04-01 12:14:01,354 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 12:14:01,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837096623] [2023-04-01 12:14:01,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837096623] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 12:14:01,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [766848165] [2023-04-01 12:14:01,355 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-04-01 12:14:01,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 12:14:01,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 12:14:01,357 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 12:14:01,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-04-01 12:14:01,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 12:14:01,396 INFO L262 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 12 conjunts are in the unsatisfiable core [2023-04-01 12:14:01,397 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 12:14:01,444 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-04-01 12:14:01,444 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 12:14:01,960 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-04-01 12:14:01,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [766848165] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 12:14:01,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [428721854] [2023-04-01 12:14:01,963 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-04-01 12:14:01,963 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 12:14:01,963 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-01 12:14:01,963 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 12:14:01,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 13] total 15 [2023-04-01 12:14:01,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014599494] [2023-04-01 12:14:01,963 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 12:14:01,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-04-01 12:14:01,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 12:14:01,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-04-01 12:14:01,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2023-04-01 12:14:01,964 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand has 15 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 15 states have internal predecessors, (28), 8 states have call successors, (9), 1 states have call predecessors, (9), 6 states have return successors, (11), 6 states have call predecessors, (11), 8 states have call successors, (11) [2023-04-01 12:14:02,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 12:14:02,030 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2023-04-01 12:14:02,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-04-01 12:14:02,031 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 15 states have internal predecessors, (28), 8 states have call successors, (9), 1 states have call predecessors, (9), 6 states have return successors, (11), 6 states have call predecessors, (11), 8 states have call successors, (11) Word has length 37 [2023-04-01 12:14:02,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 12:14:02,031 INFO L225 Difference]: With dead ends: 34 [2023-04-01 12:14:02,031 INFO L226 Difference]: Without dead ends: 30 [2023-04-01 12:14:02,032 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 68 SyntacticMatches, 5 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=123, Invalid=257, Unknown=0, NotChecked=0, Total=380 [2023-04-01 12:14:02,032 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 39 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-01 12:14:02,032 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 76 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-01 12:14:02,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-04-01 12:14:02,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2023-04-01 12:14:02,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 19 states have internal predecessors, (19), 4 states have call successors, (4), 3 states have call predecessors, (4), 7 states have return successors, (8), 7 states have call predecessors, (8), 3 states have call successors, (8) [2023-04-01 12:14:02,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2023-04-01 12:14:02,035 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 37 [2023-04-01 12:14:02,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 12:14:02,036 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2023-04-01 12:14:02,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 15 states have internal predecessors, (28), 8 states have call successors, (9), 1 states have call predecessors, (9), 6 states have return successors, (11), 6 states have call predecessors, (11), 8 states have call successors, (11) [2023-04-01 12:14:02,036 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2023-04-01 12:14:02,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-04-01 12:14:02,036 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 12:14:02,037 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 12:14:02,043 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-04-01 12:14:02,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 12:14:02,244 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 12:14:02,244 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 12:14:02,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1606051536, now seen corresponding path program 5 times [2023-04-01 12:14:02,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 12:14:02,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642898166] [2023-04-01 12:14:02,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 12:14:02,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 12:14:02,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 12:14:02,401 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-04-01 12:14:02,401 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 12:14:02,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642898166] [2023-04-01 12:14:02,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642898166] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 12:14:02,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1068331942] [2023-04-01 12:14:02,402 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-01 12:14:02,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 12:14:02,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 12:14:02,425 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 12:14:02,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-04-01 12:14:02,552 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-04-01 12:14:02,552 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 12:14:02,553 INFO L262 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 14 conjunts are in the unsatisfiable core [2023-04-01 12:14:02,555 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 12:14:02,589 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-04-01 12:14:02,589 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 12:14:03,469 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-04-01 12:14:03,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1068331942] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 12:14:03,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1172829352] [2023-04-01 12:14:03,471 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-04-01 12:14:03,471 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 12:14:03,471 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-01 12:14:03,471 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 12:14:03,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 15] total 17 [2023-04-01 12:14:03,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027763473] [2023-04-01 12:14:03,472 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 12:14:03,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-04-01 12:14:03,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 12:14:03,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-04-01 12:14:03,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2023-04-01 12:14:03,473 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand has 17 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 17 states have internal predecessors, (32), 9 states have call successors, (10), 1 states have call predecessors, (10), 7 states have return successors, (13), 7 states have call predecessors, (13), 9 states have call successors, (13) [2023-04-01 12:14:03,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 12:14:03,557 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2023-04-01 12:14:03,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-04-01 12:14:03,561 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 17 states have internal predecessors, (32), 9 states have call successors, (10), 1 states have call predecessors, (10), 7 states have return successors, (13), 7 states have call predecessors, (13), 9 states have call successors, (13) Word has length 43 [2023-04-01 12:14:03,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 12:14:03,562 INFO L225 Difference]: With dead ends: 37 [2023-04-01 12:14:03,562 INFO L226 Difference]: Without dead ends: 33 [2023-04-01 12:14:03,562 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 79 SyntacticMatches, 6 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=164, Invalid=342, Unknown=0, NotChecked=0, Total=506 [2023-04-01 12:14:03,563 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 29 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-01 12:14:03,563 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 92 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-01 12:14:03,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-04-01 12:14:03,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2023-04-01 12:14:03,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 21 states have internal predecessors, (21), 4 states have call successors, (4), 3 states have call predecessors, (4), 8 states have return successors, (9), 8 states have call predecessors, (9), 3 states have call successors, (9) [2023-04-01 12:14:03,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2023-04-01 12:14:03,566 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 43 [2023-04-01 12:14:03,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 12:14:03,566 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2023-04-01 12:14:03,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 17 states have internal predecessors, (32), 9 states have call successors, (10), 1 states have call predecessors, (10), 7 states have return successors, (13), 7 states have call predecessors, (13), 9 states have call successors, (13) [2023-04-01 12:14:03,567 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2023-04-01 12:14:03,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-04-01 12:14:03,567 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 12:14:03,567 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 12:14:03,574 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-04-01 12:14:03,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 12:14:03,772 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 12:14:03,773 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 12:14:03,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1731550722, now seen corresponding path program 6 times [2023-04-01 12:14:03,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 12:14:03,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165349041] [2023-04-01 12:14:03,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 12:14:03,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 12:14:03,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 12:14:03,873 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2023-04-01 12:14:03,873 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 12:14:03,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165349041] [2023-04-01 12:14:03,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165349041] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 12:14:03,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1691214902] [2023-04-01 12:14:03,874 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-04-01 12:14:03,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 12:14:03,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 12:14:03,890 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 12:14:03,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-04-01 12:14:03,947 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-04-01 12:14:03,947 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 12:14:03,948 INFO L262 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 16 conjunts are in the unsatisfiable core [2023-04-01 12:14:03,949 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 12:14:03,987 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2023-04-01 12:14:03,987 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 12:14:05,153 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-04-01 12:14:05,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1691214902] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 12:14:05,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1489128070] [2023-04-01 12:14:05,154 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-04-01 12:14:05,154 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 12:14:05,154 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-01 12:14:05,155 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 12:14:05,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 17] total 19 [2023-04-01 12:14:05,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11932239] [2023-04-01 12:14:05,155 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 12:14:05,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-04-01 12:14:05,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 12:14:05,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-04-01 12:14:05,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2023-04-01 12:14:05,156 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand has 19 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 19 states have internal predecessors, (36), 10 states have call successors, (11), 1 states have call predecessors, (11), 8 states have return successors, (15), 8 states have call predecessors, (15), 10 states have call successors, (15) [2023-04-01 12:14:05,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 12:14:05,226 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2023-04-01 12:14:05,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-04-01 12:14:05,226 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 19 states have internal predecessors, (36), 10 states have call successors, (11), 1 states have call predecessors, (11), 8 states have return successors, (15), 8 states have call predecessors, (15), 10 states have call successors, (15) Word has length 49 [2023-04-01 12:14:05,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 12:14:05,227 INFO L225 Difference]: With dead ends: 40 [2023-04-01 12:14:05,227 INFO L226 Difference]: Without dead ends: 36 [2023-04-01 12:14:05,227 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 90 SyntacticMatches, 7 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=211, Invalid=439, Unknown=0, NotChecked=0, Total=650 [2023-04-01 12:14:05,228 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 34 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-01 12:14:05,228 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 81 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-01 12:14:05,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2023-04-01 12:14:05,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2023-04-01 12:14:05,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 23 states have internal predecessors, (23), 4 states have call successors, (4), 3 states have call predecessors, (4), 9 states have return successors, (10), 9 states have call predecessors, (10), 3 states have call successors, (10) [2023-04-01 12:14:05,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2023-04-01 12:14:05,231 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 49 [2023-04-01 12:14:05,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 12:14:05,231 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2023-04-01 12:14:05,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 19 states have internal predecessors, (36), 10 states have call successors, (11), 1 states have call predecessors, (11), 8 states have return successors, (15), 8 states have call predecessors, (15), 10 states have call successors, (15) [2023-04-01 12:14:05,231 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2023-04-01 12:14:05,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-04-01 12:14:05,232 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 12:14:05,232 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 12:14:05,246 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-04-01 12:14:05,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 12:14:05,437 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 12:14:05,438 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 12:14:05,438 INFO L85 PathProgramCache]: Analyzing trace with hash 488728080, now seen corresponding path program 7 times [2023-04-01 12:14:05,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 12:14:05,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141944381] [2023-04-01 12:14:05,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 12:14:05,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 12:14:05,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 12:14:05,588 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2023-04-01 12:14:05,588 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 12:14:05,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141944381] [2023-04-01 12:14:05,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141944381] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 12:14:05,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [982890613] [2023-04-01 12:14:05,588 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-04-01 12:14:05,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 12:14:05,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 12:14:05,589 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 12:14:05,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-04-01 12:14:05,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 12:14:05,669 INFO L262 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 18 conjunts are in the unsatisfiable core [2023-04-01 12:14:05,670 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 12:14:05,724 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2023-04-01 12:14:05,725 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 12:14:07,215 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-04-01 12:14:07,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [982890613] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 12:14:07,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019199058] [2023-04-01 12:14:07,216 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-04-01 12:14:07,216 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 12:14:07,216 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-01 12:14:07,217 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 12:14:07,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 19] total 21 [2023-04-01 12:14:07,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566766593] [2023-04-01 12:14:07,217 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 12:14:07,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-04-01 12:14:07,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 12:14:07,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-04-01 12:14:07,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2023-04-01 12:14:07,218 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand has 21 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 21 states have internal predecessors, (40), 11 states have call successors, (12), 1 states have call predecessors, (12), 9 states have return successors, (17), 9 states have call predecessors, (17), 11 states have call successors, (17) [2023-04-01 12:14:07,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 12:14:07,306 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2023-04-01 12:14:07,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-04-01 12:14:07,307 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 21 states have internal predecessors, (40), 11 states have call successors, (12), 1 states have call predecessors, (12), 9 states have return successors, (17), 9 states have call predecessors, (17), 11 states have call successors, (17) Word has length 55 [2023-04-01 12:14:07,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 12:14:07,308 INFO L225 Difference]: With dead ends: 43 [2023-04-01 12:14:07,308 INFO L226 Difference]: Without dead ends: 39 [2023-04-01 12:14:07,309 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 101 SyntacticMatches, 8 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=548, Unknown=0, NotChecked=0, Total=812 [2023-04-01 12:14:07,309 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 52 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-01 12:14:07,309 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 97 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-01 12:14:07,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-04-01 12:14:07,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2023-04-01 12:14:07,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 25 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 10 states have return successors, (11), 10 states have call predecessors, (11), 3 states have call successors, (11) [2023-04-01 12:14:07,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2023-04-01 12:14:07,312 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 55 [2023-04-01 12:14:07,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 12:14:07,313 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2023-04-01 12:14:07,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 21 states have internal predecessors, (40), 11 states have call successors, (12), 1 states have call predecessors, (12), 9 states have return successors, (17), 9 states have call predecessors, (17), 11 states have call successors, (17) [2023-04-01 12:14:07,313 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2023-04-01 12:14:07,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-04-01 12:14:07,313 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 12:14:07,313 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 12:14:07,322 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-04-01 12:14:07,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 12:14:07,523 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 12:14:07,523 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 12:14:07,523 INFO L85 PathProgramCache]: Analyzing trace with hash 677103294, now seen corresponding path program 8 times [2023-04-01 12:14:07,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 12:14:07,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069565043] [2023-04-01 12:14:07,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 12:14:07,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 12:14:07,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 12:14:07,670 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2023-04-01 12:14:07,670 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 12:14:07,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069565043] [2023-04-01 12:14:07,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069565043] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 12:14:07,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2068929995] [2023-04-01 12:14:07,670 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-01 12:14:07,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 12:14:07,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 12:14:07,699 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 12:14:07,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-04-01 12:14:07,795 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2023-04-01 12:14:07,796 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 12:14:07,796 INFO L262 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 20 conjunts are in the unsatisfiable core [2023-04-01 12:14:07,799 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 12:14:08,025 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2023-04-01 12:14:08,025 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 12:14:09,989 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2023-04-01 12:14:09,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2068929995] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 12:14:09,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [608357475] [2023-04-01 12:14:09,990 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-04-01 12:14:09,991 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 12:14:09,991 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-01 12:14:09,992 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 12:14:09,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 21, 21] total 51 [2023-04-01 12:14:09,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992996318] [2023-04-01 12:14:09,992 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 12:14:09,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2023-04-01 12:14:09,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 12:14:09,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2023-04-01 12:14:09,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=410, Invalid=2140, Unknown=0, NotChecked=0, Total=2550 [2023-04-01 12:14:09,994 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand has 51 states, 50 states have (on average 1.36) internal successors, (68), 33 states have internal predecessors, (68), 3 states have call successors, (6), 1 states have call predecessors, (6), 28 states have return successors, (28), 28 states have call predecessors, (28), 3 states have call successors, (28) [2023-04-01 12:14:10,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 12:14:10,735 INFO L93 Difference]: Finished difference Result 72 states and 81 transitions. [2023-04-01 12:14:10,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-04-01 12:14:10,735 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 1.36) internal successors, (68), 33 states have internal predecessors, (68), 3 states have call successors, (6), 1 states have call predecessors, (6), 28 states have return successors, (28), 28 states have call predecessors, (28), 3 states have call successors, (28) Word has length 61 [2023-04-01 12:14:10,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 12:14:10,736 INFO L225 Difference]: With dead ends: 72 [2023-04-01 12:14:10,736 INFO L226 Difference]: Without dead ends: 66 [2023-04-01 12:14:10,738 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1631 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1152, Invalid=6158, Unknown=0, NotChecked=0, Total=7310 [2023-04-01 12:14:10,739 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 40 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 12:14:10,739 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 169 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 12:14:10,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2023-04-01 12:14:10,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2023-04-01 12:14:10,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 43 states have internal predecessors, (43), 4 states have call successors, (4), 3 states have call predecessors, (4), 19 states have return successors, (20), 19 states have call predecessors, (20), 3 states have call successors, (20) [2023-04-01 12:14:10,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 67 transitions. [2023-04-01 12:14:10,744 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 67 transitions. Word has length 61 [2023-04-01 12:14:10,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 12:14:10,744 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 67 transitions. [2023-04-01 12:14:10,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 1.36) internal successors, (68), 33 states have internal predecessors, (68), 3 states have call successors, (6), 1 states have call predecessors, (6), 28 states have return successors, (28), 28 states have call predecessors, (28), 3 states have call successors, (28) [2023-04-01 12:14:10,752 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 67 transitions. [2023-04-01 12:14:10,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-04-01 12:14:10,756 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 12:14:10,756 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 12:14:10,762 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-04-01 12:14:10,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2023-04-01 12:14:10,962 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 12:14:10,963 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 12:14:10,963 INFO L85 PathProgramCache]: Analyzing trace with hash 2035962448, now seen corresponding path program 9 times [2023-04-01 12:14:10,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 12:14:10,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153035689] [2023-04-01 12:14:10,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 12:14:10,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 12:14:10,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 12:14:11,763 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2023-04-01 12:14:11,764 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 12:14:11,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153035689] [2023-04-01 12:14:11,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153035689] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 12:14:11,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [595293846] [2023-04-01 12:14:11,764 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-04-01 12:14:11,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 12:14:11,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 12:14:11,765 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 12:14:11,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-04-01 12:14:11,907 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-04-01 12:14:11,907 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 12:14:11,908 INFO L262 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 38 conjunts are in the unsatisfiable core [2023-04-01 12:14:11,910 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 12:14:12,040 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2023-04-01 12:14:12,041 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 12:14:27,835 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 731 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2023-04-01 12:14:27,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [595293846] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 12:14:27,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [457504102] [2023-04-01 12:14:27,836 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-04-01 12:14:27,836 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 12:14:27,837 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-01 12:14:27,837 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 12:14:27,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 39] total 41 [2023-04-01 12:14:27,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316051783] [2023-04-01 12:14:27,837 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 12:14:27,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-04-01 12:14:27,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 12:14:27,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-04-01 12:14:27,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=422, Invalid=1218, Unknown=0, NotChecked=0, Total=1640 [2023-04-01 12:14:27,839 INFO L87 Difference]: Start difference. First operand 66 states and 67 transitions. Second operand has 41 states, 39 states have (on average 2.051282051282051) internal successors, (80), 41 states have internal predecessors, (80), 21 states have call successors, (22), 1 states have call predecessors, (22), 19 states have return successors, (37), 19 states have call predecessors, (37), 21 states have call successors, (37) [2023-04-01 12:14:28,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 12:14:28,137 INFO L93 Difference]: Finished difference Result 73 states and 74 transitions. [2023-04-01 12:14:28,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-04-01 12:14:28,138 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 39 states have (on average 2.051282051282051) internal successors, (80), 41 states have internal predecessors, (80), 21 states have call successors, (22), 1 states have call predecessors, (22), 19 states have return successors, (37), 19 states have call predecessors, (37), 21 states have call successors, (37) Word has length 115 [2023-04-01 12:14:28,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 12:14:28,139 INFO L225 Difference]: With dead ends: 73 [2023-04-01 12:14:28,139 INFO L226 Difference]: Without dead ends: 69 [2023-04-01 12:14:28,140 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 211 SyntacticMatches, 18 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 954 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1124, Invalid=2298, Unknown=0, NotChecked=0, Total=3422 [2023-04-01 12:14:28,140 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 203 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 12:14:28,140 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 200 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 12:14:28,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2023-04-01 12:14:28,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2023-04-01 12:14:28,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 45 states have internal predecessors, (45), 4 states have call successors, (4), 3 states have call predecessors, (4), 20 states have return successors, (21), 20 states have call predecessors, (21), 3 states have call successors, (21) [2023-04-01 12:14:28,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2023-04-01 12:14:28,147 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 115 [2023-04-01 12:14:28,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 12:14:28,147 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2023-04-01 12:14:28,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 39 states have (on average 2.051282051282051) internal successors, (80), 41 states have internal predecessors, (80), 21 states have call successors, (22), 1 states have call predecessors, (22), 19 states have return successors, (37), 19 states have call predecessors, (37), 21 states have call successors, (37) [2023-04-01 12:14:28,147 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2023-04-01 12:14:28,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-04-01 12:14:28,148 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 12:14:28,148 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 12:14:28,171 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-04-01 12:14:28,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-04-01 12:14:28,349 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 12:14:28,349 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 12:14:28,349 INFO L85 PathProgramCache]: Analyzing trace with hash -107508098, now seen corresponding path program 10 times [2023-04-01 12:14:28,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 12:14:28,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612544502] [2023-04-01 12:14:28,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 12:14:28,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 12:14:28,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 12:14:28,770 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2023-04-01 12:14:28,770 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 12:14:28,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612544502] [2023-04-01 12:14:28,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612544502] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 12:14:28,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [230501178] [2023-04-01 12:14:28,771 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-04-01 12:14:28,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 12:14:28,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 12:14:28,785 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 12:14:28,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-04-01 12:14:29,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 12:14:29,248 INFO L262 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 40 conjunts are in the unsatisfiable core [2023-04-01 12:14:29,250 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 12:14:29,340 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2023-04-01 12:14:29,340 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 12:14:46,668 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 819 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2023-04-01 12:14:46,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [230501178] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 12:14:46,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1535103843] [2023-04-01 12:14:46,669 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-04-01 12:14:46,669 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 12:14:46,669 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-01 12:14:46,669 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 12:14:46,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 41] total 43 [2023-04-01 12:14:46,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522450474] [2023-04-01 12:14:46,670 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 12:14:46,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-04-01 12:14:46,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 12:14:46,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-04-01 12:14:46,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=464, Invalid=1342, Unknown=0, NotChecked=0, Total=1806 [2023-04-01 12:14:46,672 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand has 43 states, 41 states have (on average 2.048780487804878) internal successors, (84), 43 states have internal predecessors, (84), 22 states have call successors, (23), 1 states have call predecessors, (23), 20 states have return successors, (39), 20 states have call predecessors, (39), 22 states have call successors, (39) [2023-04-01 12:14:46,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 12:14:46,944 INFO L93 Difference]: Finished difference Result 76 states and 77 transitions. [2023-04-01 12:14:46,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-04-01 12:14:46,944 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 41 states have (on average 2.048780487804878) internal successors, (84), 43 states have internal predecessors, (84), 22 states have call successors, (23), 1 states have call predecessors, (23), 20 states have return successors, (39), 20 states have call predecessors, (39), 22 states have call successors, (39) Word has length 121 [2023-04-01 12:14:46,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 12:14:46,945 INFO L225 Difference]: With dead ends: 76 [2023-04-01 12:14:46,945 INFO L226 Difference]: Without dead ends: 72 [2023-04-01 12:14:46,946 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 222 SyntacticMatches, 19 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1064 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1243, Invalid=2539, Unknown=0, NotChecked=0, Total=3782 [2023-04-01 12:14:46,946 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 270 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 12:14:46,946 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 196 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 12:14:46,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2023-04-01 12:14:46,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2023-04-01 12:14:46,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 47 states have internal predecessors, (47), 4 states have call successors, (4), 3 states have call predecessors, (4), 21 states have return successors, (22), 21 states have call predecessors, (22), 3 states have call successors, (22) [2023-04-01 12:14:46,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2023-04-01 12:14:46,956 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 121 [2023-04-01 12:14:46,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 12:14:46,956 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2023-04-01 12:14:46,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 41 states have (on average 2.048780487804878) internal successors, (84), 43 states have internal predecessors, (84), 22 states have call successors, (23), 1 states have call predecessors, (23), 20 states have return successors, (39), 20 states have call predecessors, (39), 22 states have call successors, (39) [2023-04-01 12:14:46,957 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2023-04-01 12:14:46,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2023-04-01 12:14:46,957 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 12:14:46,958 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 12:14:46,972 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-04-01 12:14:47,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-04-01 12:14:47,164 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 12:14:47,164 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 12:14:47,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1427091856, now seen corresponding path program 11 times [2023-04-01 12:14:47,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 12:14:47,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218038409] [2023-04-01 12:14:47,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 12:14:47,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 12:14:47,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 12:14:47,648 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2023-04-01 12:14:47,648 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 12:14:47,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218038409] [2023-04-01 12:14:47,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218038409] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 12:14:47,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [462565043] [2023-04-01 12:14:47,648 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-01 12:14:47,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 12:14:47,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 12:14:47,653 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 12:14:47,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-04-01 12:14:48,320 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2023-04-01 12:14:48,320 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 12:14:48,321 INFO L262 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 42 conjunts are in the unsatisfiable core [2023-04-01 12:14:48,323 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 12:14:49,088 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2023-04-01 12:14:49,089 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 12:15:04,671 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2023-04-01 12:15:04,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [462565043] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 12:15:04,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [567577623] [2023-04-01 12:15:04,674 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-04-01 12:15:04,674 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 12:15:04,674 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-01 12:15:04,674 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 12:15:04,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 43, 43] total 77 [2023-04-01 12:15:04,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654088048] [2023-04-01 12:15:04,675 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 12:15:04,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2023-04-01 12:15:04,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 12:15:04,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2023-04-01 12:15:04,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=919, Invalid=4933, Unknown=0, NotChecked=0, Total=5852 [2023-04-01 12:15:04,679 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand has 77 states, 76 states have (on average 1.381578947368421) internal successors, (105), 51 states have internal predecessors, (105), 3 states have call successors, (6), 1 states have call predecessors, (6), 46 states have return successors, (47), 47 states have call predecessors, (47), 3 states have call successors, (47) [2023-04-01 12:15:05,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 12:15:05,777 INFO L93 Difference]: Finished difference Result 96 states and 102 transitions. [2023-04-01 12:15:05,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2023-04-01 12:15:05,777 INFO L78 Accepts]: Start accepts. Automaton has has 77 states, 76 states have (on average 1.381578947368421) internal successors, (105), 51 states have internal predecessors, (105), 3 states have call successors, (6), 1 states have call predecessors, (6), 46 states have return successors, (47), 47 states have call predecessors, (47), 3 states have call successors, (47) Word has length 127 [2023-04-01 12:15:05,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 12:15:05,778 INFO L225 Difference]: With dead ends: 96 [2023-04-01 12:15:05,778 INFO L226 Difference]: Without dead ends: 90 [2023-04-01 12:15:05,781 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 192 SyntacticMatches, 29 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4816 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2675, Invalid=13581, Unknown=0, NotChecked=0, Total=16256 [2023-04-01 12:15:05,782 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 56 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 12:15:05,782 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 180 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 12:15:05,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2023-04-01 12:15:05,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2023-04-01 12:15:05,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 58 states have (on average 1.0172413793103448) internal successors, (59), 59 states have internal predecessors, (59), 4 states have call successors, (4), 3 states have call predecessors, (4), 27 states have return successors, (28), 27 states have call predecessors, (28), 3 states have call successors, (28) [2023-04-01 12:15:05,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 91 transitions. [2023-04-01 12:15:05,787 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 91 transitions. Word has length 127 [2023-04-01 12:15:05,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 12:15:05,787 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 91 transitions. [2023-04-01 12:15:05,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 77 states, 76 states have (on average 1.381578947368421) internal successors, (105), 51 states have internal predecessors, (105), 3 states have call successors, (6), 1 states have call predecessors, (6), 46 states have return successors, (47), 47 states have call predecessors, (47), 3 states have call successors, (47) [2023-04-01 12:15:05,787 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 91 transitions. [2023-04-01 12:15:05,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2023-04-01 12:15:05,788 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 12:15:05,788 INFO L195 NwaCegarLoop]: trace histogram [26, 26, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 12:15:05,796 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-04-01 12:15:05,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-04-01 12:15:05,996 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 12:15:05,996 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 12:15:05,997 INFO L85 PathProgramCache]: Analyzing trace with hash 445787984, now seen corresponding path program 12 times [2023-04-01 12:15:05,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 12:15:05,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320797391] [2023-04-01 12:15:05,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 12:15:05,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 12:15:06,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-04-01 12:15:06,033 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-04-01 12:15:06,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-04-01 12:15:06,079 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2023-04-01 12:15:06,079 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-04-01 12:15:06,080 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-04-01 12:15:06,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-04-01 12:15:06,083 INFO L445 BasicCegarLoop]: Path program histogram: [12, 1] [2023-04-01 12:15:06,085 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-04-01 12:15:06,107 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.04 12:15:06 BoogieIcfgContainer [2023-04-01 12:15:06,107 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-04-01 12:15:06,107 INFO L158 Benchmark]: Toolchain (without parser) took 68004.11ms. Allocated memory was 296.7MB in the beginning and 725.6MB in the end (delta: 428.9MB). Free memory was 255.7MB in the beginning and 323.7MB in the end (delta: -68.0MB). Peak memory consumption was 362.3MB. Max. memory is 8.0GB. [2023-04-01 12:15:06,108 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 182.5MB. Free memory is still 131.1MB. There was no memory consumed. Max. memory is 8.0GB. [2023-04-01 12:15:06,108 INFO L158 Benchmark]: CACSL2BoogieTranslator took 155.87ms. Allocated memory is still 296.7MB. Free memory was 255.7MB in the beginning and 245.7MB in the end (delta: 9.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-04-01 12:15:06,108 INFO L158 Benchmark]: Boogie Preprocessor took 22.00ms. Allocated memory is still 296.7MB. Free memory was 245.7MB in the beginning and 244.3MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-04-01 12:15:06,108 INFO L158 Benchmark]: RCFGBuilder took 252.55ms. Allocated memory is still 296.7MB. Free memory was 244.3MB in the beginning and 234.5MB in the end (delta: 9.8MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2023-04-01 12:15:06,108 INFO L158 Benchmark]: TraceAbstraction took 67567.58ms. Allocated memory was 296.7MB in the beginning and 725.6MB in the end (delta: 428.9MB). Free memory was 233.8MB in the beginning and 323.7MB in the end (delta: -89.8MB). Peak memory consumption was 340.2MB. Max. memory is 8.0GB. [2023-04-01 12:15:06,109 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 182.5MB. Free memory is still 131.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 155.87ms. Allocated memory is still 296.7MB. Free memory was 255.7MB in the beginning and 245.7MB in the end (delta: 9.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 22.00ms. Allocated memory is still 296.7MB. Free memory was 245.7MB in the beginning and 244.3MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 252.55ms. Allocated memory is still 296.7MB. Free memory was 244.3MB in the beginning and 234.5MB in the end (delta: 9.8MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * TraceAbstraction took 67567.58ms. Allocated memory was 296.7MB in the beginning and 725.6MB in the end (delta: 428.9MB). Free memory was 233.8MB in the beginning and 323.7MB in the end (delta: -89.8MB). Peak memory consumption was 340.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 15]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L12] int input = 25; VAL [input=25] [L13] CALL, EXPR id(input) VAL [\old(x)=25] [L7] COND FALSE !(x==0) VAL [\old(x)=25, x=25] [L8] CALL, EXPR id(x-1) VAL [\old(x)=24] [L7] COND FALSE !(x==0) VAL [\old(x)=24, x=24] [L8] CALL, EXPR id(x-1) VAL [\old(x)=23] [L7] COND FALSE !(x==0) VAL [\old(x)=23, x=23] [L8] CALL, EXPR id(x-1) VAL [\old(x)=22] [L7] COND FALSE !(x==0) VAL [\old(x)=22, x=22] [L8] CALL, EXPR id(x-1) VAL [\old(x)=21] [L7] COND FALSE !(x==0) VAL [\old(x)=21, x=21] [L8] CALL, EXPR id(x-1) VAL [\old(x)=20] [L7] COND FALSE !(x==0) VAL [\old(x)=20, x=20] [L8] CALL, EXPR id(x-1) VAL [\old(x)=19] [L7] COND FALSE !(x==0) VAL [\old(x)=19, x=19] [L8] CALL, EXPR id(x-1) VAL [\old(x)=18] [L7] COND FALSE !(x==0) VAL [\old(x)=18, x=18] [L8] CALL, EXPR id(x-1) VAL [\old(x)=17] [L7] COND FALSE !(x==0) VAL [\old(x)=17, x=17] [L8] CALL, EXPR id(x-1) VAL [\old(x)=16] [L7] COND FALSE !(x==0) VAL [\old(x)=16, x=16] [L8] CALL, EXPR id(x-1) VAL [\old(x)=15] [L7] COND FALSE !(x==0) VAL [\old(x)=15, x=15] [L8] CALL, EXPR id(x-1) VAL [\old(x)=14] [L7] COND FALSE !(x==0) VAL [\old(x)=14, x=14] [L8] CALL, EXPR id(x-1) VAL [\old(x)=13] [L7] COND FALSE !(x==0) VAL [\old(x)=13, x=13] [L8] CALL, EXPR id(x-1) VAL [\old(x)=12] [L7] COND FALSE !(x==0) VAL [\old(x)=12, x=12] [L8] CALL, EXPR id(x-1) VAL [\old(x)=11] [L7] COND FALSE !(x==0) VAL [\old(x)=11, x=11] [L8] CALL, EXPR id(x-1) VAL [\old(x)=10] [L7] COND FALSE !(x==0) VAL [\old(x)=10, x=10] [L8] CALL, EXPR id(x-1) VAL [\old(x)=9] [L7] COND FALSE !(x==0) VAL [\old(x)=9, x=9] [L8] CALL, EXPR id(x-1) VAL [\old(x)=8] [L7] COND FALSE !(x==0) VAL [\old(x)=8, x=8] [L8] CALL, EXPR id(x-1) VAL [\old(x)=7] [L7] COND FALSE !(x==0) VAL [\old(x)=7, x=7] [L8] CALL, EXPR id(x-1) VAL [\old(x)=6] [L7] COND FALSE !(x==0) VAL [\old(x)=6, x=6] [L8] CALL, EXPR id(x-1) VAL [\old(x)=5] [L7] COND FALSE !(x==0) VAL [\old(x)=5, x=5] [L8] CALL, EXPR id(x-1) VAL [\old(x)=4] [L7] COND FALSE !(x==0) VAL [\old(x)=4, x=4] [L8] CALL, EXPR id(x-1) VAL [\old(x)=3] [L7] COND FALSE !(x==0) VAL [\old(x)=3, x=3] [L8] CALL, EXPR id(x-1) VAL [\old(x)=2] [L7] COND FALSE !(x==0) VAL [\old(x)=2, x=2] [L8] CALL, EXPR id(x-1) VAL [\old(x)=1] [L7] COND FALSE !(x==0) VAL [\old(x)=1, x=1] [L8] CALL, EXPR id(x-1) VAL [\old(x)=0] [L7] COND TRUE x==0 [L7] return 0; VAL [\old(x)=0, \result=0, x=0] [L8] RET, EXPR id(x-1) VAL [\old(x)=1, id(x-1)=0, x=1] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=2, id(x-1)=1, x=2] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=3, id(x-1)=2, x=3] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=4, id(x-1)=3, x=4] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=5, id(x-1)=4, x=5] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=6, id(x-1)=5, x=6] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=7, id(x-1)=6, x=7] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=8, id(x-1)=7, x=8] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=9, id(x-1)=8, x=9] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=10, id(x-1)=9, x=10] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=11, id(x-1)=10, x=11] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=12, id(x-1)=11, x=12] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=13, id(x-1)=12, x=13] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=14, id(x-1)=13, x=14] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=15, id(x-1)=14, x=15] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=16, id(x-1)=15, x=16] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=17, id(x-1)=16, x=17] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=18, id(x-1)=17, x=18] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=19, id(x-1)=18, x=19] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=20, id(x-1)=19, x=20] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=21, id(x-1)=20, x=21] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=22, id(x-1)=21, x=22] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=23, id(x-1)=22, x=23] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=24, id(x-1)=23, x=24] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=25, id(x-1)=24, x=25] [L8] return id(x-1) + 1; [L13] RET, EXPR id(input) VAL [id(input)=25, input=25] [L13] int result = id(input); [L14] COND TRUE result == 25 VAL [input=25, result=25] [L15] reach_error() VAL [input=25, result=25] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 22 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 67.5s, OverallIterations: 13, TraceHistogramMax: 26, PathProgramHistogramMax: 12, EmptinessCheckTime: 0.0s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 935 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 786 mSDsluCounter, 1327 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1181 mSDsCounter, 282 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1011 IncrementalHoareTripleChecker+Invalid, 1293 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 282 mSolverCounterUnsat, 146 mSDtfsCounter, 1011 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1753 GetRequests, 1196 SyntacticMatches, 101 SemanticMatches, 456 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9039 ImplicationChecksByTransitivity, 6.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=90occurred in iteration=12, InterpolantAutomatonStates: 207, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 59.7s InterpolantComputationTime, 1542 NumberOfCodeBlocks, 1542 NumberOfCodeBlocksAsserted, 61 NumberOfCheckSat, 2028 ConstructedInterpolants, 0 QuantifiedInterpolants, 5324 SizeOfPredicates, 72 NumberOfNonLiveVariables, 1920 ConjunctsInSsa, 224 ConjunctsInUnsatCore, 34 InterpolantComputations, 1 PerfectInterpolantSequences, 4683/10872 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-04-01 12:15:06,149 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...