/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf -tc ../../../trunk/examples/toolchains/AutomizerC.xml --sifa.abstract.domain OctagonDomain -i ../sv-benchmarks/c/recursive/EvenOdd01-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-f954360 [2023-04-01 06:04:28,732 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-04-01 06:04:28,734 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-04-01 06:04:28,786 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-04-01 06:04:28,787 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-04-01 06:04:28,789 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-04-01 06:04:28,792 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-04-01 06:04:28,794 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-04-01 06:04:28,795 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-04-01 06:04:28,799 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-04-01 06:04:28,800 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-04-01 06:04:28,802 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-04-01 06:04:28,802 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-04-01 06:04:28,804 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-04-01 06:04:28,805 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-04-01 06:04:28,806 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-04-01 06:04:28,807 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-04-01 06:04:28,808 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-04-01 06:04:28,809 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-04-01 06:04:28,813 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-04-01 06:04:28,814 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-04-01 06:04:28,815 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-04-01 06:04:28,816 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-04-01 06:04:28,817 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-04-01 06:04:28,824 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-04-01 06:04:28,824 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-04-01 06:04:28,824 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-04-01 06:04:28,826 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-04-01 06:04:28,826 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-04-01 06:04:28,827 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-04-01 06:04:28,827 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-04-01 06:04:28,827 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-04-01 06:04:28,829 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-04-01 06:04:28,829 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-04-01 06:04:28,830 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-04-01 06:04:28,830 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-04-01 06:04:28,830 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-04-01 06:04:28,830 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-04-01 06:04:28,831 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-04-01 06:04:28,831 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-04-01 06:04:28,832 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-04-01 06:04:28,833 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf [2023-04-01 06:04:28,868 INFO L113 SettingsManager]: Loading preferences was successful [2023-04-01 06:04:28,868 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-04-01 06:04:28,869 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-04-01 06:04:28,869 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-04-01 06:04:28,869 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-04-01 06:04:28,870 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-04-01 06:04:28,870 INFO L138 SettingsManager]: * User list type=DISABLED [2023-04-01 06:04:28,870 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-04-01 06:04:28,870 INFO L138 SettingsManager]: * Explicit value domain=true [2023-04-01 06:04:28,870 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-04-01 06:04:28,870 INFO L138 SettingsManager]: * Octagon Domain=false [2023-04-01 06:04:28,871 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2023-04-01 06:04:28,871 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-04-01 06:04:28,871 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-04-01 06:04:28,871 INFO L138 SettingsManager]: * Interval Domain=false [2023-04-01 06:04:28,871 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-04-01 06:04:28,871 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-04-01 06:04:28,872 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2023-04-01 06:04:28,872 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-04-01 06:04:28,872 INFO L138 SettingsManager]: * sizeof long=4 [2023-04-01 06:04:28,872 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-04-01 06:04:28,873 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-04-01 06:04:28,873 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-04-01 06:04:28,873 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-04-01 06:04:28,873 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-04-01 06:04:28,873 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-04-01 06:04:28,873 INFO L138 SettingsManager]: * sizeof long double=12 [2023-04-01 06:04:28,874 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-04-01 06:04:28,874 INFO L138 SettingsManager]: * Use constant arrays=true [2023-04-01 06:04:28,874 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-04-01 06:04:28,874 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-04-01 06:04:28,874 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-04-01 06:04:28,874 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-01 06:04:28,875 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-04-01 06:04:28,875 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2023-04-01 06:04:28,875 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-04-01 06:04:28,875 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-04-01 06:04:28,875 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-04-01 06:04:28,875 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-04-01 06:04:28,889 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-04-01 06:04:28,889 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-04-01 06:04:28,889 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> OctagonDomain [2023-04-01 06:04:29,290 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-04-01 06:04:29,317 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-04-01 06:04:29,319 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-04-01 06:04:29,320 INFO L271 PluginConnector]: Initializing CDTParser... [2023-04-01 06:04:29,326 INFO L275 PluginConnector]: CDTParser initialized [2023-04-01 06:04:29,327 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/EvenOdd01-1.c [2023-04-01 06:04:30,948 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-04-01 06:04:31,192 INFO L351 CDTParser]: Found 1 translation units. [2023-04-01 06:04:31,193 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/EvenOdd01-1.c [2023-04-01 06:04:31,198 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2980b4b5/0e27f0dfef294cfd944beedb814aab96/FLAG3c918303d [2023-04-01 06:04:31,209 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2980b4b5/0e27f0dfef294cfd944beedb814aab96 [2023-04-01 06:04:31,212 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-04-01 06:04:31,213 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2023-04-01 06:04:31,214 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-04-01 06:04:31,214 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-04-01 06:04:31,217 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-04-01 06:04:31,218 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.04 06:04:31" (1/1) ... [2023-04-01 06:04:31,218 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5689bcec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 06:04:31, skipping insertion in model container [2023-04-01 06:04:31,218 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.04 06:04:31" (1/1) ... [2023-04-01 06:04:31,224 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-04-01 06:04:31,234 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-04-01 06:04:31,409 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/EvenOdd01-1.c[975,988] [2023-04-01 06:04:31,420 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-01 06:04:31,435 INFO L203 MainTranslator]: Completed pre-run [2023-04-01 06:04:31,457 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/EvenOdd01-1.c[975,988] [2023-04-01 06:04:31,458 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-01 06:04:31,476 INFO L208 MainTranslator]: Completed translation [2023-04-01 06:04:31,477 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 06:04:31 WrapperNode [2023-04-01 06:04:31,477 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-04-01 06:04:31,478 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-04-01 06:04:31,479 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-04-01 06:04:31,479 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-04-01 06:04:31,489 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 06:04:31" (1/1) ... [2023-04-01 06:04:31,489 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 06:04:31" (1/1) ... [2023-04-01 06:04:31,522 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 06:04:31" (1/1) ... [2023-04-01 06:04:31,522 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 06:04:31" (1/1) ... [2023-04-01 06:04:31,537 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 06:04:31" (1/1) ... [2023-04-01 06:04:31,539 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 06:04:31" (1/1) ... [2023-04-01 06:04:31,553 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 06:04:31" (1/1) ... [2023-04-01 06:04:31,554 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 06:04:31" (1/1) ... [2023-04-01 06:04:31,560 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-04-01 06:04:31,561 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-04-01 06:04:31,561 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-04-01 06:04:31,562 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-04-01 06:04:31,562 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 06:04:31" (1/1) ... [2023-04-01 06:04:31,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-01 06:04:31,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 06:04:31,615 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-04-01 06:04:31,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-04-01 06:04:31,656 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2023-04-01 06:04:31,657 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-04-01 06:04:31,657 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-04-01 06:04:31,657 INFO L138 BoogieDeclarations]: Found implementation of procedure isOdd [2023-04-01 06:04:31,657 INFO L138 BoogieDeclarations]: Found implementation of procedure isEven [2023-04-01 06:04:31,657 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2023-04-01 06:04:31,657 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2023-04-01 06:04:31,657 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2023-04-01 06:04:31,658 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-04-01 06:04:31,658 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-04-01 06:04:31,658 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2023-04-01 06:04:31,658 INFO L130 BoogieDeclarations]: Found specification of procedure isOdd [2023-04-01 06:04:31,658 INFO L130 BoogieDeclarations]: Found specification of procedure isEven [2023-04-01 06:04:31,658 INFO L130 BoogieDeclarations]: Found specification of procedure main [2023-04-01 06:04:31,658 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2023-04-01 06:04:31,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-04-01 06:04:31,658 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-04-01 06:04:31,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-04-01 06:04:31,659 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-04-01 06:04:31,659 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-04-01 06:04:31,731 INFO L236 CfgBuilder]: Building ICFG [2023-04-01 06:04:31,733 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-04-01 06:04:31,911 INFO L277 CfgBuilder]: Performing block encoding [2023-04-01 06:04:31,948 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-04-01 06:04:31,948 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-04-01 06:04:31,950 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.04 06:04:31 BoogieIcfgContainer [2023-04-01 06:04:31,950 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-04-01 06:04:31,952 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-04-01 06:04:31,952 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-04-01 06:04:31,979 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-04-01 06:04:31,979 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.04 06:04:31" (1/3) ... [2023-04-01 06:04:31,980 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1506de2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.04 06:04:31, skipping insertion in model container [2023-04-01 06:04:31,980 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 06:04:31" (2/3) ... [2023-04-01 06:04:31,980 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1506de2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.04 06:04:31, skipping insertion in model container [2023-04-01 06:04:31,980 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.04 06:04:31" (3/3) ... [2023-04-01 06:04:31,981 INFO L112 eAbstractionObserver]: Analyzing ICFG EvenOdd01-1.c [2023-04-01 06:04:32,020 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-04-01 06:04:32,045 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-04-01 06:04:32,158 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-04-01 06:04:32,163 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;@55c54ee6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-04-01 06:04:32,163 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-04-01 06:04:32,191 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-04-01 06:04:32,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-04-01 06:04:32,197 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 06:04:32,198 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 06:04:32,198 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 06:04:32,205 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 06:04:32,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1030917031, now seen corresponding path program 1 times [2023-04-01 06:04:32,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 06:04:32,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682681498] [2023-04-01 06:04:32,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 06:04:32,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 06:04:32,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 06:04:33,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 06:04:33,145 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 06:04:33,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682681498] [2023-04-01 06:04:33,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682681498] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 06:04:33,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-01 06:04:33,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-04-01 06:04:33,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708342101] [2023-04-01 06:04:33,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 06:04:33,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-04-01 06:04:33,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 06:04:33,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-04-01 06:04:33,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-04-01 06:04:33,203 INFO L87 Difference]: Start difference. First operand has 29 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-01 06:04:33,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 06:04:33,336 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2023-04-01 06:04:33,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-04-01 06:04:33,340 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 14 [2023-04-01 06:04:33,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 06:04:33,348 INFO L225 Difference]: With dead ends: 41 [2023-04-01 06:04:33,348 INFO L226 Difference]: Without dead ends: 27 [2023-04-01 06:04:33,353 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-04-01 06:04:33,360 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 9 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 06:04:33,361 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 114 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 06:04:33,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-04-01 06:04:33,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2023-04-01 06:04:33,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2023-04-01 06:04:33,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2023-04-01 06:04:33,418 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 14 [2023-04-01 06:04:33,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 06:04:33,419 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2023-04-01 06:04:33,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-01 06:04:33,419 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2023-04-01 06:04:33,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-04-01 06:04:33,420 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 06:04:33,420 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 06:04:33,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-04-01 06:04:33,421 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 06:04:33,421 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 06:04:33,422 INFO L85 PathProgramCache]: Analyzing trace with hash -1633927918, now seen corresponding path program 1 times [2023-04-01 06:04:33,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 06:04:33,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544984966] [2023-04-01 06:04:33,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 06:04:33,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 06:04:33,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 06:04:33,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 06:04:33,946 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 06:04:33,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544984966] [2023-04-01 06:04:33,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544984966] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 06:04:33,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-01 06:04:33,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-04-01 06:04:33,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124414471] [2023-04-01 06:04:33,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 06:04:33,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-04-01 06:04:33,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 06:04:33,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-04-01 06:04:33,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-04-01 06:04:33,951 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-01 06:04:34,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 06:04:34,055 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2023-04-01 06:04:34,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-04-01 06:04:34,056 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 15 [2023-04-01 06:04:34,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 06:04:34,057 INFO L225 Difference]: With dead ends: 33 [2023-04-01 06:04:34,057 INFO L226 Difference]: Without dead ends: 29 [2023-04-01 06:04:34,061 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-04-01 06:04:34,073 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 9 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-01 06:04:34,073 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 88 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-01 06:04:34,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-04-01 06:04:34,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2023-04-01 06:04:34,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2023-04-01 06:04:34,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2023-04-01 06:04:34,078 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 15 [2023-04-01 06:04:34,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 06:04:34,079 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2023-04-01 06:04:34,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-01 06:04:34,079 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2023-04-01 06:04:34,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-04-01 06:04:34,080 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 06:04:34,080 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 06:04:34,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-04-01 06:04:34,080 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 06:04:34,081 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 06:04:34,081 INFO L85 PathProgramCache]: Analyzing trace with hash -277898781, now seen corresponding path program 1 times [2023-04-01 06:04:34,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 06:04:34,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407018804] [2023-04-01 06:04:34,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 06:04:34,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 06:04:34,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 06:04:34,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 06:04:34,351 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 06:04:34,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407018804] [2023-04-01 06:04:34,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407018804] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 06:04:34,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-01 06:04:34,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-04-01 06:04:34,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991518158] [2023-04-01 06:04:34,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 06:04:34,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-04-01 06:04:34,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 06:04:34,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-04-01 06:04:34,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-04-01 06:04:34,356 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-04-01 06:04:34,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 06:04:34,439 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2023-04-01 06:04:34,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-04-01 06:04:34,440 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 21 [2023-04-01 06:04:34,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 06:04:34,441 INFO L225 Difference]: With dead ends: 41 [2023-04-01 06:04:34,441 INFO L226 Difference]: Without dead ends: 29 [2023-04-01 06:04:34,444 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-04-01 06:04:34,448 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 11 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-01 06:04:34,449 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 66 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-01 06:04:34,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-04-01 06:04:34,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2023-04-01 06:04:34,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2023-04-01 06:04:34,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2023-04-01 06:04:34,460 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 21 [2023-04-01 06:04:34,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 06:04:34,461 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2023-04-01 06:04:34,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-04-01 06:04:34,461 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2023-04-01 06:04:34,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-04-01 06:04:34,462 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 06:04:34,463 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 06:04:34,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-04-01 06:04:34,463 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 06:04:34,479 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 06:04:34,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1161994621, now seen corresponding path program 1 times [2023-04-01 06:04:34,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 06:04:34,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521460792] [2023-04-01 06:04:34,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 06:04:34,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 06:04:34,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 06:04:34,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 06:04:34,856 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 06:04:34,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521460792] [2023-04-01 06:04:34,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521460792] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 06:04:34,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-01 06:04:34,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-04-01 06:04:34,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630526079] [2023-04-01 06:04:34,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 06:04:34,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-04-01 06:04:34,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 06:04:34,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-04-01 06:04:34,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-04-01 06:04:34,858 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-04-01 06:04:34,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 06:04:34,992 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2023-04-01 06:04:34,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-04-01 06:04:34,993 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2023-04-01 06:04:34,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 06:04:34,994 INFO L225 Difference]: With dead ends: 36 [2023-04-01 06:04:34,995 INFO L226 Difference]: Without dead ends: 32 [2023-04-01 06:04:34,995 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2023-04-01 06:04:35,000 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 10 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 06:04:35,001 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 96 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 06:04:35,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-04-01 06:04:35,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2023-04-01 06:04:35,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2023-04-01 06:04:35,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2023-04-01 06:04:35,014 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 22 [2023-04-01 06:04:35,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 06:04:35,015 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2023-04-01 06:04:35,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-04-01 06:04:35,015 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2023-04-01 06:04:35,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-04-01 06:04:35,016 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 06:04:35,017 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 06:04:35,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-04-01 06:04:35,017 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 06:04:35,018 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 06:04:35,018 INFO L85 PathProgramCache]: Analyzing trace with hash 2084622900, now seen corresponding path program 1 times [2023-04-01 06:04:35,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 06:04:35,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894960901] [2023-04-01 06:04:35,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 06:04:35,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 06:04:35,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 06:04:35,131 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-01 06:04:35,131 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 06:04:35,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894960901] [2023-04-01 06:04:35,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894960901] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 06:04:35,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-01 06:04:35,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-04-01 06:04:35,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136615414] [2023-04-01 06:04:35,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 06:04:35,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-04-01 06:04:35,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 06:04:35,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-04-01 06:04:35,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-04-01 06:04:35,150 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-04-01 06:04:35,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 06:04:35,186 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2023-04-01 06:04:35,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-04-01 06:04:35,186 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2023-04-01 06:04:35,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 06:04:35,201 INFO L225 Difference]: With dead ends: 42 [2023-04-01 06:04:35,202 INFO L226 Difference]: Without dead ends: 30 [2023-04-01 06:04:35,203 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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 06:04:35,205 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 9 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-01 06:04:35,206 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 70 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-01 06:04:35,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-04-01 06:04:35,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2023-04-01 06:04:35,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 19 states have (on average 1.105263157894737) internal successors, (21), 20 states have internal predecessors, (21), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2023-04-01 06:04:35,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2023-04-01 06:04:35,219 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 28 [2023-04-01 06:04:35,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 06:04:35,220 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2023-04-01 06:04:35,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-04-01 06:04:35,220 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2023-04-01 06:04:35,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-04-01 06:04:35,221 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 06:04:35,221 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 06:04:35,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-04-01 06:04:35,221 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 06:04:35,222 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 06:04:35,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1751890349, now seen corresponding path program 1 times [2023-04-01 06:04:35,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 06:04:35,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610662086] [2023-04-01 06:04:35,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 06:04:35,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 06:04:35,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 06:04:35,702 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-04-01 06:04:35,702 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 06:04:35,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610662086] [2023-04-01 06:04:35,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610662086] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 06:04:35,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1581239321] [2023-04-01 06:04:35,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 06:04:35,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 06:04:35,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 06:04:35,706 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 06:04:35,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-04-01 06:04:35,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 06:04:35,813 INFO L262 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 32 conjunts are in the unsatisfiable core [2023-04-01 06:04:35,818 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 06:04:36,214 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-04-01 06:04:36,214 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 06:04:37,073 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-01 06:04:37,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1581239321] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 06:04:37,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2122575500] [2023-04-01 06:04:37,113 INFO L159 IcfgInterpreter]: Started Sifa with 25 locations of interest [2023-04-01 06:04:37,113 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 06:04:37,131 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-01 06:04:37,136 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 06:04:37,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 21 [2023-04-01 06:04:37,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135145240] [2023-04-01 06:04:37,137 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 06:04:37,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-04-01 06:04:37,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 06:04:37,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-04-01 06:04:37,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2023-04-01 06:04:37,141 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand has 21 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 15 states have internal predecessors, (34), 7 states have call successors, (9), 1 states have call predecessors, (9), 5 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2023-04-01 06:04:37,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 06:04:37,433 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2023-04-01 06:04:37,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-04-01 06:04:37,433 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 15 states have internal predecessors, (34), 7 states have call successors, (9), 1 states have call predecessors, (9), 5 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 29 [2023-04-01 06:04:37,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 06:04:37,434 INFO L225 Difference]: With dead ends: 42 [2023-04-01 06:04:37,434 INFO L226 Difference]: Without dead ends: 38 [2023-04-01 06:04:37,435 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 47 SyntacticMatches, 5 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=97, Invalid=605, Unknown=0, NotChecked=0, Total=702 [2023-04-01 06:04:37,435 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 16 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-04-01 06:04:37,436 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 160 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-04-01 06:04:37,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-04-01 06:04:37,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 33. [2023-04-01 06:04:37,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 22 states have internal predecessors, (23), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2023-04-01 06:04:37,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2023-04-01 06:04:37,442 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 29 [2023-04-01 06:04:37,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 06:04:37,442 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2023-04-01 06:04:37,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 15 states have internal predecessors, (34), 7 states have call successors, (9), 1 states have call predecessors, (9), 5 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2023-04-01 06:04:37,443 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2023-04-01 06:04:37,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-04-01 06:04:37,445 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 06:04:37,445 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 06:04:37,458 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-04-01 06:04:37,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-04-01 06:04:37,652 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 06:04:37,653 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 06:04:37,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1709651594, now seen corresponding path program 1 times [2023-04-01 06:04:37,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 06:04:37,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268968815] [2023-04-01 06:04:37,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 06:04:37,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 06:04:37,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 06:04:38,056 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-04-01 06:04:38,057 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 06:04:38,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268968815] [2023-04-01 06:04:38,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268968815] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 06:04:38,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [403410872] [2023-04-01 06:04:38,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 06:04:38,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 06:04:38,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 06:04:38,058 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 06:04:38,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-04-01 06:04:38,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 06:04:38,137 INFO L262 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 40 conjunts are in the unsatisfiable core [2023-04-01 06:04:38,141 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 06:04:38,401 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-04-01 06:04:38,401 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 06:04:39,198 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-04-01 06:04:39,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [403410872] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 06:04:39,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1013495726] [2023-04-01 06:04:39,201 INFO L159 IcfgInterpreter]: Started Sifa with 25 locations of interest [2023-04-01 06:04:39,201 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 06:04:39,201 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-01 06:04:39,201 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 06:04:39,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 15] total 23 [2023-04-01 06:04:39,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948957654] [2023-04-01 06:04:39,202 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 06:04:39,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-04-01 06:04:39,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 06:04:39,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-04-01 06:04:39,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=440, Unknown=0, NotChecked=0, Total=506 [2023-04-01 06:04:39,204 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand has 23 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 16 states have internal predecessors, (38), 7 states have call successors, (9), 1 states have call predecessors, (9), 6 states have return successors, (10), 8 states have call predecessors, (10), 7 states have call successors, (10) [2023-04-01 06:04:39,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 06:04:39,741 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2023-04-01 06:04:39,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-04-01 06:04:39,742 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 16 states have internal predecessors, (38), 7 states have call successors, (9), 1 states have call predecessors, (9), 6 states have return successors, (10), 8 states have call predecessors, (10), 7 states have call successors, (10) Word has length 36 [2023-04-01 06:04:39,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 06:04:39,742 INFO L225 Difference]: With dead ends: 48 [2023-04-01 06:04:39,742 INFO L226 Difference]: Without dead ends: 44 [2023-04-01 06:04:39,743 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 59 SyntacticMatches, 8 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=125, Invalid=867, Unknown=0, NotChecked=0, Total=992 [2023-04-01 06:04:39,743 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 12 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-04-01 06:04:39,744 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 207 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-04-01 06:04:39,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-04-01 06:04:39,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 36. [2023-04-01 06:04:39,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 24 states have internal predecessors, (25), 5 states have call successors, (5), 4 states have call predecessors, (5), 7 states have return successors, (8), 7 states have call predecessors, (8), 4 states have call successors, (8) [2023-04-01 06:04:39,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2023-04-01 06:04:39,748 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 36 [2023-04-01 06:04:39,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 06:04:39,748 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2023-04-01 06:04:39,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 16 states have internal predecessors, (38), 7 states have call successors, (9), 1 states have call predecessors, (9), 6 states have return successors, (10), 8 states have call predecessors, (10), 7 states have call successors, (10) [2023-04-01 06:04:39,748 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2023-04-01 06:04:39,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-04-01 06:04:39,754 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 06:04:39,754 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 06:04:39,762 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-04-01 06:04:39,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-04-01 06:04:39,960 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 06:04:39,960 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 06:04:39,960 INFO L85 PathProgramCache]: Analyzing trace with hash 381602248, now seen corresponding path program 2 times [2023-04-01 06:04:39,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 06:04:39,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998924287] [2023-04-01 06:04:39,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 06:04:39,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 06:04:39,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 06:04:40,475 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-04-01 06:04:40,476 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 06:04:40,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998924287] [2023-04-01 06:04:40,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998924287] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 06:04:40,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [419706641] [2023-04-01 06:04:40,476 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-01 06:04:40,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 06:04:40,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 06:04:40,477 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 06:04:40,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-04-01 06:04:40,548 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-04-01 06:04:40,548 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 06:04:40,549 INFO L262 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 48 conjunts are in the unsatisfiable core [2023-04-01 06:04:40,553 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 06:04:40,809 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-04-01 06:04:40,809 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 06:04:41,846 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-04-01 06:04:41,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [419706641] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 06:04:41,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1826058370] [2023-04-01 06:04:41,849 INFO L159 IcfgInterpreter]: Started Sifa with 25 locations of interest [2023-04-01 06:04:41,849 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 06:04:41,850 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-01 06:04:41,850 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 06:04:41,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 18] total 27 [2023-04-01 06:04:41,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969076341] [2023-04-01 06:04:41,850 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 06:04:41,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-04-01 06:04:41,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 06:04:41,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-04-01 06:04:41,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=620, Unknown=0, NotChecked=0, Total=702 [2023-04-01 06:04:41,865 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand has 27 states, 25 states have (on average 1.76) internal successors, (44), 19 states have internal predecessors, (44), 9 states have call successors, (11), 1 states have call predecessors, (11), 7 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2023-04-01 06:04:42,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 06:04:42,363 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2023-04-01 06:04:42,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-04-01 06:04:42,363 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 25 states have (on average 1.76) internal successors, (44), 19 states have internal predecessors, (44), 9 states have call successors, (11), 1 states have call predecessors, (11), 7 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) Word has length 43 [2023-04-01 06:04:42,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 06:04:42,364 INFO L225 Difference]: With dead ends: 54 [2023-04-01 06:04:42,364 INFO L226 Difference]: Without dead ends: 50 [2023-04-01 06:04:42,365 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 71 SyntacticMatches, 9 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=152, Invalid=1180, Unknown=0, NotChecked=0, Total=1332 [2023-04-01 06:04:42,366 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 25 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-04-01 06:04:42,366 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 272 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-04-01 06:04:42,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2023-04-01 06:04:42,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 39. [2023-04-01 06:04:42,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 25 states have (on average 1.08) internal successors, (27), 26 states have internal predecessors, (27), 5 states have call successors, (5), 4 states have call predecessors, (5), 8 states have return successors, (9), 8 states have call predecessors, (9), 4 states have call successors, (9) [2023-04-01 06:04:42,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2023-04-01 06:04:42,373 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 43 [2023-04-01 06:04:42,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 06:04:42,373 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2023-04-01 06:04:42,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 25 states have (on average 1.76) internal successors, (44), 19 states have internal predecessors, (44), 9 states have call successors, (11), 1 states have call predecessors, (11), 7 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2023-04-01 06:04:42,373 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2023-04-01 06:04:42,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-04-01 06:04:42,375 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 06:04:42,375 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 06:04:42,384 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-04-01 06:04:42,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 06:04:42,582 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 06:04:42,583 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 06:04:42,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1141940759, now seen corresponding path program 2 times [2023-04-01 06:04:42,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 06:04:42,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537384412] [2023-04-01 06:04:42,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 06:04:42,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 06:04:42,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 06:04:43,677 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-04-01 06:04:43,677 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 06:04:43,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537384412] [2023-04-01 06:04:43,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537384412] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 06:04:43,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1246808815] [2023-04-01 06:04:43,677 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-01 06:04:43,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 06:04:43,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 06:04:43,679 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 06:04:43,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-04-01 06:04:43,772 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-04-01 06:04:43,773 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 06:04:43,774 INFO L262 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 56 conjunts are in the unsatisfiable core [2023-04-01 06:04:43,777 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 06:04:44,063 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-04-01 06:04:44,064 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 06:04:45,779 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-04-01 06:04:45,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1246808815] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 06:04:45,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [222666670] [2023-04-01 06:04:45,783 INFO L159 IcfgInterpreter]: Started Sifa with 25 locations of interest [2023-04-01 06:04:45,783 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 06:04:45,783 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-01 06:04:45,784 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 06:04:45,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 21] total 29 [2023-04-01 06:04:45,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089174408] [2023-04-01 06:04:45,784 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 06:04:45,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-04-01 06:04:45,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 06:04:45,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-04-01 06:04:45,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=724, Unknown=0, NotChecked=0, Total=812 [2023-04-01 06:04:45,787 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand has 29 states, 28 states have (on average 1.7142857142857142) internal successors, (48), 20 states have internal predecessors, (48), 9 states have call successors, (11), 1 states have call predecessors, (11), 8 states have return successors, (14), 10 states have call predecessors, (14), 9 states have call successors, (14) [2023-04-01 06:04:46,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 06:04:46,404 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2023-04-01 06:04:46,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-04-01 06:04:46,405 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.7142857142857142) internal successors, (48), 20 states have internal predecessors, (48), 9 states have call successors, (11), 1 states have call predecessors, (11), 8 states have return successors, (14), 10 states have call predecessors, (14), 9 states have call successors, (14) Word has length 50 [2023-04-01 06:04:46,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 06:04:46,406 INFO L225 Difference]: With dead ends: 60 [2023-04-01 06:04:46,406 INFO L226 Difference]: Without dead ends: 56 [2023-04-01 06:04:46,407 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 83 SyntacticMatches, 12 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=186, Invalid=1536, Unknown=0, NotChecked=0, Total=1722 [2023-04-01 06:04:46,407 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 31 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-04-01 06:04:46,407 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 241 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 409 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-04-01 06:04:46,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2023-04-01 06:04:46,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 42. [2023-04-01 06:04:46,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 5 states have call successors, (5), 4 states have call predecessors, (5), 9 states have return successors, (10), 9 states have call predecessors, (10), 4 states have call successors, (10) [2023-04-01 06:04:46,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2023-04-01 06:04:46,413 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 50 [2023-04-01 06:04:46,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 06:04:46,413 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2023-04-01 06:04:46,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.7142857142857142) internal successors, (48), 20 states have internal predecessors, (48), 9 states have call successors, (11), 1 states have call predecessors, (11), 8 states have return successors, (14), 10 states have call predecessors, (14), 9 states have call successors, (14) [2023-04-01 06:04:46,414 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2023-04-01 06:04:46,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-04-01 06:04:46,414 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 06:04:46,414 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 06:04:46,425 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-04-01 06:04:46,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 06:04:46,623 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 06:04:46,624 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 06:04:46,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1059898013, now seen corresponding path program 3 times [2023-04-01 06:04:46,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 06:04:46,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716280718] [2023-04-01 06:04:46,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 06:04:46,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 06:04:46,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 06:04:47,555 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-04-01 06:04:47,555 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 06:04:47,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716280718] [2023-04-01 06:04:47,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716280718] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 06:04:47,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [242628470] [2023-04-01 06:04:47,556 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-04-01 06:04:47,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 06:04:47,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 06:04:47,569 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 06:04:47,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-04-01 06:04:47,668 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-04-01 06:04:47,669 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 06:04:47,670 INFO L262 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 64 conjunts are in the unsatisfiable core [2023-04-01 06:04:47,674 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 06:04:48,024 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-04-01 06:04:48,024 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 06:04:49,589 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-04-01 06:04:49,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [242628470] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 06:04:49,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [807543416] [2023-04-01 06:04:49,593 INFO L159 IcfgInterpreter]: Started Sifa with 25 locations of interest [2023-04-01 06:04:49,594 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 06:04:49,594 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-01 06:04:49,594 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 06:04:49,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 24] total 33 [2023-04-01 06:04:49,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291963692] [2023-04-01 06:04:49,595 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 06:04:49,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-04-01 06:04:49,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 06:04:49,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-04-01 06:04:49,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=952, Unknown=0, NotChecked=0, Total=1056 [2023-04-01 06:04:49,597 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand has 33 states, 31 states have (on average 1.7419354838709677) internal successors, (54), 23 states have internal predecessors, (54), 11 states have call successors, (13), 1 states have call predecessors, (13), 9 states have return successors, (16), 11 states have call predecessors, (16), 11 states have call successors, (16) [2023-04-01 06:04:50,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 06:04:50,354 INFO L93 Difference]: Finished difference Result 66 states and 68 transitions. [2023-04-01 06:04:50,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-04-01 06:04:50,355 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 31 states have (on average 1.7419354838709677) internal successors, (54), 23 states have internal predecessors, (54), 11 states have call successors, (13), 1 states have call predecessors, (13), 9 states have return successors, (16), 11 states have call predecessors, (16), 11 states have call successors, (16) Word has length 57 [2023-04-01 06:04:50,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 06:04:50,355 INFO L225 Difference]: With dead ends: 66 [2023-04-01 06:04:50,356 INFO L226 Difference]: Without dead ends: 62 [2023-04-01 06:04:50,357 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 95 SyntacticMatches, 13 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=215, Invalid=1947, Unknown=0, NotChecked=0, Total=2162 [2023-04-01 06:04:50,357 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 24 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 538 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-04-01 06:04:50,357 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 344 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 538 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-04-01 06:04:50,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2023-04-01 06:04:50,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 45. [2023-04-01 06:04:50,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 30 states have internal predecessors, (31), 5 states have call successors, (5), 4 states have call predecessors, (5), 10 states have return successors, (11), 10 states have call predecessors, (11), 4 states have call successors, (11) [2023-04-01 06:04:50,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2023-04-01 06:04:50,364 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 57 [2023-04-01 06:04:50,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 06:04:50,364 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2023-04-01 06:04:50,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 31 states have (on average 1.7419354838709677) internal successors, (54), 23 states have internal predecessors, (54), 11 states have call successors, (13), 1 states have call predecessors, (13), 9 states have return successors, (16), 11 states have call predecessors, (16), 11 states have call successors, (16) [2023-04-01 06:04:50,364 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2023-04-01 06:04:50,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-04-01 06:04:50,365 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 06:04:50,365 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 06:04:50,376 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-04-01 06:04:50,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-04-01 06:04:50,574 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 06:04:50,574 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 06:04:50,574 INFO L85 PathProgramCache]: Analyzing trace with hash 23827492, now seen corresponding path program 3 times [2023-04-01 06:04:50,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 06:04:50,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778112113] [2023-04-01 06:04:50,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 06:04:50,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 06:04:50,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 06:04:51,334 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2023-04-01 06:04:51,334 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 06:04:51,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778112113] [2023-04-01 06:04:51,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778112113] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 06:04:51,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [657398658] [2023-04-01 06:04:51,335 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-04-01 06:04:51,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 06:04:51,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 06:04:51,343 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 06:04:51,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-04-01 06:04:51,431 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-04-01 06:04:51,431 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 06:04:51,432 INFO L262 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 72 conjunts are in the unsatisfiable core [2023-04-01 06:04:51,434 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 06:04:51,783 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2023-04-01 06:04:51,784 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 06:04:53,833 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-04-01 06:04:53,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [657398658] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 06:04:53,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1980740081] [2023-04-01 06:04:53,835 INFO L159 IcfgInterpreter]: Started Sifa with 25 locations of interest [2023-04-01 06:04:53,836 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 06:04:53,836 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-01 06:04:53,836 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 06:04:53,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22, 27] total 35 [2023-04-01 06:04:53,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564594952] [2023-04-01 06:04:53,836 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 06:04:53,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-04-01 06:04:53,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 06:04:53,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-04-01 06:04:53,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1080, Unknown=0, NotChecked=0, Total=1190 [2023-04-01 06:04:53,839 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand has 35 states, 34 states have (on average 1.7058823529411764) internal successors, (58), 24 states have internal predecessors, (58), 11 states have call successors, (13), 1 states have call predecessors, (13), 10 states have return successors, (18), 12 states have call predecessors, (18), 11 states have call successors, (18) [2023-04-01 06:04:54,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 06:04:54,750 INFO L93 Difference]: Finished difference Result 72 states and 74 transitions. [2023-04-01 06:04:54,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-04-01 06:04:54,750 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.7058823529411764) internal successors, (58), 24 states have internal predecessors, (58), 11 states have call successors, (13), 1 states have call predecessors, (13), 10 states have return successors, (18), 12 states have call predecessors, (18), 11 states have call successors, (18) Word has length 64 [2023-04-01 06:04:54,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 06:04:54,751 INFO L225 Difference]: With dead ends: 72 [2023-04-01 06:04:54,751 INFO L226 Difference]: Without dead ends: 68 [2023-04-01 06:04:54,753 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 108 SyntacticMatches, 15 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=255, Invalid=2397, Unknown=0, NotChecked=0, Total=2652 [2023-04-01 06:04:54,753 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 20 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 734 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 734 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-04-01 06:04:54,753 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 423 Invalid, 739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 734 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-04-01 06:04:54,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2023-04-01 06:04:54,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 48. [2023-04-01 06:04:54,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 31 states have (on average 1.064516129032258) internal successors, (33), 32 states have internal predecessors, (33), 5 states have call successors, (5), 4 states have call predecessors, (5), 11 states have return successors, (12), 11 states have call predecessors, (12), 4 states have call successors, (12) [2023-04-01 06:04:54,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2023-04-01 06:04:54,769 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 64 [2023-04-01 06:04:54,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 06:04:54,770 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2023-04-01 06:04:54,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.7058823529411764) internal successors, (58), 24 states have internal predecessors, (58), 11 states have call successors, (13), 1 states have call predecessors, (13), 10 states have return successors, (18), 12 states have call predecessors, (18), 11 states have call successors, (18) [2023-04-01 06:04:54,770 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2023-04-01 06:04:54,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-04-01 06:04:54,771 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 06:04:54,771 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 06:04:54,781 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-04-01 06:04:54,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 06:04:54,980 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 06:04:54,980 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 06:04:54,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1162273918, now seen corresponding path program 4 times [2023-04-01 06:04:54,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 06:04:54,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30005011] [2023-04-01 06:04:54,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 06:04:54,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 06:04:54,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 06:04:56,014 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-04-01 06:04:56,014 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 06:04:56,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30005011] [2023-04-01 06:04:56,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30005011] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 06:04:56,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [712358093] [2023-04-01 06:04:56,015 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-04-01 06:04:56,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 06:04:56,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 06:04:56,016 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 06:04:56,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-04-01 06:04:56,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 06:04:56,109 INFO L262 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 80 conjunts are in the unsatisfiable core [2023-04-01 06:04:56,111 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 06:04:56,474 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-04-01 06:04:56,474 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 06:04:58,510 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 88 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-04-01 06:04:58,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [712358093] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 06:04:58,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2053324411] [2023-04-01 06:04:58,514 INFO L159 IcfgInterpreter]: Started Sifa with 25 locations of interest [2023-04-01 06:04:58,515 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 06:04:58,515 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-01 06:04:58,515 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 06:04:58,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 30] total 39 [2023-04-01 06:04:58,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192256613] [2023-04-01 06:04:58,516 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 06:04:58,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-04-01 06:04:58,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 06:04:58,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-04-01 06:04:58,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1356, Unknown=0, NotChecked=0, Total=1482 [2023-04-01 06:04:58,518 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand has 39 states, 37 states have (on average 1.7297297297297298) internal successors, (64), 27 states have internal predecessors, (64), 13 states have call successors, (15), 1 states have call predecessors, (15), 11 states have return successors, (20), 13 states have call predecessors, (20), 13 states have call successors, (20) [2023-04-01 06:04:59,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 06:04:59,331 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2023-04-01 06:04:59,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-04-01 06:04:59,331 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 37 states have (on average 1.7297297297297298) internal successors, (64), 27 states have internal predecessors, (64), 13 states have call successors, (15), 1 states have call predecessors, (15), 11 states have return successors, (20), 13 states have call predecessors, (20), 13 states have call successors, (20) Word has length 71 [2023-04-01 06:04:59,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 06:04:59,332 INFO L225 Difference]: With dead ends: 78 [2023-04-01 06:04:59,332 INFO L226 Difference]: Without dead ends: 74 [2023-04-01 06:04:59,334 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 119 SyntacticMatches, 17 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 444 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=286, Invalid=2906, Unknown=0, NotChecked=0, Total=3192 [2023-04-01 06:04:59,334 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 33 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 664 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-04-01 06:04:59,335 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 421 Invalid, 679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 664 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-04-01 06:04:59,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2023-04-01 06:04:59,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 51. [2023-04-01 06:04:59,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 34 states have internal predecessors, (35), 5 states have call successors, (5), 4 states have call predecessors, (5), 12 states have return successors, (13), 12 states have call predecessors, (13), 4 states have call successors, (13) [2023-04-01 06:04:59,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions. [2023-04-01 06:04:59,341 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 53 transitions. Word has length 71 [2023-04-01 06:04:59,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 06:04:59,341 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 53 transitions. [2023-04-01 06:04:59,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 37 states have (on average 1.7297297297297298) internal successors, (64), 27 states have internal predecessors, (64), 13 states have call successors, (15), 1 states have call predecessors, (15), 11 states have return successors, (20), 13 states have call predecessors, (20), 13 states have call successors, (20) [2023-04-01 06:04:59,341 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2023-04-01 06:04:59,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-04-01 06:04:59,342 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 06:04:59,342 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 06:04:59,349 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-04-01 06:04:59,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 06:04:59,543 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 06:04:59,543 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 06:04:59,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1793375409, now seen corresponding path program 4 times [2023-04-01 06:04:59,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 06:04:59,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248061448] [2023-04-01 06:04:59,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 06:04:59,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 06:04:59,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 06:05:00,317 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2023-04-01 06:05:00,318 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 06:05:00,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248061448] [2023-04-01 06:05:00,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248061448] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 06:05:00,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [318893906] [2023-04-01 06:05:00,318 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-04-01 06:05:00,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 06:05:00,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 06:05:00,319 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 06:05:00,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-04-01 06:05:00,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 06:05:00,385 INFO L262 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 88 conjunts are in the unsatisfiable core [2023-04-01 06:05:00,388 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 06:05:00,696 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2023-04-01 06:05:00,696 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 06:05:02,647 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-04-01 06:05:02,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [318893906] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 06:05:02,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1003048003] [2023-04-01 06:05:02,649 INFO L159 IcfgInterpreter]: Started Sifa with 25 locations of interest [2023-04-01 06:05:02,649 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 06:05:02,649 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-01 06:05:02,650 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 06:05:02,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 33] total 41 [2023-04-01 06:05:02,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464018913] [2023-04-01 06:05:02,650 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 06:05:02,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-04-01 06:05:02,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 06:05:02,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-04-01 06:05:02,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1508, Unknown=0, NotChecked=0, Total=1640 [2023-04-01 06:05:02,652 INFO L87 Difference]: Start difference. First operand 51 states and 53 transitions. Second operand has 41 states, 40 states have (on average 1.7) internal successors, (68), 28 states have internal predecessors, (68), 13 states have call successors, (15), 1 states have call predecessors, (15), 12 states have return successors, (22), 14 states have call predecessors, (22), 13 states have call successors, (22) [2023-04-01 06:05:03,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 06:05:03,502 INFO L93 Difference]: Finished difference Result 84 states and 86 transitions. [2023-04-01 06:05:03,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-04-01 06:05:03,503 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 1.7) internal successors, (68), 28 states have internal predecessors, (68), 13 states have call successors, (15), 1 states have call predecessors, (15), 12 states have return successors, (22), 14 states have call predecessors, (22), 13 states have call successors, (22) Word has length 78 [2023-04-01 06:05:03,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 06:05:03,503 INFO L225 Difference]: With dead ends: 84 [2023-04-01 06:05:03,503 INFO L226 Difference]: Without dead ends: 80 [2023-04-01 06:05:03,505 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 131 SyntacticMatches, 20 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 482 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=332, Invalid=3450, Unknown=0, NotChecked=0, Total=3782 [2023-04-01 06:05:03,505 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 22 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 829 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 829 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-04-01 06:05:03,506 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 476 Invalid, 836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 829 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-04-01 06:05:03,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-04-01 06:05:03,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 54. [2023-04-01 06:05:03,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 35 states have (on average 1.0571428571428572) internal successors, (37), 36 states have internal predecessors, (37), 5 states have call successors, (5), 4 states have call predecessors, (5), 13 states have return successors, (14), 13 states have call predecessors, (14), 4 states have call successors, (14) [2023-04-01 06:05:03,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions. [2023-04-01 06:05:03,511 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 56 transitions. Word has length 78 [2023-04-01 06:05:03,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 06:05:03,511 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 56 transitions. [2023-04-01 06:05:03,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 1.7) internal successors, (68), 28 states have internal predecessors, (68), 13 states have call successors, (15), 1 states have call predecessors, (15), 12 states have return successors, (22), 14 states have call predecessors, (22), 13 states have call successors, (22) [2023-04-01 06:05:03,511 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2023-04-01 06:05:03,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-04-01 06:05:03,512 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 06:05:03,512 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 06:05:03,530 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-04-01 06:05:03,718 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,SelfDestructingSolverStorable12 [2023-04-01 06:05:03,718 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 06:05:03,719 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 06:05:03,719 INFO L85 PathProgramCache]: Analyzing trace with hash -652767463, now seen corresponding path program 5 times [2023-04-01 06:05:03,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 06:05:03,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462588092] [2023-04-01 06:05:03,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 06:05:03,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 06:05:03,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 06:05:04,567 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2023-04-01 06:05:04,568 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 06:05:04,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462588092] [2023-04-01 06:05:04,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462588092] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 06:05:04,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1965848907] [2023-04-01 06:05:04,568 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-01 06:05:04,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 06:05:04,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 06:05:04,572 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 06:05:04,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-04-01 06:05:04,642 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-04-01 06:05:04,642 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 06:05:04,644 INFO L262 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 96 conjunts are in the unsatisfiable core [2023-04-01 06:05:04,647 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 06:05:04,960 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2023-04-01 06:05:04,961 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 06:05:07,487 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-04-01 06:05:07,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1965848907] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 06:05:07,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [982293861] [2023-04-01 06:05:07,490 INFO L159 IcfgInterpreter]: Started Sifa with 25 locations of interest [2023-04-01 06:05:07,490 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 06:05:07,491 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-01 06:05:07,492 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 06:05:07,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 36] total 45 [2023-04-01 06:05:07,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316259630] [2023-04-01 06:05:07,492 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 06:05:07,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2023-04-01 06:05:07,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 06:05:07,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2023-04-01 06:05:07,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1832, Unknown=0, NotChecked=0, Total=1980 [2023-04-01 06:05:07,496 INFO L87 Difference]: Start difference. First operand 54 states and 56 transitions. Second operand has 45 states, 43 states have (on average 1.7209302325581395) internal successors, (74), 31 states have internal predecessors, (74), 15 states have call successors, (17), 1 states have call predecessors, (17), 13 states have return successors, (24), 15 states have call predecessors, (24), 15 states have call successors, (24) [2023-04-01 06:05:08,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 06:05:08,413 INFO L93 Difference]: Finished difference Result 90 states and 92 transitions. [2023-04-01 06:05:08,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-04-01 06:05:08,413 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 43 states have (on average 1.7209302325581395) internal successors, (74), 31 states have internal predecessors, (74), 15 states have call successors, (17), 1 states have call predecessors, (17), 13 states have return successors, (24), 15 states have call predecessors, (24), 15 states have call successors, (24) Word has length 85 [2023-04-01 06:05:08,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 06:05:08,414 INFO L225 Difference]: With dead ends: 90 [2023-04-01 06:05:08,414 INFO L226 Difference]: Without dead ends: 86 [2023-04-01 06:05:08,415 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 143 SyntacticMatches, 21 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 606 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=365, Invalid=4057, Unknown=0, NotChecked=0, Total=4422 [2023-04-01 06:05:08,416 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 44 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 930 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 549 SdHoareTripleChecker+Invalid, 946 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 930 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-04-01 06:05:08,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 549 Invalid, 946 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 930 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-04-01 06:05:08,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-04-01 06:05:08,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 57. [2023-04-01 06:05:08,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 37 states have (on average 1.054054054054054) internal successors, (39), 38 states have internal predecessors, (39), 5 states have call successors, (5), 4 states have call predecessors, (5), 14 states have return successors, (15), 14 states have call predecessors, (15), 4 states have call successors, (15) [2023-04-01 06:05:08,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2023-04-01 06:05:08,421 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 85 [2023-04-01 06:05:08,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 06:05:08,422 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2023-04-01 06:05:08,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 43 states have (on average 1.7209302325581395) internal successors, (74), 31 states have internal predecessors, (74), 15 states have call successors, (17), 1 states have call predecessors, (17), 13 states have return successors, (24), 15 states have call predecessors, (24), 15 states have call successors, (24) [2023-04-01 06:05:08,422 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2023-04-01 06:05:08,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2023-04-01 06:05:08,423 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 06:05:08,423 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 06:05:08,432 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-04-01 06:05:08,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-04-01 06:05:08,623 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 06:05:08,624 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 06:05:08,624 INFO L85 PathProgramCache]: Analyzing trace with hash 296274878, now seen corresponding path program 5 times [2023-04-01 06:05:08,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 06:05:08,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902051127] [2023-04-01 06:05:08,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 06:05:08,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 06:05:08,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 06:05:09,593 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 85 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2023-04-01 06:05:09,594 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 06:05:09,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902051127] [2023-04-01 06:05:09,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902051127] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 06:05:09,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [666142642] [2023-04-01 06:05:09,594 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-01 06:05:09,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 06:05:09,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 06:05:09,596 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 06:05:09,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-04-01 06:05:09,728 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-04-01 06:05:09,728 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 06:05:09,747 INFO L262 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 104 conjunts are in the unsatisfiable core [2023-04-01 06:05:09,750 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 06:05:10,279 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 85 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2023-04-01 06:05:10,280 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 06:05:13,452 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 170 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-04-01 06:05:13,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [666142642] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 06:05:13,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1171969027] [2023-04-01 06:05:13,460 INFO L159 IcfgInterpreter]: Started Sifa with 25 locations of interest [2023-04-01 06:05:13,460 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 06:05:13,460 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-01 06:05:13,460 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 06:05:13,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 30, 39] total 47 [2023-04-01 06:05:13,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870234735] [2023-04-01 06:05:13,463 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 06:05:13,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2023-04-01 06:05:13,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 06:05:13,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2023-04-01 06:05:13,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=2009, Unknown=0, NotChecked=0, Total=2162 [2023-04-01 06:05:13,465 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand has 47 states, 46 states have (on average 1.6956521739130435) internal successors, (78), 32 states have internal predecessors, (78), 15 states have call successors, (17), 1 states have call predecessors, (17), 14 states have return successors, (26), 16 states have call predecessors, (26), 15 states have call successors, (26) [2023-04-01 06:05:14,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 06:05:14,690 INFO L93 Difference]: Finished difference Result 96 states and 98 transitions. [2023-04-01 06:05:14,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-04-01 06:05:14,691 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 1.6956521739130435) internal successors, (78), 32 states have internal predecessors, (78), 15 states have call successors, (17), 1 states have call predecessors, (17), 14 states have return successors, (26), 16 states have call predecessors, (26), 15 states have call successors, (26) Word has length 92 [2023-04-01 06:05:14,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 06:05:14,691 INFO L225 Difference]: With dead ends: 96 [2023-04-01 06:05:14,691 INFO L226 Difference]: Without dead ends: 92 [2023-04-01 06:05:14,693 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 156 SyntacticMatches, 23 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 573 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=416, Invalid=4696, Unknown=0, NotChecked=0, Total=5112 [2023-04-01 06:05:14,693 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 62 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 889 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 912 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-04-01 06:05:14,694 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 493 Invalid, 912 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 889 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-04-01 06:05:14,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2023-04-01 06:05:14,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 60. [2023-04-01 06:05:14,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 39 states have (on average 1.0512820512820513) internal successors, (41), 40 states have internal predecessors, (41), 5 states have call successors, (5), 4 states have call predecessors, (5), 15 states have return successors, (16), 15 states have call predecessors, (16), 4 states have call successors, (16) [2023-04-01 06:05:14,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2023-04-01 06:05:14,703 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 92 [2023-04-01 06:05:14,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 06:05:14,703 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2023-04-01 06:05:14,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 1.6956521739130435) internal successors, (78), 32 states have internal predecessors, (78), 15 states have call successors, (17), 1 states have call predecessors, (17), 14 states have return successors, (26), 16 states have call predecessors, (26), 15 states have call successors, (26) [2023-04-01 06:05:14,704 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2023-04-01 06:05:14,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-04-01 06:05:14,704 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 06:05:14,704 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 06:05:14,716 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-04-01 06:05:14,913 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,SelfDestructingSolverStorable14 [2023-04-01 06:05:14,913 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 06:05:14,914 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 06:05:14,914 INFO L85 PathProgramCache]: Analyzing trace with hash 379784500, now seen corresponding path program 6 times [2023-04-01 06:05:14,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 06:05:14,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200500585] [2023-04-01 06:05:14,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 06:05:14,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 06:05:14,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 06:05:16,377 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2023-04-01 06:05:16,378 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 06:05:16,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200500585] [2023-04-01 06:05:16,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200500585] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 06:05:16,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1685987530] [2023-04-01 06:05:16,378 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-04-01 06:05:16,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 06:05:16,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 06:05:16,379 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 06:05:16,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-04-01 06:05:16,525 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-04-01 06:05:16,525 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 06:05:16,527 INFO L262 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 112 conjunts are in the unsatisfiable core [2023-04-01 06:05:16,532 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 06:05:16,991 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2023-04-01 06:05:16,991 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 06:05:20,543 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 204 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-04-01 06:05:20,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1685987530] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 06:05:20,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [235417503] [2023-04-01 06:05:20,547 INFO L159 IcfgInterpreter]: Started Sifa with 25 locations of interest [2023-04-01 06:05:20,547 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 06:05:20,547 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-01 06:05:20,548 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 06:05:20,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 42] total 51 [2023-04-01 06:05:20,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708821484] [2023-04-01 06:05:20,549 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 06:05:20,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2023-04-01 06:05:20,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 06:05:20,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2023-04-01 06:05:20,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=2380, Unknown=0, NotChecked=0, Total=2550 [2023-04-01 06:05:20,553 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand has 51 states, 49 states have (on average 1.7142857142857142) internal successors, (84), 35 states have internal predecessors, (84), 17 states have call successors, (19), 1 states have call predecessors, (19), 15 states have return successors, (28), 17 states have call predecessors, (28), 17 states have call successors, (28) [2023-04-01 06:05:21,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 06:05:21,903 INFO L93 Difference]: Finished difference Result 102 states and 104 transitions. [2023-04-01 06:05:21,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-04-01 06:05:21,906 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 49 states have (on average 1.7142857142857142) internal successors, (84), 35 states have internal predecessors, (84), 17 states have call successors, (19), 1 states have call predecessors, (19), 15 states have return successors, (28), 17 states have call predecessors, (28), 17 states have call successors, (28) Word has length 99 [2023-04-01 06:05:21,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 06:05:21,906 INFO L225 Difference]: With dead ends: 102 [2023-04-01 06:05:21,906 INFO L226 Difference]: Without dead ends: 98 [2023-04-01 06:05:21,908 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 167 SyntacticMatches, 25 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 804 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=452, Invalid=5400, Unknown=0, NotChecked=0, Total=5852 [2023-04-01 06:05:21,908 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 45 mSDsluCounter, 593 mSDsCounter, 0 mSdLazyCounter, 1073 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 1090 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1073 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-04-01 06:05:21,908 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 620 Invalid, 1090 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1073 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-04-01 06:05:21,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-04-01 06:05:21,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 63. [2023-04-01 06:05:21,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 41 states have (on average 1.048780487804878) internal successors, (43), 42 states have internal predecessors, (43), 5 states have call successors, (5), 4 states have call predecessors, (5), 16 states have return successors, (17), 16 states have call predecessors, (17), 4 states have call successors, (17) [2023-04-01 06:05:21,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2023-04-01 06:05:21,912 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 99 [2023-04-01 06:05:21,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 06:05:21,913 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions. [2023-04-01 06:05:21,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 49 states have (on average 1.7142857142857142) internal successors, (84), 35 states have internal predecessors, (84), 17 states have call successors, (19), 1 states have call predecessors, (19), 15 states have return successors, (28), 17 states have call predecessors, (28), 17 states have call successors, (28) [2023-04-01 06:05:21,913 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2023-04-01 06:05:21,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2023-04-01 06:05:21,914 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 06:05:21,914 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 06:05:21,945 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-04-01 06:05:22,142 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,SelfDestructingSolverStorable15 [2023-04-01 06:05:22,143 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 06:05:22,143 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 06:05:22,143 INFO L85 PathProgramCache]: Analyzing trace with hash -467373749, now seen corresponding path program 6 times [2023-04-01 06:05:22,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 06:05:22,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913299704] [2023-04-01 06:05:22,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 06:05:22,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 06:05:22,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 06:05:23,394 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2023-04-01 06:05:23,394 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 06:05:23,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913299704] [2023-04-01 06:05:23,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913299704] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 06:05:23,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [251187083] [2023-04-01 06:05:23,395 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-04-01 06:05:23,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 06:05:23,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 06:05:23,397 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 06:05:23,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-04-01 06:05:23,530 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-04-01 06:05:23,530 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 06:05:23,547 INFO L262 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 120 conjunts are in the unsatisfiable core [2023-04-01 06:05:23,551 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 06:05:23,982 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2023-04-01 06:05:23,982 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 06:05:27,683 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2023-04-01 06:05:27,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [251187083] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 06:05:27,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [272181930] [2023-04-01 06:05:27,687 INFO L159 IcfgInterpreter]: Started Sifa with 25 locations of interest [2023-04-01 06:05:27,687 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 06:05:27,687 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-01 06:05:27,688 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 06:05:27,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 45] total 54 [2023-04-01 06:05:27,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149656541] [2023-04-01 06:05:27,688 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 06:05:27,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2023-04-01 06:05:27,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 06:05:27,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2023-04-01 06:05:27,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=2682, Unknown=0, NotChecked=0, Total=2862 [2023-04-01 06:05:27,692 INFO L87 Difference]: Start difference. First operand 63 states and 65 transitions. Second operand has 54 states, 52 states have (on average 1.7115384615384615) internal successors, (89), 37 states have internal predecessors, (89), 18 states have call successors, (20), 1 states have call predecessors, (20), 16 states have return successors, (30), 18 states have call predecessors, (30), 18 states have call successors, (30) [2023-04-01 06:05:29,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 06:05:29,153 INFO L93 Difference]: Finished difference Result 108 states and 110 transitions. [2023-04-01 06:05:29,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-04-01 06:05:29,153 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 52 states have (on average 1.7115384615384615) internal successors, (89), 37 states have internal predecessors, (89), 18 states have call successors, (20), 1 states have call predecessors, (20), 16 states have return successors, (30), 18 states have call predecessors, (30), 18 states have call successors, (30) Word has length 106 [2023-04-01 06:05:29,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 06:05:29,154 INFO L225 Difference]: With dead ends: 108 [2023-04-01 06:05:29,154 INFO L226 Difference]: Without dead ends: 104 [2023-04-01 06:05:29,156 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 179 SyntacticMatches, 27 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 912 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=515, Invalid=6291, Unknown=0, NotChecked=0, Total=6806 [2023-04-01 06:05:29,156 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 54 mSDsluCounter, 624 mSDsCounter, 0 mSdLazyCounter, 1172 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 1192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-04-01 06:05:29,157 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 652 Invalid, 1192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1172 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-04-01 06:05:29,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-04-01 06:05:29,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 66. [2023-04-01 06:05:29,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 43 states have (on average 1.0465116279069768) internal successors, (45), 44 states have internal predecessors, (45), 5 states have call successors, (5), 4 states have call predecessors, (5), 17 states have return successors, (18), 17 states have call predecessors, (18), 4 states have call successors, (18) [2023-04-01 06:05:29,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 68 transitions. [2023-04-01 06:05:29,167 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 68 transitions. Word has length 106 [2023-04-01 06:05:29,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 06:05:29,167 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 68 transitions. [2023-04-01 06:05:29,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 52 states have (on average 1.7115384615384615) internal successors, (89), 37 states have internal predecessors, (89), 18 states have call successors, (20), 1 states have call predecessors, (20), 16 states have return successors, (30), 18 states have call predecessors, (30), 18 states have call successors, (30) [2023-04-01 06:05:29,168 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 68 transitions. [2023-04-01 06:05:29,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-04-01 06:05:29,168 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 06:05:29,169 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 06:05:29,179 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-04-01 06:05:29,377 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,SelfDestructingSolverStorable16 [2023-04-01 06:05:29,377 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 06:05:29,378 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 06:05:29,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1935200561, now seen corresponding path program 7 times [2023-04-01 06:05:29,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 06:05:29,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97796116] [2023-04-01 06:05:29,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 06:05:29,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 06:05:29,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 06:05:30,924 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2023-04-01 06:05:30,925 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 06:05:30,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97796116] [2023-04-01 06:05:30,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97796116] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 06:05:30,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [806302332] [2023-04-01 06:05:30,925 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-04-01 06:05:30,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 06:05:30,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 06:05:30,945 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 06:05:30,977 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 06:05:31,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 06:05:31,120 INFO L262 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 128 conjunts are in the unsatisfiable core [2023-04-01 06:05:31,123 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 06:05:31,664 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2023-04-01 06:05:31,664 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 06:05:36,103 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 0 proven. 280 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2023-04-01 06:05:36,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [806302332] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 06:05:36,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1778395127] [2023-04-01 06:05:36,106 INFO L159 IcfgInterpreter]: Started Sifa with 25 locations of interest [2023-04-01 06:05:36,107 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 06:05:36,107 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-01 06:05:36,108 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 06:05:36,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 48] total 57 [2023-04-01 06:05:36,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115088473] [2023-04-01 06:05:36,108 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 06:05:36,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2023-04-01 06:05:36,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 06:05:36,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2023-04-01 06:05:36,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=3000, Unknown=0, NotChecked=0, Total=3192 [2023-04-01 06:05:36,114 INFO L87 Difference]: Start difference. First operand 66 states and 68 transitions. Second operand has 57 states, 55 states have (on average 1.709090909090909) internal successors, (94), 39 states have internal predecessors, (94), 19 states have call successors, (21), 1 states have call predecessors, (21), 17 states have return successors, (32), 19 states have call predecessors, (32), 19 states have call successors, (32) [2023-04-01 06:05:37,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 06:05:37,881 INFO L93 Difference]: Finished difference Result 114 states and 116 transitions. [2023-04-01 06:05:37,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-04-01 06:05:37,897 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 55 states have (on average 1.709090909090909) internal successors, (94), 39 states have internal predecessors, (94), 19 states have call successors, (21), 1 states have call predecessors, (21), 17 states have return successors, (32), 19 states have call predecessors, (32), 19 states have call successors, (32) Word has length 113 [2023-04-01 06:05:37,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 06:05:37,898 INFO L225 Difference]: With dead ends: 114 [2023-04-01 06:05:37,898 INFO L226 Difference]: Without dead ends: 110 [2023-04-01 06:05:37,900 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 191 SyntacticMatches, 29 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1016 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=547, Invalid=6935, Unknown=0, NotChecked=0, Total=7482 [2023-04-01 06:05:37,903 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 49 mSDsluCounter, 800 mSDsCounter, 0 mSdLazyCounter, 1408 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 829 SdHoareTripleChecker+Invalid, 1422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-04-01 06:05:37,903 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 829 Invalid, 1422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1408 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-04-01 06:05:37,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2023-04-01 06:05:37,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 69. [2023-04-01 06:05:37,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 45 states have (on average 1.0444444444444445) internal successors, (47), 46 states have internal predecessors, (47), 5 states have call successors, (5), 4 states have call predecessors, (5), 18 states have return successors, (19), 18 states have call predecessors, (19), 4 states have call successors, (19) [2023-04-01 06:05:37,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 71 transitions. [2023-04-01 06:05:37,913 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 71 transitions. Word has length 113 [2023-04-01 06:05:37,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 06:05:37,914 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 71 transitions. [2023-04-01 06:05:37,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 55 states have (on average 1.709090909090909) internal successors, (94), 39 states have internal predecessors, (94), 19 states have call successors, (21), 1 states have call predecessors, (21), 17 states have return successors, (32), 19 states have call predecessors, (32), 19 states have call successors, (32) [2023-04-01 06:05:37,914 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 71 transitions. [2023-04-01 06:05:37,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-04-01 06:05:37,915 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 06:05:37,915 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 06:05:37,927 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 06:05:38,125 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,SelfDestructingSolverStorable17 [2023-04-01 06:05:38,125 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 06:05:38,125 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 06:05:38,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1191468376, now seen corresponding path program 7 times [2023-04-01 06:05:38,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 06:05:38,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267872268] [2023-04-01 06:05:38,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 06:05:38,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 06:05:38,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 06:05:39,699 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 161 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2023-04-01 06:05:39,699 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 06:05:39,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267872268] [2023-04-01 06:05:39,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267872268] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 06:05:39,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [411300072] [2023-04-01 06:05:39,699 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-04-01 06:05:39,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 06:05:39,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 06:05:39,701 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 06:05:39,705 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 06:05:39,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 06:05:39,919 INFO L262 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 136 conjunts are in the unsatisfiable core [2023-04-01 06:05:39,923 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 06:05:40,472 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 161 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2023-04-01 06:05:40,472 INFO L327 TraceCheckSpWp]: Computing backward predicates...