./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/heap-data/packet_filter.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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/heap-data/packet_filter.i -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 d604fdd8f7c4d34db0106d8a0ff422218ae80e9ee6eb03f691b84d2fcc8ad49f --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 17:35:12,831 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 17:35:12,881 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 17:35:12,885 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 17:35:12,885 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 17:35:12,899 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 17:35:12,900 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 17:35:12,900 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 17:35:12,900 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 17:35:12,900 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 17:35:12,900 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 17:35:12,901 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 17:35:12,901 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 17:35:12,901 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 17:35:12,902 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 17:35:12,902 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 17:35:12,902 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 17:35:12,902 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 17:35:12,902 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 17:35:12,902 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 17:35:12,902 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 17:35:12,902 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 17:35:12,902 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 17:35:12,902 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 17:35:12,903 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 17:35:12,903 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 17:35:12,903 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 17:35:12,903 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 17:35:12,903 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 17:35:12,903 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 17:35:12,903 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 17:35:12,903 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 17:35:12,903 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 17:35:12,904 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 17:35:12,904 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 17:35:12,904 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 17:35:12,904 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 17:35:12,904 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 17:35:12,904 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 17:35:12,904 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 17:35:12,904 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 17:35:12,904 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 17:35:12,904 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 17:35:12,904 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 -> d604fdd8f7c4d34db0106d8a0ff422218ae80e9ee6eb03f691b84d2fcc8ad49f [2025-03-16 17:35:13,183 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 17:35:13,190 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 17:35:13,193 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 17:35:13,195 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 17:35:13,195 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 17:35:13,197 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-data/packet_filter.i [2025-03-16 17:35:14,402 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83da6369a/849d6d970e7d4d4595ff3fe447c0a86c/FLAG1e237f2ed [2025-03-16 17:35:14,683 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 17:35:14,683 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-data/packet_filter.i [2025-03-16 17:35:14,693 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83da6369a/849d6d970e7d4d4595ff3fe447c0a86c/FLAG1e237f2ed [2025-03-16 17:35:14,704 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83da6369a/849d6d970e7d4d4595ff3fe447c0a86c [2025-03-16 17:35:14,706 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 17:35:14,707 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 17:35:14,708 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 17:35:14,708 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 17:35:14,711 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 17:35:14,712 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 05:35:14" (1/1) ... [2025-03-16 17:35:14,713 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@752de4f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:35:14, skipping insertion in model container [2025-03-16 17:35:14,713 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 05:35:14" (1/1) ... [2025-03-16 17:35:14,742 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 17:35:14,950 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/heap-data/packet_filter.i[23925,23938] [2025-03-16 17:35:14,958 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/heap-data/packet_filter.i[24159,24172] [2025-03-16 17:35:14,968 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 17:35:14,978 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 17:35:15,017 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/heap-data/packet_filter.i[23925,23938] [2025-03-16 17:35:15,019 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/heap-data/packet_filter.i[24159,24172] [2025-03-16 17:35:15,028 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 17:35:15,054 INFO L204 MainTranslator]: Completed translation [2025-03-16 17:35:15,055 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:35:15 WrapperNode [2025-03-16 17:35:15,055 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 17:35:15,056 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 17:35:15,056 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 17:35:15,056 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 17:35:15,060 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:35:15" (1/1) ... [2025-03-16 17:35:15,070 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:35:15" (1/1) ... [2025-03-16 17:35:15,086 INFO L138 Inliner]: procedures = 130, calls = 85, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 157 [2025-03-16 17:35:15,087 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 17:35:15,087 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 17:35:15,087 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 17:35:15,087 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 17:35:15,093 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:35:15" (1/1) ... [2025-03-16 17:35:15,095 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:35:15" (1/1) ... [2025-03-16 17:35:15,098 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:35:15" (1/1) ... [2025-03-16 17:35:15,110 INFO L175 MemorySlicer]: Split 57 memory accesses to 7 slices as follows [2, 6, 6, 6, 16, 15, 6]. 28 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 2, 0, 0, 0, 3, 0]. The 14 writes are split as follows [0, 1, 3, 3, 4, 0, 3]. [2025-03-16 17:35:15,110 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:35:15" (1/1) ... [2025-03-16 17:35:15,111 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:35:15" (1/1) ... [2025-03-16 17:35:15,119 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:35:15" (1/1) ... [2025-03-16 17:35:15,120 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:35:15" (1/1) ... [2025-03-16 17:35:15,121 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:35:15" (1/1) ... [2025-03-16 17:35:15,122 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:35:15" (1/1) ... [2025-03-16 17:35:15,128 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 17:35:15,129 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 17:35:15,129 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 17:35:15,129 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 17:35:15,129 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:35:15" (1/1) ... [2025-03-16 17:35:15,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 17:35:15,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:35:15,154 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-16 17:35:15,156 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-16 17:35:15,173 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-16 17:35:15,173 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-16 17:35:15,173 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-16 17:35:15,173 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-16 17:35:15,173 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-16 17:35:15,174 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-16 17:35:15,174 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-16 17:35:15,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-16 17:35:15,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-16 17:35:15,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-16 17:35:15,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-16 17:35:15,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-16 17:35:15,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-16 17:35:15,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-16 17:35:15,175 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-16 17:35:15,175 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 17:35:15,175 INFO L130 BoogieDeclarations]: Found specification of procedure append_to_queue [2025-03-16 17:35:15,175 INFO L138 BoogieDeclarations]: Found implementation of procedure append_to_queue [2025-03-16 17:35:15,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-16 17:35:15,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-16 17:35:15,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-16 17:35:15,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-16 17:35:15,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-16 17:35:15,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-16 17:35:15,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-16 17:35:15,176 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-16 17:35:15,176 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-16 17:35:15,177 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-16 17:35:15,177 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-16 17:35:15,177 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-16 17:35:15,177 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-16 17:35:15,177 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-16 17:35:15,177 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-16 17:35:15,177 INFO L130 BoogieDeclarations]: Found specification of procedure send [2025-03-16 17:35:15,177 INFO L138 BoogieDeclarations]: Found implementation of procedure send [2025-03-16 17:35:15,177 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-16 17:35:15,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-16 17:35:15,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-16 17:35:15,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-16 17:35:15,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-16 17:35:15,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-03-16 17:35:15,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-03-16 17:35:15,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-03-16 17:35:15,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 17:35:15,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-16 17:35:15,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-16 17:35:15,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-16 17:35:15,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-16 17:35:15,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-16 17:35:15,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-16 17:35:15,179 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 17:35:15,179 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 17:35:15,321 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 17:35:15,323 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 17:35:15,585 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L587: havoc receive_#t~mem6#1;havoc receive_#t~mem7#1;havoc receive_#t~mem8#1.base, receive_#t~mem8#1.offset;call ULTIMATE.dealloc(receive_~#packet~0#1.base, receive_~#packet~0#1.offset);havoc receive_~#packet~0#1.base, receive_~#packet~0#1.offset; [2025-03-16 17:35:15,585 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L611: call ULTIMATE.dealloc(main_~#prio_queue~0#1.base, main_~#prio_queue~0#1.offset);havoc main_~#prio_queue~0#1.base, main_~#prio_queue~0#1.offset;call ULTIMATE.dealloc(main_~#normal_queue~0#1.base, main_~#normal_queue~0#1.offset);havoc main_~#normal_queue~0#1.base, main_~#normal_queue~0#1.offset; [2025-03-16 17:35:15,607 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2025-03-16 17:35:15,607 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 17:35:15,614 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 17:35:15,614 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 17:35:15,614 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 05:35:15 BoogieIcfgContainer [2025-03-16 17:35:15,614 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 17:35:15,616 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 17:35:15,616 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 17:35:15,619 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 17:35:15,619 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 05:35:14" (1/3) ... [2025-03-16 17:35:15,619 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b10d9cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 05:35:15, skipping insertion in model container [2025-03-16 17:35:15,620 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:35:15" (2/3) ... [2025-03-16 17:35:15,620 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b10d9cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 05:35:15, skipping insertion in model container [2025-03-16 17:35:15,620 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 05:35:15" (3/3) ... [2025-03-16 17:35:15,621 INFO L128 eAbstractionObserver]: Analyzing ICFG packet_filter.i [2025-03-16 17:35:15,630 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 17:35:15,631 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG packet_filter.i that has 3 procedures, 40 locations, 1 initial locations, 3 loop locations, and 2 error locations. [2025-03-16 17:35:15,663 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 17:35:15,670 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;@dd85091, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 17:35:15,670 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-16 17:35:15,673 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 30 states have (on average 1.4333333333333333) internal successors, (43), 32 states have internal predecessors, (43), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-16 17:35:15,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-16 17:35:15,678 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:35:15,678 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:35:15,679 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:35:15,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:35:15,684 INFO L85 PathProgramCache]: Analyzing trace with hash 2136090202, now seen corresponding path program 1 times [2025-03-16 17:35:15,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:35:15,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382631946] [2025-03-16 17:35:15,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:35:15,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:35:15,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-16 17:35:15,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-16 17:35:15,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:35:15,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:35:15,818 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-16 17:35:15,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:35:15,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382631946] [2025-03-16 17:35:15,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382631946] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:35:15,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:35:15,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 17:35:15,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342289724] [2025-03-16 17:35:15,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:35:15,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 17:35:15,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:35:15,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 17:35:15,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 17:35:15,841 INFO L87 Difference]: Start difference. First operand has 40 states, 30 states have (on average 1.4333333333333333) internal successors, (43), 32 states have internal predecessors, (43), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:35:15,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:35:15,855 INFO L93 Difference]: Finished difference Result 63 states and 82 transitions. [2025-03-16 17:35:15,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 17:35:15,856 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-16 17:35:15,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:35:15,860 INFO L225 Difference]: With dead ends: 63 [2025-03-16 17:35:15,860 INFO L226 Difference]: Without dead ends: 37 [2025-03-16 17:35:15,863 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 17:35:15,866 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:35:15,867 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:35:15,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-03-16 17:35:15,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2025-03-16 17:35:15,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 29 states have internal predecessors, (37), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-16 17:35:15,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 47 transitions. [2025-03-16 17:35:15,891 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 47 transitions. Word has length 7 [2025-03-16 17:35:15,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:35:15,891 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 47 transitions. [2025-03-16 17:35:15,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:35:15,892 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions. [2025-03-16 17:35:15,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-16 17:35:15,892 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:35:15,892 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:35:15,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 17:35:15,893 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:35:15,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:35:15,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1451722089, now seen corresponding path program 1 times [2025-03-16 17:35:15,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:35:15,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672118904] [2025-03-16 17:35:15,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:35:15,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:35:15,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-16 17:35:15,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-16 17:35:15,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:35:15,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:35:16,072 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-16 17:35:16,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:35:16,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672118904] [2025-03-16 17:35:16,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672118904] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:35:16,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:35:16,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 17:35:16,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079748794] [2025-03-16 17:35:16,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:35:16,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 17:35:16,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:35:16,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 17:35:16,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 17:35:16,074 INFO L87 Difference]: Start difference. First operand 37 states and 47 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:35:16,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:35:16,136 INFO L93 Difference]: Finished difference Result 68 states and 90 transitions. [2025-03-16 17:35:16,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 17:35:16,137 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-16 17:35:16,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:35:16,140 INFO L225 Difference]: With dead ends: 68 [2025-03-16 17:35:16,140 INFO L226 Difference]: Without dead ends: 49 [2025-03-16 17:35:16,141 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-16 17:35:16,142 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 9 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 17:35:16,142 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 126 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 17:35:16,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-03-16 17:35:16,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 44. [2025-03-16 17:35:16,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 36 states have internal predecessors, (46), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-16 17:35:16,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 56 transitions. [2025-03-16 17:35:16,151 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 56 transitions. Word has length 8 [2025-03-16 17:35:16,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:35:16,151 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 56 transitions. [2025-03-16 17:35:16,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:35:16,152 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 56 transitions. [2025-03-16 17:35:16,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-16 17:35:16,152 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:35:16,152 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:35:16,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 17:35:16,152 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:35:16,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:35:16,153 INFO L85 PathProgramCache]: Analyzing trace with hash 2044200484, now seen corresponding path program 1 times [2025-03-16 17:35:16,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:35:16,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857702560] [2025-03-16 17:35:16,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:35:16,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:35:16,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-16 17:35:16,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-16 17:35:16,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:35:16,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:35:16,284 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-16 17:35:16,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:35:16,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857702560] [2025-03-16 17:35:16,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857702560] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:35:16,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:35:16,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 17:35:16,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593140084] [2025-03-16 17:35:16,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:35:16,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 17:35:16,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:35:16,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 17:35:16,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 17:35:16,288 INFO L87 Difference]: Start difference. First operand 44 states and 56 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:35:16,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:35:16,349 INFO L93 Difference]: Finished difference Result 61 states and 79 transitions. [2025-03-16 17:35:16,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 17:35:16,350 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-16 17:35:16,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:35:16,351 INFO L225 Difference]: With dead ends: 61 [2025-03-16 17:35:16,351 INFO L226 Difference]: Without dead ends: 47 [2025-03-16 17:35:16,351 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-16 17:35:16,351 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 9 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 17:35:16,351 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 129 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 17:35:16,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-03-16 17:35:16,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 42. [2025-03-16 17:35:16,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 33 states have (on average 1.303030303030303) internal successors, (43), 34 states have internal predecessors, (43), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-16 17:35:16,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 53 transitions. [2025-03-16 17:35:16,358 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 53 transitions. Word has length 9 [2025-03-16 17:35:16,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:35:16,359 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 53 transitions. [2025-03-16 17:35:16,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:35:16,359 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 53 transitions. [2025-03-16 17:35:16,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-16 17:35:16,359 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:35:16,359 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:35:16,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 17:35:16,360 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:35:16,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:35:16,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1657894228, now seen corresponding path program 1 times [2025-03-16 17:35:16,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:35:16,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476979211] [2025-03-16 17:35:16,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:35:16,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:35:16,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-16 17:35:16,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-16 17:35:16,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:35:16,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:35:17,666 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:35:17,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:35:17,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476979211] [2025-03-16 17:35:17,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476979211] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:35:17,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:35:17,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-16 17:35:17,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311848013] [2025-03-16 17:35:17,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:35:17,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 17:35:17,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:35:17,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 17:35:17,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-16 17:35:17,669 INFO L87 Difference]: Start difference. First operand 42 states and 53 transitions. Second operand has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 10 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-16 17:35:18,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:35:18,196 INFO L93 Difference]: Finished difference Result 81 states and 107 transitions. [2025-03-16 17:35:18,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-16 17:35:18,197 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 10 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2025-03-16 17:35:18,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:35:18,197 INFO L225 Difference]: With dead ends: 81 [2025-03-16 17:35:18,198 INFO L226 Difference]: Without dead ends: 62 [2025-03-16 17:35:18,198 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2025-03-16 17:35:18,198 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 15 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 17:35:18,199 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 247 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 17:35:18,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-03-16 17:35:18,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 51. [2025-03-16 17:35:18,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 43 states have internal predecessors, (55), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-16 17:35:18,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 65 transitions. [2025-03-16 17:35:18,206 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 65 transitions. Word has length 19 [2025-03-16 17:35:18,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:35:18,207 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 65 transitions. [2025-03-16 17:35:18,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 10 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-16 17:35:18,207 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 65 transitions. [2025-03-16 17:35:18,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-16 17:35:18,207 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:35:18,207 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:35:18,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 17:35:18,207 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:35:18,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:35:18,208 INFO L85 PathProgramCache]: Analyzing trace with hash 135375169, now seen corresponding path program 1 times [2025-03-16 17:35:18,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:35:18,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286682234] [2025-03-16 17:35:18,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:35:18,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:35:18,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-16 17:35:18,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-16 17:35:18,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:35:18,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:35:18,418 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:35:18,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:35:18,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286682234] [2025-03-16 17:35:18,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286682234] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:35:18,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:35:18,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 17:35:18,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937060401] [2025-03-16 17:35:18,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:35:18,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 17:35:18,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:35:18,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 17:35:18,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 17:35:18,422 INFO L87 Difference]: Start difference. First operand 51 states and 65 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-16 17:35:18,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:35:18,544 INFO L93 Difference]: Finished difference Result 82 states and 107 transitions. [2025-03-16 17:35:18,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 17:35:18,544 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2025-03-16 17:35:18,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:35:18,545 INFO L225 Difference]: With dead ends: 82 [2025-03-16 17:35:18,545 INFO L226 Difference]: Without dead ends: 71 [2025-03-16 17:35:18,545 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 17:35:18,545 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 16 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 17:35:18,546 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 188 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 17:35:18,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-03-16 17:35:18,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 58. [2025-03-16 17:35:18,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 49 states have (on average 1.2857142857142858) internal successors, (63), 50 states have internal predecessors, (63), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-16 17:35:18,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 73 transitions. [2025-03-16 17:35:18,554 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 73 transitions. Word has length 20 [2025-03-16 17:35:18,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:35:18,555 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 73 transitions. [2025-03-16 17:35:18,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-16 17:35:18,555 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 73 transitions. [2025-03-16 17:35:18,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-16 17:35:18,556 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:35:18,556 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:35:18,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 17:35:18,557 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:35:18,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:35:18,557 INFO L85 PathProgramCache]: Analyzing trace with hash -1776038252, now seen corresponding path program 1 times [2025-03-16 17:35:18,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:35:18,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035966061] [2025-03-16 17:35:18,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:35:18,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:35:18,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-16 17:35:18,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-16 17:35:18,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:35:18,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:35:19,038 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:35:19,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:35:19,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035966061] [2025-03-16 17:35:19,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035966061] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:35:19,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:35:19,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-16 17:35:19,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111597643] [2025-03-16 17:35:19,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:35:19,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 17:35:19,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:35:19,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 17:35:19,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-16 17:35:19,040 INFO L87 Difference]: Start difference. First operand 58 states and 73 transitions. Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 10 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-16 17:35:19,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:35:19,337 INFO L93 Difference]: Finished difference Result 71 states and 94 transitions. [2025-03-16 17:35:19,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-16 17:35:19,337 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 10 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2025-03-16 17:35:19,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:35:19,338 INFO L225 Difference]: With dead ends: 71 [2025-03-16 17:35:19,339 INFO L226 Difference]: Without dead ends: 69 [2025-03-16 17:35:19,339 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2025-03-16 17:35:19,340 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 12 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 17:35:19,340 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 305 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 17:35:19,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-03-16 17:35:19,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 59. [2025-03-16 17:35:19,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 50 states have (on average 1.3) internal successors, (65), 51 states have internal predecessors, (65), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-16 17:35:19,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 75 transitions. [2025-03-16 17:35:19,350 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 75 transitions. Word has length 20 [2025-03-16 17:35:19,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:35:19,350 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 75 transitions. [2025-03-16 17:35:19,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 10 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-16 17:35:19,351 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 75 transitions. [2025-03-16 17:35:19,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-16 17:35:19,352 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:35:19,352 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:35:19,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 17:35:19,353 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:35:19,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:35:19,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1104975948, now seen corresponding path program 1 times [2025-03-16 17:35:19,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:35:19,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022903713] [2025-03-16 17:35:19,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:35:19,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:35:19,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-16 17:35:19,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-16 17:35:19,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:35:19,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:35:19,630 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:35:19,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:35:19,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022903713] [2025-03-16 17:35:19,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022903713] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:35:19,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [350590219] [2025-03-16 17:35:19,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:35:19,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:35:19,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:35:19,633 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-16 17:35:19,635 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-16 17:35:19,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-16 17:35:19,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-16 17:35:19,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:35:19,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:35:19,787 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-16 17:35:19,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:35:19,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2025-03-16 17:35:19,987 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:35:19,988 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:35:20,059 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_381 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#normal_queue~0#1.base| v_ArrVal_381) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0)) (forall ((v_ArrVal_380 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#normal_queue~0#1.base| v_ArrVal_380) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0))) is different from false [2025-03-16 17:35:20,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [350590219] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:35:20,064 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 17:35:20,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2025-03-16 17:35:20,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836750232] [2025-03-16 17:35:20,064 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 17:35:20,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 17:35:20,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:35:20,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 17:35:20,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=30, Unknown=1, NotChecked=10, Total=56 [2025-03-16 17:35:20,067 INFO L87 Difference]: Start difference. First operand 59 states and 75 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-16 17:35:20,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:35:20,179 INFO L93 Difference]: Finished difference Result 92 states and 120 transitions. [2025-03-16 17:35:20,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 17:35:20,180 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2025-03-16 17:35:20,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:35:20,181 INFO L225 Difference]: With dead ends: 92 [2025-03-16 17:35:20,181 INFO L226 Difference]: Without dead ends: 72 [2025-03-16 17:35:20,181 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=30, Unknown=1, NotChecked=10, Total=56 [2025-03-16 17:35:20,182 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 11 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 17:35:20,182 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 172 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 17:35:20,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-03-16 17:35:20,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2025-03-16 17:35:20,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 60 states have (on average 1.3166666666666667) internal successors, (79), 61 states have internal predecessors, (79), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-16 17:35:20,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 91 transitions. [2025-03-16 17:35:20,187 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 91 transitions. Word has length 20 [2025-03-16 17:35:20,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:35:20,188 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 91 transitions. [2025-03-16 17:35:20,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-16 17:35:20,188 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 91 transitions. [2025-03-16 17:35:20,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-16 17:35:20,188 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:35:20,188 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:35:20,195 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-16 17:35:20,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:35:20,389 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:35:20,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:35:20,389 INFO L85 PathProgramCache]: Analyzing trace with hash 95972665, now seen corresponding path program 1 times [2025-03-16 17:35:20,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:35:20,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095859709] [2025-03-16 17:35:20,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:35:20,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:35:20,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-16 17:35:20,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-16 17:35:20,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:35:20,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:35:21,076 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:35:21,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:35:21,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095859709] [2025-03-16 17:35:21,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095859709] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:35:21,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:35:21,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-16 17:35:21,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640471854] [2025-03-16 17:35:21,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:35:21,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-16 17:35:21,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:35:21,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-16 17:35:21,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-03-16 17:35:21,077 INFO L87 Difference]: Start difference. First operand 70 states and 91 transitions. Second operand has 11 states, 10 states have (on average 1.9) internal successors, (19), 11 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-16 17:35:21,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:35:21,710 INFO L93 Difference]: Finished difference Result 111 states and 146 transitions. [2025-03-16 17:35:21,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-16 17:35:21,710 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.9) internal successors, (19), 11 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2025-03-16 17:35:21,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:35:21,711 INFO L225 Difference]: With dead ends: 111 [2025-03-16 17:35:21,711 INFO L226 Difference]: Without dead ends: 100 [2025-03-16 17:35:21,712 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2025-03-16 17:35:21,712 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 24 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 17:35:21,712 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 425 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 17:35:21,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-03-16 17:35:21,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 79. [2025-03-16 17:35:21,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 68 states have (on average 1.3235294117647058) internal successors, (90), 69 states have internal predecessors, (90), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-16 17:35:21,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 104 transitions. [2025-03-16 17:35:21,718 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 104 transitions. Word has length 21 [2025-03-16 17:35:21,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:35:21,719 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 104 transitions. [2025-03-16 17:35:21,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.9) internal successors, (19), 11 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-16 17:35:21,719 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 104 transitions. [2025-03-16 17:35:21,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-16 17:35:21,719 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:35:21,719 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:35:21,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 17:35:21,720 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:35:21,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:35:21,720 INFO L85 PathProgramCache]: Analyzing trace with hash 95971704, now seen corresponding path program 1 times [2025-03-16 17:35:21,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:35:21,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911546129] [2025-03-16 17:35:21,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:35:21,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:35:21,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-16 17:35:21,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-16 17:35:21,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:35:21,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:35:22,104 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:35:22,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:35:22,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911546129] [2025-03-16 17:35:22,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911546129] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:35:22,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:35:22,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 17:35:22,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495027115] [2025-03-16 17:35:22,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:35:22,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 17:35:22,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:35:22,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 17:35:22,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-16 17:35:22,107 INFO L87 Difference]: Start difference. First operand 79 states and 104 transitions. Second operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-16 17:35:22,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:35:22,354 INFO L93 Difference]: Finished difference Result 95 states and 128 transitions. [2025-03-16 17:35:22,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 17:35:22,354 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2025-03-16 17:35:22,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:35:22,355 INFO L225 Difference]: With dead ends: 95 [2025-03-16 17:35:22,355 INFO L226 Difference]: Without dead ends: 93 [2025-03-16 17:35:22,356 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-03-16 17:35:22,356 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 19 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 17:35:22,357 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 375 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 17:35:22,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-03-16 17:35:22,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 80. [2025-03-16 17:35:22,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 69 states have (on average 1.318840579710145) internal successors, (91), 70 states have internal predecessors, (91), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-16 17:35:22,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 105 transitions. [2025-03-16 17:35:22,365 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 105 transitions. Word has length 21 [2025-03-16 17:35:22,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:35:22,365 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 105 transitions. [2025-03-16 17:35:22,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-16 17:35:22,365 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 105 transitions. [2025-03-16 17:35:22,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-16 17:35:22,366 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:35:22,366 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:35:22,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 17:35:22,366 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:35:22,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:35:22,366 INFO L85 PathProgramCache]: Analyzing trace with hash 45259110, now seen corresponding path program 1 times [2025-03-16 17:35:22,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:35:22,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330876538] [2025-03-16 17:35:22,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:35:22,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:35:22,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-16 17:35:22,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-16 17:35:22,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:35:22,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:35:22,801 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:35:22,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:35:22,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330876538] [2025-03-16 17:35:22,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330876538] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:35:22,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [529088884] [2025-03-16 17:35:22,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:35:22,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:35:22,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:35:22,804 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-16 17:35:22,806 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-16 17:35:22,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-16 17:35:22,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-16 17:35:22,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:35:22,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:35:22,959 INFO L256 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-03-16 17:35:22,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:35:23,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2025-03-16 17:35:23,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-03-16 17:35:23,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 15 [2025-03-16 17:35:23,029 WARN L873 $PredicateComparison]: unable to prove that (exists ((v_append_to_queue_~q.offset_12 Int)) (let ((.cse1 (select |c_old(#memory_$Pointer$#1.offset)| |c_append_to_queue_#in~q.base|)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_append_to_queue_#in~q.base|) v_append_to_queue_~q.offset_12)) (.cse2 (select |c_old(#memory_$Pointer$#1.base)| |c_append_to_queue_#in~q.base|))) (and (= (select (select |c_#memory_$Pointer$#4.offset| .cse0) 12) (select .cse1 v_append_to_queue_~q.offset_12)) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |c_append_to_queue_#in~q.base| (store .cse1 v_append_to_queue_~q.offset_12 0))) (= (store |c_old(#memory_$Pointer$#1.base)| |c_append_to_queue_#in~q.base| (store .cse2 v_append_to_queue_~q.offset_12 .cse0)) |c_#memory_$Pointer$#1.base|) (= (select (select |c_#memory_$Pointer$#4.base| .cse0) 12) (select .cse2 v_append_to_queue_~q.offset_12))))) is different from true [2025-03-16 17:35:23,075 INFO L349 Elim1Store]: treesize reduction 16, result has 55.6 percent of original size [2025-03-16 17:35:23,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 34 [2025-03-16 17:35:23,093 INFO L349 Elim1Store]: treesize reduction 16, result has 50.0 percent of original size [2025-03-16 17:35:23,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 37 [2025-03-16 17:35:23,441 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:35:23,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 106 treesize of output 102 [2025-03-16 17:35:23,465 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:35:23,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 82 treesize of output 114 [2025-03-16 17:35:23,831 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:35:23,832 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:35:24,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 465 treesize of output 425 [2025-03-16 17:35:24,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 176 treesize of output 172 [2025-03-16 17:35:24,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 316 treesize of output 296 [2025-03-16 17:35:24,270 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:35:24,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 56 [2025-03-16 17:35:24,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 182 treesize of output 162 [2025-03-16 17:35:24,351 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:35:24,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 60 [2025-03-16 17:35:24,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2025-03-16 17:35:24,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 186 treesize of output 166 [2025-03-16 17:35:24,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2025-03-16 17:35:24,539 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:35:24,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [529088884] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 17:35:24,539 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 17:35:24,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 18 [2025-03-16 17:35:24,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789398098] [2025-03-16 17:35:24,540 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 17:35:24,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-16 17:35:24,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:35:24,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-16 17:35:24,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=223, Unknown=1, NotChecked=30, Total=306 [2025-03-16 17:35:24,541 INFO L87 Difference]: Start difference. First operand 80 states and 105 transitions. Second operand has 18 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 16 states have internal predecessors, (50), 4 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-16 17:35:25,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:35:25,078 INFO L93 Difference]: Finished difference Result 157 states and 211 transitions. [2025-03-16 17:35:25,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 17:35:25,079 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 16 states have internal predecessors, (50), 4 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 28 [2025-03-16 17:35:25,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:35:25,080 INFO L225 Difference]: With dead ends: 157 [2025-03-16 17:35:25,080 INFO L226 Difference]: Without dead ends: 137 [2025-03-16 17:35:25,080 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=68, Invalid=315, Unknown=1, NotChecked=36, Total=420 [2025-03-16 17:35:25,081 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 61 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 122 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 17:35:25,081 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 375 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 209 Invalid, 0 Unknown, 122 Unchecked, 0.4s Time] [2025-03-16 17:35:25,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-03-16 17:35:25,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 116. [2025-03-16 17:35:25,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 100 states have (on average 1.31) internal successors, (131), 101 states have internal predecessors, (131), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-16 17:35:25,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 153 transitions. [2025-03-16 17:35:25,095 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 153 transitions. Word has length 28 [2025-03-16 17:35:25,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:35:25,095 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 153 transitions. [2025-03-16 17:35:25,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 16 states have internal predecessors, (50), 4 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-16 17:35:25,098 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 153 transitions. [2025-03-16 17:35:25,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-16 17:35:25,099 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:35:25,099 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:35:25,105 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-16 17:35:25,301 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,SelfDestructingSolverStorable9 [2025-03-16 17:35:25,301 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:35:25,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:35:25,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1393521095, now seen corresponding path program 1 times [2025-03-16 17:35:25,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:35:25,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082127314] [2025-03-16 17:35:25,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:35:25,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:35:25,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-16 17:35:25,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-16 17:35:25,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:35:25,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:35:25,535 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-16 17:35:25,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:35:25,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082127314] [2025-03-16 17:35:25,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082127314] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:35:25,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [672750734] [2025-03-16 17:35:25,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:35:25,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:35:25,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:35:25,537 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-16 17:35:25,540 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-16 17:35:25,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-16 17:35:25,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-16 17:35:25,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:35:25,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:35:25,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-16 17:35:25,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:35:25,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2025-03-16 17:35:25,791 WARN L851 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0) (or (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0) (exists ((|v_#memory_$Pointer$#1.offset_BEFORE_CALL_7| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_$Pointer$#1.offset_BEFORE_CALL_7| |c_#memory_$Pointer$#1.offset|))) (and (= (select (select |v_#memory_$Pointer$#1.offset_BEFORE_CALL_7| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~#normal_queue~0#1.base| .cse0)) (= (store |v_#memory_$Pointer$#1.offset_BEFORE_CALL_7| .cse0 (select |c_#memory_$Pointer$#1.offset| .cse0)) |c_#memory_$Pointer$#1.offset|)))))) is different from false [2025-03-16 17:35:25,793 WARN L873 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0) (or (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0) (exists ((|v_#memory_$Pointer$#1.offset_BEFORE_CALL_7| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_$Pointer$#1.offset_BEFORE_CALL_7| |c_#memory_$Pointer$#1.offset|))) (and (= (select (select |v_#memory_$Pointer$#1.offset_BEFORE_CALL_7| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~#normal_queue~0#1.base| .cse0)) (= (store |v_#memory_$Pointer$#1.offset_BEFORE_CALL_7| .cse0 (select |c_#memory_$Pointer$#1.offset| .cse0)) |c_#memory_$Pointer$#1.offset|)))))) is different from true [2025-03-16 17:35:25,862 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-16 17:35:25,862 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:35:25,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [672750734] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:35:25,938 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 17:35:25,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 9 [2025-03-16 17:35:25,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227687986] [2025-03-16 17:35:25,938 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 17:35:25,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 17:35:25,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:35:25,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 17:35:25,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=47, Unknown=7, NotChecked=14, Total=90 [2025-03-16 17:35:25,939 INFO L87 Difference]: Start difference. First operand 116 states and 153 transitions. Second operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 7 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-16 17:35:26,065 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0))) (and (not (= |c_ULTIMATE.start_main_~#normal_queue~0#1.base| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|)) (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0) .cse0 (or .cse0 (exists ((|v_#memory_$Pointer$#1.offset_BEFORE_CALL_7| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_$Pointer$#1.offset_BEFORE_CALL_7| |c_#memory_$Pointer$#1.offset|))) (and (= (select (select |v_#memory_$Pointer$#1.offset_BEFORE_CALL_7| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~#normal_queue~0#1.base| .cse1)) (= (store |v_#memory_$Pointer$#1.offset_BEFORE_CALL_7| .cse1 (select |c_#memory_$Pointer$#1.offset| .cse1)) |c_#memory_$Pointer$#1.offset|))))))) is different from false [2025-03-16 17:35:26,067 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0))) (and (not (= |c_ULTIMATE.start_main_~#normal_queue~0#1.base| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|)) (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0) .cse0 (or .cse0 (exists ((|v_#memory_$Pointer$#1.offset_BEFORE_CALL_7| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_$Pointer$#1.offset_BEFORE_CALL_7| |c_#memory_$Pointer$#1.offset|))) (and (= (select (select |v_#memory_$Pointer$#1.offset_BEFORE_CALL_7| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~#normal_queue~0#1.base| .cse1)) (= (store |v_#memory_$Pointer$#1.offset_BEFORE_CALL_7| .cse1 (select |c_#memory_$Pointer$#1.offset| .cse1)) |c_#memory_$Pointer$#1.offset|))))))) is different from true [2025-03-16 17:35:26,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:35:26,195 INFO L93 Difference]: Finished difference Result 188 states and 247 transitions. [2025-03-16 17:35:26,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 17:35:26,197 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 7 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2025-03-16 17:35:26,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:35:26,197 INFO L225 Difference]: With dead ends: 188 [2025-03-16 17:35:26,197 INFO L226 Difference]: Without dead ends: 147 [2025-03-16 17:35:26,198 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=76, Unknown=9, NotChecked=38, Total=156 [2025-03-16 17:35:26,198 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 47 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 115 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 17:35:26,198 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 199 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 75 Invalid, 0 Unknown, 115 Unchecked, 0.2s Time] [2025-03-16 17:35:26,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2025-03-16 17:35:26,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 128. [2025-03-16 17:35:26,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 111 states have (on average 1.3153153153153154) internal successors, (146), 112 states have internal predecessors, (146), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-16 17:35:26,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 170 transitions. [2025-03-16 17:35:26,210 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 170 transitions. Word has length 29 [2025-03-16 17:35:26,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:35:26,210 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 170 transitions. [2025-03-16 17:35:26,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 7 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-16 17:35:26,210 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 170 transitions. [2025-03-16 17:35:26,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-16 17:35:26,211 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:35:26,211 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:35:26,218 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-16 17:35:26,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:35:26,416 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:35:26,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:35:26,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1252278769, now seen corresponding path program 1 times [2025-03-16 17:35:26,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:35:26,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002730364] [2025-03-16 17:35:26,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:35:26,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:35:26,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-16 17:35:26,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-16 17:35:26,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:35:26,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:35:26,855 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:35:26,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:35:26,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002730364] [2025-03-16 17:35:26,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002730364] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:35:26,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1812835839] [2025-03-16 17:35:26,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:35:26,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:35:26,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:35:26,858 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-16 17:35:26,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-16 17:35:26,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-16 17:35:27,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-16 17:35:27,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:35:27,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:35:27,021 INFO L256 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-03-16 17:35:27,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:35:27,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2025-03-16 17:35:27,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-03-16 17:35:27,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 15 [2025-03-16 17:35:27,078 WARN L873 $PredicateComparison]: unable to prove that (exists ((v_append_to_queue_~q.offset_20 Int)) (let ((.cse1 (select |c_old(#memory_$Pointer$#1.offset)| |c_append_to_queue_#in~q.base|)) (.cse2 (select |c_old(#memory_$Pointer$#1.base)| |c_append_to_queue_#in~q.base|)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_append_to_queue_#in~q.base|) v_append_to_queue_~q.offset_20))) (and (= (select (select |c_#memory_$Pointer$#4.offset| .cse0) 12) (select .cse1 v_append_to_queue_~q.offset_20)) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |c_append_to_queue_#in~q.base| (store .cse1 v_append_to_queue_~q.offset_20 0))) (= (select (select |c_#memory_$Pointer$#4.base| .cse0) 12) (select .cse2 v_append_to_queue_~q.offset_20)) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |c_append_to_queue_#in~q.base| (store .cse2 v_append_to_queue_~q.offset_20 .cse0)))))) is different from true [2025-03-16 17:35:27,111 INFO L349 Elim1Store]: treesize reduction 16, result has 50.0 percent of original size [2025-03-16 17:35:27,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 37 [2025-03-16 17:35:27,133 INFO L349 Elim1Store]: treesize reduction 16, result has 55.6 percent of original size [2025-03-16 17:35:27,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 34 [2025-03-16 17:35:27,395 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:35:27,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 106 treesize of output 102 [2025-03-16 17:35:27,422 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:35:27,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 82 treesize of output 114 [2025-03-16 17:35:27,573 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:35:27,574 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:35:27,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 225 treesize of output 205 [2025-03-16 17:35:27,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 148 [2025-03-16 17:35:27,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 292 treesize of output 272 [2025-03-16 17:35:27,943 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:35:27,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 60 [2025-03-16 17:35:27,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2025-03-16 17:35:27,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 186 treesize of output 166 [2025-03-16 17:35:27,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2025-03-16 17:35:28,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 418 treesize of output 378 [2025-03-16 17:35:28,086 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:35:28,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 56 [2025-03-16 17:35:28,193 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:35:28,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1812835839] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 17:35:28,196 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 17:35:28,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 17 [2025-03-16 17:35:28,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925148670] [2025-03-16 17:35:28,197 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 17:35:28,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-16 17:35:28,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:35:28,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-16 17:35:28,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=197, Unknown=1, NotChecked=28, Total=272 [2025-03-16 17:35:28,198 INFO L87 Difference]: Start difference. First operand 128 states and 170 transitions. Second operand has 17 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 15 states have internal predecessors, (50), 3 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-16 17:35:28,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:35:28,872 INFO L93 Difference]: Finished difference Result 172 states and 232 transitions. [2025-03-16 17:35:28,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 17:35:28,875 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 15 states have internal predecessors, (50), 3 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 30 [2025-03-16 17:35:28,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:35:28,876 INFO L225 Difference]: With dead ends: 172 [2025-03-16 17:35:28,876 INFO L226 Difference]: Without dead ends: 149 [2025-03-16 17:35:28,876 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=68, Invalid=315, Unknown=1, NotChecked=36, Total=420 [2025-03-16 17:35:28,877 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 36 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 108 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 17:35:28,877 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 460 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 277 Invalid, 0 Unknown, 108 Unchecked, 0.5s Time] [2025-03-16 17:35:28,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2025-03-16 17:35:28,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 135. [2025-03-16 17:35:28,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 117 states have (on average 1.3076923076923077) internal successors, (153), 118 states have internal predecessors, (153), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-16 17:35:28,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 179 transitions. [2025-03-16 17:35:28,887 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 179 transitions. Word has length 30 [2025-03-16 17:35:28,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:35:28,887 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 179 transitions. [2025-03-16 17:35:28,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 15 states have internal predecessors, (50), 3 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-16 17:35:28,887 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 179 transitions. [2025-03-16 17:35:28,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-16 17:35:28,888 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:35:28,888 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:35:28,896 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-16 17:35:29,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:35:29,089 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:35:29,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:35:29,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1035313271, now seen corresponding path program 1 times [2025-03-16 17:35:29,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:35:29,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293112350] [2025-03-16 17:35:29,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:35:29,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:35:29,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-16 17:35:29,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-16 17:35:29,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:35:29,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:35:30,345 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:35:30,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:35:30,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293112350] [2025-03-16 17:35:30,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293112350] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:35:30,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1188523922] [2025-03-16 17:35:30,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:35:30,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:35:30,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:35:30,348 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 17:35:30,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-16 17:35:30,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-16 17:35:30,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-16 17:35:30,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:35:30,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:35:30,551 INFO L256 TraceCheckSpWp]: Trace formula consists of 555 conjuncts, 98 conjuncts are in the unsatisfiable core [2025-03-16 17:35:30,556 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:35:30,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2025-03-16 17:35:30,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 46 [2025-03-16 17:35:30,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 77 [2025-03-16 17:35:30,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 36 [2025-03-16 17:35:30,601 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:35:30,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 28 [2025-03-16 17:35:30,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 16 [2025-03-16 17:35:30,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-16 17:35:30,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 31 [2025-03-16 17:35:30,686 INFO L349 Elim1Store]: treesize reduction 29, result has 23.7 percent of original size [2025-03-16 17:35:30,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 21 [2025-03-16 17:35:30,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-16 17:35:30,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 17:35:30,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-03-16 17:35:30,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 17:35:30,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-03-16 17:35:30,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 17:35:30,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 17:35:30,794 INFO L349 Elim1Store]: treesize reduction 49, result has 2.0 percent of original size [2025-03-16 17:35:30,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 1 [2025-03-16 17:35:30,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2025-03-16 17:35:30,927 INFO L349 Elim1Store]: treesize reduction 13, result has 60.6 percent of original size [2025-03-16 17:35:30,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 42 [2025-03-16 17:35:30,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-03-16 17:35:30,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-16 17:35:30,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-16 17:35:30,971 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:35:30,971 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:35:31,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1188523922] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:35:31,160 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 17:35:31,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 20 [2025-03-16 17:35:31,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869665509] [2025-03-16 17:35:31,160 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 17:35:31,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-16 17:35:31,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:35:31,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-16 17:35:31,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2025-03-16 17:35:31,161 INFO L87 Difference]: Start difference. First operand 135 states and 179 transitions. Second operand has 20 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 18 states have internal predecessors, (40), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-16 17:35:32,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:35:32,214 INFO L93 Difference]: Finished difference Result 202 states and 267 transitions. [2025-03-16 17:35:32,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-16 17:35:32,215 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 18 states have internal predecessors, (40), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 31 [2025-03-16 17:35:32,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:35:32,216 INFO L225 Difference]: With dead ends: 202 [2025-03-16 17:35:32,216 INFO L226 Difference]: Without dead ends: 179 [2025-03-16 17:35:32,217 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=206, Invalid=1200, Unknown=0, NotChecked=0, Total=1406 [2025-03-16 17:35:32,217 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 62 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 17:35:32,217 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 320 Invalid, 550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 536 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 17:35:32,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2025-03-16 17:35:32,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 147. [2025-03-16 17:35:32,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 128 states have (on average 1.3203125) internal successors, (169), 129 states have internal predecessors, (169), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-16 17:35:32,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 197 transitions. [2025-03-16 17:35:32,230 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 197 transitions. Word has length 31 [2025-03-16 17:35:32,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:35:32,230 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 197 transitions. [2025-03-16 17:35:32,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 18 states have internal predecessors, (40), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-16 17:35:32,230 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 197 transitions. [2025-03-16 17:35:32,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-16 17:35:32,231 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:35:32,231 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:35:32,238 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-16 17:35:32,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-16 17:35:32,431 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:35:32,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:35:32,432 INFO L85 PathProgramCache]: Analyzing trace with hash -526628769, now seen corresponding path program 1 times [2025-03-16 17:35:32,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:35:32,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423208339] [2025-03-16 17:35:32,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:35:32,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:35:32,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-16 17:35:32,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-16 17:35:32,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:35:32,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:35:33,426 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:35:33,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:35:33,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423208339] [2025-03-16 17:35:33,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423208339] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:35:33,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1718077291] [2025-03-16 17:35:33,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:35:33,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:35:33,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:35:33,428 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 17:35:33,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-16 17:35:33,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-16 17:35:33,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-16 17:35:33,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:35:33,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:35:33,634 INFO L256 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 88 conjuncts are in the unsatisfiable core [2025-03-16 17:35:33,646 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:35:33,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2025-03-16 17:35:33,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-16 17:35:33,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 31 [2025-03-16 17:35:33,738 INFO L349 Elim1Store]: treesize reduction 29, result has 23.7 percent of original size [2025-03-16 17:35:33,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 21 [2025-03-16 17:35:33,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-16 17:35:33,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-16 17:35:33,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 17:35:33,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-03-16 17:35:33,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 17:35:33,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 17:35:33,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2025-03-16 17:35:33,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 17:35:33,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-03-16 17:35:34,032 INFO L349 Elim1Store]: treesize reduction 13, result has 60.6 percent of original size [2025-03-16 17:35:34,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 42 [2025-03-16 17:35:34,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 29 [2025-03-16 17:35:34,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2025-03-16 17:35:34,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-16 17:35:34,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2025-03-16 17:35:34,119 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:35:34,119 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:35:34,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1718077291] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:35:34,276 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 17:35:34,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 25 [2025-03-16 17:35:34,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022470969] [2025-03-16 17:35:34,276 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 17:35:34,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-16 17:35:34,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:35:34,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-16 17:35:34,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=655, Unknown=1, NotChecked=0, Total=756 [2025-03-16 17:35:34,278 INFO L87 Difference]: Start difference. First operand 147 states and 197 transitions. Second operand has 25 states, 23 states have (on average 2.217391304347826) internal successors, (51), 23 states have internal predecessors, (51), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-16 17:35:35,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:35:35,384 INFO L93 Difference]: Finished difference Result 181 states and 248 transitions. [2025-03-16 17:35:35,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-16 17:35:35,384 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 2.217391304347826) internal successors, (51), 23 states have internal predecessors, (51), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 32 [2025-03-16 17:35:35,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:35:35,385 INFO L225 Difference]: With dead ends: 181 [2025-03-16 17:35:35,385 INFO L226 Difference]: Without dead ends: 179 [2025-03-16 17:35:35,386 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 468 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=305, Invalid=1764, Unknown=1, NotChecked=0, Total=2070 [2025-03-16 17:35:35,386 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 84 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 790 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 790 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 17:35:35,386 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 440 Invalid, 805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 790 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 17:35:35,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2025-03-16 17:35:35,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 159. [2025-03-16 17:35:35,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 139 states have (on average 1.3381294964028776) internal successors, (186), 140 states have internal predecessors, (186), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-16 17:35:35,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 216 transitions. [2025-03-16 17:35:35,399 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 216 transitions. Word has length 32 [2025-03-16 17:35:35,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:35:35,399 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 216 transitions. [2025-03-16 17:35:35,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 2.217391304347826) internal successors, (51), 23 states have internal predecessors, (51), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-16 17:35:35,399 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 216 transitions. [2025-03-16 17:35:35,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-16 17:35:35,400 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:35:35,400 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:35:35,409 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-16 17:35:35,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:35:35,601 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:35:35,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:35:35,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1196597463, now seen corresponding path program 2 times [2025-03-16 17:35:35,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:35:35,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037597318] [2025-03-16 17:35:35,601 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 17:35:35,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:35:35,631 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-03-16 17:35:35,679 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-03-16 17:35:35,679 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 17:35:35,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:35:37,238 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:35:37,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:35:37,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037597318] [2025-03-16 17:35:37,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037597318] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:35:37,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [972312077] [2025-03-16 17:35:37,239 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 17:35:37,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:35:37,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:35:37,240 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 17:35:37,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-16 17:35:37,427 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-03-16 17:35:37,491 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-03-16 17:35:37,491 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 17:35:37,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:35:37,495 INFO L256 TraceCheckSpWp]: Trace formula consists of 633 conjuncts, 127 conjuncts are in the unsatisfiable core [2025-03-16 17:35:37,502 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:35:37,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 46 [2025-03-16 17:35:37,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 77 [2025-03-16 17:35:37,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 36 [2025-03-16 17:35:37,562 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:35:37,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 28 [2025-03-16 17:35:37,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 16 [2025-03-16 17:35:37,742 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 15 [2025-03-16 17:35:37,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2025-03-16 17:35:37,768 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-03-16 17:35:37,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 17 [2025-03-16 17:35:37,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 15 [2025-03-16 17:35:37,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 15 [2025-03-16 17:35:37,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2025-03-16 17:35:37,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-16 17:35:37,931 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-03-16 17:35:37,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 29 [2025-03-16 17:35:38,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 17:35:38,028 INFO L349 Elim1Store]: treesize reduction 47, result has 51.0 percent of original size [2025-03-16 17:35:38,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 66 [2025-03-16 17:35:38,055 INFO L349 Elim1Store]: treesize reduction 49, result has 2.0 percent of original size [2025-03-16 17:35:38,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 1 [2025-03-16 17:35:38,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 31 [2025-03-16 17:35:38,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2025-03-16 17:35:38,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-16 17:35:38,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-16 17:35:38,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-16 17:35:38,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2025-03-16 17:35:38,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2025-03-16 17:35:38,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25 [2025-03-16 17:35:38,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25 [2025-03-16 17:35:38,332 INFO L349 Elim1Store]: treesize reduction 13, result has 68.3 percent of original size [2025-03-16 17:35:38,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 66 [2025-03-16 17:35:38,361 INFO L349 Elim1Store]: treesize reduction 16, result has 55.6 percent of original size [2025-03-16 17:35:38,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 99 treesize of output 75 [2025-03-16 17:35:38,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-03-16 17:35:38,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-03-16 17:35:38,395 INFO L349 Elim1Store]: treesize reduction 16, result has 50.0 percent of original size [2025-03-16 17:35:38,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 37 [2025-03-16 17:35:38,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-03-16 17:35:38,685 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:35:38,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 168 treesize of output 132 [2025-03-16 17:35:38,698 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:35:38,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 112 treesize of output 124 [2025-03-16 17:35:39,144 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:35:39,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 64 [2025-03-16 17:35:39,153 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:35:39,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 55 [2025-03-16 17:35:39,230 INFO L349 Elim1Store]: treesize reduction 17, result has 41.4 percent of original size [2025-03-16 17:35:39,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 47 [2025-03-16 17:35:39,238 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:35:39,238 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:35:39,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 170 treesize of output 162 [2025-03-16 17:35:39,606 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:35:39,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 162 treesize of output 158 [2025-03-16 17:35:39,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 134 [2025-03-16 17:35:39,619 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:35:39,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 134 treesize of output 130 [2025-03-16 17:35:39,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [972312077] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:35:39,900 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 17:35:39,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 33 [2025-03-16 17:35:39,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104358746] [2025-03-16 17:35:39,901 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 17:35:39,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-16 17:35:39,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:35:39,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-16 17:35:39,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1229, Unknown=2, NotChecked=0, Total=1332 [2025-03-16 17:35:39,902 INFO L87 Difference]: Start difference. First operand 159 states and 216 transitions. Second operand has 33 states, 31 states have (on average 2.032258064516129) internal successors, (63), 30 states have internal predecessors, (63), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-16 17:35:45,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:35:45,873 INFO L93 Difference]: Finished difference Result 342 states and 467 transitions. [2025-03-16 17:35:45,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2025-03-16 17:35:45,874 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 31 states have (on average 2.032258064516129) internal successors, (63), 30 states have internal predecessors, (63), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 39 [2025-03-16 17:35:45,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:35:45,875 INFO L225 Difference]: With dead ends: 342 [2025-03-16 17:35:45,875 INFO L226 Difference]: Without dead ends: 322 [2025-03-16 17:35:45,877 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1931 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=652, Invalid=7718, Unknown=2, NotChecked=0, Total=8372 [2025-03-16 17:35:45,877 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 187 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 1680 mSolverCounterSat, 67 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 1752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1680 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2025-03-16 17:35:45,877 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 599 Invalid, 1752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1680 Invalid, 5 Unknown, 0 Unchecked, 3.5s Time] [2025-03-16 17:35:45,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2025-03-16 17:35:45,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 184. [2025-03-16 17:35:45,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 161 states have (on average 1.329192546583851) internal successors, (214), 162 states have internal predecessors, (214), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-16 17:35:45,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 250 transitions. [2025-03-16 17:35:45,898 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 250 transitions. Word has length 39 [2025-03-16 17:35:45,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:35:45,898 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 250 transitions. [2025-03-16 17:35:45,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 31 states have (on average 2.032258064516129) internal successors, (63), 30 states have internal predecessors, (63), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-16 17:35:45,898 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 250 transitions. [2025-03-16 17:35:45,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-16 17:35:45,899 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:35:45,899 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:35:45,907 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-16 17:35:46,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:35:46,100 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:35:46,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:35:46,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1550672996, now seen corresponding path program 2 times [2025-03-16 17:35:46,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:35:46,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562321684] [2025-03-16 17:35:46,100 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 17:35:46,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:35:46,125 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-03-16 17:35:46,134 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-03-16 17:35:46,134 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 17:35:46,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:35:46,452 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-16 17:35:46,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:35:46,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562321684] [2025-03-16 17:35:46,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562321684] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:35:46,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1422450752] [2025-03-16 17:35:46,452 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 17:35:46,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:35:46,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:35:46,454 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 17:35:46,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-16 17:35:46,642 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-03-16 17:35:46,688 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-03-16 17:35:46,688 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 17:35:46,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:35:46,690 INFO L256 TraceCheckSpWp]: Trace formula consists of 650 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-03-16 17:35:46,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:35:46,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2025-03-16 17:35:46,763 WARN L851 $PredicateComparison]: unable to prove that (and (or (exists ((|v_#memory_$Pointer$#1.offset_BEFORE_CALL_20| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_$Pointer$#1.offset_BEFORE_CALL_20| |c_#memory_$Pointer$#1.offset|))) (and (= .cse0 |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) (= (select (select |v_#memory_$Pointer$#1.offset_BEFORE_CALL_20| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0) (= (store |v_#memory_$Pointer$#1.offset_BEFORE_CALL_20| .cse0 (select |c_#memory_$Pointer$#1.offset| .cse0)) |c_#memory_$Pointer$#1.offset|)))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0)) (not (= |c_ULTIMATE.start_main_~#normal_queue~0#1.base| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|)) (or (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0) (exists ((|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_11| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_11| |c_#memory_$Pointer$#1.base|))) (and (= (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_11| .cse1 (select |c_#memory_$Pointer$#1.base| .cse1)) |c_#memory_$Pointer$#1.base|) (= (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_11| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0) (= .cse1 |c_ULTIMATE.start_main_~#prio_queue~0#1.base|)))))) is different from false [2025-03-16 17:35:46,765 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_#memory_$Pointer$#1.offset_BEFORE_CALL_20| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_$Pointer$#1.offset_BEFORE_CALL_20| |c_#memory_$Pointer$#1.offset|))) (and (= .cse0 |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) (= (select (select |v_#memory_$Pointer$#1.offset_BEFORE_CALL_20| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0) (= (store |v_#memory_$Pointer$#1.offset_BEFORE_CALL_20| .cse0 (select |c_#memory_$Pointer$#1.offset| .cse0)) |c_#memory_$Pointer$#1.offset|)))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0)) (not (= |c_ULTIMATE.start_main_~#normal_queue~0#1.base| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|)) (or (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0) (exists ((|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_11| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_11| |c_#memory_$Pointer$#1.base|))) (and (= (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_11| .cse1 (select |c_#memory_$Pointer$#1.base| .cse1)) |c_#memory_$Pointer$#1.base|) (= (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_11| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0) (= .cse1 |c_ULTIMATE.start_main_~#prio_queue~0#1.base|)))))) is different from true [2025-03-16 17:35:46,880 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 1 not checked. [2025-03-16 17:35:46,881 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:35:46,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1422450752] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:35:46,941 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 17:35:46,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 9 [2025-03-16 17:35:46,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262592645] [2025-03-16 17:35:46,941 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 17:35:46,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 17:35:46,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:35:46,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 17:35:46,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=46, Unknown=8, NotChecked=14, Total=90 [2025-03-16 17:35:46,942 INFO L87 Difference]: Start difference. First operand 184 states and 250 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 7 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 17:35:47,117 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0)) (.cse1 (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0))) (and (or (exists ((|v_#memory_$Pointer$#1.offset_BEFORE_CALL_20| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_$Pointer$#1.offset_BEFORE_CALL_20| |c_#memory_$Pointer$#1.offset|))) (and (= .cse0 |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) (= (select (select |v_#memory_$Pointer$#1.offset_BEFORE_CALL_20| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0) (= (store |v_#memory_$Pointer$#1.offset_BEFORE_CALL_20| .cse0 (select |c_#memory_$Pointer$#1.offset| .cse0)) |c_#memory_$Pointer$#1.offset|)))) .cse1) (not (= |c_ULTIMATE.start_main_~#normal_queue~0#1.base| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|)) .cse2 (or .cse2 (exists ((|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_11| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_11| |c_#memory_$Pointer$#1.base|))) (and (= (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_11| .cse3 (select |c_#memory_$Pointer$#1.base| .cse3)) |c_#memory_$Pointer$#1.base|) (= (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_11| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0) (= .cse3 |c_ULTIMATE.start_main_~#prio_queue~0#1.base|))))) .cse1)) is different from false [2025-03-16 17:35:47,119 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0)) (.cse1 (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0))) (and (or (exists ((|v_#memory_$Pointer$#1.offset_BEFORE_CALL_20| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_$Pointer$#1.offset_BEFORE_CALL_20| |c_#memory_$Pointer$#1.offset|))) (and (= .cse0 |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) (= (select (select |v_#memory_$Pointer$#1.offset_BEFORE_CALL_20| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0) (= (store |v_#memory_$Pointer$#1.offset_BEFORE_CALL_20| .cse0 (select |c_#memory_$Pointer$#1.offset| .cse0)) |c_#memory_$Pointer$#1.offset|)))) .cse1) (not (= |c_ULTIMATE.start_main_~#normal_queue~0#1.base| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|)) .cse2 (or .cse2 (exists ((|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_11| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_11| |c_#memory_$Pointer$#1.base|))) (and (= (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_11| .cse3 (select |c_#memory_$Pointer$#1.base| .cse3)) |c_#memory_$Pointer$#1.base|) (= (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_11| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0) (= .cse3 |c_ULTIMATE.start_main_~#prio_queue~0#1.base|))))) .cse1)) is different from true [2025-03-16 17:35:47,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:35:47,212 INFO L93 Difference]: Finished difference Result 260 states and 351 transitions. [2025-03-16 17:35:47,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 17:35:47,213 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 7 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 40 [2025-03-16 17:35:47,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:35:47,214 INFO L225 Difference]: With dead ends: 260 [2025-03-16 17:35:47,214 INFO L226 Difference]: Without dead ends: 248 [2025-03-16 17:35:47,214 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 59 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=74, Unknown=11, NotChecked=38, Total=156 [2025-03-16 17:35:47,215 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 18 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 85 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 17:35:47,215 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 239 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 85 Invalid, 0 Unknown, 85 Unchecked, 0.2s Time] [2025-03-16 17:35:47,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2025-03-16 17:35:47,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 242. [2025-03-16 17:35:47,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 212 states have (on average 1.3254716981132075) internal successors, (281), 213 states have internal predecessors, (281), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-16 17:35:47,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 329 transitions. [2025-03-16 17:35:47,244 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 329 transitions. Word has length 40 [2025-03-16 17:35:47,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:35:47,245 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 329 transitions. [2025-03-16 17:35:47,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 7 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 17:35:47,245 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 329 transitions. [2025-03-16 17:35:47,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-16 17:35:47,246 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:35:47,246 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:35:47,253 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-16 17:35:47,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-16 17:35:47,446 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:35:47,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:35:47,447 INFO L85 PathProgramCache]: Analyzing trace with hash -963651589, now seen corresponding path program 1 times [2025-03-16 17:35:47,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:35:47,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138716068] [2025-03-16 17:35:47,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:35:47,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:35:47,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-16 17:35:47,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-16 17:35:47,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:35:47,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:35:49,251 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:35:49,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:35:49,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138716068] [2025-03-16 17:35:49,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138716068] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:35:49,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1974355241] [2025-03-16 17:35:49,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:35:49,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:35:49,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:35:49,254 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 17:35:49,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-16 17:35:49,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-16 17:35:49,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-16 17:35:49,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:35:49,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:35:49,505 INFO L256 TraceCheckSpWp]: Trace formula consists of 635 conjuncts, 98 conjuncts are in the unsatisfiable core [2025-03-16 17:35:49,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:35:49,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2025-03-16 17:35:49,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 15 [2025-03-16 17:35:49,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2025-03-16 17:35:49,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-03-16 17:35:49,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2025-03-16 17:35:49,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-16 17:35:49,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 38 [2025-03-16 17:35:49,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 69 [2025-03-16 17:35:49,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2025-03-16 17:35:49,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 31 [2025-03-16 17:35:49,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2025-03-16 17:35:49,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2025-03-16 17:35:49,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2025-03-16 17:35:49,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-16 17:35:49,931 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-03-16 17:35:49,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2025-03-16 17:35:49,940 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-03-16 17:35:49,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2025-03-16 17:35:50,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 34 [2025-03-16 17:35:50,071 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:35:50,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 48 [2025-03-16 17:35:50,161 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:35:50,161 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:35:50,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 3394 treesize of output 3314 [2025-03-16 17:35:50,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1974355241] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:35:50,807 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 17:35:50,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 18] total 26 [2025-03-16 17:35:50,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051443660] [2025-03-16 17:35:50,807 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 17:35:50,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-16 17:35:50,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:35:50,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-16 17:35:50,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=792, Unknown=26, NotChecked=0, Total=930 [2025-03-16 17:35:50,809 INFO L87 Difference]: Start difference. First operand 242 states and 329 transitions. Second operand has 26 states, 25 states have (on average 2.36) internal successors, (59), 23 states have internal predecessors, (59), 5 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-16 17:35:58,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:35:58,276 INFO L93 Difference]: Finished difference Result 519 states and 718 transitions. [2025-03-16 17:35:58,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-16 17:35:58,277 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.36) internal successors, (59), 23 states have internal predecessors, (59), 5 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 40 [2025-03-16 17:35:58,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:35:58,279 INFO L225 Difference]: With dead ends: 519 [2025-03-16 17:35:58,279 INFO L226 Difference]: Without dead ends: 489 [2025-03-16 17:35:58,280 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=261, Invalid=1955, Unknown=40, NotChecked=0, Total=2256 [2025-03-16 17:35:58,280 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 106 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 931 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 986 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 931 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-16 17:35:58,280 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 550 Invalid, 986 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 931 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-16 17:35:58,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2025-03-16 17:35:58,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 376. [2025-03-16 17:35:58,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 331 states have (on average 1.3353474320241692) internal successors, (442), 332 states have internal predecessors, (442), 38 states have call successors, (38), 5 states have call predecessors, (38), 5 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-16 17:35:58,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 518 transitions. [2025-03-16 17:35:58,322 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 518 transitions. Word has length 40 [2025-03-16 17:35:58,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:35:58,322 INFO L471 AbstractCegarLoop]: Abstraction has 376 states and 518 transitions. [2025-03-16 17:35:58,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.36) internal successors, (59), 23 states have internal predecessors, (59), 5 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-16 17:35:58,323 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 518 transitions. [2025-03-16 17:35:58,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-16 17:35:58,325 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:35:58,325 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:35:58,335 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-16 17:35:58,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-16 17:35:58,526 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:35:58,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:35:58,527 INFO L85 PathProgramCache]: Analyzing trace with hash 402759441, now seen corresponding path program 1 times [2025-03-16 17:35:58,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:35:58,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109010354] [2025-03-16 17:35:58,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:35:58,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:35:58,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-16 17:35:58,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-16 17:35:58,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:35:58,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:35:59,976 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:35:59,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:35:59,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109010354] [2025-03-16 17:35:59,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109010354] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:35:59,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [436242210] [2025-03-16 17:35:59,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:35:59,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:35:59,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:35:59,978 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 17:35:59,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-16 17:36:00,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-16 17:36:00,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-16 17:36:00,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:36:00,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:36:00,244 INFO L256 TraceCheckSpWp]: Trace formula consists of 635 conjuncts, 107 conjuncts are in the unsatisfiable core [2025-03-16 17:36:00,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:36:04,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-16 17:36:04,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-16 17:36:04,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 15 [2025-03-16 17:36:04,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 38 [2025-03-16 17:36:04,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 69 [2025-03-16 17:36:04,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2025-03-16 17:36:04,655 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:36:04,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 73 treesize of output 77 [2025-03-16 17:36:04,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 15 [2025-03-16 17:36:04,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 15 [2025-03-16 17:36:08,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 21 [2025-03-16 17:36:08,850 INFO L349 Elim1Store]: treesize reduction 41, result has 43.1 percent of original size [2025-03-16 17:36:08,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 48 [2025-03-16 17:36:08,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-16 17:36:08,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 39 [2025-03-16 17:36:09,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2025-03-16 17:36:09,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-16 17:36:09,359 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-16 17:36:09,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 40 [2025-03-16 17:36:09,367 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:36:09,367 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:36:13,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [436242210] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:36:13,923 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 17:36:13,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19] total 32 [2025-03-16 17:36:13,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342062024] [2025-03-16 17:36:13,923 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 17:36:13,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-16 17:36:13,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:36:13,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-16 17:36:13,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=1225, Unknown=3, NotChecked=0, Total=1332 [2025-03-16 17:36:13,925 INFO L87 Difference]: Start difference. First operand 376 states and 518 transitions. Second operand has 32 states, 29 states have (on average 2.206896551724138) internal successors, (64), 29 states have internal predecessors, (64), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-16 17:36:18,360 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-16 17:36:22,538 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-16 17:36:35,006 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-16 17:36:39,013 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]