/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 IntervalDomain -i ../sv-benchmarks/c/recursive/MultCommutative-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-f954360 [2023-04-01 00:01:05,426 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-04-01 00:01:05,428 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-04-01 00:01:05,454 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-04-01 00:01:05,455 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-04-01 00:01:05,455 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-04-01 00:01:05,456 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-04-01 00:01:05,462 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-04-01 00:01:05,463 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-04-01 00:01:05,468 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-04-01 00:01:05,469 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-04-01 00:01:05,470 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-04-01 00:01:05,470 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-04-01 00:01:05,472 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-04-01 00:01:05,475 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-04-01 00:01:05,477 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-04-01 00:01:05,477 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-04-01 00:01:05,478 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-04-01 00:01:05,478 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-04-01 00:01:05,479 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-04-01 00:01:05,480 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-04-01 00:01:05,482 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-04-01 00:01:05,483 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-04-01 00:01:05,484 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-04-01 00:01:05,491 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-04-01 00:01:05,491 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-04-01 00:01:05,491 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-04-01 00:01:05,492 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-04-01 00:01:05,492 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-04-01 00:01:05,493 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-04-01 00:01:05,493 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-04-01 00:01:05,493 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-04-01 00:01:05,494 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-04-01 00:01:05,494 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-04-01 00:01:05,494 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-04-01 00:01:05,495 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-04-01 00:01:05,495 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-04-01 00:01:05,495 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-04-01 00:01:05,496 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-04-01 00:01:05,497 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-04-01 00:01:05,498 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-04-01 00:01:05,499 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 00:01:05,523 INFO L113 SettingsManager]: Loading preferences was successful [2023-04-01 00:01:05,523 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-04-01 00:01:05,524 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-04-01 00:01:05,524 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-04-01 00:01:05,524 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-04-01 00:01:05,525 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-04-01 00:01:05,525 INFO L138 SettingsManager]: * User list type=DISABLED [2023-04-01 00:01:05,525 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-04-01 00:01:05,525 INFO L138 SettingsManager]: * Explicit value domain=true [2023-04-01 00:01:05,525 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-04-01 00:01:05,525 INFO L138 SettingsManager]: * Octagon Domain=false [2023-04-01 00:01:05,526 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2023-04-01 00:01:05,526 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-04-01 00:01:05,526 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-04-01 00:01:05,526 INFO L138 SettingsManager]: * Interval Domain=false [2023-04-01 00:01:05,526 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-04-01 00:01:05,526 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-04-01 00:01:05,526 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2023-04-01 00:01:05,526 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-04-01 00:01:05,527 INFO L138 SettingsManager]: * sizeof long=4 [2023-04-01 00:01:05,527 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-04-01 00:01:05,527 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-04-01 00:01:05,527 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-04-01 00:01:05,527 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-04-01 00:01:05,527 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-04-01 00:01:05,527 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-04-01 00:01:05,527 INFO L138 SettingsManager]: * sizeof long double=12 [2023-04-01 00:01:05,527 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-04-01 00:01:05,527 INFO L138 SettingsManager]: * Use constant arrays=true [2023-04-01 00:01:05,527 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-04-01 00:01:05,527 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-04-01 00:01:05,528 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-04-01 00:01:05,528 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-01 00:01:05,528 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-04-01 00:01:05,528 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2023-04-01 00:01:05,528 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-04-01 00:01:05,528 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-04-01 00:01:05,528 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-04-01 00:01:05,528 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-04-01 00:01:05,528 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-04-01 00:01:05,528 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-04-01 00:01:05,528 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 -> IntervalDomain [2023-04-01 00:01:05,778 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-04-01 00:01:05,800 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-04-01 00:01:05,802 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-04-01 00:01:05,803 INFO L271 PluginConnector]: Initializing CDTParser... [2023-04-01 00:01:05,803 INFO L275 PluginConnector]: CDTParser initialized [2023-04-01 00:01:05,804 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/MultCommutative-2.c [2023-04-01 00:01:07,260 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-04-01 00:01:07,421 INFO L351 CDTParser]: Found 1 translation units. [2023-04-01 00:01:07,421 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/MultCommutative-2.c [2023-04-01 00:01:07,425 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/368a8cb93/783800c1a0054372af027c80deb7595f/FLAG6ad6a6059 [2023-04-01 00:01:07,437 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/368a8cb93/783800c1a0054372af027c80deb7595f [2023-04-01 00:01:07,440 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-04-01 00:01:07,441 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2023-04-01 00:01:07,442 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-04-01 00:01:07,443 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-04-01 00:01:07,445 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-04-01 00:01:07,445 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.04 12:01:07" (1/1) ... [2023-04-01 00:01:07,446 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30118483 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:01:07, skipping insertion in model container [2023-04-01 00:01:07,446 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.04 12:01:07" (1/1) ... [2023-04-01 00:01:07,451 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-04-01 00:01:07,461 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-04-01 00:01:07,584 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/MultCommutative-2.c[970,983] [2023-04-01 00:01:07,587 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-01 00:01:07,594 INFO L203 MainTranslator]: Completed pre-run [2023-04-01 00:01:07,607 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/MultCommutative-2.c[970,983] [2023-04-01 00:01:07,608 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-01 00:01:07,620 INFO L208 MainTranslator]: Completed translation [2023-04-01 00:01:07,620 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:01:07 WrapperNode [2023-04-01 00:01:07,620 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-04-01 00:01:07,621 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-04-01 00:01:07,621 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-04-01 00:01:07,621 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-04-01 00:01:07,629 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:01:07" (1/1) ... [2023-04-01 00:01:07,629 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:01:07" (1/1) ... [2023-04-01 00:01:07,634 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:01:07" (1/1) ... [2023-04-01 00:01:07,634 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:01:07" (1/1) ... [2023-04-01 00:01:07,642 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:01:07" (1/1) ... [2023-04-01 00:01:07,644 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:01:07" (1/1) ... [2023-04-01 00:01:07,645 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:01:07" (1/1) ... [2023-04-01 00:01:07,645 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:01:07" (1/1) ... [2023-04-01 00:01:07,649 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-04-01 00:01:07,650 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-04-01 00:01:07,650 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-04-01 00:01:07,650 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-04-01 00:01:07,651 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:01:07" (1/1) ... [2023-04-01 00:01:07,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-01 00:01:07,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 00:01:07,672 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 00:01:07,689 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 00:01:07,700 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2023-04-01 00:01:07,700 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-04-01 00:01:07,700 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-04-01 00:01:07,700 INFO L138 BoogieDeclarations]: Found implementation of procedure mult [2023-04-01 00:01:07,700 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2023-04-01 00:01:07,701 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2023-04-01 00:01:07,701 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2023-04-01 00:01:07,701 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-04-01 00:01:07,701 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-04-01 00:01:07,701 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2023-04-01 00:01:07,701 INFO L130 BoogieDeclarations]: Found specification of procedure mult [2023-04-01 00:01:07,701 INFO L130 BoogieDeclarations]: Found specification of procedure main [2023-04-01 00:01:07,701 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2023-04-01 00:01:07,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-04-01 00:01:07,701 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-04-01 00:01:07,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-04-01 00:01:07,702 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-04-01 00:01:07,702 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-04-01 00:01:07,760 INFO L236 CfgBuilder]: Building ICFG [2023-04-01 00:01:07,762 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-04-01 00:01:07,918 INFO L277 CfgBuilder]: Performing block encoding [2023-04-01 00:01:07,941 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-04-01 00:01:07,941 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-04-01 00:01:07,942 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.04 12:01:07 BoogieIcfgContainer [2023-04-01 00:01:07,942 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-04-01 00:01:07,944 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-04-01 00:01:07,944 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-04-01 00:01:07,946 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-04-01 00:01:07,947 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.04 12:01:07" (1/3) ... [2023-04-01 00:01:07,947 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7080f2ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.04 12:01:07, skipping insertion in model container [2023-04-01 00:01:07,947 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:01:07" (2/3) ... [2023-04-01 00:01:07,947 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7080f2ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.04 12:01:07, skipping insertion in model container [2023-04-01 00:01:07,948 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.04 12:01:07" (3/3) ... [2023-04-01 00:01:07,948 INFO L112 eAbstractionObserver]: Analyzing ICFG MultCommutative-2.c [2023-04-01 00:01:07,975 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-04-01 00:01:07,975 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-04-01 00:01:08,023 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-04-01 00:01:08,027 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;@2f360910, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-04-01 00:01:08,028 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-04-01 00:01:08,043 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-04-01 00:01:08,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-04-01 00:01:08,048 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:01:08,049 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 00:01:08,049 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:01:08,052 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:01:08,053 INFO L85 PathProgramCache]: Analyzing trace with hash 3858641, now seen corresponding path program 1 times [2023-04-01 00:01:08,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:01:08,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076035888] [2023-04-01 00:01:08,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:01:08,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:01:08,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:01:08,292 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-04-01 00:01:08,293 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:01:08,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076035888] [2023-04-01 00:01:08,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076035888] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 00:01:08,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-01 00:01:08,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-04-01 00:01:08,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020512122] [2023-04-01 00:01:08,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 00:01:08,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-04-01 00:01:08,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:01:08,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-04-01 00:01:08,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-04-01 00:01:08,318 INFO L87 Difference]: Start difference. First operand has 27 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-04-01 00:01:08,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:01:08,423 INFO L93 Difference]: Finished difference Result 47 states and 60 transitions. [2023-04-01 00:01:08,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-04-01 00:01:08,425 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2023-04-01 00:01:08,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:01:08,430 INFO L225 Difference]: With dead ends: 47 [2023-04-01 00:01:08,430 INFO L226 Difference]: Without dead ends: 31 [2023-04-01 00:01:08,432 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-04-01 00:01:08,434 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 10 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 00:01:08,435 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 171 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 00:01:08,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-04-01 00:01:08,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2023-04-01 00:01:08,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) [2023-04-01 00:01:08,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2023-04-01 00:01:08,474 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 23 [2023-04-01 00:01:08,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:01:08,475 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2023-04-01 00:01:08,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-04-01 00:01:08,475 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2023-04-01 00:01:08,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-04-01 00:01:08,476 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:01:08,476 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 00:01:08,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-04-01 00:01:08,477 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:01:08,480 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:01:08,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1817311031, now seen corresponding path program 1 times [2023-04-01 00:01:08,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:01:08,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850660625] [2023-04-01 00:01:08,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:01:08,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:01:08,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:01:08,602 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-04-01 00:01:08,603 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:01:08,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850660625] [2023-04-01 00:01:08,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850660625] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 00:01:08,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-01 00:01:08,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-04-01 00:01:08,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609496737] [2023-04-01 00:01:08,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 00:01:08,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-04-01 00:01:08,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:01:08,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-04-01 00:01:08,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-04-01 00:01:08,605 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2023-04-01 00:01:08,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:01:08,671 INFO L93 Difference]: Finished difference Result 40 states and 53 transitions. [2023-04-01 00:01:08,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-04-01 00:01:08,672 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2023-04-01 00:01:08,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:01:08,673 INFO L225 Difference]: With dead ends: 40 [2023-04-01 00:01:08,673 INFO L226 Difference]: Without dead ends: 36 [2023-04-01 00:01:08,673 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-04-01 00:01:08,674 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 3 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-01 00:01:08,674 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 155 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-01 00:01:08,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2023-04-01 00:01:08,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 28. [2023-04-01 00:01:08,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (10), 7 states have call predecessors, (10), 6 states have call successors, (10) [2023-04-01 00:01:08,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2023-04-01 00:01:08,680 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 29 [2023-04-01 00:01:08,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:01:08,681 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2023-04-01 00:01:08,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2023-04-01 00:01:08,681 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2023-04-01 00:01:08,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-04-01 00:01:08,682 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:01:08,682 INFO L195 NwaCegarLoop]: trace histogram [3, 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 00:01:08,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-04-01 00:01:08,682 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:01:08,683 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:01:08,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1940651569, now seen corresponding path program 1 times [2023-04-01 00:01:08,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:01:08,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917143648] [2023-04-01 00:01:08,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:01:08,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:01:08,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:01:08,729 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-04-01 00:01:08,730 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:01:08,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917143648] [2023-04-01 00:01:08,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917143648] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 00:01:08,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [566086431] [2023-04-01 00:01:08,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:01:08,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:01:08,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 00:01:08,733 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 00:01:08,734 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 00:01:08,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:01:08,779 INFO L262 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 4 conjunts are in the unsatisfiable core [2023-04-01 00:01:08,783 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 00:01:08,815 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-04-01 00:01:08,816 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 00:01:08,870 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-04-01 00:01:08,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [566086431] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 00:01:08,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1609929780] [2023-04-01 00:01:08,883 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2023-04-01 00:01:08,884 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 00:01:08,886 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 00:01:08,888 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 00:01:08,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2023-04-01 00:01:08,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075667941] [2023-04-01 00:01:08,888 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 00:01:08,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-04-01 00:01:08,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:01:08,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-04-01 00:01:08,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-04-01 00:01:08,889 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-04-01 00:01:08,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:01:08,926 INFO L93 Difference]: Finished difference Result 36 states and 50 transitions. [2023-04-01 00:01:08,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-04-01 00:01:08,927 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 30 [2023-04-01 00:01:08,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:01:08,927 INFO L225 Difference]: With dead ends: 36 [2023-04-01 00:01:08,927 INFO L226 Difference]: Without dead ends: 28 [2023-04-01 00:01:08,928 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-04-01 00:01:08,929 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 13 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-01 00:01:08,929 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 41 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-01 00:01:08,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-04-01 00:01:08,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2023-04-01 00:01:08,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2023-04-01 00:01:08,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2023-04-01 00:01:08,933 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 31 transitions. Word has length 30 [2023-04-01 00:01:08,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:01:08,933 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 31 transitions. [2023-04-01 00:01:08,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-04-01 00:01:08,933 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2023-04-01 00:01:08,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-04-01 00:01:08,934 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:01:08,934 INFO L195 NwaCegarLoop]: trace histogram [3, 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 00:01:08,940 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 00:01:09,139 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 00:01:09,140 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:01:09,140 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:01:09,140 INFO L85 PathProgramCache]: Analyzing trace with hash -334295295, now seen corresponding path program 2 times [2023-04-01 00:01:09,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:01:09,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693043034] [2023-04-01 00:01:09,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:01:09,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:01:09,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:01:09,192 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-04-01 00:01:09,193 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:01:09,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693043034] [2023-04-01 00:01:09,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693043034] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 00:01:09,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-01 00:01:09,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-04-01 00:01:09,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849270996] [2023-04-01 00:01:09,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 00:01:09,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-04-01 00:01:09,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:01:09,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-04-01 00:01:09,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-04-01 00:01:09,194 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-04-01 00:01:09,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:01:09,229 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2023-04-01 00:01:09,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-04-01 00:01:09,229 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 30 [2023-04-01 00:01:09,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:01:09,230 INFO L225 Difference]: With dead ends: 29 [2023-04-01 00:01:09,230 INFO L226 Difference]: Without dead ends: 25 [2023-04-01 00:01:09,230 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-04-01 00:01:09,231 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 8 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-01 00:01:09,231 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 51 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-01 00:01:09,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-04-01 00:01:09,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2023-04-01 00:01:09,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2023-04-01 00:01:09,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2023-04-01 00:01:09,235 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 30 [2023-04-01 00:01:09,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:01:09,235 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2023-04-01 00:01:09,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-04-01 00:01:09,235 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2023-04-01 00:01:09,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-04-01 00:01:09,236 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:01:09,236 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 00:01:09,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-04-01 00:01:09,236 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:01:09,236 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:01:09,236 INFO L85 PathProgramCache]: Analyzing trace with hash 230981023, now seen corresponding path program 3 times [2023-04-01 00:01:09,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:01:09,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480226120] [2023-04-01 00:01:09,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:01:09,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:01:09,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:01:09,567 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 9 proven. 17 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-04-01 00:01:09,568 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:01:09,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480226120] [2023-04-01 00:01:09,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480226120] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 00:01:09,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [779891139] [2023-04-01 00:01:09,568 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-04-01 00:01:09,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:01:09,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 00:01:09,569 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 00:01:09,572 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 00:01:09,642 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-04-01 00:01:09,643 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 00:01:09,644 INFO L262 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 41 conjunts are in the unsatisfiable core [2023-04-01 00:01:09,647 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 00:01:09,865 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-04-01 00:01:09,865 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 00:01:10,659 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 8 proven. 14 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-04-01 00:01:10,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [779891139] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 00:01:10,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1429476617] [2023-04-01 00:01:10,661 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2023-04-01 00:01:10,661 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 00:01:10,662 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 00:01:10,663 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 00:01:10,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11, 14] total 33 [2023-04-01 00:01:10,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956492173] [2023-04-01 00:01:10,664 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 00:01:10,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-04-01 00:01:10,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:01:10,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-04-01 00:01:10,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=935, Unknown=0, NotChecked=0, Total=1056 [2023-04-01 00:01:10,667 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand has 33 states, 30 states have (on average 1.5666666666666667) internal successors, (47), 23 states have internal predecessors, (47), 8 states have call successors, (10), 1 states have call predecessors, (10), 8 states have return successors, (11), 11 states have call predecessors, (11), 8 states have call successors, (11) [2023-04-01 00:01:11,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:01:11,162 INFO L93 Difference]: Finished difference Result 44 states and 54 transitions. [2023-04-01 00:01:11,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-04-01 00:01:11,163 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 30 states have (on average 1.5666666666666667) internal successors, (47), 23 states have internal predecessors, (47), 8 states have call successors, (10), 1 states have call predecessors, (10), 8 states have return successors, (11), 11 states have call predecessors, (11), 8 states have call successors, (11) Word has length 37 [2023-04-01 00:01:11,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:01:11,163 INFO L225 Difference]: With dead ends: 44 [2023-04-01 00:01:11,164 INFO L226 Difference]: Without dead ends: 40 [2023-04-01 00:01:11,164 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 383 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=258, Invalid=1548, Unknown=0, NotChecked=0, Total=1806 [2023-04-01 00:01:11,167 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 47 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-04-01 00:01:11,167 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 179 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-04-01 00:01:11,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2023-04-01 00:01:11,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 32. [2023-04-01 00:01:11,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 19 states have (on average 1.105263157894737) internal successors, (21), 21 states have internal predecessors, (21), 7 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (14), 7 states have call predecessors, (14), 6 states have call successors, (14) [2023-04-01 00:01:11,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2023-04-01 00:01:11,173 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 37 [2023-04-01 00:01:11,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:01:11,173 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2023-04-01 00:01:11,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 30 states have (on average 1.5666666666666667) internal successors, (47), 23 states have internal predecessors, (47), 8 states have call successors, (10), 1 states have call predecessors, (10), 8 states have return successors, (11), 11 states have call predecessors, (11), 8 states have call successors, (11) [2023-04-01 00:01:11,174 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2023-04-01 00:01:11,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-04-01 00:01:11,174 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:01:11,174 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 00:01:11,191 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 00:01:11,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:01:11,382 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:01:11,382 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:01:11,383 INFO L85 PathProgramCache]: Analyzing trace with hash -139139097, now seen corresponding path program 1 times [2023-04-01 00:01:11,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:01:11,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650844628] [2023-04-01 00:01:11,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:01:11,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:01:11,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:01:11,460 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-04-01 00:01:11,461 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:01:11,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650844628] [2023-04-01 00:01:11,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650844628] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 00:01:11,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [626587407] [2023-04-01 00:01:11,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:01:11,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:01:11,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 00:01:11,463 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 00:01:11,523 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 00:01:11,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:01:11,565 INFO L262 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 6 conjunts are in the unsatisfiable core [2023-04-01 00:01:11,567 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 00:01:11,592 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 20 proven. 5 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-04-01 00:01:11,592 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 00:01:11,712 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-04-01 00:01:11,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [626587407] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 00:01:11,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1950554438] [2023-04-01 00:01:11,714 INFO L159 IcfgInterpreter]: Started Sifa with 23 locations of interest [2023-04-01 00:01:11,714 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 00:01:11,714 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 00:01:11,714 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 00:01:11,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 10 [2023-04-01 00:01:11,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127589082] [2023-04-01 00:01:11,715 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 00:01:11,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-04-01 00:01:11,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:01:11,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-04-01 00:01:11,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-04-01 00:01:11,716 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 10 states have internal predecessors, (33), 5 states have call successors, (9), 1 states have call predecessors, (9), 4 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2023-04-01 00:01:11,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:01:11,803 INFO L93 Difference]: Finished difference Result 60 states and 86 transitions. [2023-04-01 00:01:11,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-04-01 00:01:11,803 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 10 states have internal predecessors, (33), 5 states have call successors, (9), 1 states have call predecessors, (9), 4 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) Word has length 43 [2023-04-01 00:01:11,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:01:11,804 INFO L225 Difference]: With dead ends: 60 [2023-04-01 00:01:11,804 INFO L226 Difference]: Without dead ends: 28 [2023-04-01 00:01:11,805 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 84 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2023-04-01 00:01:11,805 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 20 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-01 00:01:11,806 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 65 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-01 00:01:11,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-04-01 00:01:11,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2023-04-01 00:01:11,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 18 states have internal predecessors, (18), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) [2023-04-01 00:01:11,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2023-04-01 00:01:11,809 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 43 [2023-04-01 00:01:11,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:01:11,809 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2023-04-01 00:01:11,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 10 states have internal predecessors, (33), 5 states have call successors, (9), 1 states have call predecessors, (9), 4 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2023-04-01 00:01:11,810 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2023-04-01 00:01:11,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-04-01 00:01:11,810 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:01:11,810 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 00:01:11,827 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-04-01 00:01:12,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:01:12,011 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:01:12,012 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:01:12,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1283633839, now seen corresponding path program 4 times [2023-04-01 00:01:12,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:01:12,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397198043] [2023-04-01 00:01:12,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:01:12,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:01:12,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:01:12,340 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 9 proven. 37 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-04-01 00:01:12,340 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:01:12,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397198043] [2023-04-01 00:01:12,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397198043] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 00:01:12,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2022148037] [2023-04-01 00:01:12,341 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-04-01 00:01:12,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:01:12,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 00:01:12,357 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 00:01:12,358 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 00:01:12,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:01:12,399 INFO L262 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 57 conjunts are in the unsatisfiable core [2023-04-01 00:01:12,401 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 00:01:12,814 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 17 proven. 26 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-04-01 00:01:12,814 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 00:01:13,792 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 8 proven. 38 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-04-01 00:01:13,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2022148037] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 00:01:13,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [929871918] [2023-04-01 00:01:13,794 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2023-04-01 00:01:13,794 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 00:01:13,794 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 00:01:13,795 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 00:01:13,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 20] total 46 [2023-04-01 00:01:13,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73928704] [2023-04-01 00:01:13,795 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 00:01:13,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2023-04-01 00:01:13,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:01:13,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2023-04-01 00:01:13,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1905, Unknown=0, NotChecked=0, Total=2070 [2023-04-01 00:01:13,797 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand has 46 states, 43 states have (on average 1.5348837209302326) internal successors, (66), 32 states have internal predecessors, (66), 10 states have call successors, (12), 1 states have call predecessors, (12), 12 states have return successors, (15), 15 states have call predecessors, (15), 10 states have call successors, (15) [2023-04-01 00:01:14,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:01:14,682 INFO L93 Difference]: Finished difference Result 61 states and 73 transitions. [2023-04-01 00:01:14,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-04-01 00:01:14,682 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 43 states have (on average 1.5348837209302326) internal successors, (66), 32 states have internal predecessors, (66), 10 states have call successors, (12), 1 states have call predecessors, (12), 12 states have return successors, (15), 15 states have call predecessors, (15), 10 states have call successors, (15) Word has length 44 [2023-04-01 00:01:14,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:01:14,683 INFO L225 Difference]: With dead ends: 61 [2023-04-01 00:01:14,683 INFO L226 Difference]: Without dead ends: 55 [2023-04-01 00:01:14,684 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 59 SyntacticMatches, 4 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 899 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=430, Invalid=3476, Unknown=0, NotChecked=0, Total=3906 [2023-04-01 00:01:14,685 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 68 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 701 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-04-01 00:01:14,685 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 299 Invalid, 739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 701 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-04-01 00:01:14,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-04-01 00:01:14,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 43. [2023-04-01 00:01:14,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 8 states have call successors, (8), 4 states have call predecessors, (8), 7 states have return successors, (20), 10 states have call predecessors, (20), 7 states have call successors, (20) [2023-04-01 00:01:14,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 57 transitions. [2023-04-01 00:01:14,694 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 57 transitions. Word has length 44 [2023-04-01 00:01:14,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:01:14,695 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 57 transitions. [2023-04-01 00:01:14,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 43 states have (on average 1.5348837209302326) internal successors, (66), 32 states have internal predecessors, (66), 10 states have call successors, (12), 1 states have call predecessors, (12), 12 states have return successors, (15), 15 states have call predecessors, (15), 10 states have call successors, (15) [2023-04-01 00:01:14,695 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 57 transitions. [2023-04-01 00:01:14,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-04-01 00:01:14,699 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:01:14,699 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 5, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 00:01:14,713 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-04-01 00:01:14,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:01:14,906 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:01:14,906 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:01:14,906 INFO L85 PathProgramCache]: Analyzing trace with hash -1281572337, now seen corresponding path program 5 times [2023-04-01 00:01:14,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:01:14,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841895168] [2023-04-01 00:01:14,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:01:14,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:01:14,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:01:15,578 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-04-01 00:01:15,578 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:01:15,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841895168] [2023-04-01 00:01:15,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841895168] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 00:01:15,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1139146080] [2023-04-01 00:01:15,579 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-01 00:01:15,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:01:15,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 00:01:15,580 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 00:01:15,621 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 00:01:15,667 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2023-04-01 00:01:15,668 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 00:01:15,669 INFO L262 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 85 conjunts are in the unsatisfiable core [2023-04-01 00:01:15,672 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 00:01:16,212 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 3 proven. 61 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2023-04-01 00:01:16,212 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 00:01:17,703 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 20 proven. 80 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-04-01 00:01:17,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1139146080] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 00:01:17,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [404944656] [2023-04-01 00:01:17,705 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2023-04-01 00:01:17,705 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 00:01:17,705 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 00:01:17,705 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 00:01:17,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 16, 24] total 57 [2023-04-01 00:01:17,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612766682] [2023-04-01 00:01:17,705 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 00:01:17,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2023-04-01 00:01:17,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:01:17,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2023-04-01 00:01:17,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=2997, Unknown=0, NotChecked=0, Total=3192 [2023-04-01 00:01:17,708 INFO L87 Difference]: Start difference. First operand 43 states and 57 transitions. Second operand has 57 states, 52 states have (on average 1.5192307692307692) internal successors, (79), 39 states have internal predecessors, (79), 15 states have call successors, (17), 1 states have call predecessors, (17), 13 states have return successors, (20), 19 states have call predecessors, (20), 15 states have call successors, (20) [2023-04-01 00:01:18,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:01:18,890 INFO L93 Difference]: Finished difference Result 66 states and 86 transitions. [2023-04-01 00:01:18,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-04-01 00:01:18,890 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 52 states have (on average 1.5192307692307692) internal successors, (79), 39 states have internal predecessors, (79), 15 states have call successors, (17), 1 states have call predecessors, (17), 13 states have return successors, (20), 19 states have call predecessors, (20), 15 states have call successors, (20) Word has length 58 [2023-04-01 00:01:18,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:01:18,891 INFO L225 Difference]: With dead ends: 66 [2023-04-01 00:01:18,891 INFO L226 Difference]: Without dead ends: 58 [2023-04-01 00:01:18,893 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 85 SyntacticMatches, 4 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1265 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=592, Invalid=5414, Unknown=0, NotChecked=0, Total=6006 [2023-04-01 00:01:18,893 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 119 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 1123 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 1183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-04-01 00:01:18,893 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 403 Invalid, 1183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1123 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-04-01 00:01:18,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2023-04-01 00:01:18,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 50. [2023-04-01 00:01:18,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 32 states have (on average 1.09375) internal successors, (35), 33 states have internal predecessors, (35), 9 states have call successors, (9), 5 states have call predecessors, (9), 8 states have return successors, (22), 11 states have call predecessors, (22), 8 states have call successors, (22) [2023-04-01 00:01:18,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 66 transitions. [2023-04-01 00:01:18,905 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 66 transitions. Word has length 58 [2023-04-01 00:01:18,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:01:18,905 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 66 transitions. [2023-04-01 00:01:18,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 52 states have (on average 1.5192307692307692) internal successors, (79), 39 states have internal predecessors, (79), 15 states have call successors, (17), 1 states have call predecessors, (17), 13 states have return successors, (20), 19 states have call predecessors, (20), 15 states have call successors, (20) [2023-04-01 00:01:18,905 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 66 transitions. [2023-04-01 00:01:18,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-04-01 00:01:18,906 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:01:18,906 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 00:01:18,918 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-04-01 00:01:19,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:01:19,121 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:01:19,121 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:01:19,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1181616079, now seen corresponding path program 6 times [2023-04-01 00:01:19,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:01:19,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574060070] [2023-04-01 00:01:19,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:01:19,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:01:19,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:01:19,824 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 2 proven. 66 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-04-01 00:01:19,824 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:01:19,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574060070] [2023-04-01 00:01:19,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574060070] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 00:01:19,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1449457514] [2023-04-01 00:01:19,825 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-04-01 00:01:19,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:01:19,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 00:01:19,829 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 00:01:19,830 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 00:01:19,886 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-04-01 00:01:19,888 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 00:01:19,890 INFO L262 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 69 conjunts are in the unsatisfiable core [2023-04-01 00:01:19,894 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 00:01:20,253 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-04-01 00:01:20,253 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 00:01:21,073 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-04-01 00:01:21,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1449457514] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 00:01:21,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1472135385] [2023-04-01 00:01:21,075 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2023-04-01 00:01:21,075 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 00:01:21,076 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 00:01:21,076 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 00:01:21,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 23] total 56 [2023-04-01 00:01:21,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635978364] [2023-04-01 00:01:21,076 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 00:01:21,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2023-04-01 00:01:21,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:01:21,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2023-04-01 00:01:21,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=2867, Unknown=0, NotChecked=0, Total=3080 [2023-04-01 00:01:21,078 INFO L87 Difference]: Start difference. First operand 50 states and 66 transitions. Second operand has 56 states, 52 states have (on average 1.5384615384615385) internal successors, (80), 38 states have internal predecessors, (80), 14 states have call successors, (16), 1 states have call predecessors, (16), 13 states have return successors, (19), 19 states have call predecessors, (19), 14 states have call successors, (19) [2023-04-01 00:01:22,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:01:22,051 INFO L93 Difference]: Finished difference Result 72 states and 94 transitions. [2023-04-01 00:01:22,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-04-01 00:01:22,051 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 52 states have (on average 1.5384615384615385) internal successors, (80), 38 states have internal predecessors, (80), 14 states have call successors, (16), 1 states have call predecessors, (16), 13 states have return successors, (19), 19 states have call predecessors, (19), 14 states have call successors, (19) Word has length 51 [2023-04-01 00:01:22,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:01:22,053 INFO L225 Difference]: With dead ends: 72 [2023-04-01 00:01:22,053 INFO L226 Difference]: Without dead ends: 64 [2023-04-01 00:01:22,054 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1352 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=592, Invalid=5260, Unknown=0, NotChecked=0, Total=5852 [2023-04-01 00:01:22,055 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 123 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 1004 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 1066 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 1004 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-04-01 00:01:22,055 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 368 Invalid, 1066 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 1004 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-04-01 00:01:22,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2023-04-01 00:01:22,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 50. [2023-04-01 00:01:22,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 32 states have (on average 1.09375) internal successors, (35), 33 states have internal predecessors, (35), 9 states have call successors, (9), 5 states have call predecessors, (9), 8 states have return successors, (21), 11 states have call predecessors, (21), 8 states have call successors, (21) [2023-04-01 00:01:22,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 65 transitions. [2023-04-01 00:01:22,061 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 65 transitions. Word has length 51 [2023-04-01 00:01:22,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:01:22,061 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 65 transitions. [2023-04-01 00:01:22,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 52 states have (on average 1.5384615384615385) internal successors, (80), 38 states have internal predecessors, (80), 14 states have call successors, (16), 1 states have call predecessors, (16), 13 states have return successors, (19), 19 states have call predecessors, (19), 14 states have call successors, (19) [2023-04-01 00:01:22,061 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 65 transitions. [2023-04-01 00:01:22,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-04-01 00:01:22,062 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:01:22,062 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 6, 6, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 00:01:22,067 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 00:01:22,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:01:22,263 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:01:22,263 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:01:22,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1506634205, now seen corresponding path program 7 times [2023-04-01 00:01:22,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:01:22,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936279739] [2023-04-01 00:01:22,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:01:22,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:01:22,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:01:22,972 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 1 proven. 137 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2023-04-01 00:01:22,972 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:01:22,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936279739] [2023-04-01 00:01:22,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936279739] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 00:01:22,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1518185804] [2023-04-01 00:01:22,973 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-04-01 00:01:22,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:01:22,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 00:01:22,989 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 00:01:23,017 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 00:01:23,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:01:23,182 INFO L262 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 97 conjunts are in the unsatisfiable core [2023-04-01 00:01:23,184 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 00:01:23,676 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 2 proven. 85 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2023-04-01 00:01:23,676 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 00:01:25,193 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 8 proven. 118 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2023-04-01 00:01:25,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1518185804] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 00:01:25,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1796627739] [2023-04-01 00:01:25,208 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2023-04-01 00:01:25,208 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 00:01:25,208 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 00:01:25,208 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 00:01:25,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 18, 21] total 59 [2023-04-01 00:01:25,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792246642] [2023-04-01 00:01:25,208 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 00:01:25,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2023-04-01 00:01:25,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:01:25,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2023-04-01 00:01:25,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=3221, Unknown=0, NotChecked=0, Total=3422 [2023-04-01 00:01:25,210 INFO L87 Difference]: Start difference. First operand 50 states and 65 transitions. Second operand has 59 states, 54 states have (on average 1.5) internal successors, (81), 40 states have internal predecessors, (81), 15 states have call successors, (17), 1 states have call predecessors, (17), 14 states have return successors, (21), 20 states have call predecessors, (21), 15 states have call successors, (21) [2023-04-01 00:01:26,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:01:26,721 INFO L93 Difference]: Finished difference Result 75 states and 103 transitions. [2023-04-01 00:01:26,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-04-01 00:01:26,722 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 54 states have (on average 1.5) internal successors, (81), 40 states have internal predecessors, (81), 15 states have call successors, (17), 1 states have call predecessors, (17), 14 states have return successors, (21), 20 states have call predecessors, (21), 15 states have call successors, (21) Word has length 65 [2023-04-01 00:01:26,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:01:26,723 INFO L225 Difference]: With dead ends: 75 [2023-04-01 00:01:26,723 INFO L226 Difference]: Without dead ends: 67 [2023-04-01 00:01:26,724 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 100 SyntacticMatches, 4 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1399 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=654, Invalid=5988, Unknown=0, NotChecked=0, Total=6642 [2023-04-01 00:01:26,725 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 94 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 978 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 1028 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 978 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-04-01 00:01:26,725 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 382 Invalid, 1028 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 978 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-04-01 00:01:26,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2023-04-01 00:01:26,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 59. [2023-04-01 00:01:26,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 38 states have (on average 1.105263157894737) internal successors, (42), 39 states have internal predecessors, (42), 11 states have call successors, (11), 6 states have call predecessors, (11), 9 states have return successors, (30), 13 states have call predecessors, (30), 10 states have call successors, (30) [2023-04-01 00:01:26,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 83 transitions. [2023-04-01 00:01:26,741 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 83 transitions. Word has length 65 [2023-04-01 00:01:26,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:01:26,741 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 83 transitions. [2023-04-01 00:01:26,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 54 states have (on average 1.5) internal successors, (81), 40 states have internal predecessors, (81), 15 states have call successors, (17), 1 states have call predecessors, (17), 14 states have return successors, (21), 20 states have call predecessors, (21), 15 states have call successors, (21) [2023-04-01 00:01:26,741 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 83 transitions. [2023-04-01 00:01:26,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-04-01 00:01:26,743 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:01:26,743 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 7, 7, 7, 7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 00:01:26,749 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-04-01 00:01:26,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:01:26,944 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:01:26,944 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:01:26,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1554407009, now seen corresponding path program 8 times [2023-04-01 00:01:26,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:01:26,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290907645] [2023-04-01 00:01:26,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:01:26,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:01:26,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:01:28,037 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 4 proven. 175 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2023-04-01 00:01:28,038 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:01:28,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290907645] [2023-04-01 00:01:28,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290907645] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 00:01:28,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [598986134] [2023-04-01 00:01:28,038 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-01 00:01:28,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:01:28,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 00:01:28,039 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 00:01:28,041 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 00:01:28,101 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2023-04-01 00:01:28,101 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 00:01:28,104 INFO L262 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 109 conjunts are in the unsatisfiable core [2023-04-01 00:01:28,106 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 00:01:28,989 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 5 proven. 108 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2023-04-01 00:01:28,989 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 00:01:31,343 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 26 proven. 156 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-04-01 00:01:31,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [598986134] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 00:01:31,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1642592470] [2023-04-01 00:01:31,346 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2023-04-01 00:01:31,347 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 00:01:31,347 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 00:01:31,369 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 00:01:31,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 20, 30] total 68 [2023-04-01 00:01:31,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142709726] [2023-04-01 00:01:31,370 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 00:01:31,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2023-04-01 00:01:31,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:01:31,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2023-04-01 00:01:31,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=4289, Unknown=0, NotChecked=0, Total=4556 [2023-04-01 00:01:31,373 INFO L87 Difference]: Start difference. First operand 59 states and 83 transitions. Second operand has 68 states, 63 states have (on average 1.507936507936508) internal successors, (95), 45 states have internal predecessors, (95), 17 states have call successors, (19), 1 states have call predecessors, (19), 17 states have return successors, (26), 24 states have call predecessors, (26), 17 states have call successors, (26) [2023-04-01 00:01:33,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:01:33,020 INFO L93 Difference]: Finished difference Result 84 states and 121 transitions. [2023-04-01 00:01:33,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-04-01 00:01:33,021 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 63 states have (on average 1.507936507936508) internal successors, (95), 45 states have internal predecessors, (95), 17 states have call successors, (19), 1 states have call predecessors, (19), 17 states have return successors, (26), 24 states have call predecessors, (26), 17 states have call successors, (26) Word has length 72 [2023-04-01 00:01:33,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:01:33,022 INFO L225 Difference]: With dead ends: 84 [2023-04-01 00:01:33,022 INFO L226 Difference]: Without dead ends: 76 [2023-04-01 00:01:33,024 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 100 SyntacticMatches, 12 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2302 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=779, Invalid=7593, Unknown=0, NotChecked=0, Total=8372 [2023-04-01 00:01:33,024 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 125 mSDsluCounter, 622 mSDsCounter, 0 mSdLazyCounter, 1637 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 1694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-04-01 00:01:33,024 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 645 Invalid, 1694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1637 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-04-01 00:01:33,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2023-04-01 00:01:33,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 62. [2023-04-01 00:01:33,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 40 states have (on average 1.1) internal successors, (44), 41 states have internal predecessors, (44), 11 states have call successors, (11), 6 states have call predecessors, (11), 10 states have return successors, (33), 14 states have call predecessors, (33), 10 states have call successors, (33) [2023-04-01 00:01:33,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 88 transitions. [2023-04-01 00:01:33,038 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 88 transitions. Word has length 72 [2023-04-01 00:01:33,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:01:33,038 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 88 transitions. [2023-04-01 00:01:33,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 63 states have (on average 1.507936507936508) internal successors, (95), 45 states have internal predecessors, (95), 17 states have call successors, (19), 1 states have call predecessors, (19), 17 states have return successors, (26), 24 states have call predecessors, (26), 17 states have call successors, (26) [2023-04-01 00:01:33,039 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 88 transitions. [2023-04-01 00:01:33,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2023-04-01 00:01:33,039 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:01:33,039 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 00:01:33,058 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 00:01:33,249 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,SelfDestructingSolverStorable10 [2023-04-01 00:01:33,249 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:01:33,249 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:01:33,249 INFO L85 PathProgramCache]: Analyzing trace with hash 164032813, now seen corresponding path program 9 times [2023-04-01 00:01:33,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:01:33,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600849612] [2023-04-01 00:01:33,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:01:33,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:01:33,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:01:34,487 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 0 proven. 232 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2023-04-01 00:01:34,487 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:01:34,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600849612] [2023-04-01 00:01:34,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600849612] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 00:01:34,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1334768145] [2023-04-01 00:01:34,488 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-04-01 00:01:34,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:01:34,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 00:01:34,489 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 00:01:34,491 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 00:01:34,552 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-04-01 00:01:34,552 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 00:01:34,554 INFO L262 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 121 conjunts are in the unsatisfiable core [2023-04-01 00:01:34,556 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 00:01:35,536 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 6 proven. 136 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2023-04-01 00:01:35,537 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 00:01:38,521 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 29 proven. 203 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2023-04-01 00:01:38,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1334768145] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 00:01:38,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [228499478] [2023-04-01 00:01:38,525 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2023-04-01 00:01:38,525 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 00:01:38,525 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 00:01:38,526 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 00:01:38,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 22, 33] total 78 [2023-04-01 00:01:38,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002196834] [2023-04-01 00:01:38,526 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 00:01:38,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 78 states [2023-04-01 00:01:38,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:01:38,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2023-04-01 00:01:38,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=5739, Unknown=0, NotChecked=0, Total=6006 [2023-04-01 00:01:38,529 INFO L87 Difference]: Start difference. First operand 62 states and 88 transitions. Second operand has 78 states, 73 states have (on average 1.5342465753424657) internal successors, (112), 51 states have internal predecessors, (112), 21 states have call successors, (23), 1 states have call predecessors, (23), 19 states have return successors, (29), 28 states have call predecessors, (29), 21 states have call successors, (29) [2023-04-01 00:01:40,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:01:40,439 INFO L93 Difference]: Finished difference Result 85 states and 122 transitions. [2023-04-01 00:01:40,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-04-01 00:01:40,440 INFO L78 Accepts]: Start accepts. Automaton has has 78 states, 73 states have (on average 1.5342465753424657) internal successors, (112), 51 states have internal predecessors, (112), 21 states have call successors, (23), 1 states have call predecessors, (23), 19 states have return successors, (29), 28 states have call predecessors, (29), 21 states have call successors, (29) Word has length 79 [2023-04-01 00:01:40,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:01:40,441 INFO L225 Difference]: With dead ends: 85 [2023-04-01 00:01:40,441 INFO L226 Difference]: Without dead ends: 79 [2023-04-01 00:01:40,443 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 115 SyntacticMatches, 4 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2187 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=937, Invalid=9569, Unknown=0, NotChecked=0, Total=10506 [2023-04-01 00:01:40,443 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 364 mSDsluCounter, 730 mSDsCounter, 0 mSdLazyCounter, 1830 mSolverCounterSat, 175 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 755 SdHoareTripleChecker+Invalid, 2005 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 175 IncrementalHoareTripleChecker+Valid, 1830 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-04-01 00:01:40,443 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 755 Invalid, 2005 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [175 Valid, 1830 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-04-01 00:01:40,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2023-04-01 00:01:40,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 65. [2023-04-01 00:01:40,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 42 states have (on average 1.0952380952380953) internal successors, (46), 43 states have internal predecessors, (46), 11 states have call successors, (11), 6 states have call predecessors, (11), 11 states have return successors, (36), 15 states have call predecessors, (36), 10 states have call successors, (36) [2023-04-01 00:01:40,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 93 transitions. [2023-04-01 00:01:40,458 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 93 transitions. Word has length 79 [2023-04-01 00:01:40,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:01:40,459 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 93 transitions. [2023-04-01 00:01:40,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 78 states, 73 states have (on average 1.5342465753424657) internal successors, (112), 51 states have internal predecessors, (112), 21 states have call successors, (23), 1 states have call predecessors, (23), 19 states have return successors, (29), 28 states have call predecessors, (29), 21 states have call successors, (29) [2023-04-01 00:01:40,459 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 93 transitions. [2023-04-01 00:01:40,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-04-01 00:01:40,460 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:01:40,460 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 9, 9, 9, 9, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 00:01:40,465 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-04-01 00:01:40,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:01:40,667 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:01:40,667 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:01:40,668 INFO L85 PathProgramCache]: Analyzing trace with hash 332752307, now seen corresponding path program 10 times [2023-04-01 00:01:40,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:01:40,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067220843] [2023-04-01 00:01:40,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:01:40,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:01:40,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:01:42,003 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 4 proven. 281 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2023-04-01 00:01:42,003 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:01:42,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067220843] [2023-04-01 00:01:42,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067220843] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 00:01:42,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2078969730] [2023-04-01 00:01:42,003 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-04-01 00:01:42,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:01:42,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 00:01:42,004 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 00:01:42,007 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 00:01:42,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:01:42,102 INFO L262 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 133 conjunts are in the unsatisfiable core [2023-04-01 00:01:42,104 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 00:01:43,108 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 7 proven. 167 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2023-04-01 00:01:43,108 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 00:01:46,675 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 32 proven. 256 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2023-04-01 00:01:46,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2078969730] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 00:01:46,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1285348042] [2023-04-01 00:01:46,678 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2023-04-01 00:01:46,678 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 00:01:46,679 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 00:01:46,679 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 00:01:46,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 24, 36] total 82 [2023-04-01 00:01:46,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577285655] [2023-04-01 00:01:46,679 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 00:01:46,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 82 states [2023-04-01 00:01:46,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:01:46,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2023-04-01 00:01:46,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=6319, Unknown=0, NotChecked=0, Total=6642 [2023-04-01 00:01:46,683 INFO L87 Difference]: Start difference. First operand 65 states and 93 transitions. Second operand has 82 states, 77 states have (on average 1.5194805194805194) internal successors, (117), 53 states have internal predecessors, (117), 21 states have call successors, (23), 1 states have call predecessors, (23), 21 states have return successors, (32), 30 states have call predecessors, (32), 21 states have call successors, (32) [2023-04-01 00:01:48,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:01:48,482 INFO L93 Difference]: Finished difference Result 88 states and 127 transitions. [2023-04-01 00:01:48,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-04-01 00:01:48,483 INFO L78 Accepts]: Start accepts. Automaton has has 82 states, 77 states have (on average 1.5194805194805194) internal successors, (117), 53 states have internal predecessors, (117), 21 states have call successors, (23), 1 states have call predecessors, (23), 21 states have return successors, (32), 30 states have call predecessors, (32), 21 states have call successors, (32) Word has length 86 [2023-04-01 00:01:48,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:01:48,485 INFO L225 Difference]: With dead ends: 88 [2023-04-01 00:01:48,485 INFO L226 Difference]: Without dead ends: 82 [2023-04-01 00:01:48,486 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 118 SyntacticMatches, 14 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3203 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=1019, Invalid=10537, Unknown=0, NotChecked=0, Total=11556 [2023-04-01 00:01:48,488 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 302 mSDsluCounter, 838 mSDsCounter, 0 mSdLazyCounter, 2131 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 864 SdHoareTripleChecker+Invalid, 2271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 2131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-04-01 00:01:48,488 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 864 Invalid, 2271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 2131 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-04-01 00:01:48,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2023-04-01 00:01:48,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 68. [2023-04-01 00:01:48,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 44 states have (on average 1.0909090909090908) internal successors, (48), 45 states have internal predecessors, (48), 11 states have call successors, (11), 6 states have call predecessors, (11), 12 states have return successors, (39), 16 states have call predecessors, (39), 10 states have call successors, (39) [2023-04-01 00:01:48,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 98 transitions. [2023-04-01 00:01:48,512 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 98 transitions. Word has length 86 [2023-04-01 00:01:48,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:01:48,513 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 98 transitions. [2023-04-01 00:01:48,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 82 states, 77 states have (on average 1.5194805194805194) internal successors, (117), 53 states have internal predecessors, (117), 21 states have call successors, (23), 1 states have call predecessors, (23), 21 states have return successors, (32), 30 states have call predecessors, (32), 21 states have call successors, (32) [2023-04-01 00:01:48,514 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 98 transitions. [2023-04-01 00:01:48,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-04-01 00:01:48,515 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:01:48,515 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 9, 9, 9, 9, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 00:01:48,521 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 00:01:48,721 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,SelfDestructingSolverStorable12 [2023-04-01 00:01:48,721 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:01:48,721 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:01:48,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1398565305, now seen corresponding path program 11 times [2023-04-01 00:01:48,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:01:48,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403717102] [2023-04-01 00:01:48,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:01:48,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:01:48,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:01:49,969 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 0 proven. 288 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2023-04-01 00:01:49,969 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:01:49,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403717102] [2023-04-01 00:01:49,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403717102] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 00:01:49,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [167222893] [2023-04-01 00:01:49,969 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-01 00:01:49,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:01:49,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 00:01:49,971 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 00:01:49,973 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 00:01:50,050 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2023-04-01 00:01:50,050 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 00:01:50,052 INFO L262 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 133 conjunts are in the unsatisfiable core [2023-04-01 00:01:50,054 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 00:01:50,887 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 9 proven. 160 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2023-04-01 00:01:50,887 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 00:01:53,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [167222893] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 00:01:53,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1774560921] [2023-04-01 00:01:53,642 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2023-04-01 00:01:53,643 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 00:01:53,643 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 00:01:53,643 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-01 00:01:53,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 20] total 57 [2023-04-01 00:01:53,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943603920] [2023-04-01 00:01:53,643 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-01 00:01:53,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2023-04-01 00:01:53,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:01:53,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2023-04-01 00:01:53,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=5733, Unknown=0, NotChecked=0, Total=6006 [2023-04-01 00:01:53,645 INFO L87 Difference]: Start difference. First operand 68 states and 98 transitions. Second operand has 57 states, 53 states have (on average 1.490566037735849) internal successors, (79), 39 states have internal predecessors, (79), 13 states have call successors, (15), 1 states have call predecessors, (15), 17 states have return successors, (19), 19 states have call predecessors, (19), 13 states have call successors, (19) [2023-04-01 00:01:54,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:01:54,631 INFO L93 Difference]: Finished difference Result 78 states and 108 transitions. [2023-04-01 00:01:54,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-04-01 00:01:54,631 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 53 states have (on average 1.490566037735849) internal successors, (79), 39 states have internal predecessors, (79), 13 states have call successors, (15), 1 states have call predecessors, (15), 17 states have return successors, (19), 19 states have call predecessors, (19), 13 states have call successors, (19) Word has length 86 [2023-04-01 00:01:54,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:01:54,632 INFO L225 Difference]: With dead ends: 78 [2023-04-01 00:01:54,632 INFO L226 Difference]: Without dead ends: 74 [2023-04-01 00:01:54,633 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 93 SyntacticMatches, 8 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1647 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=718, Invalid=7838, Unknown=0, NotChecked=0, Total=8556 [2023-04-01 00:01:54,633 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 129 mSDsluCounter, 620 mSDsCounter, 0 mSdLazyCounter, 1097 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 642 SdHoareTripleChecker+Invalid, 1160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1097 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-04-01 00:01:54,634 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 642 Invalid, 1160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1097 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-04-01 00:01:54,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2023-04-01 00:01:54,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 70. [2023-04-01 00:01:54,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 45 states have (on average 1.0888888888888888) internal successors, (49), 46 states have internal predecessors, (49), 12 states have call successors, (12), 6 states have call predecessors, (12), 12 states have return successors, (40), 17 states have call predecessors, (40), 11 states have call successors, (40) [2023-04-01 00:01:54,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 101 transitions. [2023-04-01 00:01:54,646 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 101 transitions. Word has length 86 [2023-04-01 00:01:54,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:01:54,646 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 101 transitions. [2023-04-01 00:01:54,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 53 states have (on average 1.490566037735849) internal successors, (79), 39 states have internal predecessors, (79), 13 states have call successors, (15), 1 states have call predecessors, (15), 17 states have return successors, (19), 19 states have call predecessors, (19), 13 states have call successors, (19) [2023-04-01 00:01:54,647 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 101 transitions. [2023-04-01 00:01:54,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-04-01 00:01:54,648 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:01:54,648 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 7, 7, 7, 7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 00:01:54,655 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 00:01:54,853 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,SelfDestructingSolverStorable13 [2023-04-01 00:01:54,853 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:01:54,854 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:01:54,854 INFO L85 PathProgramCache]: Analyzing trace with hash 494096395, now seen corresponding path program 12 times [2023-04-01 00:01:54,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:01:54,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999981183] [2023-04-01 00:01:54,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:01:54,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:01:54,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:01:55,630 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-04-01 00:01:55,630 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:01:55,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999981183] [2023-04-01 00:01:55,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999981183] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 00:01:55,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1167859464] [2023-04-01 00:01:55,630 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-04-01 00:01:55,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:01:55,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 00:01:55,632 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 00:01:55,634 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 00:01:55,705 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-04-01 00:01:55,706 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 00:01:55,707 INFO L262 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 109 conjunts are in the unsatisfiable core [2023-04-01 00:01:55,709 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 00:01:56,344 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 4 proven. 106 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-04-01 00:01:56,345 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 00:01:58,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1167859464] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 00:01:58,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1781912167] [2023-04-01 00:01:58,672 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2023-04-01 00:01:58,672 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 00:01:58,672 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 00:01:58,672 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-01 00:01:58,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 18] total 49 [2023-04-01 00:01:58,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288477897] [2023-04-01 00:01:58,673 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-01 00:01:58,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2023-04-01 00:01:58,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:01:58,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2023-04-01 00:01:58,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=245, Invalid=4585, Unknown=0, NotChecked=0, Total=4830 [2023-04-01 00:01:58,674 INFO L87 Difference]: Start difference. First operand 70 states and 101 transitions. Second operand has 49 states, 45 states have (on average 1.4444444444444444) internal successors, (65), 34 states have internal predecessors, (65), 11 states have call successors, (13), 1 states have call predecessors, (13), 14 states have return successors, (16), 16 states have call predecessors, (16), 11 states have call successors, (16) [2023-04-01 00:01:59,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:01:59,584 INFO L93 Difference]: Finished difference Result 78 states and 107 transitions. [2023-04-01 00:01:59,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-04-01 00:01:59,584 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 45 states have (on average 1.4444444444444444) internal successors, (65), 34 states have internal predecessors, (65), 11 states have call successors, (13), 1 states have call predecessors, (13), 14 states have return successors, (16), 16 states have call predecessors, (16), 11 states have call successors, (16) Word has length 72 [2023-04-01 00:01:59,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:01:59,585 INFO L225 Difference]: With dead ends: 78 [2023-04-01 00:01:59,586 INFO L226 Difference]: Without dead ends: 74 [2023-04-01 00:01:59,586 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 86 SyntacticMatches, 3 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1323 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=600, Invalid=6206, Unknown=0, NotChecked=0, Total=6806 [2023-04-01 00:01:59,587 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 79 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 992 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 1029 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 992 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-04-01 00:01:59,587 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 599 Invalid, 1029 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 992 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-04-01 00:01:59,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2023-04-01 00:01:59,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 64. [2023-04-01 00:01:59,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 42 states have internal predecessors, (44), 10 states have call successors, (10), 5 states have call predecessors, (10), 12 states have return successors, (35), 16 states have call predecessors, (35), 9 states have call successors, (35) [2023-04-01 00:01:59,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 89 transitions. [2023-04-01 00:01:59,596 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 89 transitions. Word has length 72 [2023-04-01 00:01:59,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:01:59,597 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 89 transitions. [2023-04-01 00:01:59,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 45 states have (on average 1.4444444444444444) internal successors, (65), 34 states have internal predecessors, (65), 11 states have call successors, (13), 1 states have call predecessors, (13), 14 states have return successors, (16), 16 states have call predecessors, (16), 11 states have call successors, (16) [2023-04-01 00:01:59,597 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 89 transitions. [2023-04-01 00:01:59,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-04-01 00:01:59,597 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:01:59,597 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 5, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 00:01:59,605 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 00:01:59,798 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,SelfDestructingSolverStorable14 [2023-04-01 00:01:59,798 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:01:59,798 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:01:59,799 INFO L85 PathProgramCache]: Analyzing trace with hash 65805149, now seen corresponding path program 13 times [2023-04-01 00:01:59,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:01:59,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957352952] [2023-04-01 00:01:59,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:01:59,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:01:59,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:02:00,265 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 4 proven. 100 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-04-01 00:02:00,265 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:02:00,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957352952] [2023-04-01 00:02:00,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957352952] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 00:02:00,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [104725680] [2023-04-01 00:02:00,266 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-04-01 00:02:00,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:02:00,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 00:02:00,267 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 00:02:00,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-04-01 00:02:00,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:02:00,373 INFO L262 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 81 conjunts are in the unsatisfiable core [2023-04-01 00:02:00,375 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 00:02:01,047 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 27 proven. 59 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2023-04-01 00:02:01,048 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 00:02:02,832 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 8 proven. 96 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-04-01 00:02:02,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [104725680] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 00:02:02,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [125426020] [2023-04-01 00:02:02,845 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2023-04-01 00:02:02,846 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 00:02:02,846 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 00:02:02,846 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 00:02:02,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 23, 26] total 65 [2023-04-01 00:02:02,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29825303] [2023-04-01 00:02:02,846 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 00:02:02,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2023-04-01 00:02:02,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:02:02,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2023-04-01 00:02:02,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=3933, Unknown=0, NotChecked=0, Total=4160 [2023-04-01 00:02:02,849 INFO L87 Difference]: Start difference. First operand 64 states and 89 transitions. Second operand has 65 states, 62 states have (on average 1.5483870967741935) internal successors, (96), 44 states have internal predecessors, (96), 16 states have call successors, (18), 1 states have call predecessors, (18), 18 states have return successors, (22), 22 states have call predecessors, (22), 16 states have call successors, (22) [2023-04-01 00:02:04,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:02:04,329 INFO L93 Difference]: Finished difference Result 82 states and 102 transitions. [2023-04-01 00:02:04,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-04-01 00:02:04,329 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 62 states have (on average 1.5483870967741935) internal successors, (96), 44 states have internal predecessors, (96), 16 states have call successors, (18), 1 states have call predecessors, (18), 18 states have return successors, (22), 22 states have call predecessors, (22), 16 states have call successors, (22) Word has length 58 [2023-04-01 00:02:04,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:02:04,330 INFO L225 Difference]: With dead ends: 82 [2023-04-01 00:02:04,330 INFO L226 Difference]: Without dead ends: 78 [2023-04-01 00:02:04,331 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 76 SyntacticMatches, 2 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1488 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=771, Invalid=6711, Unknown=0, NotChecked=0, Total=7482 [2023-04-01 00:02:04,331 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 38 mSDsluCounter, 653 mSDsCounter, 0 mSdLazyCounter, 1442 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 677 SdHoareTripleChecker+Invalid, 1474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-04-01 00:02:04,331 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 677 Invalid, 1474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1442 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-04-01 00:02:04,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-04-01 00:02:04,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 70. [2023-04-01 00:02:04,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 45 states have (on average 1.0666666666666667) internal successors, (48), 46 states have internal predecessors, (48), 10 states have call successors, (10), 5 states have call predecessors, (10), 14 states have return successors, (34), 18 states have call predecessors, (34), 9 states have call successors, (34) [2023-04-01 00:02:04,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 92 transitions. [2023-04-01 00:02:04,348 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 92 transitions. Word has length 58 [2023-04-01 00:02:04,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:02:04,348 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 92 transitions. [2023-04-01 00:02:04,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 62 states have (on average 1.5483870967741935) internal successors, (96), 44 states have internal predecessors, (96), 16 states have call successors, (18), 1 states have call predecessors, (18), 18 states have return successors, (22), 22 states have call predecessors, (22), 16 states have call successors, (22) [2023-04-01 00:02:04,349 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 92 transitions. [2023-04-01 00:02:04,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-04-01 00:02:04,361 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:02:04,361 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 13, 13, 13, 13, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 00:02:04,370 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-04-01 00:02:04,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-04-01 00:02:04,566 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:02:04,566 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:02:04,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1650337813, now seen corresponding path program 14 times [2023-04-01 00:02:04,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:02:04,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098996168] [2023-04-01 00:02:04,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:02:04,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:02:04,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:02:07,334 INFO L134 CoverageAnalysis]: Checked inductivity of 681 backedges. 0 proven. 572 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2023-04-01 00:02:07,334 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:02:07,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098996168] [2023-04-01 00:02:07,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098996168] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 00:02:07,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1389308956] [2023-04-01 00:02:07,335 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-01 00:02:07,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:02:07,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 00:02:07,338 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 00:02:07,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-04-01 00:02:07,442 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2023-04-01 00:02:07,442 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 00:02:07,445 WARN L260 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 181 conjunts are in the unsatisfiable core [2023-04-01 00:02:07,447 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 00:02:09,010 INFO L134 CoverageAnalysis]: Checked inductivity of 681 backedges. 8 proven. 315 refuted. 0 times theorem prover too weak. 358 trivial. 0 not checked. [2023-04-01 00:02:09,010 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 00:02:13,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1389308956] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 00:02:13,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [748600559] [2023-04-01 00:02:13,783 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2023-04-01 00:02:13,784 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 00:02:13,784 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 00:02:13,784 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-01 00:02:13,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 26] total 75 [2023-04-01 00:02:13,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995846674] [2023-04-01 00:02:13,784 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-01 00:02:13,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2023-04-01 00:02:13,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:02:13,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2023-04-01 00:02:13,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=365, Invalid=10347, Unknown=0, NotChecked=0, Total=10712 [2023-04-01 00:02:13,786 INFO L87 Difference]: Start difference. First operand 70 states and 92 transitions. Second operand has 75 states, 71 states have (on average 1.4507042253521127) internal successors, (103), 50 states have internal predecessors, (103), 17 states have call successors, (19), 1 states have call predecessors, (19), 24 states have return successors, (26), 26 states have call predecessors, (26), 17 states have call successors, (26) [2023-04-01 00:02:15,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:02:15,803 INFO L93 Difference]: Finished difference Result 81 states and 108 transitions. [2023-04-01 00:02:15,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-04-01 00:02:15,803 INFO L78 Accepts]: Start accepts. Automaton has has 75 states, 71 states have (on average 1.4507042253521127) internal successors, (103), 50 states have internal predecessors, (103), 17 states have call successors, (19), 1 states have call predecessors, (19), 24 states have return successors, (26), 26 states have call predecessors, (26), 17 states have call successors, (26) Word has length 114 [2023-04-01 00:02:15,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:02:15,804 INFO L225 Difference]: With dead ends: 81 [2023-04-01 00:02:15,804 INFO L226 Difference]: Without dead ends: 77 [2023-04-01 00:02:15,805 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 140 SyntacticMatches, 3 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2773 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=1166, Invalid=14334, Unknown=0, NotChecked=0, Total=15500 [2023-04-01 00:02:15,806 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 144 mSDsluCounter, 1040 mSDsCounter, 0 mSdLazyCounter, 2110 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 1066 SdHoareTripleChecker+Invalid, 2180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 2110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-04-01 00:02:15,806 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 1066 Invalid, 2180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 2110 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-04-01 00:02:15,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-04-01 00:02:15,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 73. [2023-04-01 00:02:15,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 47 states have (on average 1.0638297872340425) internal successors, (50), 48 states have internal predecessors, (50), 10 states have call successors, (10), 5 states have call predecessors, (10), 15 states have return successors, (41), 19 states have call predecessors, (41), 9 states have call successors, (41) [2023-04-01 00:02:15,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 101 transitions. [2023-04-01 00:02:15,823 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 101 transitions. Word has length 114 [2023-04-01 00:02:15,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:02:15,826 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 101 transitions. [2023-04-01 00:02:15,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 71 states have (on average 1.4507042253521127) internal successors, (103), 50 states have internal predecessors, (103), 17 states have call successors, (19), 1 states have call predecessors, (19), 24 states have return successors, (26), 26 states have call predecessors, (26), 17 states have call successors, (26) [2023-04-01 00:02:15,826 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 101 transitions. [2023-04-01 00:02:15,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-04-01 00:02:15,827 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:02:15,827 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 10, 10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 00:02:15,832 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-04-01 00:02:16,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:02:16,032 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:02:16,033 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:02:16,033 INFO L85 PathProgramCache]: Analyzing trace with hash 353591387, now seen corresponding path program 15 times [2023-04-01 00:02:16,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:02:16,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807771566] [2023-04-01 00:02:16,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:02:16,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:02:16,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:02:17,458 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 350 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2023-04-01 00:02:17,458 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:02:17,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807771566] [2023-04-01 00:02:17,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807771566] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 00:02:17,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1078452981] [2023-04-01 00:02:17,458 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-04-01 00:02:17,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:02:17,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 00:02:17,459 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 00:02:17,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-04-01 00:02:17,563 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-04-01 00:02:17,563 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 00:02:17,565 WARN L260 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 145 conjunts are in the unsatisfiable core [2023-04-01 00:02:17,567 INFO L285 TraceCheckSpWp]: Computing forward predicates...