./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops-crafted-1/discover_list.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loops-crafted-1/discover_list.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2aca78a4c905fef1e916fc947a81c98263f5056a4b2b5d7ea35195ed74fad5a5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 13:35:54,819 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 13:35:54,877 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 13:35:54,882 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 13:35:54,885 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 13:35:54,898 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 13:35:54,899 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 13:35:54,899 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 13:35:54,899 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 13:35:54,899 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 13:35:54,899 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 13:35:54,899 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 13:35:54,899 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 13:35:54,899 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 13:35:54,899 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 13:35:54,904 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 13:35:54,904 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 13:35:54,904 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 13:35:54,905 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 13:35:54,905 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 13:35:54,906 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 13:35:54,906 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 13:35:54,906 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 13:35:54,906 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 13:35:54,906 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 13:35:54,907 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 13:35:54,907 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 13:35:54,907 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 13:35:54,907 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 13:35:54,907 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 13:35:54,907 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 13:35:54,907 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 13:35:54,907 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 13:35:54,907 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 13:35:54,907 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 13:35:54,907 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 13:35:54,908 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 13:35:54,908 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 13:35:54,908 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 13:35:54,908 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 13:35:54,908 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 13:35:54,908 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 13:35:54,908 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 13:35:54,908 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> Automizer 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 -> 2aca78a4c905fef1e916fc947a81c98263f5056a4b2b5d7ea35195ed74fad5a5 [2025-03-03 13:35:55,117 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 13:35:55,124 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 13:35:55,125 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 13:35:55,126 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 13:35:55,126 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 13:35:55,128 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops-crafted-1/discover_list.c [2025-03-03 13:35:56,330 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fed58b3b/a70dc37e0d87449d9239f5b913f54af9/FLAGd093e9a66 [2025-03-03 13:35:56,569 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 13:35:56,572 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/discover_list.c [2025-03-03 13:35:56,582 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fed58b3b/a70dc37e0d87449d9239f5b913f54af9/FLAGd093e9a66 [2025-03-03 13:35:56,599 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fed58b3b/a70dc37e0d87449d9239f5b913f54af9 [2025-03-03 13:35:56,601 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 13:35:56,602 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 13:35:56,604 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 13:35:56,604 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 13:35:56,607 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 13:35:56,608 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 01:35:56" (1/1) ... [2025-03-03 13:35:56,608 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c38d0b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:35:56, skipping insertion in model container [2025-03-03 13:35:56,608 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 01:35:56" (1/1) ... [2025-03-03 13:35:56,632 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 13:35:56,776 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/discover_list.c[5067,5080] [2025-03-03 13:35:56,841 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 13:35:56,859 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 13:35:56,875 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/discover_list.c[5067,5080] [2025-03-03 13:35:56,910 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 13:35:56,932 INFO L204 MainTranslator]: Completed translation [2025-03-03 13:35:56,933 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:35:56 WrapperNode [2025-03-03 13:35:56,933 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 13:35:56,933 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 13:35:56,934 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 13:35:56,934 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 13:35:56,938 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:35:56" (1/1) ... [2025-03-03 13:35:56,948 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:35:56" (1/1) ... [2025-03-03 13:35:56,971 INFO L138 Inliner]: procedures = 37, calls = 248, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 509 [2025-03-03 13:35:56,971 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 13:35:56,971 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 13:35:56,972 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 13:35:56,972 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 13:35:56,980 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:35:56" (1/1) ... [2025-03-03 13:35:56,980 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:35:56" (1/1) ... [2025-03-03 13:35:56,986 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:35:56" (1/1) ... [2025-03-03 13:35:57,005 INFO L175 MemorySlicer]: Split 181 memory accesses to 7 slices as follows [2, 42, 11, 10, 100, 12, 4]. 55 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0, 0, 0]. The 148 writes are split as follows [0, 39, 11, 0, 97, 0, 1]. [2025-03-03 13:35:57,005 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:35:56" (1/1) ... [2025-03-03 13:35:57,005 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:35:56" (1/1) ... [2025-03-03 13:35:57,024 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:35:56" (1/1) ... [2025-03-03 13:35:57,025 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:35:56" (1/1) ... [2025-03-03 13:35:57,027 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:35:56" (1/1) ... [2025-03-03 13:35:57,028 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:35:56" (1/1) ... [2025-03-03 13:35:57,031 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 13:35:57,032 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 13:35:57,032 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 13:35:57,032 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 13:35:57,034 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:35:56" (1/1) ... [2025-03-03 13:35:57,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 13:35:57,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:35:57,061 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 13:35:57,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 13:35:57,078 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 13:35:57,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-03 13:35:57,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-03 13:35:57,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-03-03 13:35:57,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-03-03 13:35:57,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-03-03 13:35:57,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-03-03 13:35:57,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-03-03 13:35:57,078 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-03 13:35:57,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-03 13:35:57,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-03 13:35:57,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-03 13:35:57,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-03 13:35:57,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-03 13:35:57,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-03 13:35:57,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-03 13:35:57,079 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-03 13:35:57,079 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-03 13:35:57,079 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-03 13:35:57,079 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-03 13:35:57,079 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-03 13:35:57,079 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-03 13:35:57,079 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-03 13:35:57,079 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-03 13:35:57,080 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-03 13:35:57,080 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-03-03 13:35:57,080 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#3 [2025-03-03 13:35:57,080 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#4 [2025-03-03 13:35:57,080 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#5 [2025-03-03 13:35:57,080 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#6 [2025-03-03 13:35:57,080 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-03 13:35:57,080 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-03 13:35:57,081 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-03-03 13:35:57,081 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#3 [2025-03-03 13:35:57,081 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#4 [2025-03-03 13:35:57,081 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#5 [2025-03-03 13:35:57,081 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#6 [2025-03-03 13:35:57,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 13:35:57,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 13:35:57,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-03 13:35:57,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-03 13:35:57,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-03 13:35:57,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-03 13:35:57,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-03 13:35:57,082 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-03 13:35:57,082 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 13:35:57,082 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 13:35:57,082 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-03 13:35:57,082 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-03 13:35:57,082 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-03 13:35:57,190 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 13:35:57,192 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 13:35:57,709 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L495: call ULTIMATE.dealloc(main_~#tobj~0#1.base, main_~#tobj~0#1.offset);havoc main_~#tobj~0#1.base, main_~#tobj~0#1.offset;call ULTIMATE.dealloc(main_~#opts~0#1.base, main_~#opts~0#1.offset);havoc main_~#opts~0#1.base, main_~#opts~0#1.offset; [2025-03-03 13:35:57,709 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L475: havoc do_discover_list_#t~mem97#1; [2025-03-03 13:35:57,709 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L108: havoc smp_send_req_#t~nondet4#1; [2025-03-03 13:35:57,709 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L489: havoc do_discover_list_#t~mem102#1; [2025-03-03 13:35:57,709 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L419: call ULTIMATE.dealloc(do_discover_list_~#smp_req~0#1.base, do_discover_list_~#smp_req~0#1.offset);havoc do_discover_list_~#smp_req~0#1.base, do_discover_list_~#smp_req~0#1.offset;call ULTIMATE.dealloc(do_discover_list_~#smp_rr~0#1.base, do_discover_list_~#smp_rr~0#1.offset);havoc do_discover_list_~#smp_rr~0#1.base, do_discover_list_~#smp_rr~0#1.offset; [2025-03-03 13:35:57,755 INFO L? ?]: Removed 109 outVars from TransFormulas that were not future-live. [2025-03-03 13:35:57,755 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 13:35:57,769 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 13:35:57,771 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 13:35:57,771 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 01:35:57 BoogieIcfgContainer [2025-03-03 13:35:57,772 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 13:35:57,773 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 13:35:57,773 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 13:35:57,776 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 13:35:57,777 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 01:35:56" (1/3) ... [2025-03-03 13:35:57,777 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@791d8001 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 01:35:57, skipping insertion in model container [2025-03-03 13:35:57,777 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:35:56" (2/3) ... [2025-03-03 13:35:57,778 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@791d8001 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 01:35:57, skipping insertion in model container [2025-03-03 13:35:57,778 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 01:35:57" (3/3) ... [2025-03-03 13:35:57,780 INFO L128 eAbstractionObserver]: Analyzing ICFG discover_list.c [2025-03-03 13:35:57,791 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 13:35:57,792 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG discover_list.c that has 9 procedures, 105 locations, 1 initial locations, 12 loop locations, and 1 error locations. [2025-03-03 13:35:57,835 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 13:35:57,845 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=PETRI_NET, 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;@3e9b75cb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 13:35:57,846 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 13:35:57,850 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 72 states have (on average 1.5277777777777777) internal successors, (110), 73 states have internal predecessors, (110), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-03 13:35:57,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-03 13:35:57,856 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:35:57,857 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:35:57,857 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:35:57,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:35:57,863 INFO L85 PathProgramCache]: Analyzing trace with hash -474713352, now seen corresponding path program 1 times [2025-03-03 13:35:57,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:35:57,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192791419] [2025-03-03 13:35:57,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:35:57,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:35:59,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-03 13:35:59,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-03 13:35:59,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:35:59,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:35:59,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:35:59,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:35:59,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192791419] [2025-03-03 13:35:59,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192791419] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:35:59,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:35:59,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 13:35:59,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575886850] [2025-03-03 13:35:59,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:35:59,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 13:35:59,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:35:59,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 13:35:59,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 13:35:59,356 INFO L87 Difference]: Start difference. First operand has 85 states, 72 states have (on average 1.5277777777777777) internal successors, (110), 73 states have internal predecessors, (110), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 13:35:59,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:35:59,456 INFO L93 Difference]: Finished difference Result 197 states and 302 transitions. [2025-03-03 13:35:59,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 13:35:59,458 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 38 [2025-03-03 13:35:59,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:35:59,462 INFO L225 Difference]: With dead ends: 197 [2025-03-03 13:35:59,462 INFO L226 Difference]: Without dead ends: 98 [2025-03-03 13:35:59,464 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 13:35:59,466 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 45 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:35:59,466 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 544 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 13:35:59,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-03-03 13:35:59,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 73. [2025-03-03 13:35:59,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 61 states have (on average 1.3442622950819672) internal successors, (82), 61 states have internal predecessors, (82), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-03 13:35:59,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 98 transitions. [2025-03-03 13:35:59,496 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 98 transitions. Word has length 38 [2025-03-03 13:35:59,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:35:59,497 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 98 transitions. [2025-03-03 13:35:59,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 13:35:59,497 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 98 transitions. [2025-03-03 13:35:59,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-03 13:35:59,498 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:35:59,498 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:35:59,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 13:35:59,498 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:35:59,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:35:59,499 INFO L85 PathProgramCache]: Analyzing trace with hash 550778647, now seen corresponding path program 1 times [2025-03-03 13:35:59,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:35:59,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302870620] [2025-03-03 13:35:59,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:35:59,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:36:00,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-03 13:36:00,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-03 13:36:00,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:36:00,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:36:00,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:36:00,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:36:00,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302870620] [2025-03-03 13:36:00,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302870620] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:36:00,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:36:00,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 13:36:00,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039524171] [2025-03-03 13:36:00,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:36:00,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 13:36:00,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:36:00,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 13:36:00,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 13:36:00,621 INFO L87 Difference]: Start difference. First operand 73 states and 98 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 13:36:00,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:36:00,663 INFO L93 Difference]: Finished difference Result 111 states and 149 transitions. [2025-03-03 13:36:00,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 13:36:00,666 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 38 [2025-03-03 13:36:00,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:36:00,666 INFO L225 Difference]: With dead ends: 111 [2025-03-03 13:36:00,666 INFO L226 Difference]: Without dead ends: 73 [2025-03-03 13:36:00,667 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 13:36:00,667 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 1 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:36:00,667 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 354 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:36:00,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-03-03 13:36:00,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2025-03-03 13:36:00,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 61 states have (on average 1.3278688524590163) internal successors, (81), 61 states have internal predecessors, (81), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-03 13:36:00,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 97 transitions. [2025-03-03 13:36:00,672 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 97 transitions. Word has length 38 [2025-03-03 13:36:00,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:36:00,672 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 97 transitions. [2025-03-03 13:36:00,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 13:36:00,673 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 97 transitions. [2025-03-03 13:36:00,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-03 13:36:00,673 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:36:00,673 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:36:00,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 13:36:00,674 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:36:00,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:36:00,674 INFO L85 PathProgramCache]: Analyzing trace with hash 40244470, now seen corresponding path program 1 times [2025-03-03 13:36:00,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:36:00,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999395262] [2025-03-03 13:36:00,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:36:00,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:36:01,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-03 13:36:01,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-03 13:36:01,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:36:01,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:36:01,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:36:01,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:36:01,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999395262] [2025-03-03 13:36:01,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999395262] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:36:01,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:36:01,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 13:36:01,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220021525] [2025-03-03 13:36:01,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:36:01,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 13:36:01,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:36:01,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 13:36:01,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 13:36:01,638 INFO L87 Difference]: Start difference. First operand 73 states and 97 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 13:36:01,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:36:01,657 INFO L93 Difference]: Finished difference Result 130 states and 174 transitions. [2025-03-03 13:36:01,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 13:36:01,659 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 38 [2025-03-03 13:36:01,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:36:01,659 INFO L225 Difference]: With dead ends: 130 [2025-03-03 13:36:01,659 INFO L226 Difference]: Without dead ends: 74 [2025-03-03 13:36:01,660 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 13:36:01,660 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 0 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:36:01,660 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 274 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:36:01,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-03-03 13:36:01,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2025-03-03 13:36:01,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 62 states have (on average 1.3225806451612903) internal successors, (82), 62 states have internal predecessors, (82), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-03 13:36:01,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 98 transitions. [2025-03-03 13:36:01,670 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 98 transitions. Word has length 38 [2025-03-03 13:36:01,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:36:01,673 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 98 transitions. [2025-03-03 13:36:01,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 13:36:01,673 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 98 transitions. [2025-03-03 13:36:01,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-03 13:36:01,674 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:36:01,674 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:36:01,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 13:36:01,674 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:36:01,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:36:01,674 INFO L85 PathProgramCache]: Analyzing trace with hash 828223724, now seen corresponding path program 1 times [2025-03-03 13:36:01,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:36:01,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726685745] [2025-03-03 13:36:01,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:36:01,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:36:02,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-03 13:36:02,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-03 13:36:02,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:36:02,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:36:02,620 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:36:02,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:36:02,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726685745] [2025-03-03 13:36:02,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726685745] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:36:02,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1392975922] [2025-03-03 13:36:02,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:36:02,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:36:02,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:36:02,624 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:36:02,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 13:36:03,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-03 13:36:03,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-03 13:36:03,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:36:03,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:36:03,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 589 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 13:36:03,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:36:03,642 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:36:03,642 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:36:03,698 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:36:03,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1392975922] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:36:03,699 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:36:03,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-03 13:36:03,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203932814] [2025-03-03 13:36:03,699 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:36:03,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 13:36:03,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:36:03,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 13:36:03,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-03-03 13:36:03,702 INFO L87 Difference]: Start difference. First operand 74 states and 98 transitions. Second operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-03 13:36:03,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:36:03,749 INFO L93 Difference]: Finished difference Result 135 states and 181 transitions. [2025-03-03 13:36:03,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 13:36:03,750 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 39 [2025-03-03 13:36:03,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:36:03,750 INFO L225 Difference]: With dead ends: 135 [2025-03-03 13:36:03,751 INFO L226 Difference]: Without dead ends: 77 [2025-03-03 13:36:03,751 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-03-03 13:36:03,751 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 0 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:36:03,751 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 456 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:36:03,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-03-03 13:36:03,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2025-03-03 13:36:03,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 65 states have (on average 1.3076923076923077) internal successors, (85), 65 states have internal predecessors, (85), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-03 13:36:03,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 101 transitions. [2025-03-03 13:36:03,756 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 101 transitions. Word has length 39 [2025-03-03 13:36:03,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:36:03,757 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 101 transitions. [2025-03-03 13:36:03,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-03 13:36:03,757 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 101 transitions. [2025-03-03 13:36:03,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-03 13:36:03,757 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:36:03,758 INFO L218 NwaCegarLoop]: trace histogram [4, 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] [2025-03-03 13:36:03,767 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 13:36:03,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:36:03,962 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:36:03,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:36:03,963 INFO L85 PathProgramCache]: Analyzing trace with hash -781688202, now seen corresponding path program 2 times [2025-03-03 13:36:03,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:36:03,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179030565] [2025-03-03 13:36:03,963 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:36:03,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:36:04,623 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-03-03 13:36:04,657 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 38 of 42 statements. [2025-03-03 13:36:04,660 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-03 13:36:04,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:36:04,784 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-03 13:36:04,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:36:04,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179030565] [2025-03-03 13:36:04,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179030565] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:36:04,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:36:04,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 13:36:04,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225315856] [2025-03-03 13:36:04,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:36:04,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 13:36:04,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:36:04,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 13:36:04,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 13:36:04,789 INFO L87 Difference]: Start difference. First operand 77 states and 101 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 13:36:04,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:36:04,805 INFO L93 Difference]: Finished difference Result 114 states and 152 transitions. [2025-03-03 13:36:04,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 13:36:04,805 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 42 [2025-03-03 13:36:04,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:36:04,806 INFO L225 Difference]: With dead ends: 114 [2025-03-03 13:36:04,806 INFO L226 Difference]: Without dead ends: 78 [2025-03-03 13:36:04,806 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 13:36:04,807 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 0 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:36:04,807 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 273 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:36:04,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-03-03 13:36:04,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2025-03-03 13:36:04,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 66 states have (on average 1.303030303030303) internal successors, (86), 66 states have internal predecessors, (86), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-03 13:36:04,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 102 transitions. [2025-03-03 13:36:04,812 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 102 transitions. Word has length 42 [2025-03-03 13:36:04,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:36:04,812 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 102 transitions. [2025-03-03 13:36:04,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 13:36:04,812 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 102 transitions. [2025-03-03 13:36:04,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-03 13:36:04,815 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:36:04,815 INFO L218 NwaCegarLoop]: trace histogram [4, 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, 1] [2025-03-03 13:36:04,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 13:36:04,815 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:36:04,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:36:04,815 INFO L85 PathProgramCache]: Analyzing trace with hash -207732602, now seen corresponding path program 1 times [2025-03-03 13:36:04,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:36:04,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624422338] [2025-03-03 13:36:04,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:36:04,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:36:05,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-03 13:36:05,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-03 13:36:05,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:36:05,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:36:05,780 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 13:36:05,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:36:05,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624422338] [2025-03-03 13:36:05,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624422338] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:36:05,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [273911128] [2025-03-03 13:36:05,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:36:05,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:36:05,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:36:05,783 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:36:05,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 13:36:06,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-03 13:36:06,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-03 13:36:06,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:36:06,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:36:06,636 INFO L256 TraceCheckSpWp]: Trace formula consists of 617 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-03 13:36:06,637 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:36:06,692 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 13:36:06,693 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:36:06,767 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-03 13:36:06,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [273911128] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:36:06,768 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:36:06,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 5] total 15 [2025-03-03 13:36:06,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681480885] [2025-03-03 13:36:06,768 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:36:06,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-03 13:36:06,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:36:06,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-03 13:36:06,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2025-03-03 13:36:06,770 INFO L87 Difference]: Start difference. First operand 78 states and 102 transitions. Second operand has 15 states, 15 states have (on average 4.333333333333333) internal successors, (65), 15 states have internal predecessors, (65), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 13:36:06,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:36:06,859 INFO L93 Difference]: Finished difference Result 143 states and 192 transitions. [2025-03-03 13:36:06,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 13:36:06,860 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.333333333333333) internal successors, (65), 15 states have internal predecessors, (65), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 43 [2025-03-03 13:36:06,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:36:06,861 INFO L225 Difference]: With dead ends: 143 [2025-03-03 13:36:06,861 INFO L226 Difference]: Without dead ends: 82 [2025-03-03 13:36:06,862 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2025-03-03 13:36:06,863 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 0 mSDsluCounter, 884 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 974 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:36:06,863 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 974 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 13:36:06,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-03-03 13:36:06,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2025-03-03 13:36:06,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 70 states have (on average 1.2857142857142858) internal successors, (90), 70 states have internal predecessors, (90), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-03 13:36:06,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 106 transitions. [2025-03-03 13:36:06,868 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 106 transitions. Word has length 43 [2025-03-03 13:36:06,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:36:06,868 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 106 transitions. [2025-03-03 13:36:06,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.333333333333333) internal successors, (65), 15 states have internal predecessors, (65), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 13:36:06,868 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 106 transitions. [2025-03-03 13:36:06,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-03 13:36:06,869 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:36:06,869 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 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] [2025-03-03 13:36:06,876 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 13:36:07,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-03 13:36:07,072 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:36:07,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:36:07,073 INFO L85 PathProgramCache]: Analyzing trace with hash -806966164, now seen corresponding path program 2 times [2025-03-03 13:36:07,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:36:07,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014250382] [2025-03-03 13:36:07,073 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:36:07,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:36:07,770 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 47 statements into 2 equivalence classes. [2025-03-03 13:36:07,827 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 47 of 47 statements. [2025-03-03 13:36:07,827 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:36:07,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:36:08,084 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 13:36:08,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:36:08,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014250382] [2025-03-03 13:36:08,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014250382] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:36:08,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [707244551] [2025-03-03 13:36:08,085 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:36:08,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:36:08,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:36:08,087 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:36:08,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 13:36:08,863 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 47 statements into 2 equivalence classes. [2025-03-03 13:37:25,784 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 47 of 47 statements. [2025-03-03 13:37:25,785 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:37:25,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:37:25,796 INFO L256 TraceCheckSpWp]: Trace formula consists of 645 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-03 13:37:25,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:37:25,946 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:37:25,946 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:37:26,146 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 13:37:26,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [707244551] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:37:26,147 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:37:26,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 14, 8] total 25 [2025-03-03 13:37:26,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091044934] [2025-03-03 13:37:26,147 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:37:26,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-03 13:37:26,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:37:26,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-03 13:37:26,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=488, Unknown=0, NotChecked=0, Total=600 [2025-03-03 13:37:26,148 INFO L87 Difference]: Start difference. First operand 82 states and 106 transitions. Second operand has 25 states, 25 states have (on average 2.36) internal successors, (59), 25 states have internal predecessors, (59), 2 states have call successors, (3), 2 states have call predecessors, (3), 5 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-03 13:37:26,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:37:26,593 INFO L93 Difference]: Finished difference Result 130 states and 174 transitions. [2025-03-03 13:37:26,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-03 13:37:26,594 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.36) internal successors, (59), 25 states have internal predecessors, (59), 2 states have call successors, (3), 2 states have call predecessors, (3), 5 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 47 [2025-03-03 13:37:26,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:37:26,594 INFO L225 Difference]: With dead ends: 130 [2025-03-03 13:37:26,595 INFO L226 Difference]: Without dead ends: 88 [2025-03-03 13:37:26,596 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=277, Invalid=1205, Unknown=0, NotChecked=0, Total=1482 [2025-03-03 13:37:26,596 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 6 mSDsluCounter, 1226 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 1315 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:37:26,598 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 1315 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 13:37:26,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-03-03 13:37:26,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2025-03-03 13:37:26,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 76 states have (on average 1.263157894736842) internal successors, (96), 76 states have internal predecessors, (96), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-03 13:37:26,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 112 transitions. [2025-03-03 13:37:26,604 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 112 transitions. Word has length 47 [2025-03-03 13:37:26,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:37:26,604 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 112 transitions. [2025-03-03 13:37:26,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.36) internal successors, (59), 25 states have internal predecessors, (59), 2 states have call successors, (3), 2 states have call predecessors, (3), 5 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-03 13:37:26,605 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 112 transitions. [2025-03-03 13:37:26,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-03 13:37:26,605 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:37:26,605 INFO L218 NwaCegarLoop]: trace histogram [10, 5, 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] [2025-03-03 13:37:26,635 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 13:37:26,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:37:26,806 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:37:26,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:37:26,806 INFO L85 PathProgramCache]: Analyzing trace with hash -501046804, now seen corresponding path program 3 times [2025-03-03 13:37:26,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:37:26,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647603845] [2025-03-03 13:37:26,806 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 13:37:26,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:37:27,486 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 53 statements into 6 equivalence classes. [2025-03-03 13:37:27,648 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 49 of 53 statements. [2025-03-03 13:37:27,649 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-03 13:37:27,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:37:27,856 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-03 13:37:27,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:37:27,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647603845] [2025-03-03 13:37:27,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647603845] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:37:27,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1746857711] [2025-03-03 13:37:27,857 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 13:37:27,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:37:27,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:37:27,859 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:37:27,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 13:37:28,659 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 53 statements into 6 equivalence classes.