/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 OctagonDomain -i ../sv-benchmarks/c/recursive-simple/fibo_25-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-f954360 [2023-04-01 06:05:25,889 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-04-01 06:05:25,891 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-04-01 06:05:25,913 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-04-01 06:05:25,914 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-04-01 06:05:25,915 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-04-01 06:05:25,916 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-04-01 06:05:25,917 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-04-01 06:05:25,918 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-04-01 06:05:25,919 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-04-01 06:05:25,920 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-04-01 06:05:25,921 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-04-01 06:05:25,921 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-04-01 06:05:25,922 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-04-01 06:05:25,922 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-04-01 06:05:25,923 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-04-01 06:05:25,924 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-04-01 06:05:25,925 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-04-01 06:05:25,926 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-04-01 06:05:25,927 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-04-01 06:05:25,929 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-04-01 06:05:25,930 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-04-01 06:05:25,931 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-04-01 06:05:25,931 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-04-01 06:05:25,934 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-04-01 06:05:25,935 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-04-01 06:05:25,935 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-04-01 06:05:25,936 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-04-01 06:05:25,936 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-04-01 06:05:25,937 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-04-01 06:05:25,937 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-04-01 06:05:25,938 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-04-01 06:05:25,939 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-04-01 06:05:25,939 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-04-01 06:05:25,940 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-04-01 06:05:25,940 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-04-01 06:05:25,941 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-04-01 06:05:25,941 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-04-01 06:05:25,941 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-04-01 06:05:25,942 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-04-01 06:05:25,943 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-04-01 06:05:25,944 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 06:05:25,963 INFO L113 SettingsManager]: Loading preferences was successful [2023-04-01 06:05:25,964 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-04-01 06:05:25,964 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-04-01 06:05:25,964 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-04-01 06:05:25,965 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-04-01 06:05:25,965 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-04-01 06:05:25,965 INFO L138 SettingsManager]: * User list type=DISABLED [2023-04-01 06:05:25,965 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-04-01 06:05:25,966 INFO L138 SettingsManager]: * Explicit value domain=true [2023-04-01 06:05:25,966 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-04-01 06:05:25,966 INFO L138 SettingsManager]: * Octagon Domain=false [2023-04-01 06:05:25,966 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2023-04-01 06:05:25,966 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-04-01 06:05:25,966 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-04-01 06:05:25,966 INFO L138 SettingsManager]: * Interval Domain=false [2023-04-01 06:05:25,967 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-04-01 06:05:25,967 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-04-01 06:05:25,967 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2023-04-01 06:05:25,968 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-04-01 06:05:25,968 INFO L138 SettingsManager]: * sizeof long=4 [2023-04-01 06:05:25,968 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-04-01 06:05:25,968 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-04-01 06:05:25,968 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-04-01 06:05:25,968 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-04-01 06:05:25,969 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-04-01 06:05:25,969 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-04-01 06:05:25,969 INFO L138 SettingsManager]: * sizeof long double=12 [2023-04-01 06:05:25,969 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-04-01 06:05:25,969 INFO L138 SettingsManager]: * Use constant arrays=true [2023-04-01 06:05:25,969 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-04-01 06:05:25,970 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-04-01 06:05:25,970 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-04-01 06:05:25,970 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-01 06:05:25,970 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-04-01 06:05:25,970 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2023-04-01 06:05:25,970 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-04-01 06:05:25,971 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-04-01 06:05:25,971 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-04-01 06:05:25,971 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-04-01 06:05:25,971 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-04-01 06:05:25,971 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-04-01 06:05:25,971 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 -> OctagonDomain [2023-04-01 06:05:26,203 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-04-01 06:05:26,227 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-04-01 06:05:26,229 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-04-01 06:05:26,230 INFO L271 PluginConnector]: Initializing CDTParser... [2023-04-01 06:05:26,231 INFO L275 PluginConnector]: CDTParser initialized [2023-04-01 06:05:26,232 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/fibo_25-1.c [2023-04-01 06:05:27,407 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-04-01 06:05:27,635 INFO L351 CDTParser]: Found 1 translation units. [2023-04-01 06:05:27,636 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_25-1.c [2023-04-01 06:05:27,642 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b34d1a214/bc610ae29d4144b28d85cc532972ac6c/FLAGc5250c150 [2023-04-01 06:05:28,036 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b34d1a214/bc610ae29d4144b28d85cc532972ac6c [2023-04-01 06:05:28,038 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-04-01 06:05:28,039 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2023-04-01 06:05:28,040 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-04-01 06:05:28,040 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-04-01 06:05:28,043 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-04-01 06:05:28,043 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.04 06:05:28" (1/1) ... [2023-04-01 06:05:28,045 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68337eae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 06:05:28, skipping insertion in model container [2023-04-01 06:05:28,045 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.04 06:05:28" (1/1) ... [2023-04-01 06:05:28,051 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-04-01 06:05:28,065 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-04-01 06:05:28,184 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/fibo_25-1.c[746,759] [2023-04-01 06:05:28,188 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-01 06:05:28,196 INFO L203 MainTranslator]: Completed pre-run [2023-04-01 06:05:28,209 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/fibo_25-1.c[746,759] [2023-04-01 06:05:28,209 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-01 06:05:28,221 INFO L208 MainTranslator]: Completed translation [2023-04-01 06:05:28,221 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 06:05:28 WrapperNode [2023-04-01 06:05:28,221 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-04-01 06:05:28,222 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-04-01 06:05:28,222 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-04-01 06:05:28,222 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-04-01 06:05:28,230 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 06:05:28" (1/1) ... [2023-04-01 06:05:28,231 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 06:05:28" (1/1) ... [2023-04-01 06:05:28,235 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 06:05:28" (1/1) ... [2023-04-01 06:05:28,236 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 06:05:28" (1/1) ... [2023-04-01 06:05:28,239 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 06:05:28" (1/1) ... [2023-04-01 06:05:28,240 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 06:05:28" (1/1) ... [2023-04-01 06:05:28,241 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 06:05:28" (1/1) ... [2023-04-01 06:05:28,242 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 06:05:28" (1/1) ... [2023-04-01 06:05:28,243 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-04-01 06:05:28,244 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-04-01 06:05:28,244 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-04-01 06:05:28,244 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-04-01 06:05:28,245 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 06:05:28" (1/1) ... [2023-04-01 06:05:28,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-01 06:05:28,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 06:05:28,274 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 06:05:28,293 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 06:05:28,308 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2023-04-01 06:05:28,309 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-04-01 06:05:28,309 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-04-01 06:05:28,309 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2023-04-01 06:05:28,309 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2023-04-01 06:05:28,309 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2023-04-01 06:05:28,309 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2023-04-01 06:05:28,309 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2023-04-01 06:05:28,310 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-04-01 06:05:28,310 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-04-01 06:05:28,310 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2023-04-01 06:05:28,310 INFO L130 BoogieDeclarations]: Found specification of procedure main [2023-04-01 06:05:28,310 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2023-04-01 06:05:28,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-04-01 06:05:28,310 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-04-01 06:05:28,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-04-01 06:05:28,310 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-04-01 06:05:28,310 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-04-01 06:05:28,366 INFO L236 CfgBuilder]: Building ICFG [2023-04-01 06:05:28,367 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-04-01 06:05:28,444 INFO L277 CfgBuilder]: Performing block encoding [2023-04-01 06:05:28,459 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-04-01 06:05:28,459 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-04-01 06:05:28,461 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.04 06:05:28 BoogieIcfgContainer [2023-04-01 06:05:28,461 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-04-01 06:05:28,463 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-04-01 06:05:28,463 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-04-01 06:05:28,466 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-04-01 06:05:28,466 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.04 06:05:28" (1/3) ... [2023-04-01 06:05:28,467 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5221e42b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.04 06:05:28, skipping insertion in model container [2023-04-01 06:05:28,467 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 06:05:28" (2/3) ... [2023-04-01 06:05:28,467 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5221e42b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.04 06:05:28, skipping insertion in model container [2023-04-01 06:05:28,467 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.04 06:05:28" (3/3) ... [2023-04-01 06:05:28,468 INFO L112 eAbstractionObserver]: Analyzing ICFG fibo_25-1.c [2023-04-01 06:05:28,484 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-04-01 06:05:28,484 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-04-01 06:05:28,525 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-04-01 06:05:28,530 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;@289bf13f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-04-01 06:05:28,531 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-04-01 06:05:28,534 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-04-01 06:05:28,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-04-01 06:05:28,541 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 06:05:28,541 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 06:05:28,542 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 06:05:28,546 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 06:05:28,546 INFO L85 PathProgramCache]: Analyzing trace with hash -207187148, now seen corresponding path program 1 times [2023-04-01 06:05:28,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 06:05:28,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268454578] [2023-04-01 06:05:28,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 06:05:28,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 06:05:28,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 06:05:28,835 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 06:05:28,835 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 06:05:28,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268454578] [2023-04-01 06:05:28,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268454578] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 06:05:28,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-01 06:05:28,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-04-01 06:05:28,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459010254] [2023-04-01 06:05:28,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 06:05:28,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-04-01 06:05:28,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 06:05:28,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-04-01 06:05:28,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-04-01 06:05:28,886 INFO L87 Difference]: Start difference. First operand has 23 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) 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 06:05:28,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 06:05:28,961 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2023-04-01 06:05:28,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-04-01 06:05:28,964 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 06:05:28,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 06:05:28,970 INFO L225 Difference]: With dead ends: 35 [2023-04-01 06:05:28,971 INFO L226 Difference]: Without dead ends: 21 [2023-04-01 06:05:28,974 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 06:05:28,979 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 2 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-01 06:05:28,980 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 81 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-01 06:05:28,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2023-04-01 06:05:29,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2023-04-01 06:05:29,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-04-01 06:05:29,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2023-04-01 06:05:29,008 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 13 [2023-04-01 06:05:29,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 06:05:29,008 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2023-04-01 06:05:29,008 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 06:05:29,009 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2023-04-01 06:05:29,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-04-01 06:05:29,010 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 06:05:29,010 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 06:05:29,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-04-01 06:05:29,011 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 06:05:29,011 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 06:05:29,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1413002183, now seen corresponding path program 1 times [2023-04-01 06:05:29,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 06:05:29,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126572639] [2023-04-01 06:05:29,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 06:05:29,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 06:05:29,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 06:05:29,084 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 06:05:29,085 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 06:05:29,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126572639] [2023-04-01 06:05:29,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126572639] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 06:05:29,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-01 06:05:29,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-04-01 06:05:29,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295342618] [2023-04-01 06:05:29,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 06:05:29,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-04-01 06:05:29,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 06:05:29,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-04-01 06:05:29,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-04-01 06:05:29,088 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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 06:05:29,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 06:05:29,119 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2023-04-01 06:05:29,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-04-01 06:05:29,120 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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 14 [2023-04-01 06:05:29,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 06:05:29,121 INFO L225 Difference]: With dead ends: 27 [2023-04-01 06:05:29,121 INFO L226 Difference]: Without dead ends: 23 [2023-04-01 06:05:29,122 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 06:05:29,123 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-01 06:05:29,124 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 84 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-01 06:05:29,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-04-01 06:05:29,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2023-04-01 06:05:29,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-04-01 06:05:29,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2023-04-01 06:05:29,130 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2023-04-01 06:05:29,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 06:05:29,131 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2023-04-01 06:05:29,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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 06:05:29,131 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2023-04-01 06:05:29,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-04-01 06:05:29,132 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 06:05:29,132 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 06:05:29,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-04-01 06:05:29,133 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 06:05:29,133 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 06:05:29,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1852803964, now seen corresponding path program 1 times [2023-04-01 06:05:29,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 06:05:29,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215195310] [2023-04-01 06:05:29,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 06:05:29,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 06:05:29,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 06:05:29,315 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-04-01 06:05:29,316 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 06:05:29,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215195310] [2023-04-01 06:05:29,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215195310] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 06:05:29,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [462920056] [2023-04-01 06:05:29,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 06:05:29,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 06:05:29,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 06:05:29,323 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 06:05:29,325 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 06:05:29,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 06:05:29,391 INFO L262 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 6 conjunts are in the unsatisfiable core [2023-04-01 06:05:29,397 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 06:05:29,515 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-04-01 06:05:29,515 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 06:05:29,725 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-04-01 06:05:29,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [462920056] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 06:05:29,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [778137152] [2023-04-01 06:05:29,757 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2023-04-01 06:05:29,757 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 06:05:29,761 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 06:05:29,765 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 06:05:29,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 11 [2023-04-01 06:05:29,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657793100] [2023-04-01 06:05:29,766 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 06:05:29,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-04-01 06:05:29,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 06:05:29,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-04-01 06:05:29,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2023-04-01 06:05:29,771 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 11 states, 8 states have (on average 3.5) internal successors, (28), 11 states have internal predecessors, (28), 8 states have call successors, (10), 1 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 8 states have call successors, (9) [2023-04-01 06:05:29,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 06:05:29,914 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2023-04-01 06:05:29,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-04-01 06:05:29,915 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 3.5) internal successors, (28), 11 states have internal predecessors, (28), 8 states have call successors, (10), 1 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 8 states have call successors, (9) Word has length 26 [2023-04-01 06:05:29,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 06:05:29,918 INFO L225 Difference]: With dead ends: 38 [2023-04-01 06:05:29,918 INFO L226 Difference]: Without dead ends: 23 [2023-04-01 06:05:29,919 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2023-04-01 06:05:29,922 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 24 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 06:05:29,924 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 65 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 06:05:29,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-04-01 06:05:29,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2023-04-01 06:05:29,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 15 states have internal predecessors, (15), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2023-04-01 06:05:29,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2023-04-01 06:05:29,942 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 26 [2023-04-01 06:05:29,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 06:05:29,942 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2023-04-01 06:05:29,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 3.5) internal successors, (28), 11 states have internal predecessors, (28), 8 states have call successors, (10), 1 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 8 states have call successors, (9) [2023-04-01 06:05:29,943 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2023-04-01 06:05:29,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-04-01 06:05:29,944 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 06:05:29,944 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 06:05:29,954 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 06:05:30,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 06:05:30,151 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 06:05:30,152 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 06:05:30,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1799377537, now seen corresponding path program 1 times [2023-04-01 06:05:30,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 06:05:30,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817791878] [2023-04-01 06:05:30,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 06:05:30,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 06:05:30,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 06:05:30,241 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-04-01 06:05:30,241 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 06:05:30,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817791878] [2023-04-01 06:05:30,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817791878] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 06:05:30,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1602238974] [2023-04-01 06:05:30,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 06:05:30,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 06:05:30,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 06:05:30,244 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 06:05:30,269 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 06:05:30,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 06:05:30,300 INFO L262 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 6 conjunts are in the unsatisfiable core [2023-04-01 06:05:30,308 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 06:05:30,369 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-04-01 06:05:30,370 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 06:05:30,558 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-04-01 06:05:30,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1602238974] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 06:05:30,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [865128088] [2023-04-01 06:05:30,561 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2023-04-01 06:05:30,561 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 06:05:30,561 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 06:05:30,562 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 06:05:30,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 9 [2023-04-01 06:05:30,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694883124] [2023-04-01 06:05:30,562 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 06:05:30,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-04-01 06:05:30,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 06:05:30,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-04-01 06:05:30,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-04-01 06:05:30,564 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 9 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 9 states have internal predecessors, (23), 6 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 6 states have call successors, (6) [2023-04-01 06:05:30,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 06:05:30,631 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2023-04-01 06:05:30,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-04-01 06:05:30,632 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 9 states have internal predecessors, (23), 6 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 6 states have call successors, (6) Word has length 27 [2023-04-01 06:05:30,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 06:05:30,635 INFO L225 Difference]: With dead ends: 32 [2023-04-01 06:05:30,636 INFO L226 Difference]: Without dead ends: 28 [2023-04-01 06:05:30,636 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 53 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 06:05:30,640 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 16 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-01 06:05:30,641 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 48 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-01 06:05:30,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-04-01 06:05:30,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2023-04-01 06:05:30,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 16 states have (on average 1.125) internal successors, (18), 18 states have internal predecessors, (18), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) [2023-04-01 06:05:30,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2023-04-01 06:05:30,649 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 37 transitions. Word has length 27 [2023-04-01 06:05:30,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 06:05:30,650 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 37 transitions. [2023-04-01 06:05:30,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 9 states have internal predecessors, (23), 6 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 6 states have call successors, (6) [2023-04-01 06:05:30,650 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2023-04-01 06:05:30,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-04-01 06:05:30,651 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 06:05:30,652 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 06:05:30,660 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-04-01 06:05:30,857 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,SelfDestructingSolverStorable3 [2023-04-01 06:05:30,858 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 06:05:30,859 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 06:05:30,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1917676903, now seen corresponding path program 2 times [2023-04-01 06:05:30,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 06:05:30,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343480183] [2023-04-01 06:05:30,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 06:05:30,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 06:05:30,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 06:05:31,052 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 23 proven. 8 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-04-01 06:05:31,053 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 06:05:31,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343480183] [2023-04-01 06:05:31,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343480183] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 06:05:31,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [98851455] [2023-04-01 06:05:31,053 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-01 06:05:31,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 06:05:31,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 06:05:31,055 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 06:05:31,057 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 06:05:31,098 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-04-01 06:05:31,098 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 06:05:31,099 INFO L262 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 6 conjunts are in the unsatisfiable core [2023-04-01 06:05:31,101 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 06:05:31,152 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-04-01 06:05:31,152 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 06:05:31,339 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-04-01 06:05:31,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [98851455] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 06:05:31,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1990534982] [2023-04-01 06:05:31,342 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2023-04-01 06:05:31,343 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 06:05:31,343 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 06:05:31,343 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 06:05:31,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 7] total 14 [2023-04-01 06:05:31,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584997686] [2023-04-01 06:05:31,344 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 06:05:31,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-04-01 06:05:31,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 06:05:31,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-04-01 06:05:31,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2023-04-01 06:05:31,346 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. Second operand has 14 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 14 states have internal predecessors, (38), 7 states have call successors, (14), 1 states have call predecessors, (14), 5 states have return successors, (14), 8 states have call predecessors, (14), 7 states have call successors, (14) [2023-04-01 06:05:31,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 06:05:31,542 INFO L93 Difference]: Finished difference Result 59 states and 89 transitions. [2023-04-01 06:05:31,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-04-01 06:05:31,543 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 14 states have internal predecessors, (38), 7 states have call successors, (14), 1 states have call predecessors, (14), 5 states have return successors, (14), 8 states have call predecessors, (14), 7 states have call successors, (14) Word has length 40 [2023-04-01 06:05:31,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 06:05:31,544 INFO L225 Difference]: With dead ends: 59 [2023-04-01 06:05:31,544 INFO L226 Difference]: Without dead ends: 37 [2023-04-01 06:05:31,545 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 74 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2023-04-01 06:05:31,545 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 27 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 06:05:31,545 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 104 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 06:05:31,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-04-01 06:05:31,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 31. [2023-04-01 06:05:31,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 19 states have (on average 1.105263157894737) internal successors, (21), 20 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) [2023-04-01 06:05:31,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2023-04-01 06:05:31,552 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 40 [2023-04-01 06:05:31,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 06:05:31,553 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2023-04-01 06:05:31,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 14 states have internal predecessors, (38), 7 states have call successors, (14), 1 states have call predecessors, (14), 5 states have return successors, (14), 8 states have call predecessors, (14), 7 states have call successors, (14) [2023-04-01 06:05:31,553 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2023-04-01 06:05:31,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-04-01 06:05:31,554 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 06:05:31,554 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 06:05:31,563 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 06:05:31,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 06:05:31,761 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 06:05:31,761 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 06:05:31,761 INFO L85 PathProgramCache]: Analyzing trace with hash -660284548, now seen corresponding path program 3 times [2023-04-01 06:05:31,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 06:05:31,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351388539] [2023-04-01 06:05:31,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 06:05:31,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 06:05:31,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 06:05:31,842 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-04-01 06:05:31,842 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 06:05:31,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351388539] [2023-04-01 06:05:31,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351388539] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 06:05:31,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [396001953] [2023-04-01 06:05:31,842 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-04-01 06:05:31,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 06:05:31,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 06:05:31,844 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 06:05:31,860 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 06:05:31,901 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-04-01 06:05:31,901 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 06:05:31,902 INFO L262 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 8 conjunts are in the unsatisfiable core [2023-04-01 06:05:31,904 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 06:05:31,951 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-04-01 06:05:31,952 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 06:05:32,249 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 31 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-04-01 06:05:32,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [396001953] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 06:05:32,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1763547887] [2023-04-01 06:05:32,252 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2023-04-01 06:05:32,252 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 06:05:32,252 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 06:05:32,252 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 06:05:32,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 9] total 11 [2023-04-01 06:05:32,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203052207] [2023-04-01 06:05:32,253 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 06:05:32,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-04-01 06:05:32,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 06:05:32,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-04-01 06:05:32,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2023-04-01 06:05:32,254 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. Second operand has 11 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 11 states have internal predecessors, (31), 8 states have call successors, (9), 1 states have call predecessors, (9), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2023-04-01 06:05:32,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 06:05:32,344 INFO L93 Difference]: Finished difference Result 40 states and 54 transitions. [2023-04-01 06:05:32,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-04-01 06:05:32,344 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 11 states have internal predecessors, (31), 8 states have call successors, (9), 1 states have call predecessors, (9), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) Word has length 41 [2023-04-01 06:05:32,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 06:05:32,345 INFO L225 Difference]: With dead ends: 40 [2023-04-01 06:05:32,345 INFO L226 Difference]: Without dead ends: 36 [2023-04-01 06:05:32,346 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 80 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 06:05:32,346 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 34 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 06:05:32,347 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 58 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 06:05:32,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2023-04-01 06:05:32,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2023-04-01 06:05:32,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 23 states have internal predecessors, (24), 7 states have call successors, (7), 4 states have call predecessors, (7), 6 states have return successors, (19), 8 states have call predecessors, (19), 6 states have call successors, (19) [2023-04-01 06:05:32,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 50 transitions. [2023-04-01 06:05:32,353 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 50 transitions. Word has length 41 [2023-04-01 06:05:32,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 06:05:32,354 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 50 transitions. [2023-04-01 06:05:32,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 11 states have internal predecessors, (31), 8 states have call successors, (9), 1 states have call predecessors, (9), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2023-04-01 06:05:32,354 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 50 transitions. [2023-04-01 06:05:32,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-04-01 06:05:32,356 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 06:05:32,356 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 7, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 06:05:32,366 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 06:05:32,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 06:05:32,563 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 06:05:32,563 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 06:05:32,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1785909457, now seen corresponding path program 4 times [2023-04-01 06:05:32,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 06:05:32,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605477532] [2023-04-01 06:05:32,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 06:05:32,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 06:05:32,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 06:05:32,735 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 17 proven. 88 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-04-01 06:05:32,735 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 06:05:32,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605477532] [2023-04-01 06:05:32,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605477532] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 06:05:32,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1243366370] [2023-04-01 06:05:32,736 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-04-01 06:05:32,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 06:05:32,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 06:05:32,737 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 06:05:32,739 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 06:05:32,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 06:05:32,797 INFO L262 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 10 conjunts are in the unsatisfiable core [2023-04-01 06:05:32,799 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 06:05:32,856 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 17 proven. 88 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-04-01 06:05:32,856 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 06:05:33,311 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 17 proven. 103 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2023-04-01 06:05:33,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1243366370] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 06:05:33,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1389792778] [2023-04-01 06:05:33,313 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2023-04-01 06:05:33,313 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 06:05:33,314 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 06:05:33,314 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 06:05:33,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 11] total 13 [2023-04-01 06:05:33,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974406816] [2023-04-01 06:05:33,314 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 06:05:33,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-04-01 06:05:33,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 06:05:33,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-04-01 06:05:33,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2023-04-01 06:05:33,316 INFO L87 Difference]: Start difference. First operand 36 states and 50 transitions. Second operand has 13 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 13 states have internal predecessors, (40), 10 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (14), 5 states have call predecessors, (14), 10 states have call successors, (14) [2023-04-01 06:05:33,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 06:05:33,421 INFO L93 Difference]: Finished difference Result 45 states and 67 transitions. [2023-04-01 06:05:33,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-04-01 06:05:33,421 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 13 states have internal predecessors, (40), 10 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (14), 5 states have call predecessors, (14), 10 states have call successors, (14) Word has length 68 [2023-04-01 06:05:33,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 06:05:33,422 INFO L225 Difference]: With dead ends: 45 [2023-04-01 06:05:33,422 INFO L226 Difference]: Without dead ends: 41 [2023-04-01 06:05:33,423 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 131 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 06:05:33,423 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 33 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 06:05:33,424 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 75 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 06:05:33,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2023-04-01 06:05:33,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2023-04-01 06:05:33,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 25 states have (on average 1.08) internal successors, (27), 26 states have internal predecessors, (27), 8 states have call successors, (8), 4 states have call predecessors, (8), 7 states have return successors, (28), 10 states have call predecessors, (28), 7 states have call successors, (28) [2023-04-01 06:05:33,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 63 transitions. [2023-04-01 06:05:33,430 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 63 transitions. Word has length 68 [2023-04-01 06:05:33,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 06:05:33,431 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 63 transitions. [2023-04-01 06:05:33,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 13 states have internal predecessors, (40), 10 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (14), 5 states have call predecessors, (14), 10 states have call successors, (14) [2023-04-01 06:05:33,431 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 63 transitions. [2023-04-01 06:05:33,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2023-04-01 06:05:33,435 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 06:05:33,435 INFO L195 NwaCegarLoop]: trace histogram [29, 29, 25, 14, 14, 14, 14, 14, 14, 14, 11, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 06:05:33,447 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 06:05:33,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 06:05:33,642 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 06:05:33,642 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 06:05:33,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1405836889, now seen corresponding path program 5 times [2023-04-01 06:05:33,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 06:05:33,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143534725] [2023-04-01 06:05:33,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 06:05:33,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 06:05:33,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 06:05:33,958 INFO L134 CoverageAnalysis]: Checked inductivity of 2288 backedges. 91 proven. 567 refuted. 0 times theorem prover too weak. 1630 trivial. 0 not checked. [2023-04-01 06:05:33,958 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 06:05:33,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143534725] [2023-04-01 06:05:33,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143534725] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 06:05:33,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1728945252] [2023-04-01 06:05:33,970 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-01 06:05:33,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 06:05:33,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 06:05:33,971 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 06:05:33,994 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 06:05:34,064 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2023-04-01 06:05:34,065 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 06:05:34,066 INFO L262 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 8 conjunts are in the unsatisfiable core [2023-04-01 06:05:34,075 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 06:05:34,137 INFO L134 CoverageAnalysis]: Checked inductivity of 2288 backedges. 712 proven. 16 refuted. 0 times theorem prover too weak. 1560 trivial. 0 not checked. [2023-04-01 06:05:34,137 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 06:05:34,810 INFO L134 CoverageAnalysis]: Checked inductivity of 2288 backedges. 588 proven. 34 refuted. 0 times theorem prover too weak. 1666 trivial. 0 not checked. [2023-04-01 06:05:34,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1728945252] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 06:05:34,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1237463903] [2023-04-01 06:05:34,814 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2023-04-01 06:05:34,815 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 06:05:34,815 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 06:05:34,815 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 06:05:34,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 16 [2023-04-01 06:05:34,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453515405] [2023-04-01 06:05:34,816 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 06:05:34,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-04-01 06:05:34,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 06:05:34,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-04-01 06:05:34,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2023-04-01 06:05:34,818 INFO L87 Difference]: Start difference. First operand 41 states and 63 transitions. Second operand has 16 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 16 states have internal predecessors, (56), 11 states have call successors, (18), 2 states have call predecessors, (18), 9 states have return successors, (23), 10 states have call predecessors, (23), 11 states have call successors, (23) [2023-04-01 06:05:35,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 06:05:35,134 INFO L93 Difference]: Finished difference Result 98 states and 195 transitions. [2023-04-01 06:05:35,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-04-01 06:05:35,135 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 16 states have internal predecessors, (56), 11 states have call successors, (18), 2 states have call predecessors, (18), 9 states have return successors, (23), 10 states have call predecessors, (23), 11 states have call successors, (23) Word has length 206 [2023-04-01 06:05:35,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 06:05:35,139 INFO L225 Difference]: With dead ends: 98 [2023-04-01 06:05:35,139 INFO L226 Difference]: Without dead ends: 62 [2023-04-01 06:05:35,143 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 439 GetRequests, 406 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=245, Invalid=685, Unknown=0, NotChecked=0, Total=930 [2023-04-01 06:05:35,144 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 80 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 06:05:35,144 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 123 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 06:05:35,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2023-04-01 06:05:35,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2023-04-01 06:05:35,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 41 states have (on average 1.146341463414634) internal successors, (47), 40 states have internal predecessors, (47), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (23), 12 states have call predecessors, (23), 11 states have call successors, (23) [2023-04-01 06:05:35,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 82 transitions. [2023-04-01 06:05:35,170 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 82 transitions. Word has length 206 [2023-04-01 06:05:35,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 06:05:35,170 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 82 transitions. [2023-04-01 06:05:35,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 16 states have internal predecessors, (56), 11 states have call successors, (18), 2 states have call predecessors, (18), 9 states have return successors, (23), 10 states have call predecessors, (23), 11 states have call successors, (23) [2023-04-01 06:05:35,170 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 82 transitions. [2023-04-01 06:05:35,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2023-04-01 06:05:35,172 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 06:05:35,172 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 20, 12, 12, 12, 12, 12, 12, 12, 8, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 06:05:35,184 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 06:05:35,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 06:05:35,373 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 06:05:35,374 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 06:05:35,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1950698244, now seen corresponding path program 6 times [2023-04-01 06:05:35,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 06:05:35,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406795313] [2023-04-01 06:05:35,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 06:05:35,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 06:05:35,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 06:05:35,640 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 93 proven. 533 refuted. 0 times theorem prover too weak. 1028 trivial. 0 not checked. [2023-04-01 06:05:35,641 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 06:05:35,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406795313] [2023-04-01 06:05:35,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406795313] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 06:05:35,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1569105555] [2023-04-01 06:05:35,641 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-04-01 06:05:35,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 06:05:35,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 06:05:35,643 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 06:05:35,645 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 06:05:35,746 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-04-01 06:05:35,746 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 06:05:35,748 INFO L262 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 14 conjunts are in the unsatisfiable core [2023-04-01 06:05:35,751 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 06:05:35,813 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 93 proven. 533 refuted. 0 times theorem prover too weak. 1028 trivial. 0 not checked. [2023-04-01 06:05:35,813 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 06:05:36,975 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 93 proven. 573 refuted. 0 times theorem prover too weak. 988 trivial. 0 not checked. [2023-04-01 06:05:36,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1569105555] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 06:05:36,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1065338149] [2023-04-01 06:05:36,978 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2023-04-01 06:05:36,978 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 06:05:36,978 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 06:05:36,978 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 06:05:36,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 15] total 17 [2023-04-01 06:05:36,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730170769] [2023-04-01 06:05:36,979 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 06:05:36,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-04-01 06:05:36,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 06:05:36,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-04-01 06:05:36,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2023-04-01 06:05:36,981 INFO L87 Difference]: Start difference. First operand 62 states and 82 transitions. Second operand has 17 states, 15 states have (on average 3.466666666666667) internal successors, (52), 17 states have internal predecessors, (52), 14 states have call successors, (17), 1 states have call predecessors, (17), 7 states have return successors, (20), 7 states have call predecessors, (20), 14 states have call successors, (20) [2023-04-01 06:05:37,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 06:05:37,116 INFO L93 Difference]: Finished difference Result 71 states and 99 transitions. [2023-04-01 06:05:37,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-04-01 06:05:37,117 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 3.466666666666667) internal successors, (52), 17 states have internal predecessors, (52), 14 states have call successors, (17), 1 states have call predecessors, (17), 7 states have return successors, (20), 7 states have call predecessors, (20), 14 states have call successors, (20) Word has length 177 [2023-04-01 06:05:37,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 06:05:37,118 INFO L225 Difference]: With dead ends: 71 [2023-04-01 06:05:37,119 INFO L226 Difference]: Without dead ends: 67 [2023-04-01 06:05:37,119 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 347 SyntacticMatches, 6 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=164, Invalid=342, Unknown=0, NotChecked=0, Total=506 [2023-04-01 06:05:37,120 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 75 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 06:05:37,120 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 95 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 06:05:37,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2023-04-01 06:05:37,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2023-04-01 06:05:37,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 44 states have (on average 1.1363636363636365) internal successors, (50), 43 states have internal predecessors, (50), 13 states have call successors, (13), 9 states have call predecessors, (13), 9 states have return successors, (31), 14 states have call predecessors, (31), 12 states have call successors, (31) [2023-04-01 06:05:37,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 94 transitions. [2023-04-01 06:05:37,127 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 94 transitions. Word has length 177 [2023-04-01 06:05:37,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 06:05:37,128 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 94 transitions. [2023-04-01 06:05:37,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 3.466666666666667) internal successors, (52), 17 states have internal predecessors, (52), 14 states have call successors, (17), 1 states have call predecessors, (17), 7 states have return successors, (20), 7 states have call predecessors, (20), 14 states have call successors, (20) [2023-04-01 06:05:37,128 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 94 transitions. [2023-04-01 06:05:37,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2023-04-01 06:05:37,134 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 06:05:37,134 INFO L195 NwaCegarLoop]: trace histogram [41, 41, 33, 20, 20, 20, 20, 20, 20, 20, 13, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 06:05:37,143 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 06:05:37,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 06:05:37,341 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 06:05:37,341 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 06:05:37,341 INFO L85 PathProgramCache]: Analyzing trace with hash 263606889, now seen corresponding path program 7 times [2023-04-01 06:05:37,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 06:05:37,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006695553] [2023-04-01 06:05:37,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 06:05:37,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 06:05:37,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 06:05:37,783 INFO L134 CoverageAnalysis]: Checked inductivity of 4568 backedges. 189 proven. 1130 refuted. 0 times theorem prover too weak. 3249 trivial. 0 not checked. [2023-04-01 06:05:37,783 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 06:05:37,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006695553] [2023-04-01 06:05:37,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006695553] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 06:05:37,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2005820860] [2023-04-01 06:05:37,784 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-04-01 06:05:37,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 06:05:37,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 06:05:37,789 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 06:05:37,792 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 06:05:37,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 06:05:37,936 INFO L262 TraceCheckSpWp]: Trace formula consists of 665 conjuncts, 16 conjunts are in the unsatisfiable core [2023-04-01 06:05:37,941 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 06:05:38,024 INFO L134 CoverageAnalysis]: Checked inductivity of 4568 backedges. 189 proven. 1130 refuted. 0 times theorem prover too weak. 3249 trivial. 0 not checked. [2023-04-01 06:05:38,024 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 06:05:39,826 INFO L134 CoverageAnalysis]: Checked inductivity of 4568 backedges. 189 proven. 1187 refuted. 0 times theorem prover too weak. 3192 trivial. 0 not checked. [2023-04-01 06:05:39,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2005820860] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 06:05:39,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1920053210] [2023-04-01 06:05:39,829 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2023-04-01 06:05:39,829 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 06:05:39,829 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 06:05:39,829 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 06:05:39,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 17] total 19 [2023-04-01 06:05:39,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863821613] [2023-04-01 06:05:39,830 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 06:05:39,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-04-01 06:05:39,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 06:05:39,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-04-01 06:05:39,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2023-04-01 06:05:39,832 INFO L87 Difference]: Start difference. First operand 67 states and 94 transitions. Second operand has 19 states, 17 states have (on average 3.411764705882353) internal successors, (58), 19 states have internal predecessors, (58), 16 states have call successors, (19), 1 states have call predecessors, (19), 8 states have return successors, (23), 8 states have call predecessors, (23), 16 states have call successors, (23) [2023-04-01 06:05:40,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 06:05:40,002 INFO L93 Difference]: Finished difference Result 76 states and 113 transitions. [2023-04-01 06:05:40,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-04-01 06:05:40,003 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 3.411764705882353) internal successors, (58), 19 states have internal predecessors, (58), 16 states have call successors, (19), 1 states have call predecessors, (19), 8 states have return successors, (23), 8 states have call predecessors, (23), 16 states have call successors, (23) Word has length 286 [2023-04-01 06:05:40,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 06:05:40,005 INFO L225 Difference]: With dead ends: 76 [2023-04-01 06:05:40,005 INFO L226 Difference]: Without dead ends: 72 [2023-04-01 06:05:40,005 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 595 GetRequests, 564 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 06:05:40,006 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 113 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 06:05:40,006 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 105 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 06:05:40,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2023-04-01 06:05:40,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2023-04-01 06:05:40,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 47 states have (on average 1.127659574468085) internal successors, (53), 46 states have internal predecessors, (53), 14 states have call successors, (14), 9 states have call predecessors, (14), 10 states have return successors, (41), 16 states have call predecessors, (41), 13 states have call successors, (41) [2023-04-01 06:05:40,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 108 transitions. [2023-04-01 06:05:40,014 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 108 transitions. Word has length 286 [2023-04-01 06:05:40,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 06:05:40,014 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 108 transitions. [2023-04-01 06:05:40,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 3.411764705882353) internal successors, (58), 19 states have internal predecessors, (58), 16 states have call successors, (19), 1 states have call predecessors, (19), 8 states have return successors, (23), 8 states have call predecessors, (23), 16 states have call successors, (23) [2023-04-01 06:05:40,015 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 108 transitions. [2023-04-01 06:05:40,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 518 [2023-04-01 06:05:40,021 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 06:05:40,021 INFO L195 NwaCegarLoop]: trace histogram [75, 75, 60, 37, 37, 37, 37, 37, 37, 37, 23, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 06:05:40,031 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 06:05:40,231 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,SelfDestructingSolverStorable9 [2023-04-01 06:05:40,232 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 06:05:40,232 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 06:05:40,232 INFO L85 PathProgramCache]: Analyzing trace with hash -799005503, now seen corresponding path program 8 times [2023-04-01 06:05:40,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 06:05:40,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616150915] [2023-04-01 06:05:40,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 06:05:40,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 06:05:40,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 06:05:40,982 INFO L134 CoverageAnalysis]: Checked inductivity of 15534 backedges. 409 proven. 2574 refuted. 0 times theorem prover too weak. 12551 trivial. 0 not checked. [2023-04-01 06:05:40,982 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 06:05:40,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616150915] [2023-04-01 06:05:40,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616150915] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 06:05:40,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1966735015] [2023-04-01 06:05:40,983 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-01 06:05:40,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 06:05:40,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 06:05:40,984 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 06:05:41,010 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 06:05:41,156 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2023-04-01 06:05:41,156 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 06:05:41,157 INFO L262 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 12 conjunts are in the unsatisfiable core [2023-04-01 06:05:41,164 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 06:05:41,263 INFO L134 CoverageAnalysis]: Checked inductivity of 15534 backedges. 2214 proven. 71 refuted. 0 times theorem prover too weak. 13249 trivial. 0 not checked. [2023-04-01 06:05:41,264 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 06:05:42,850 INFO L134 CoverageAnalysis]: Checked inductivity of 15534 backedges. 2214 proven. 77 refuted. 0 times theorem prover too weak. 13243 trivial. 0 not checked. [2023-04-01 06:05:42,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1966735015] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 06:05:42,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [220126481] [2023-04-01 06:05:42,853 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2023-04-01 06:05:42,853 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 06:05:42,854 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 06:05:42,854 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 06:05:42,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 13] total 23 [2023-04-01 06:05:42,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418843243] [2023-04-01 06:05:42,855 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 06:05:42,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-04-01 06:05:42,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 06:05:42,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-04-01 06:05:42,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=407, Unknown=0, NotChecked=0, Total=506 [2023-04-01 06:05:42,857 INFO L87 Difference]: Start difference. First operand 72 states and 108 transitions. Second operand has 23 states, 22 states have (on average 3.3181818181818183) internal successors, (73), 23 states have internal predecessors, (73), 16 states have call successors, (24), 1 states have call predecessors, (24), 14 states have return successors, (33), 16 states have call predecessors, (33), 16 states have call successors, (33) [2023-04-01 06:05:43,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 06:05:43,452 INFO L93 Difference]: Finished difference Result 173 states and 330 transitions. [2023-04-01 06:05:43,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-04-01 06:05:43,452 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 3.3181818181818183) internal successors, (73), 23 states have internal predecessors, (73), 16 states have call successors, (24), 1 states have call predecessors, (24), 14 states have return successors, (33), 16 states have call predecessors, (33), 16 states have call successors, (33) Word has length 517 [2023-04-01 06:05:43,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 06:05:43,454 INFO L225 Difference]: With dead ends: 173 [2023-04-01 06:05:43,454 INFO L226 Difference]: Without dead ends: 111 [2023-04-01 06:05:43,456 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1083 GetRequests, 1025 SyntacticMatches, 6 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 684 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=691, Invalid=2171, Unknown=0, NotChecked=0, Total=2862 [2023-04-01 06:05:43,456 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 179 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-04-01 06:05:43,456 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 137 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-04-01 06:05:43,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-04-01 06:05:43,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 102. [2023-04-01 06:05:43,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 71 states have (on average 1.0845070422535212) internal successors, (77), 67 states have internal predecessors, (77), 19 states have call successors, (19), 16 states have call predecessors, (19), 11 states have return successors, (48), 18 states have call predecessors, (48), 18 states have call successors, (48) [2023-04-01 06:05:43,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 144 transitions. [2023-04-01 06:05:43,467 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 144 transitions. Word has length 517 [2023-04-01 06:05:43,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 06:05:43,468 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 144 transitions. [2023-04-01 06:05:43,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 3.3181818181818183) internal successors, (73), 23 states have internal predecessors, (73), 16 states have call successors, (24), 1 states have call predecessors, (24), 14 states have return successors, (33), 16 states have call predecessors, (33), 16 states have call successors, (33) [2023-04-01 06:05:43,468 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 144 transitions. [2023-04-01 06:05:43,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 750 [2023-04-01 06:05:43,484 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 06:05:43,485 INFO L195 NwaCegarLoop]: trace histogram [109, 109, 88, 54, 54, 54, 54, 54, 54, 54, 34, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 06:05:43,495 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 06:05:43,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 06:05:43,693 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 06:05:43,693 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 06:05:43,693 INFO L85 PathProgramCache]: Analyzing trace with hash 608566348, now seen corresponding path program 9 times [2023-04-01 06:05:43,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 06:05:43,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131304310] [2023-04-01 06:05:43,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 06:05:43,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 06:05:43,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 06:05:44,697 INFO L134 CoverageAnalysis]: Checked inductivity of 33096 backedges. 659 proven. 4380 refuted. 0 times theorem prover too weak. 28057 trivial. 0 not checked. [2023-04-01 06:05:44,697 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 06:05:44,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131304310] [2023-04-01 06:05:44,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131304310] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 06:05:44,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [485382624] [2023-04-01 06:05:44,697 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-04-01 06:05:44,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 06:05:44,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 06:05:44,699 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 06:05:44,724 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 06:05:45,039 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-04-01 06:05:45,040 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 06:05:45,046 INFO L262 TraceCheckSpWp]: Trace formula consists of 1693 conjuncts, 20 conjunts are in the unsatisfiable core [2023-04-01 06:05:45,056 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 06:05:45,154 INFO L134 CoverageAnalysis]: Checked inductivity of 33096 backedges. 659 proven. 4380 refuted. 0 times theorem prover too weak. 28057 trivial. 0 not checked. [2023-04-01 06:05:45,155 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 06:05:48,922 INFO L134 CoverageAnalysis]: Checked inductivity of 33096 backedges. 659 proven. 4480 refuted. 0 times theorem prover too weak. 27957 trivial. 0 not checked. [2023-04-01 06:05:48,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [485382624] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 06:05:48,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [395218210] [2023-04-01 06:05:48,924 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2023-04-01 06:05:48,924 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 06:05:48,924 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 06:05:48,925 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 06:05:48,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 21] total 23 [2023-04-01 06:05:48,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306821809] [2023-04-01 06:05:48,925 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 06:05:48,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-04-01 06:05:48,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 06:05:48,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-04-01 06:05:48,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2023-04-01 06:05:48,928 INFO L87 Difference]: Start difference. First operand 102 states and 144 transitions. Second operand has 23 states, 21 states have (on average 3.3333333333333335) internal successors, (70), 23 states have internal predecessors, (70), 20 states have call successors, (23), 1 states have call predecessors, (23), 10 states have return successors, (29), 10 states have call predecessors, (29), 20 states have call successors, (29) [2023-04-01 06:05:49,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 06:05:49,087 INFO L93 Difference]: Finished difference Result 111 states and 163 transitions. [2023-04-01 06:05:49,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-04-01 06:05:49,088 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 3.3333333333333335) internal successors, (70), 23 states have internal predecessors, (70), 20 states have call successors, (23), 1 states have call predecessors, (23), 10 states have return successors, (29), 10 states have call predecessors, (29), 20 states have call successors, (29) Word has length 749 [2023-04-01 06:05:49,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 06:05:49,094 INFO L225 Difference]: With dead ends: 111 [2023-04-01 06:05:49,094 INFO L226 Difference]: Without dead ends: 107 [2023-04-01 06:05:49,095 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1527 GetRequests, 1488 SyntacticMatches, 9 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=323, Invalid=669, Unknown=0, NotChecked=0, Total=992 [2023-04-01 06:05:49,096 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 36 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 06:05:49,096 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 132 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 06:05:49,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2023-04-01 06:05:49,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2023-04-01 06:05:49,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 74 states have (on average 1.0810810810810811) internal successors, (80), 70 states have internal predecessors, (80), 20 states have call successors, (20), 16 states have call predecessors, (20), 12 states have return successors, (58), 20 states have call predecessors, (58), 19 states have call successors, (58) [2023-04-01 06:05:49,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 158 transitions. [2023-04-01 06:05:49,113 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 158 transitions. Word has length 749 [2023-04-01 06:05:49,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 06:05:49,115 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 158 transitions. [2023-04-01 06:05:49,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 3.3333333333333335) internal successors, (70), 23 states have internal predecessors, (70), 20 states have call successors, (23), 1 states have call predecessors, (23), 10 states have return successors, (29), 10 states have call predecessors, (29), 20 states have call successors, (29) [2023-04-01 06:05:49,116 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 158 transitions. [2023-04-01 06:05:49,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1499 [2023-04-01 06:05:49,176 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 06:05:49,176 INFO L195 NwaCegarLoop]: trace histogram [219, 219, 177, 109, 109, 109, 109, 109, 109, 109, 68, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 06:05:49,184 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 06:05:49,384 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,SelfDestructingSolverStorable11 [2023-04-01 06:05:49,384 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 06:05:49,385 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 06:05:49,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1482965588, now seen corresponding path program 10 times [2023-04-01 06:05:49,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 06:05:49,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117397258] [2023-04-01 06:05:49,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 06:05:49,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 06:05:49,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 06:05:51,697 INFO L134 CoverageAnalysis]: Checked inductivity of 134604 backedges. 1269 proven. 10469 refuted. 0 times theorem prover too weak. 122866 trivial. 0 not checked. [2023-04-01 06:05:51,698 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 06:05:51,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117397258] [2023-04-01 06:05:51,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117397258] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 06:05:51,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1542446540] [2023-04-01 06:05:51,698 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-04-01 06:05:51,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 06:05:51,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 06:05:51,701 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 06:05:51,711 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 06:05:52,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 06:05:52,241 INFO L262 TraceCheckSpWp]: Trace formula consists of 3356 conjuncts, 22 conjunts are in the unsatisfiable core [2023-04-01 06:05:52,270 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 06:05:52,389 INFO L134 CoverageAnalysis]: Checked inductivity of 134604 backedges. 1269 proven. 10469 refuted. 0 times theorem prover too weak. 122866 trivial. 0 not checked. [2023-04-01 06:05:52,390 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 06:05:58,374 INFO L134 CoverageAnalysis]: Checked inductivity of 134604 backedges. 1269 proven. 10595 refuted. 0 times theorem prover too weak. 122740 trivial. 0 not checked. [2023-04-01 06:05:58,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1542446540] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 06:05:58,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1736213280] [2023-04-01 06:05:58,377 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2023-04-01 06:05:58,378 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 06:05:58,378 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 06:05:58,378 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 06:05:58,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 23] total 25 [2023-04-01 06:05:58,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448975115] [2023-04-01 06:05:58,379 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 06:05:58,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-04-01 06:05:58,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 06:05:58,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-04-01 06:05:58,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=442, Unknown=0, NotChecked=0, Total=600 [2023-04-01 06:05:58,383 INFO L87 Difference]: Start difference. First operand 107 states and 158 transitions. Second operand has 25 states, 23 states have (on average 3.3043478260869565) internal successors, (76), 25 states have internal predecessors, (76), 22 states have call successors, (25), 1 states have call predecessors, (25), 11 states have return successors, (32), 11 states have call predecessors, (32), 22 states have call successors, (32) [2023-04-01 06:05:58,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 06:05:58,617 INFO L93 Difference]: Finished difference Result 116 states and 179 transitions. [2023-04-01 06:05:58,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-04-01 06:05:58,618 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 3.3043478260869565) internal successors, (76), 25 states have internal predecessors, (76), 22 states have call successors, (25), 1 states have call predecessors, (25), 11 states have return successors, (32), 11 states have call predecessors, (32), 22 states have call successors, (32) Word has length 1498 [2023-04-01 06:05:58,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 06:05:58,622 INFO L225 Difference]: With dead ends: 116 [2023-04-01 06:05:58,622 INFO L226 Difference]: Without dead ends: 112 [2023-04-01 06:05:58,623 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3028 GetRequests, 2985 SyntacticMatches, 10 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=388, Invalid=802, Unknown=0, NotChecked=0, Total=1190 [2023-04-01 06:05:58,623 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 36 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 06:05:58,624 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 163 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 06:05:58,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-04-01 06:05:58,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2023-04-01 06:05:58,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 77 states have (on average 1.077922077922078) internal successors, (83), 73 states have internal predecessors, (83), 21 states have call successors, (21), 16 states have call predecessors, (21), 13 states have return successors, (70), 22 states have call predecessors, (70), 20 states have call successors, (70) [2023-04-01 06:05:58,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 174 transitions. [2023-04-01 06:05:58,639 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 174 transitions. Word has length 1498 [2023-04-01 06:05:58,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 06:05:58,642 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 174 transitions. [2023-04-01 06:05:58,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 3.3043478260869565) internal successors, (76), 25 states have internal predecessors, (76), 22 states have call successors, (25), 1 states have call predecessors, (25), 11 states have return successors, (32), 11 states have call predecessors, (32), 22 states have call successors, (32) [2023-04-01 06:05:58,642 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 174 transitions. [2023-04-01 06:05:58,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3188 [2023-04-01 06:05:58,719 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 06:05:58,719 INFO L195 NwaCegarLoop]: trace histogram [467, 467, 378, 233, 233, 233, 233, 233, 233, 233, 145, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 06:05:58,732 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-04-01 06:05:58,932 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,SelfDestructingSolverStorable12 [2023-04-01 06:05:58,932 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 06:05:58,932 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 06:05:58,933 INFO L85 PathProgramCache]: Analyzing trace with hash -738513289, now seen corresponding path program 11 times [2023-04-01 06:05:58,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 06:05:58,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182561152] [2023-04-01 06:05:58,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 06:05:58,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 06:06:00,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 06:06:04,953 INFO L134 CoverageAnalysis]: Checked inductivity of 614609 backedges. 2772 proven. 25478 refuted. 0 times theorem prover too weak. 586359 trivial. 0 not checked. [2023-04-01 06:06:04,954 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 06:06:04,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182561152] [2023-04-01 06:06:04,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182561152] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 06:06:04,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1731854720] [2023-04-01 06:06:04,954 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-01 06:06:04,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 06:06:04,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 06:06:04,955 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 06:06:04,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-04-01 06:06:05,369 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2023-04-01 06:06:05,370 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 06:06:05,373 INFO L262 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 12 conjunts are in the unsatisfiable core [2023-04-01 06:06:05,408 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 06:06:05,575 INFO L134 CoverageAnalysis]: Checked inductivity of 614609 backedges. 16499 proven. 123 refuted. 0 times theorem prover too weak. 597987 trivial. 0 not checked. [2023-04-01 06:06:05,575 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 06:06:13,048 INFO L134 CoverageAnalysis]: Checked inductivity of 614609 backedges. 16499 proven. 134 refuted. 0 times theorem prover too weak. 597976 trivial. 0 not checked. [2023-04-01 06:06:13,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1731854720] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 06:06:13,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [189671753] [2023-04-01 06:06:13,057 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2023-04-01 06:06:13,057 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 06:06:13,058 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 06:06:13,058 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 06:06:13,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10, 13] total 25 [2023-04-01 06:06:13,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648825846] [2023-04-01 06:06:13,059 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 06:06:13,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-04-01 06:06:13,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 06:06:13,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-04-01 06:06:13,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=478, Unknown=0, NotChecked=0, Total=600 [2023-04-01 06:06:13,064 INFO L87 Difference]: Start difference. First operand 112 states and 174 transitions. Second operand has 25 states, 24 states have (on average 3.375) internal successors, (81), 25 states have internal predecessors, (81), 18 states have call successors, (27), 1 states have call predecessors, (27), 16 states have return successors, (39), 20 states have call predecessors, (39), 18 states have call successors, (39) [2023-04-01 06:06:14,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 06:06:14,010 INFO L93 Difference]: Finished difference Result 281 states and 605 transitions. [2023-04-01 06:06:14,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2023-04-01 06:06:14,011 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 3.375) internal successors, (81), 25 states have internal predecessors, (81), 18 states have call successors, (27), 1 states have call predecessors, (27), 16 states have return successors, (39), 20 states have call predecessors, (39), 18 states have call successors, (39) Word has length 3187 [2023-04-01 06:06:14,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 06:06:14,015 INFO L225 Difference]: With dead ends: 281 [2023-04-01 06:06:14,015 INFO L226 Difference]: Without dead ends: 175 [2023-04-01 06:06:14,022 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6446 GetRequests, 6369 SyntacticMatches, 6 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1371 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1273, Invalid=3983, Unknown=0, NotChecked=0, Total=5256 [2023-04-01 06:06:14,023 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 237 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 225 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 225 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-04-01 06:06:14,023 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 183 Invalid, 573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [225 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-04-01 06:06:14,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2023-04-01 06:06:14,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 148. [2023-04-01 06:06:14,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 101 states have (on average 1.099009900990099) internal successors, (111), 100 states have internal predecessors, (111), 32 states have call successors, (32), 23 states have call predecessors, (32), 14 states have return successors, (112), 24 states have call predecessors, (112), 31 states have call successors, (112) [2023-04-01 06:06:14,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 255 transitions. [2023-04-01 06:06:14,039 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 255 transitions. Word has length 3187 [2023-04-01 06:06:14,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 06:06:14,039 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 255 transitions. [2023-04-01 06:06:14,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.375) internal successors, (81), 25 states have internal predecessors, (81), 18 states have call successors, (27), 1 states have call predecessors, (27), 16 states have return successors, (39), 20 states have call predecessors, (39), 18 states have call successors, (39) [2023-04-01 06:06:14,040 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 255 transitions. [2023-04-01 06:06:14,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3174 [2023-04-01 06:06:14,127 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 06:06:14,128 INFO L195 NwaCegarLoop]: trace histogram [465, 465, 376, 232, 232, 232, 232, 232, 232, 232, 144, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 06:06:14,140 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-04-01 06:06:14,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-04-01 06:06:14,338 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 06:06:14,338 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 06:06:14,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1227044396, now seen corresponding path program 12 times [2023-04-01 06:06:14,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 06:06:14,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497935638] [2023-04-01 06:06:14,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 06:06:14,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 06:06:15,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat