./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursified_loop-simple/recursified_nested_5.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65715cb6-d814-48ba-b1a7-36259505a931/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65715cb6-d814-48ba-b1a7-36259505a931/bin/utaipan-verify-sOmjnqqW8E/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65715cb6-d814-48ba-b1a7-36259505a931/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65715cb6-d814-48ba-b1a7-36259505a931/bin/utaipan-verify-sOmjnqqW8E/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursified_loop-simple/recursified_nested_5.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65715cb6-d814-48ba-b1a7-36259505a931/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65715cb6-d814-48ba-b1a7-36259505a931/bin/utaipan-verify-sOmjnqqW8E --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c9dfd2bf12e8d041fe6d1d6bf651e6b1ba93f167a26b0485680374a443f598c5 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 23:42:45,561 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 23:42:45,662 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65715cb6-d814-48ba-b1a7-36259505a931/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-32bit-Taipan_Default.epf [2024-11-13 23:42:45,668 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 23:42:45,668 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 23:42:45,709 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 23:42:45,712 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 23:42:45,712 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 23:42:45,713 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 23:42:45,713 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 23:42:45,714 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-13 23:42:45,714 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-13 23:42:45,714 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-13 23:42:45,714 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-13 23:42:45,714 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-13 23:42:45,715 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-13 23:42:45,716 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-13 23:42:45,717 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-13 23:42:45,717 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-13 23:42:45,717 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-13 23:42:45,717 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-13 23:42:45,717 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-13 23:42:45,718 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 23:42:45,718 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 23:42:45,718 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 23:42:45,718 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 23:42:45,718 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 23:42:45,718 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 23:42:45,718 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 23:42:45,718 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 23:42:45,719 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 23:42:45,719 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 23:42:45,719 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 23:42:45,719 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 23:42:45,719 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 23:42:45,719 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 23:42:45,719 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 23:42:45,719 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 23:42:45,719 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-13 23:42:45,719 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 23:42:45,719 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 23:42:45,720 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 23:42:45,720 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-13 23:42:45,720 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 23:42:45,720 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 23:42:45,720 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-13 23:42:45,720 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 23:42:45,720 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65715cb6-d814-48ba-b1a7-36259505a931/bin/utaipan-verify-sOmjnqqW8E Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c9dfd2bf12e8d041fe6d1d6bf651e6b1ba93f167a26b0485680374a443f598c5 [2024-11-13 23:42:46,086 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 23:42:46,097 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 23:42:46,100 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 23:42:46,102 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 23:42:46,102 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 23:42:46,104 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65715cb6-d814-48ba-b1a7-36259505a931/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/recursified_loop-simple/recursified_nested_5.c Unable to find full path for "g++" [2024-11-13 23:42:48,190 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 23:42:48,512 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 23:42:48,512 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65715cb6-d814-48ba-b1a7-36259505a931/sv-benchmarks/c/recursified_loop-simple/recursified_nested_5.c [2024-11-13 23:42:48,525 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65715cb6-d814-48ba-b1a7-36259505a931/bin/utaipan-verify-sOmjnqqW8E/data/4326b1fe5/32069ce27d904ef7bf10cc45a2f5c5b1/FLAG49e1f3ba6 [2024-11-13 23:42:48,552 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65715cb6-d814-48ba-b1a7-36259505a931/bin/utaipan-verify-sOmjnqqW8E/data/4326b1fe5/32069ce27d904ef7bf10cc45a2f5c5b1 [2024-11-13 23:42:48,555 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 23:42:48,558 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 23:42:48,561 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 23:42:48,562 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 23:42:48,571 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 23:42:48,572 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 11:42:48" (1/1) ... [2024-11-13 23:42:48,573 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19955873 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:42:48, skipping insertion in model container [2024-11-13 23:42:48,573 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 11:42:48" (1/1) ... [2024-11-13 23:42:48,596 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 23:42:48,808 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65715cb6-d814-48ba-b1a7-36259505a931/sv-benchmarks/c/recursified_loop-simple/recursified_nested_5.c[2721,2734] [2024-11-13 23:42:48,812 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 23:42:48,824 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 23:42:48,866 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65715cb6-d814-48ba-b1a7-36259505a931/sv-benchmarks/c/recursified_loop-simple/recursified_nested_5.c[2721,2734] [2024-11-13 23:42:48,867 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 23:42:48,888 INFO L204 MainTranslator]: Completed translation [2024-11-13 23:42:48,889 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:42:48 WrapperNode [2024-11-13 23:42:48,889 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 23:42:48,891 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 23:42:48,891 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 23:42:48,891 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 23:42:48,899 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:42:48" (1/1) ... [2024-11-13 23:42:48,906 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:42:48" (1/1) ... [2024-11-13 23:42:48,926 INFO L138 Inliner]: procedures = 16, calls = 62, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 80 [2024-11-13 23:42:48,926 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 23:42:48,927 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 23:42:48,927 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 23:42:48,927 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 23:42:48,933 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:42:48" (1/1) ... [2024-11-13 23:42:48,933 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:42:48" (1/1) ... [2024-11-13 23:42:48,936 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:42:48" (1/1) ... [2024-11-13 23:42:48,936 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:42:48" (1/1) ... [2024-11-13 23:42:48,943 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:42:48" (1/1) ... [2024-11-13 23:42:48,946 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:42:48" (1/1) ... [2024-11-13 23:42:48,947 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:42:48" (1/1) ... [2024-11-13 23:42:48,948 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:42:48" (1/1) ... [2024-11-13 23:42:48,950 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 23:42:48,951 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 23:42:48,951 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 23:42:48,951 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 23:42:48,952 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:42:48" (1/1) ... [2024-11-13 23:42:48,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-13 23:42:48,974 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65715cb6-d814-48ba-b1a7-36259505a931/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-13 23:42:48,990 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65715cb6-d814-48ba-b1a7-36259505a931/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-13 23:42:48,993 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65715cb6-d814-48ba-b1a7-36259505a931/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-13 23:42:49,022 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 23:42:49,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-13 23:42:49,022 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-13 23:42:49,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-13 23:42:49,022 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_24_to_25_0 [2024-11-13 23:42:49,022 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_24_to_25_0 [2024-11-13 23:42:49,023 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_23_to_24_0 [2024-11-13 23:42:49,023 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_23_to_24_0 [2024-11-13 23:42:49,023 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_25_to_26_0 [2024-11-13 23:42:49,023 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_25_to_26_0 [2024-11-13 23:42:49,023 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 23:42:49,023 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 23:42:49,023 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-13 23:42:49,023 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_27_to_27_0 [2024-11-13 23:42:49,023 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_27_to_27_0 [2024-11-13 23:42:49,023 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_26_to_27_0 [2024-11-13 23:42:49,023 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_26_to_27_0 [2024-11-13 23:42:49,024 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-13 23:42:49,131 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 23:42:49,134 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 23:42:49,528 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-11-13 23:42:49,528 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 23:42:49,638 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 23:42:49,642 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-13 23:42:49,643 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 11:42:49 BoogieIcfgContainer [2024-11-13 23:42:49,643 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 23:42:49,646 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 23:42:49,646 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 23:42:49,654 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 23:42:49,654 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 11:42:48" (1/3) ... [2024-11-13 23:42:49,655 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@720e76ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 11:42:49, skipping insertion in model container [2024-11-13 23:42:49,655 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:42:48" (2/3) ... [2024-11-13 23:42:49,655 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@720e76ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 11:42:49, skipping insertion in model container [2024-11-13 23:42:49,656 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 11:42:49" (3/3) ... [2024-11-13 23:42:49,657 INFO L112 eAbstractionObserver]: Analyzing ICFG recursified_nested_5.c [2024-11-13 23:42:49,676 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 23:42:49,679 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG recursified_nested_5.c that has 6 procedures, 41 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2024-11-13 23:42:49,750 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 23:42:49,766 INFO L333 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, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@408fe7eb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 23:42:49,767 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 23:42:49,771 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 30 states have internal predecessors, (31), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-13 23:42:49,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-13 23:42:49,779 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:42:49,780 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:42:49,780 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:42:49,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:42:49,786 INFO L85 PathProgramCache]: Analyzing trace with hash -295619350, now seen corresponding path program 1 times [2024-11-13 23:42:49,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:42:49,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758231023] [2024-11-13 23:42:49,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:42:49,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:42:49,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:42:50,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 23:42:50,532 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:42:50,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758231023] [2024-11-13 23:42:50,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758231023] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:42:50,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:42:50,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 23:42:50,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245474064] [2024-11-13 23:42:50,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:42:50,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 23:42:50,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:42:50,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 23:42:50,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 23:42:50,576 INFO L87 Difference]: Start difference. First operand has 41 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 30 states have internal predecessors, (31), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 23:42:50,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:42:50,901 INFO L93 Difference]: Finished difference Result 57 states and 72 transitions. [2024-11-13 23:42:50,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 23:42:50,904 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2024-11-13 23:42:50,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:42:50,913 INFO L225 Difference]: With dead ends: 57 [2024-11-13 23:42:50,913 INFO L226 Difference]: Without dead ends: 49 [2024-11-13 23:42:50,916 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-13 23:42:50,922 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 13 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 23:42:50,924 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 91 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 23:42:50,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-13 23:42:50,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 41. [2024-11-13 23:42:50,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 29 states have internal predecessors, (29), 10 states have call successors, (10), 5 states have call predecessors, (10), 6 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2024-11-13 23:42:50,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 50 transitions. [2024-11-13 23:42:50,981 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 50 transitions. Word has length 9 [2024-11-13 23:42:50,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:42:50,982 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 50 transitions. [2024-11-13 23:42:50,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 23:42:50,982 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 50 transitions. [2024-11-13 23:42:50,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-13 23:42:50,986 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:42:50,987 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:42:50,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 23:42:50,988 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:42:50,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:42:50,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1675804554, now seen corresponding path program 1 times [2024-11-13 23:42:50,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:42:50,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897909299] [2024-11-13 23:42:50,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:42:50,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:42:51,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:42:51,441 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 23:42:51,441 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:42:51,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897909299] [2024-11-13 23:42:51,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897909299] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:42:51,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:42:51,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 23:42:51,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788293097] [2024-11-13 23:42:51,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:42:51,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 23:42:51,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:42:51,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 23:42:51,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 23:42:51,444 INFO L87 Difference]: Start difference. First operand 41 states and 50 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 23:42:51,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:42:51,660 INFO L93 Difference]: Finished difference Result 88 states and 111 transitions. [2024-11-13 23:42:51,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 23:42:51,661 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) Word has length 20 [2024-11-13 23:42:51,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:42:51,662 INFO L225 Difference]: With dead ends: 88 [2024-11-13 23:42:51,664 INFO L226 Difference]: Without dead ends: 49 [2024-11-13 23:42:51,665 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-13 23:42:51,666 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 13 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 23:42:51,668 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 85 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 23:42:51,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-13 23:42:51,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 43. [2024-11-13 23:42:51,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 25 states have (on average 1.2) internal successors, (30), 30 states have internal predecessors, (30), 10 states have call successors, (10), 5 states have call predecessors, (10), 7 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2024-11-13 23:42:51,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 52 transitions. [2024-11-13 23:42:51,685 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 52 transitions. Word has length 20 [2024-11-13 23:42:51,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:42:51,689 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 52 transitions. [2024-11-13 23:42:51,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 23:42:51,689 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 52 transitions. [2024-11-13 23:42:51,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-13 23:42:51,690 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:42:51,691 INFO L215 NwaCegarLoop]: trace histogram [2, 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] [2024-11-13 23:42:51,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 23:42:51,691 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:42:51,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:42:51,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1520575934, now seen corresponding path program 1 times [2024-11-13 23:42:51,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:42:51,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400668214] [2024-11-13 23:42:51,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:42:51,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:42:51,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:42:52,097 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-13 23:42:52,099 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:42:52,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400668214] [2024-11-13 23:42:52,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400668214] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:42:52,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:42:52,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 23:42:52,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601056055] [2024-11-13 23:42:52,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:42:52,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 23:42:52,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:42:52,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 23:42:52,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 23:42:52,104 INFO L87 Difference]: Start difference. First operand 43 states and 52 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 1 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-13 23:42:52,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:42:52,327 INFO L93 Difference]: Finished difference Result 90 states and 114 transitions. [2024-11-13 23:42:52,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 23:42:52,327 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 1 states have call predecessors, (5), 3 states have call successors, (5) Word has length 31 [2024-11-13 23:42:52,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:42:52,330 INFO L225 Difference]: With dead ends: 90 [2024-11-13 23:42:52,332 INFO L226 Difference]: Without dead ends: 49 [2024-11-13 23:42:52,333 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-13 23:42:52,335 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 13 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 23:42:52,336 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 88 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 23:42:52,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-13 23:42:52,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 45. [2024-11-13 23:42:52,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 31 states have internal predecessors, (31), 10 states have call successors, (10), 5 states have call predecessors, (10), 8 states have return successors, (13), 10 states have call predecessors, (13), 10 states have call successors, (13) [2024-11-13 23:42:52,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 54 transitions. [2024-11-13 23:42:52,356 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 54 transitions. Word has length 31 [2024-11-13 23:42:52,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:42:52,356 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 54 transitions. [2024-11-13 23:42:52,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 1 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-13 23:42:52,357 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 54 transitions. [2024-11-13 23:42:52,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-13 23:42:52,360 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:42:52,361 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:42:52,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 23:42:52,361 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:42:52,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:42:52,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1805714706, now seen corresponding path program 1 times [2024-11-13 23:42:52,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:42:52,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607046632] [2024-11-13 23:42:52,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:42:52,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:42:52,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:42:52,852 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-13 23:42:52,852 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:42:52,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607046632] [2024-11-13 23:42:52,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607046632] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:42:52,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:42:52,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 23:42:52,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801696868] [2024-11-13 23:42:52,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:42:52,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 23:42:52,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:42:52,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 23:42:52,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 23:42:52,855 INFO L87 Difference]: Start difference. First operand 45 states and 54 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 1 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-13 23:42:53,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:42:53,080 INFO L93 Difference]: Finished difference Result 92 states and 117 transitions. [2024-11-13 23:42:53,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 23:42:53,082 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 1 states have call predecessors, (7), 3 states have call successors, (7) Word has length 42 [2024-11-13 23:42:53,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:42:53,083 INFO L225 Difference]: With dead ends: 92 [2024-11-13 23:42:53,083 INFO L226 Difference]: Without dead ends: 49 [2024-11-13 23:42:53,084 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-13 23:42:53,085 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 13 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 23:42:53,088 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 98 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 23:42:53,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-13 23:42:53,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2024-11-13 23:42:53,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 32 states have internal predecessors, (32), 10 states have call successors, (10), 5 states have call predecessors, (10), 9 states have return successors, (14), 10 states have call predecessors, (14), 10 states have call successors, (14) [2024-11-13 23:42:53,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 56 transitions. [2024-11-13 23:42:53,105 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 56 transitions. Word has length 42 [2024-11-13 23:42:53,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:42:53,105 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 56 transitions. [2024-11-13 23:42:53,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 1 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-13 23:42:53,105 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 56 transitions. [2024-11-13 23:42:53,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-13 23:42:53,111 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:42:53,111 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:42:53,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 23:42:53,112 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:42:53,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:42:53,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1473520921, now seen corresponding path program 1 times [2024-11-13 23:42:53,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:42:53,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186388418] [2024-11-13 23:42:53,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:42:53,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:42:53,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:42:53,569 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-13 23:42:53,569 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:42:53,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186388418] [2024-11-13 23:42:53,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186388418] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:42:53,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:42:53,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 23:42:53,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370870677] [2024-11-13 23:42:53,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:42:53,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 23:42:53,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:42:53,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 23:42:53,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 23:42:53,571 INFO L87 Difference]: Start difference. First operand 47 states and 56 transitions. Second operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 1 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-13 23:42:53,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:42:53,759 INFO L93 Difference]: Finished difference Result 94 states and 120 transitions. [2024-11-13 23:42:53,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 23:42:53,760 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 1 states have call predecessors, (9), 3 states have call successors, (9) Word has length 53 [2024-11-13 23:42:53,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:42:53,762 INFO L225 Difference]: With dead ends: 94 [2024-11-13 23:42:53,762 INFO L226 Difference]: Without dead ends: 49 [2024-11-13 23:42:53,763 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-13 23:42:53,764 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 13 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 23:42:53,767 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 94 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 23:42:53,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-13 23:42:53,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-11-13 23:42:53,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 33 states have internal predecessors, (33), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (15), 10 states have call predecessors, (15), 10 states have call successors, (15) [2024-11-13 23:42:53,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 58 transitions. [2024-11-13 23:42:53,778 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 58 transitions. Word has length 53 [2024-11-13 23:42:53,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:42:53,778 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 58 transitions. [2024-11-13 23:42:53,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 1 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-13 23:42:53,778 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 58 transitions. [2024-11-13 23:42:53,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-13 23:42:53,780 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:42:53,780 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:42:53,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-13 23:42:53,780 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:42:53,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:42:53,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1845601206, now seen corresponding path program 1 times [2024-11-13 23:42:53,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:42:53,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566872878] [2024-11-13 23:42:53,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:42:53,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:42:53,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:42:54,502 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-13 23:42:54,502 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:42:54,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566872878] [2024-11-13 23:42:54,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566872878] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 23:42:54,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1619439807] [2024-11-13 23:42:54,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:42:54,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 23:42:54,503 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65715cb6-d814-48ba-b1a7-36259505a931/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-13 23:42:54,507 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65715cb6-d814-48ba-b1a7-36259505a931/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 23:42:54,510 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65715cb6-d814-48ba-b1a7-36259505a931/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 23:42:54,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:42:54,792 INFO L255 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-13 23:42:54,808 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:42:54,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-13 23:42:55,105 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-13 23:42:55,106 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 23:42:56,581 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-13 23:42:56,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1619439807] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 23:42:56,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [690329446] [2024-11-13 23:42:56,615 INFO L159 IcfgInterpreter]: Started Sifa with 39 locations of interest [2024-11-13 23:42:56,617 INFO L166 IcfgInterpreter]: Building call graph [2024-11-13 23:42:56,622 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:276) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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) [2024-11-13 23:42:56,628 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 23:42:56,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 22 [2024-11-13 23:42:56,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746400605] [2024-11-13 23:42:56,628 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 23:42:56,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-13 23:42:56,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:42:56,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-13 23:42:56,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2024-11-13 23:42:56,630 INFO L87 Difference]: Start difference. First operand 49 states and 58 transitions. Second operand has 22 states, 16 states have (on average 3.4375) internal successors, (55), 19 states have internal predecessors, (55), 8 states have call successors, (18), 5 states have call predecessors, (18), 7 states have return successors, (18), 4 states have call predecessors, (18), 8 states have call successors, (18) [2024-11-13 23:42:57,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:42:57,254 INFO L93 Difference]: Finished difference Result 100 states and 127 transitions. [2024-11-13 23:42:57,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 23:42:57,255 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 16 states have (on average 3.4375) internal successors, (55), 19 states have internal predecessors, (55), 8 states have call successors, (18), 5 states have call predecessors, (18), 7 states have return successors, (18), 4 states have call predecessors, (18), 8 states have call successors, (18) Word has length 58 [2024-11-13 23:42:57,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:42:57,257 INFO L225 Difference]: With dead ends: 100 [2024-11-13 23:42:57,257 INFO L226 Difference]: Without dead ends: 53 [2024-11-13 23:42:57,258 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=157, Invalid=599, Unknown=0, NotChecked=0, Total=756 [2024-11-13 23:42:57,263 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 31 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 23:42:57,263 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 234 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 23:42:57,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-13 23:42:57,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-11-13 23:42:57,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 35 states have internal predecessors, (35), 10 states have call successors, (10), 5 states have call predecessors, (10), 12 states have return successors, (17), 12 states have call predecessors, (17), 10 states have call successors, (17) [2024-11-13 23:42:57,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 62 transitions. [2024-11-13 23:42:57,274 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 62 transitions. Word has length 58 [2024-11-13 23:42:57,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:42:57,274 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 62 transitions. [2024-11-13 23:42:57,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 16 states have (on average 3.4375) internal successors, (55), 19 states have internal predecessors, (55), 8 states have call successors, (18), 5 states have call predecessors, (18), 7 states have return successors, (18), 4 states have call predecessors, (18), 8 states have call successors, (18) [2024-11-13 23:42:57,275 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 62 transitions. [2024-11-13 23:42:57,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-13 23:42:57,276 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:42:57,277 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:42:57,301 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65715cb6-d814-48ba-b1a7-36259505a931/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-13 23:42:57,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65715cb6-d814-48ba-b1a7-36259505a931/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 23:42:57,481 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:42:57,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:42:57,482 INFO L85 PathProgramCache]: Analyzing trace with hash -186818732, now seen corresponding path program 2 times [2024-11-13 23:42:57,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:42:57,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837931800] [2024-11-13 23:42:57,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:42:57,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:42:57,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:42:58,702 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 15 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-13 23:42:58,702 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:42:58,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837931800] [2024-11-13 23:42:58,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837931800] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 23:42:58,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [304768639] [2024-11-13 23:42:58,702 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-13 23:42:58,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 23:42:58,703 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65715cb6-d814-48ba-b1a7-36259505a931/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-13 23:42:58,707 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65715cb6-d814-48ba-b1a7-36259505a931/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 23:42:58,709 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65715cb6-d814-48ba-b1a7-36259505a931/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-13 23:42:59,034 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2024-11-13 23:42:59,034 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 23:42:59,045 INFO L255 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 75 conjuncts are in the unsatisfiable core [2024-11-13 23:42:59,052 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:42:59,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-13 23:42:59,532 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 8 proven. 15 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-13 23:42:59,533 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 23:43:02,987 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 8 proven. 27 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-13 23:43:02,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [304768639] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 23:43:02,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1336011043] [2024-11-13 23:43:02,991 INFO L159 IcfgInterpreter]: Started Sifa with 39 locations of interest [2024-11-13 23:43:02,992 INFO L166 IcfgInterpreter]: Building call graph [2024-11-13 23:43:02,992 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:276) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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) [2024-11-13 23:43:02,993 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 23:43:02,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16, 18] total 38 [2024-11-13 23:43:02,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911935237] [2024-11-13 23:43:02,994 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 23:43:02,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-13 23:43:02,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:43:02,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-13 23:43:02,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=1195, Unknown=0, NotChecked=0, Total=1406 [2024-11-13 23:43:02,997 INFO L87 Difference]: Start difference. First operand 53 states and 62 transitions. Second operand has 38 states, 28 states have (on average 2.5714285714285716) internal successors, (72), 33 states have internal predecessors, (72), 15 states have call successors, (25), 7 states have call predecessors, (25), 11 states have return successors, (28), 8 states have call predecessors, (28), 15 states have call successors, (28) [2024-11-13 23:43:04,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:43:04,093 INFO L93 Difference]: Finished difference Result 108 states and 135 transitions. [2024-11-13 23:43:04,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-13 23:43:04,094 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 28 states have (on average 2.5714285714285716) internal successors, (72), 33 states have internal predecessors, (72), 15 states have call successors, (25), 7 states have call predecessors, (25), 11 states have return successors, (28), 8 states have call predecessors, (28), 15 states have call successors, (28) Word has length 68 [2024-11-13 23:43:04,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:43:04,095 INFO L225 Difference]: With dead ends: 108 [2024-11-13 23:43:04,095 INFO L226 Difference]: Without dead ends: 57 [2024-11-13 23:43:04,097 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 114 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 741 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=370, Invalid=2282, Unknown=0, NotChecked=0, Total=2652 [2024-11-13 23:43:04,098 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 66 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 626 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-13 23:43:04,098 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 312 Invalid, 677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 626 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-13 23:43:04,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-13 23:43:04,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2024-11-13 23:43:04,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 32 states have (on average 1.15625) internal successors, (37), 37 states have internal predecessors, (37), 10 states have call successors, (10), 5 states have call predecessors, (10), 14 states have return successors, (19), 14 states have call predecessors, (19), 10 states have call successors, (19) [2024-11-13 23:43:04,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 66 transitions. [2024-11-13 23:43:04,107 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 66 transitions. Word has length 68 [2024-11-13 23:43:04,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:43:04,107 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 66 transitions. [2024-11-13 23:43:04,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 28 states have (on average 2.5714285714285716) internal successors, (72), 33 states have internal predecessors, (72), 15 states have call successors, (25), 7 states have call predecessors, (25), 11 states have return successors, (28), 8 states have call predecessors, (28), 15 states have call successors, (28) [2024-11-13 23:43:04,108 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 66 transitions. [2024-11-13 23:43:04,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-13 23:43:04,109 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:43:04,109 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:43:04,131 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65715cb6-d814-48ba-b1a7-36259505a931/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-13 23:43:04,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65715cb6-d814-48ba-b1a7-36259505a931/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 23:43:04,313 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:43:04,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:43:04,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1144558242, now seen corresponding path program 3 times [2024-11-13 23:43:04,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:43:04,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861710620] [2024-11-13 23:43:04,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:43:04,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:43:04,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:43:05,718 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 16 proven. 35 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-13 23:43:05,718 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:43:05,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861710620] [2024-11-13 23:43:05,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861710620] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 23:43:05,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1608583103] [2024-11-13 23:43:05,719 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-13 23:43:05,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 23:43:05,719 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65715cb6-d814-48ba-b1a7-36259505a931/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-13 23:43:05,721 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65715cb6-d814-48ba-b1a7-36259505a931/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 23:43:05,727 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65715cb6-d814-48ba-b1a7-36259505a931/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-13 23:43:05,955 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-13 23:43:05,955 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 23:43:05,965 INFO L255 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 75 conjuncts are in the unsatisfiable core [2024-11-13 23:43:05,971 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:43:05,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-13 23:43:06,415 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 8 proven. 35 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2024-11-13 23:43:06,415 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 23:43:11,169 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 8 proven. 70 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-13 23:43:11,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1608583103] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 23:43:11,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1921778238] [2024-11-13 23:43:11,173 INFO L159 IcfgInterpreter]: Started Sifa with 39 locations of interest [2024-11-13 23:43:11,173 INFO L166 IcfgInterpreter]: Building call graph [2024-11-13 23:43:11,173 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:276) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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) [2024-11-13 23:43:11,175 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 23:43:11,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 26] total 42 [2024-11-13 23:43:11,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334959023] [2024-11-13 23:43:11,175 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 23:43:11,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-11-13 23:43:11,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:43:11,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-11-13 23:43:11,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=331, Invalid=1391, Unknown=0, NotChecked=0, Total=1722 [2024-11-13 23:43:11,181 INFO L87 Difference]: Start difference. First operand 57 states and 66 transitions. Second operand has 42 states, 32 states have (on average 2.21875) internal successors, (71), 35 states have internal predecessors, (71), 12 states have call successors, (23), 9 states have call predecessors, (23), 15 states have return successors, (30), 12 states have call predecessors, (30), 12 states have call successors, (30) [2024-11-13 23:43:12,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:43:12,134 INFO L93 Difference]: Finished difference Result 114 states and 140 transitions. [2024-11-13 23:43:12,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-13 23:43:12,135 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 32 states have (on average 2.21875) internal successors, (71), 35 states have internal predecessors, (71), 12 states have call successors, (23), 9 states have call predecessors, (23), 15 states have return successors, (30), 12 states have call predecessors, (30), 12 states have call successors, (30) Word has length 78 [2024-11-13 23:43:12,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:43:12,137 INFO L225 Difference]: With dead ends: 114 [2024-11-13 23:43:12,137 INFO L226 Difference]: Without dead ends: 59 [2024-11-13 23:43:12,140 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 135 SyntacticMatches, 5 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 967 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=503, Invalid=2047, Unknown=0, NotChecked=0, Total=2550 [2024-11-13 23:43:12,142 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 96 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 624 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-13 23:43:12,142 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 344 Invalid, 710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 624 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-13 23:43:12,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-13 23:43:12,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-11-13 23:43:12,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 38 states have internal predecessors, (38), 10 states have call successors, (10), 5 states have call predecessors, (10), 15 states have return successors, (20), 15 states have call predecessors, (20), 10 states have call successors, (20) [2024-11-13 23:43:12,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 68 transitions. [2024-11-13 23:43:12,157 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 68 transitions. Word has length 78 [2024-11-13 23:43:12,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:43:12,158 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 68 transitions. [2024-11-13 23:43:12,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 32 states have (on average 2.21875) internal successors, (71), 35 states have internal predecessors, (71), 12 states have call successors, (23), 9 states have call predecessors, (23), 15 states have return successors, (30), 12 states have call predecessors, (30), 12 states have call successors, (30) [2024-11-13 23:43:12,158 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 68 transitions. [2024-11-13 23:43:12,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-13 23:43:12,160 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:43:12,160 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:43:12,185 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65715cb6-d814-48ba-b1a7-36259505a931/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-13 23:43:12,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65715cb6-d814-48ba-b1a7-36259505a931/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 23:43:12,361 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:43:12,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:43:12,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1053195191, now seen corresponding path program 4 times [2024-11-13 23:43:12,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:43:12,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435481296] [2024-11-13 23:43:12,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:43:12,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:43:12,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:43:18,071 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2024-11-13 23:43:18,071 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:43:18,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435481296] [2024-11-13 23:43:18,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435481296] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 23:43:18,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1906054759] [2024-11-13 23:43:18,072 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-13 23:43:18,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 23:43:18,072 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65715cb6-d814-48ba-b1a7-36259505a931/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-13 23:43:18,074 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65715cb6-d814-48ba-b1a7-36259505a931/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 23:43:18,077 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65715cb6-d814-48ba-b1a7-36259505a931/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-13 23:43:18,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:43:18,336 INFO L255 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 102 conjuncts are in the unsatisfiable core [2024-11-13 23:43:18,343 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:43:18,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6710 treesize of output 6646 [2024-11-13 23:43:18,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-13 23:43:20,729 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_#memory_int_BEFORE_CALL_47| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_47| |c_#memory_int|))) (and (= (store |v_#memory_int_BEFORE_CALL_47| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_#memory_int_BEFORE_CALL_47| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |v_#memory_int_BEFORE_CALL_47|) (= .cse0 |c_func_to_recursive_line_27_to_27_0_#in~e.base|)))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |c_#memory_int| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |c_#memory_int|)) is different from false [2024-11-13 23:43:22,731 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_#memory_int_BEFORE_CALL_47| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_47| |c_#memory_int|))) (and (= (store |v_#memory_int_BEFORE_CALL_47| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_#memory_int_BEFORE_CALL_47| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |v_#memory_int_BEFORE_CALL_47|) (= .cse0 |c_func_to_recursive_line_27_to_27_0_#in~e.base|)))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |c_#memory_int| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |c_#memory_int|)) is different from true [2024-11-13 23:43:24,774 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#memory_int)_AFTER_CALL_40| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_40| |c_#memory_int|))) (and (= .cse0 |c_func_to_recursive_line_27_to_27_0_#in~e.base|) (= |v_old(#memory_int)_AFTER_CALL_40| (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_old(#memory_int)_AFTER_CALL_40| |c_func_to_recursive_line_27_to_27_0_#in~e.base|))) (= (store |v_old(#memory_int)_AFTER_CALL_40| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|)))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |c_#memory_int| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |c_#memory_int|)) is different from false [2024-11-13 23:43:26,776 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#memory_int)_AFTER_CALL_40| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_40| |c_#memory_int|))) (and (= .cse0 |c_func_to_recursive_line_27_to_27_0_#in~e.base|) (= |v_old(#memory_int)_AFTER_CALL_40| (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_old(#memory_int)_AFTER_CALL_40| |c_func_to_recursive_line_27_to_27_0_#in~e.base|))) (= (store |v_old(#memory_int)_AFTER_CALL_40| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|)))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |c_#memory_int| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |c_#memory_int|)) is different from true [2024-11-13 23:43:28,816 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_#memory_int_BEFORE_CALL_49| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_49| |c_#memory_int|))) (and (= .cse0 |c_func_to_recursive_line_27_to_27_0_#in~e.base|) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_#memory_int_BEFORE_CALL_49| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |v_#memory_int_BEFORE_CALL_49|) (= |c_#memory_int| (store |v_#memory_int_BEFORE_CALL_49| .cse0 (select |c_#memory_int| .cse0)))))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |c_#memory_int| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |c_#memory_int|)) is different from false [2024-11-13 23:43:30,818 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_#memory_int_BEFORE_CALL_49| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_49| |c_#memory_int|))) (and (= .cse0 |c_func_to_recursive_line_27_to_27_0_#in~e.base|) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_#memory_int_BEFORE_CALL_49| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |v_#memory_int_BEFORE_CALL_49|) (= |c_#memory_int| (store |v_#memory_int_BEFORE_CALL_49| .cse0 (select |c_#memory_int| .cse0)))))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |c_#memory_int| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |c_#memory_int|)) is different from true [2024-11-13 23:43:31,205 INFO L349 Elim1Store]: treesize reduction 52, result has 1.9 percent of original size [2024-11-13 23:43:31,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 86 treesize of output 91 [2024-11-13 23:43:31,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 33 [2024-11-13 23:43:31,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2024-11-13 23:43:31,254 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 6 proven. 26 refuted. 0 times theorem prover too weak. 68 trivial. 15 not checked. [2024-11-13 23:43:31,254 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 23:43:32,061 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:43:32,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2024-11-13 23:43:32,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2024-11-13 23:43:32,708 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:43:32,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2024-11-13 23:43:32,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2024-11-13 23:43:33,332 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:43:33,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2024-11-13 23:43:33,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2024-11-13 23:43:33,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1906054759] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 23:43:33,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1100259697] [2024-11-13 23:43:33,915 INFO L159 IcfgInterpreter]: Started Sifa with 39 locations of interest [2024-11-13 23:43:33,915 INFO L166 IcfgInterpreter]: Building call graph [2024-11-13 23:43:33,915 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:276) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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) [2024-11-13 23:43:33,916 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 23:43:33,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 24] total 29 [2024-11-13 23:43:33,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034367520] [2024-11-13 23:43:33,916 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 23:43:33,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-13 23:43:33,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:43:33,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-13 23:43:33,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=715, Unknown=7, NotChecked=168, Total=992 [2024-11-13 23:43:33,922 INFO L87 Difference]: Start difference. First operand 59 states and 68 transitions. Second operand has 29 states, 22 states have (on average 2.1363636363636362) internal successors, (47), 24 states have internal predecessors, (47), 13 states have call successors, (13), 2 states have call predecessors, (13), 9 states have return successors, (18), 12 states have call predecessors, (18), 13 states have call successors, (18) [2024-11-13 23:43:36,251 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |c_#memory_int| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |c_#memory_int|))) (and (= (store |c_old(#memory_int)| c_func_to_recursive_line_27_to_27_0_~e.base (select |c_#memory_int| c_func_to_recursive_line_27_to_27_0_~e.base)) |c_#memory_int|) (= |c_func_to_recursive_line_27_to_27_0_#in~e.base| c_func_to_recursive_line_27_to_27_0_~e.base) (or (exists ((|v_#memory_int_BEFORE_CALL_47| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_47| |c_#memory_int|))) (and (= (store |v_#memory_int_BEFORE_CALL_47| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_#memory_int_BEFORE_CALL_47| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |v_#memory_int_BEFORE_CALL_47|) (= .cse0 |c_func_to_recursive_line_27_to_27_0_#in~e.base|)))) .cse1) (or (exists ((|v_old(#memory_int)_AFTER_CALL_40| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_old(#memory_int)_AFTER_CALL_40| |c_#memory_int|))) (and (= .cse2 |c_func_to_recursive_line_27_to_27_0_#in~e.base|) (= |v_old(#memory_int)_AFTER_CALL_40| (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_old(#memory_int)_AFTER_CALL_40| |c_func_to_recursive_line_27_to_27_0_#in~e.base|))) (= (store |v_old(#memory_int)_AFTER_CALL_40| .cse2 (select |c_#memory_int| .cse2)) |c_#memory_int|)))) .cse1) (or (exists ((|v_#memory_int_BEFORE_CALL_49| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_#memory_int_BEFORE_CALL_49| |c_#memory_int|))) (and (= .cse3 |c_func_to_recursive_line_27_to_27_0_#in~e.base|) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_#memory_int_BEFORE_CALL_49| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |v_#memory_int_BEFORE_CALL_49|) (= |c_#memory_int| (store |v_#memory_int_BEFORE_CALL_49| .cse3 (select |c_#memory_int| .cse3)))))) .cse1))) is different from false [2024-11-13 23:43:38,253 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |c_#memory_int| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |c_#memory_int|))) (and (= (store |c_old(#memory_int)| c_func_to_recursive_line_27_to_27_0_~e.base (select |c_#memory_int| c_func_to_recursive_line_27_to_27_0_~e.base)) |c_#memory_int|) (= |c_func_to_recursive_line_27_to_27_0_#in~e.base| c_func_to_recursive_line_27_to_27_0_~e.base) (or (exists ((|v_#memory_int_BEFORE_CALL_47| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_47| |c_#memory_int|))) (and (= (store |v_#memory_int_BEFORE_CALL_47| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_#memory_int_BEFORE_CALL_47| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |v_#memory_int_BEFORE_CALL_47|) (= .cse0 |c_func_to_recursive_line_27_to_27_0_#in~e.base|)))) .cse1) (or (exists ((|v_old(#memory_int)_AFTER_CALL_40| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_old(#memory_int)_AFTER_CALL_40| |c_#memory_int|))) (and (= .cse2 |c_func_to_recursive_line_27_to_27_0_#in~e.base|) (= |v_old(#memory_int)_AFTER_CALL_40| (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_old(#memory_int)_AFTER_CALL_40| |c_func_to_recursive_line_27_to_27_0_#in~e.base|))) (= (store |v_old(#memory_int)_AFTER_CALL_40| .cse2 (select |c_#memory_int| .cse2)) |c_#memory_int|)))) .cse1) (or (exists ((|v_#memory_int_BEFORE_CALL_49| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_#memory_int_BEFORE_CALL_49| |c_#memory_int|))) (and (= .cse3 |c_func_to_recursive_line_27_to_27_0_#in~e.base|) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_#memory_int_BEFORE_CALL_49| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |v_#memory_int_BEFORE_CALL_49|) (= |c_#memory_int| (store |v_#memory_int_BEFORE_CALL_49| .cse3 (select |c_#memory_int| .cse3)))))) .cse1))) is different from true [2024-11-13 23:43:39,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:43:39,243 INFO L93 Difference]: Finished difference Result 99 states and 125 transitions. [2024-11-13 23:43:39,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-11-13 23:43:39,244 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 22 states have (on average 2.1363636363636362) internal successors, (47), 24 states have internal predecessors, (47), 13 states have call successors, (13), 2 states have call predecessors, (13), 9 states have return successors, (18), 12 states have call predecessors, (18), 13 states have call successors, (18) Word has length 83 [2024-11-13 23:43:39,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:43:39,246 INFO L225 Difference]: With dead ends: 99 [2024-11-13 23:43:39,246 INFO L226 Difference]: Without dead ends: 61 [2024-11-13 23:43:39,247 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 124 SyntacticMatches, 6 SemanticMatches, 52 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 607 ImplicationChecksByTransitivity, 17.4s TimeCoverageRelationStatistics Valid=277, Invalid=2178, Unknown=11, NotChecked=396, Total=2862 [2024-11-13 23:43:39,247 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 61 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 753 mSolverCounterSat, 44 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 1151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 753 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 351 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-13 23:43:39,248 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 359 Invalid, 1151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 753 Invalid, 3 Unknown, 351 Unchecked, 0.7s Time] [2024-11-13 23:43:39,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-13 23:43:39,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-11-13 23:43:39,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 39 states have internal predecessors, (39), 10 states have call successors, (10), 5 states have call predecessors, (10), 16 states have return successors, (21), 16 states have call predecessors, (21), 10 states have call successors, (21) [2024-11-13 23:43:39,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 70 transitions. [2024-11-13 23:43:39,261 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 70 transitions. Word has length 83 [2024-11-13 23:43:39,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:43:39,262 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 70 transitions. [2024-11-13 23:43:39,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 22 states have (on average 2.1363636363636362) internal successors, (47), 24 states have internal predecessors, (47), 13 states have call successors, (13), 2 states have call predecessors, (13), 9 states have return successors, (18), 12 states have call predecessors, (18), 13 states have call successors, (18) [2024-11-13 23:43:39,262 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 70 transitions. [2024-11-13 23:43:39,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-13 23:43:39,264 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:43:39,264 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 12, 12, 12, 3, 3, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:43:39,284 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65715cb6-d814-48ba-b1a7-36259505a931/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-13 23:43:39,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65715cb6-d814-48ba-b1a7-36259505a931/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 23:43:39,468 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:43:39,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:43:39,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1101129270, now seen corresponding path program 5 times [2024-11-13 23:43:39,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:43:39,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47575679] [2024-11-13 23:43:39,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:43:39,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:43:39,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat