./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 e2fb8bed 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-?-e2fb8be-m [2025-03-08 04:26:13,113 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 04:26:13,169 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 04:26:13,176 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 04:26:13,177 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 04:26:13,192 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 04:26:13,192 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 04:26:13,192 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 04:26:13,193 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 04:26:13,193 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 04:26:13,194 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 04:26:13,194 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 04:26:13,194 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 04:26:13,194 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 04:26:13,194 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 04:26:13,195 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 04:26:13,195 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 04:26:13,195 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 04:26:13,195 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 04:26:13,195 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 04:26:13,195 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 04:26:13,195 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 04:26:13,195 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 04:26:13,195 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 04:26:13,195 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 04:26:13,195 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 04:26:13,196 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 04:26:13,196 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 04:26:13,196 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 04:26:13,196 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 04:26:13,196 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 04:26:13,196 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 04:26:13,196 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 04:26:13,196 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 04:26:13,197 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 04:26:13,197 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 04:26:13,197 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 04:26:13,197 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 04:26:13,197 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 04:26:13,197 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 04:26:13,197 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 04:26:13,197 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 04:26:13,197 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 04:26:13,197 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-08 04:26:13,420 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 04:26:13,426 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 04:26:13,428 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 04:26:13,429 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 04:26:13,429 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 04:26:13,430 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-08 04:26:14,549 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef979118a/19c6e63acd694e74b386a52e329856a8/FLAGbad680ab4 [2025-03-08 04:26:14,837 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 04:26:14,839 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-data/packet_filter.i [2025-03-08 04:26:14,852 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef979118a/19c6e63acd694e74b386a52e329856a8/FLAGbad680ab4 [2025-03-08 04:26:15,113 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef979118a/19c6e63acd694e74b386a52e329856a8 [2025-03-08 04:26:15,115 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 04:26:15,117 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 04:26:15,118 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 04:26:15,118 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 04:26:15,121 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 04:26:15,122 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:26:15" (1/1) ... [2025-03-08 04:26:15,122 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71d4e2c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:26:15, skipping insertion in model container [2025-03-08 04:26:15,122 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:26:15" (1/1) ... [2025-03-08 04:26:15,144 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 04:26:15,355 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-08 04:26:15,364 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-08 04:26:15,369 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 04:26:15,377 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 04:26:15,418 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-08 04:26:15,419 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-08 04:26:15,423 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 04:26:15,449 INFO L204 MainTranslator]: Completed translation [2025-03-08 04:26:15,449 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:26:15 WrapperNode [2025-03-08 04:26:15,450 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 04:26:15,451 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 04:26:15,451 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 04:26:15,451 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 04:26:15,456 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:26:15" (1/1) ... [2025-03-08 04:26:15,466 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:26:15" (1/1) ... [2025-03-08 04:26:15,480 INFO L138 Inliner]: procedures = 130, calls = 85, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 157 [2025-03-08 04:26:15,480 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 04:26:15,481 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 04:26:15,481 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 04:26:15,481 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 04:26:15,486 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:26:15" (1/1) ... [2025-03-08 04:26:15,487 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:26:15" (1/1) ... [2025-03-08 04:26:15,490 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:26:15" (1/1) ... [2025-03-08 04:26:15,509 INFO L175 MemorySlicer]: Split 57 memory accesses to 7 slices as follows [2, 16, 6, 6, 6, 15, 6]. 28 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 0, 2, 0, 0, 3, 0]. The 14 writes are split as follows [0, 4, 1, 3, 3, 0, 3]. [2025-03-08 04:26:15,509 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:26:15" (1/1) ... [2025-03-08 04:26:15,509 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:26:15" (1/1) ... [2025-03-08 04:26:15,521 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:26:15" (1/1) ... [2025-03-08 04:26:15,523 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:26:15" (1/1) ... [2025-03-08 04:26:15,524 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:26:15" (1/1) ... [2025-03-08 04:26:15,525 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:26:15" (1/1) ... [2025-03-08 04:26:15,528 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 04:26:15,529 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 04:26:15,529 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 04:26:15,529 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 04:26:15,530 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:26:15" (1/1) ... [2025-03-08 04:26:15,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 04:26:15,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:26:15,555 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-08 04:26:15,557 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-08 04:26:15,572 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 04:26:15,572 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 04:26:15,572 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 04:26:15,572 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-08 04:26:15,572 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-08 04:26:15,572 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-08 04:26:15,572 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-08 04:26:15,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 04:26:15,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 04:26:15,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 04:26:15,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-08 04:26:15,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-08 04:26:15,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-08 04:26:15,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-08 04:26:15,573 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 04:26:15,573 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 04:26:15,573 INFO L130 BoogieDeclarations]: Found specification of procedure append_to_queue [2025-03-08 04:26:15,573 INFO L138 BoogieDeclarations]: Found implementation of procedure append_to_queue [2025-03-08 04:26:15,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-08 04:26:15,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-08 04:26:15,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-08 04:26:15,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-08 04:26:15,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-08 04:26:15,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-08 04:26:15,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-08 04:26:15,574 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 04:26:15,575 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-08 04:26:15,575 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-08 04:26:15,575 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-08 04:26:15,575 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-08 04:26:15,575 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-08 04:26:15,575 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-08 04:26:15,575 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-08 04:26:15,575 INFO L130 BoogieDeclarations]: Found specification of procedure send [2025-03-08 04:26:15,575 INFO L138 BoogieDeclarations]: Found implementation of procedure send [2025-03-08 04:26:15,575 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 04:26:15,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-08 04:26:15,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-08 04:26:15,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-08 04:26:15,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-08 04:26:15,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-03-08 04:26:15,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-03-08 04:26:15,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-03-08 04:26:15,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 04:26:15,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 04:26:15,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 04:26:15,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 04:26:15,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-08 04:26:15,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-08 04:26:15,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-08 04:26:15,575 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 04:26:15,575 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 04:26:15,692 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 04:26:15,694 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 04:26:15,889 INFO L1307 $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-08 04:26:15,889 INFO L1307 $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-08 04:26:15,910 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2025-03-08 04:26:15,911 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 04:26:15,918 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 04:26:15,919 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 04:26:15,919 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:26:15 BoogieIcfgContainer [2025-03-08 04:26:15,919 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 04:26:15,921 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 04:26:15,921 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 04:26:15,924 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 04:26:15,924 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 04:26:15" (1/3) ... [2025-03-08 04:26:15,924 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c0e7aa6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:26:15, skipping insertion in model container [2025-03-08 04:26:15,925 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:26:15" (2/3) ... [2025-03-08 04:26:15,925 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c0e7aa6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:26:15, skipping insertion in model container [2025-03-08 04:26:15,925 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:26:15" (3/3) ... [2025-03-08 04:26:15,925 INFO L128 eAbstractionObserver]: Analyzing ICFG packet_filter.i [2025-03-08 04:26:15,936 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 04:26:15,938 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG packet_filter.i that has 3 procedures, 43 locations, 1 initial locations, 3 loop locations, and 2 error locations. [2025-03-08 04:26:15,973 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 04:26:15,985 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;@7e9bf316, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 04:26:15,986 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-08 04:26:15,988 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 33 states have (on average 1.393939393939394) internal successors, (46), 35 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-08 04:26:15,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-08 04:26:15,994 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:26:15,994 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:26:15,994 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:26:15,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:26:15,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1785287591, now seen corresponding path program 1 times [2025-03-08 04:26:16,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:26:16,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512753012] [2025-03-08 04:26:16,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:26:16,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:26:16,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-08 04:26:16,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-08 04:26:16,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:26:16,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:26:16,099 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-08 04:26:16,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:26:16,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512753012] [2025-03-08 04:26:16,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512753012] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:26:16,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:26:16,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 04:26:16,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890148977] [2025-03-08 04:26:16,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:26:16,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 04:26:16,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:26:16,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 04:26:16,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 04:26:16,120 INFO L87 Difference]: Start difference. First operand has 43 states, 33 states have (on average 1.393939393939394) internal successors, (46), 35 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) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 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-08 04:26:16,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:26:16,135 INFO L93 Difference]: Finished difference Result 68 states and 87 transitions. [2025-03-08 04:26:16,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 04:26:16,137 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 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-08 04:26:16,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:26:16,141 INFO L225 Difference]: With dead ends: 68 [2025-03-08 04:26:16,141 INFO L226 Difference]: Without dead ends: 39 [2025-03-08 04:26:16,143 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-08 04:26:16,144 INFO L435 NwaCegarLoop]: 53 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, 53 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-08 04:26:16,147 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:26:16,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-03-08 04:26:16,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2025-03-08 04:26:16,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 30 states have (on average 1.3) internal successors, (39), 31 states have internal predecessors, (39), 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-08 04:26:16,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 49 transitions. [2025-03-08 04:26:16,169 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 49 transitions. Word has length 8 [2025-03-08 04:26:16,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:26:16,169 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 49 transitions. [2025-03-08 04:26:16,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 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-08 04:26:16,170 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 49 transitions. [2025-03-08 04:26:16,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-08 04:26:16,170 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:26:16,170 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:26:16,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 04:26:16,170 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:26:16,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:26:16,171 INFO L85 PathProgramCache]: Analyzing trace with hash -833224258, now seen corresponding path program 1 times [2025-03-08 04:26:16,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:26:16,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833145648] [2025-03-08 04:26:16,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:26:16,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:26:16,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-08 04:26:16,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-08 04:26:16,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:26:16,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:26:16,358 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-08 04:26:16,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:26:16,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833145648] [2025-03-08 04:26:16,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833145648] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:26:16,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:26:16,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 04:26:16,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724383848] [2025-03-08 04:26:16,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:26:16,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 04:26:16,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:26:16,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 04:26:16,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 04:26:16,360 INFO L87 Difference]: Start difference. First operand 39 states and 49 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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-08 04:26:16,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:26:16,420 INFO L93 Difference]: Finished difference Result 71 states and 93 transitions. [2025-03-08 04:26:16,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 04:26:16,420 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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-08 04:26:16,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:26:16,422 INFO L225 Difference]: With dead ends: 71 [2025-03-08 04:26:16,422 INFO L226 Difference]: Without dead ends: 51 [2025-03-08 04:26:16,423 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 04:26:16,424 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 9 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:26:16,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 133 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:26:16,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-03-08 04:26:16,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 46. [2025-03-08 04:26:16,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 38 states have internal predecessors, (48), 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-08 04:26:16,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 58 transitions. [2025-03-08 04:26:16,435 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 58 transitions. Word has length 9 [2025-03-08 04:26:16,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:26:16,436 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 58 transitions. [2025-03-08 04:26:16,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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-08 04:26:16,436 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 58 transitions. [2025-03-08 04:26:16,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-08 04:26:16,437 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:26:16,437 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:26:16,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 04:26:16,437 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:26:16,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:26:16,438 INFO L85 PathProgramCache]: Analyzing trace with hash 2135522685, now seen corresponding path program 1 times [2025-03-08 04:26:16,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:26:16,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801624913] [2025-03-08 04:26:16,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:26:16,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:26:16,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-08 04:26:16,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-08 04:26:16,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:26:16,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:26:16,541 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-08 04:26:16,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:26:16,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801624913] [2025-03-08 04:26:16,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801624913] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:26:16,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:26:16,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 04:26:16,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936561645] [2025-03-08 04:26:16,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:26:16,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 04:26:16,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:26:16,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 04:26:16,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 04:26:16,542 INFO L87 Difference]: Start difference. First operand 46 states and 58 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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-08 04:26:16,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:26:16,586 INFO L93 Difference]: Finished difference Result 64 states and 82 transitions. [2025-03-08 04:26:16,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 04:26:16,586 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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 11 [2025-03-08 04:26:16,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:26:16,587 INFO L225 Difference]: With dead ends: 64 [2025-03-08 04:26:16,587 INFO L226 Difference]: Without dead ends: 49 [2025-03-08 04:26:16,587 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 04:26:16,589 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 9 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 132 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.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:26:16,589 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 132 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:26:16,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-03-08 04:26:16,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 44. [2025-03-08 04:26:16,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 36 states have internal predecessors, (45), 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-08 04:26:16,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 55 transitions. [2025-03-08 04:26:16,594 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 55 transitions. Word has length 11 [2025-03-08 04:26:16,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:26:16,594 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 55 transitions. [2025-03-08 04:26:16,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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-08 04:26:16,594 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 55 transitions. [2025-03-08 04:26:16,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-08 04:26:16,595 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:26:16,595 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-08 04:26:16,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 04:26:16,595 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:26:16,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:26:16,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1806629543, now seen corresponding path program 1 times [2025-03-08 04:26:16,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:26:16,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284965931] [2025-03-08 04:26:16,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:26:16,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:26:16,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-08 04:26:16,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-08 04:26:16,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:26:16,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:26:17,809 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-08 04:26:17,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:26:17,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284965931] [2025-03-08 04:26:17,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284965931] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:26:17,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:26:17,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 04:26:17,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966744987] [2025-03-08 04:26:17,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:26:17,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 04:26:17,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:26:17,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 04:26:17,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-08 04:26:17,813 INFO L87 Difference]: Start difference. First operand 44 states and 55 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-08 04:26:18,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:26:18,379 INFO L93 Difference]: Finished difference Result 84 states and 110 transitions. [2025-03-08 04:26:18,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 04:26:18,380 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-08 04:26:18,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:26:18,381 INFO L225 Difference]: With dead ends: 84 [2025-03-08 04:26:18,382 INFO L226 Difference]: Without dead ends: 64 [2025-03-08 04:26:18,383 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-08 04:26:18,383 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 15 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 04:26:18,383 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 259 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 04:26:18,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-03-08 04:26:18,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 53. [2025-03-08 04:26:18,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 45 states have internal predecessors, (57), 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-08 04:26:18,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 67 transitions. [2025-03-08 04:26:18,391 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 67 transitions. Word has length 20 [2025-03-08 04:26:18,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:26:18,391 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 67 transitions. [2025-03-08 04:26:18,391 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-08 04:26:18,391 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 67 transitions. [2025-03-08 04:26:18,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-08 04:26:18,392 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:26:18,392 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-08 04:26:18,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 04:26:18,392 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:26:18,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:26:18,393 INFO L85 PathProgramCache]: Analyzing trace with hash -1567142839, now seen corresponding path program 1 times [2025-03-08 04:26:18,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:26:18,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119051041] [2025-03-08 04:26:18,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:26:18,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:26:18,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-08 04:26:18,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-08 04:26:18,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:26:18,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:26:18,940 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-08 04:26:18,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:26:18,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119051041] [2025-03-08 04:26:18,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119051041] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:26:18,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:26:18,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 04:26:18,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761424036] [2025-03-08 04:26:18,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:26:18,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 04:26:18,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:26:18,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 04:26:18,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-08 04:26:18,944 INFO L87 Difference]: Start difference. First operand 53 states and 67 transitions. Second operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 10 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-08 04:26:19,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:26:19,218 INFO L93 Difference]: Finished difference Result 73 states and 98 transitions. [2025-03-08 04:26:19,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 04:26:19,218 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 10 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-08 04:26:19,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:26:19,219 INFO L225 Difference]: With dead ends: 73 [2025-03-08 04:26:19,219 INFO L226 Difference]: Without dead ends: 71 [2025-03-08 04:26:19,219 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-08 04:26:19,220 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 12 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 04:26:19,220 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 363 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 04:26:19,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-03-08 04:26:19,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 61. [2025-03-08 04:26:19,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 52 states have (on average 1.3269230769230769) internal successors, (69), 53 states have internal predecessors, (69), 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-08 04:26:19,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 79 transitions. [2025-03-08 04:26:19,226 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 79 transitions. Word has length 21 [2025-03-08 04:26:19,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:26:19,226 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 79 transitions. [2025-03-08 04:26:19,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 10 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-08 04:26:19,226 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 79 transitions. [2025-03-08 04:26:19,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-08 04:26:19,230 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:26:19,230 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-08 04:26:19,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 04:26:19,230 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:26:19,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:26:19,231 INFO L85 PathProgramCache]: Analyzing trace with hash -896080535, now seen corresponding path program 1 times [2025-03-08 04:26:19,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:26:19,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289380642] [2025-03-08 04:26:19,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:26:19,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:26:19,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-08 04:26:19,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-08 04:26:19,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:26:19,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:26:19,535 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-08 04:26:19,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:26:19,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289380642] [2025-03-08 04:26:19,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289380642] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:26:19,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [371789138] [2025-03-08 04:26:19,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:26:19,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:26:19,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:26:19,539 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-08 04:26:19,541 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-08 04:26:19,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-08 04:26:19,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-08 04:26:19,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:26:19,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:26:19,683 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-08 04:26:19,688 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:26:19,719 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-08 04:26:20,285 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0))) (or (and (or .cse0 (exists ((|v_#memory_$Pointer$#2.offset_BEFORE_CALL_2| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_$Pointer$#2.offset_BEFORE_CALL_2| |c_#memory_$Pointer$#2.offset|))) (and (not (= .cse1 |c_ULTIMATE.start_main_~#prio_queue~0#1.base|)) (= (select (select |v_#memory_$Pointer$#2.offset_BEFORE_CALL_2| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0) (= |c_#memory_$Pointer$#2.offset| (store |v_#memory_$Pointer$#2.offset_BEFORE_CALL_2| .cse1 (select |c_#memory_$Pointer$#2.offset| .cse1))))))) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0)) (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_1| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_1| |c_#memory_$Pointer$#2.base|))) (and (exists ((|v_#memory_$Pointer$#2.offset_BEFORE_CALL_2| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_$Pointer$#2.offset_BEFORE_CALL_2| |c_#memory_$Pointer$#2.offset|))) (and (= .cse2 .cse3) (= (select (select |v_#memory_$Pointer$#2.offset_BEFORE_CALL_2| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0) (= |c_#memory_$Pointer$#2.offset| (store |v_#memory_$Pointer$#2.offset_BEFORE_CALL_2| .cse2 (select |c_#memory_$Pointer$#2.offset| .cse2)))))) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_1| .cse3 (select |c_#memory_$Pointer$#2.base| .cse3)) |c_#memory_$Pointer$#2.base|) (= 0 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_1| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~#prio_queue~0#1.base| .cse3))))) (and .cse0 (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_1| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_1| |c_#memory_$Pointer$#2.base|))) (and (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_1| .cse4 (select |c_#memory_$Pointer$#2.base| .cse4)) |c_#memory_$Pointer$#2.base|) (= 0 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_1| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~#prio_queue~0#1.base| .cse4)))))))) is different from false [2025-03-08 04:26:20,292 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0))) (or (and (or .cse0 (exists ((|v_#memory_$Pointer$#2.offset_BEFORE_CALL_2| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_$Pointer$#2.offset_BEFORE_CALL_2| |c_#memory_$Pointer$#2.offset|))) (and (not (= .cse1 |c_ULTIMATE.start_main_~#prio_queue~0#1.base|)) (= (select (select |v_#memory_$Pointer$#2.offset_BEFORE_CALL_2| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0) (= |c_#memory_$Pointer$#2.offset| (store |v_#memory_$Pointer$#2.offset_BEFORE_CALL_2| .cse1 (select |c_#memory_$Pointer$#2.offset| .cse1))))))) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0)) (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_1| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_1| |c_#memory_$Pointer$#2.base|))) (and (exists ((|v_#memory_$Pointer$#2.offset_BEFORE_CALL_2| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_$Pointer$#2.offset_BEFORE_CALL_2| |c_#memory_$Pointer$#2.offset|))) (and (= .cse2 .cse3) (= (select (select |v_#memory_$Pointer$#2.offset_BEFORE_CALL_2| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0) (= |c_#memory_$Pointer$#2.offset| (store |v_#memory_$Pointer$#2.offset_BEFORE_CALL_2| .cse2 (select |c_#memory_$Pointer$#2.offset| .cse2)))))) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_1| .cse3 (select |c_#memory_$Pointer$#2.base| .cse3)) |c_#memory_$Pointer$#2.base|) (= 0 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_1| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~#prio_queue~0#1.base| .cse3))))) (and .cse0 (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_1| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_1| |c_#memory_$Pointer$#2.base|))) (and (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_1| .cse4 (select |c_#memory_$Pointer$#2.base| .cse4)) |c_#memory_$Pointer$#2.base|) (= 0 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_1| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~#prio_queue~0#1.base| .cse4)))))))) is different from true [2025-03-08 04:26:20,366 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-08 04:26:20,367 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:26:20,431 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_308 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#normal_queue~0#1.base| v_ArrVal_308) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0)) (forall ((v_ArrVal_309 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#normal_queue~0#1.base| v_ArrVal_309) |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-08 04:26:20,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [371789138] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:26:20,433 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 04:26:20,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 8 [2025-03-08 04:26:20,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132148226] [2025-03-08 04:26:20,433 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 04:26:20,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 04:26:20,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:26:20,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 04:26:20,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=30, Unknown=3, NotChecked=22, Total=72 [2025-03-08 04:26:20,434 INFO L87 Difference]: Start difference. First operand 61 states and 79 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 04:26:20,570 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0)) (.cse2 (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0))) (and .cse0 (not (= |c_ULTIMATE.start_main_~#normal_queue~0#1.base| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|)) (or (and (or .cse0 (exists ((|v_#memory_$Pointer$#2.offset_BEFORE_CALL_2| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_$Pointer$#2.offset_BEFORE_CALL_2| |c_#memory_$Pointer$#2.offset|))) (and (not (= .cse1 |c_ULTIMATE.start_main_~#prio_queue~0#1.base|)) (= (select (select |v_#memory_$Pointer$#2.offset_BEFORE_CALL_2| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0) (= |c_#memory_$Pointer$#2.offset| (store |v_#memory_$Pointer$#2.offset_BEFORE_CALL_2| .cse1 (select |c_#memory_$Pointer$#2.offset| .cse1))))))) .cse2) (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_1| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_1| |c_#memory_$Pointer$#2.base|))) (and (exists ((|v_#memory_$Pointer$#2.offset_BEFORE_CALL_2| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_#memory_$Pointer$#2.offset_BEFORE_CALL_2| |c_#memory_$Pointer$#2.offset|))) (and (= .cse3 .cse4) (= (select (select |v_#memory_$Pointer$#2.offset_BEFORE_CALL_2| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0) (= |c_#memory_$Pointer$#2.offset| (store |v_#memory_$Pointer$#2.offset_BEFORE_CALL_2| .cse3 (select |c_#memory_$Pointer$#2.offset| .cse3)))))) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_1| .cse4 (select |c_#memory_$Pointer$#2.base| .cse4)) |c_#memory_$Pointer$#2.base|) (= 0 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_1| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~#prio_queue~0#1.base| .cse4))))) (and .cse0 (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_1| (Array Int (Array Int Int)))) (let ((.cse5 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_1| |c_#memory_$Pointer$#2.base|))) (and (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_1| .cse5 (select |c_#memory_$Pointer$#2.base| .cse5)) |c_#memory_$Pointer$#2.base|) (= 0 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_1| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~#prio_queue~0#1.base| .cse5))))))) .cse2)) is different from false [2025-03-08 04:26:20,574 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0)) (.cse2 (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0))) (and .cse0 (not (= |c_ULTIMATE.start_main_~#normal_queue~0#1.base| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|)) (or (and (or .cse0 (exists ((|v_#memory_$Pointer$#2.offset_BEFORE_CALL_2| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_$Pointer$#2.offset_BEFORE_CALL_2| |c_#memory_$Pointer$#2.offset|))) (and (not (= .cse1 |c_ULTIMATE.start_main_~#prio_queue~0#1.base|)) (= (select (select |v_#memory_$Pointer$#2.offset_BEFORE_CALL_2| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0) (= |c_#memory_$Pointer$#2.offset| (store |v_#memory_$Pointer$#2.offset_BEFORE_CALL_2| .cse1 (select |c_#memory_$Pointer$#2.offset| .cse1))))))) .cse2) (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_1| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_1| |c_#memory_$Pointer$#2.base|))) (and (exists ((|v_#memory_$Pointer$#2.offset_BEFORE_CALL_2| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_#memory_$Pointer$#2.offset_BEFORE_CALL_2| |c_#memory_$Pointer$#2.offset|))) (and (= .cse3 .cse4) (= (select (select |v_#memory_$Pointer$#2.offset_BEFORE_CALL_2| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0) (= |c_#memory_$Pointer$#2.offset| (store |v_#memory_$Pointer$#2.offset_BEFORE_CALL_2| .cse3 (select |c_#memory_$Pointer$#2.offset| .cse3)))))) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_1| .cse4 (select |c_#memory_$Pointer$#2.base| .cse4)) |c_#memory_$Pointer$#2.base|) (= 0 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_1| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~#prio_queue~0#1.base| .cse4))))) (and .cse0 (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_1| (Array Int (Array Int Int)))) (let ((.cse5 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_1| |c_#memory_$Pointer$#2.base|))) (and (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_1| .cse5 (select |c_#memory_$Pointer$#2.base| .cse5)) |c_#memory_$Pointer$#2.base|) (= 0 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_1| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~#prio_queue~0#1.base| .cse5))))))) .cse2)) is different from true [2025-03-08 04:26:20,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:26:20,599 INFO L93 Difference]: Finished difference Result 100 states and 135 transitions. [2025-03-08 04:26:20,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 04:26:20,599 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2025-03-08 04:26:20,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:26:20,600 INFO L225 Difference]: With dead ends: 100 [2025-03-08 04:26:20,600 INFO L226 Difference]: Without dead ends: 79 [2025-03-08 04:26:20,600 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=19, Invalid=30, Unknown=5, NotChecked=36, Total=90 [2025-03-08 04:26:20,601 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 14 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 89 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 04:26:20,601 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 227 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 87 Invalid, 0 Unknown, 89 Unchecked, 0.1s Time] [2025-03-08 04:26:20,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-03-08 04:26:20,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 72. [2025-03-08 04:26:20,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 62 states have (on average 1.3387096774193548) internal successors, (83), 63 states have internal predecessors, (83), 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-08 04:26:20,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 95 transitions. [2025-03-08 04:26:20,612 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 95 transitions. Word has length 21 [2025-03-08 04:26:20,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:26:20,612 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 95 transitions. [2025-03-08 04:26:20,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 04:26:20,612 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 95 transitions. [2025-03-08 04:26:20,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-08 04:26:20,613 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:26:20,614 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] [2025-03-08 04:26:20,621 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-08 04:26:20,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-08 04:26:20,818 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:26:20,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:26:20,818 INFO L85 PathProgramCache]: Analyzing trace with hash -1299052968, now seen corresponding path program 1 times [2025-03-08 04:26:20,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:26:20,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348357641] [2025-03-08 04:26:20,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:26:20,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:26:20,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-08 04:26:20,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-08 04:26:20,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:26:20,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:26:20,961 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-08 04:26:20,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:26:20,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348357641] [2025-03-08 04:26:20,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348357641] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:26:20,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:26:20,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 04:26:20,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222783901] [2025-03-08 04:26:20,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:26:20,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 04:26:20,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:26:20,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 04:26:20,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 04:26:20,966 INFO L87 Difference]: Start difference. First operand 72 states and 95 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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-08 04:26:21,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:26:21,072 INFO L93 Difference]: Finished difference Result 94 states and 124 transitions. [2025-03-08 04:26:21,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 04:26:21,073 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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 22 [2025-03-08 04:26:21,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:26:21,074 INFO L225 Difference]: With dead ends: 94 [2025-03-08 04:26:21,074 INFO L226 Difference]: Without dead ends: 82 [2025-03-08 04:26:21,074 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-08 04:26:21,074 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 14 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 04:26:21,074 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 189 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 04:26:21,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-03-08 04:26:21,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 72. [2025-03-08 04:26:21,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 62 states have (on average 1.3064516129032258) internal successors, (81), 63 states have internal predecessors, (81), 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-08 04:26:21,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 93 transitions. [2025-03-08 04:26:21,080 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 93 transitions. Word has length 22 [2025-03-08 04:26:21,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:26:21,080 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 93 transitions. [2025-03-08 04:26:21,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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-08 04:26:21,080 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 93 transitions. [2025-03-08 04:26:21,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-08 04:26:21,081 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:26:21,081 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] [2025-03-08 04:26:21,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 04:26:21,081 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:26:21,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:26:21,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1860182632, now seen corresponding path program 1 times [2025-03-08 04:26:21,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:26:21,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125431961] [2025-03-08 04:26:21,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:26:21,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:26:21,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-08 04:26:21,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 04:26:21,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:26:21,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:26:21,440 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-08 04:26:21,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:26:21,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125431961] [2025-03-08 04:26:21,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125431961] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:26:21,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:26:21,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 04:26:21,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728665096] [2025-03-08 04:26:21,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:26:21,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 04:26:21,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:26:21,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 04:26:21,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 04:26:21,442 INFO L87 Difference]: Start difference. First operand 72 states and 93 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 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-08 04:26:21,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:26:21,688 INFO L93 Difference]: Finished difference Result 98 states and 129 transitions. [2025-03-08 04:26:21,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 04:26:21,689 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 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 23 [2025-03-08 04:26:21,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:26:21,689 INFO L225 Difference]: With dead ends: 98 [2025-03-08 04:26:21,689 INFO L226 Difference]: Without dead ends: 96 [2025-03-08 04:26:21,690 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-08 04:26:21,690 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 23 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 04:26:21,690 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 417 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 04:26:21,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-03-08 04:26:21,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 83. [2025-03-08 04:26:21,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 72 states have (on average 1.3194444444444444) internal successors, (95), 73 states have internal predecessors, (95), 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-08 04:26:21,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 109 transitions. [2025-03-08 04:26:21,701 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 109 transitions. Word has length 23 [2025-03-08 04:26:21,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:26:21,701 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 109 transitions. [2025-03-08 04:26:21,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 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-08 04:26:21,701 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 109 transitions. [2025-03-08 04:26:21,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-08 04:26:21,703 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:26:21,703 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] [2025-03-08 04:26:21,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 04:26:21,703 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:26:21,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:26:21,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1860183593, now seen corresponding path program 1 times [2025-03-08 04:26:21,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:26:21,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573391704] [2025-03-08 04:26:21,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:26:21,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:26:21,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-08 04:26:21,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 04:26:21,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:26:21,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:26:22,249 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-08 04:26:22,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:26:22,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573391704] [2025-03-08 04:26:22,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573391704] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:26:22,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:26:22,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 04:26:22,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069606162] [2025-03-08 04:26:22,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:26:22,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 04:26:22,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:26:22,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 04:26:22,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-03-08 04:26:22,252 INFO L87 Difference]: Start difference. First operand 83 states and 109 transitions. Second operand has 11 states, 10 states have (on average 2.1) internal successors, (21), 11 states have internal predecessors, (21), 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-08 04:26:22,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:26:22,798 INFO L93 Difference]: Finished difference Result 109 states and 141 transitions. [2025-03-08 04:26:22,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 04:26:22,798 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.1) internal successors, (21), 11 states have internal predecessors, (21), 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 23 [2025-03-08 04:26:22,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:26:22,799 INFO L225 Difference]: With dead ends: 109 [2025-03-08 04:26:22,799 INFO L226 Difference]: Without dead ends: 98 [2025-03-08 04:26:22,799 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2025-03-08 04:26:22,799 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 21 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 04:26:22,800 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 384 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 04:26:22,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-03-08 04:26:22,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 83. [2025-03-08 04:26:22,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 72 states have (on average 1.3055555555555556) internal successors, (94), 73 states have internal predecessors, (94), 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-08 04:26:22,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 108 transitions. [2025-03-08 04:26:22,806 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 108 transitions. Word has length 23 [2025-03-08 04:26:22,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:26:22,807 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 108 transitions. [2025-03-08 04:26:22,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.1) internal successors, (21), 11 states have internal predecessors, (21), 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-08 04:26:22,807 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 108 transitions. [2025-03-08 04:26:22,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-08 04:26:22,807 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:26:22,807 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] [2025-03-08 04:26:22,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 04:26:22,808 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:26:22,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:26:22,808 INFO L85 PathProgramCache]: Analyzing trace with hash -916207685, now seen corresponding path program 1 times [2025-03-08 04:26:22,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:26:22,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120587710] [2025-03-08 04:26:22,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:26:22,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:26:22,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-08 04:26:22,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 04:26:22,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:26:22,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:26:23,293 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-08 04:26:23,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:26:23,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120587710] [2025-03-08 04:26:23,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120587710] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:26:23,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [220363339] [2025-03-08 04:26:23,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:26:23,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:26:23,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:26:23,296 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-08 04:26:23,298 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-08 04:26:23,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-08 04:26:23,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 04:26:23,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:26:23,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:26:23,457 INFO L256 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-03-08 04:26:23,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:26:23,505 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-08 04:26:23,511 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-08 04:26:23,515 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-08 04:26:23,526 WARN L873 $PredicateComparison]: unable to prove that (exists ((v_append_to_queue_~q.offset_12 Int)) (let ((.cse1 (select |c_old(#memory_$Pointer$#2.offset)| |c_append_to_queue_#in~q.base|)) (.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_append_to_queue_#in~q.base|) v_append_to_queue_~q.offset_12)) (.cse2 (select |c_old(#memory_$Pointer$#2.base)| |c_append_to_queue_#in~q.base|))) (and (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 12) (select .cse1 v_append_to_queue_~q.offset_12)) (= (store |c_old(#memory_$Pointer$#2.base)| |c_append_to_queue_#in~q.base| (store .cse2 v_append_to_queue_~q.offset_12 .cse0)) |c_#memory_$Pointer$#2.base|) (= |c_#memory_$Pointer$#2.offset| (store |c_old(#memory_$Pointer$#2.offset)| |c_append_to_queue_#in~q.base| (store .cse1 v_append_to_queue_~q.offset_12 0))) (= (select (select |c_#memory_$Pointer$#1.base| .cse0) 12) (select .cse2 v_append_to_queue_~q.offset_12))))) is different from true [2025-03-08 04:26:23,568 INFO L349 Elim1Store]: treesize reduction 16, result has 50.0 percent of original size [2025-03-08 04:26:23,568 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-08 04:26:23,588 INFO L349 Elim1Store]: treesize reduction 16, result has 55.6 percent of original size [2025-03-08 04:26:23,589 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-08 04:26:23,884 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:26:23,885 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-08 04:26:23,917 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:26:23,918 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-08 04:26:24,168 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-08 04:26:24,168 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:26:24,367 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-08 04:26:24,375 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 180 treesize of output 176 [2025-03-08 04:26:24,383 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 320 treesize of output 300 [2025-03-08 04:26:24,580 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 04:26:24,582 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-08 04:26:24,586 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-08 04:26:24,606 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 426 treesize of output 386 [2025-03-08 04:26:24,613 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 108 treesize of output 104 [2025-03-08 04:26:24,666 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 04:26:24,669 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-08 04:26:24,685 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-08 04:26:24,842 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-08 04:26:24,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [220363339] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:26:24,843 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 04:26:24,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 9] total 17 [2025-03-08 04:26:24,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349647449] [2025-03-08 04:26:24,843 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 04:26:24,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-08 04:26:24,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:26:24,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-08 04:26:24,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=198, Unknown=1, NotChecked=28, Total=272 [2025-03-08 04:26:24,844 INFO L87 Difference]: Start difference. First operand 83 states and 108 transitions. Second operand has 17 states, 17 states have (on average 2.764705882352941) internal successors, (47), 15 states have internal predecessors, (47), 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-08 04:26:25,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:26:25,372 INFO L93 Difference]: Finished difference Result 151 states and 200 transitions. [2025-03-08 04:26:25,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 04:26:25,373 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.764705882352941) internal successors, (47), 15 states have internal predecessors, (47), 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 29 [2025-03-08 04:26:25,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:26:25,374 INFO L225 Difference]: With dead ends: 151 [2025-03-08 04:26:25,374 INFO L226 Difference]: Without dead ends: 130 [2025-03-08 04:26:25,374 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=72, Invalid=351, Unknown=1, NotChecked=38, Total=462 [2025-03-08 04:26:25,374 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 63 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 125 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 04:26:25,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 345 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 201 Invalid, 0 Unknown, 125 Unchecked, 0.4s Time] [2025-03-08 04:26:25,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-03-08 04:26:25,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 118. [2025-03-08 04:26:25,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 102 states have (on average 1.2843137254901962) internal successors, (131), 103 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-08 04:26:25,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 153 transitions. [2025-03-08 04:26:25,383 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 153 transitions. Word has length 29 [2025-03-08 04:26:25,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:26:25,383 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 153 transitions. [2025-03-08 04:26:25,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.764705882352941) internal successors, (47), 15 states have internal predecessors, (47), 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-08 04:26:25,384 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 153 transitions. [2025-03-08 04:26:25,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-08 04:26:25,384 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:26:25,384 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, 1, 1] [2025-03-08 04:26:25,391 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-08 04:26:25,585 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-08 04:26:25,585 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:26:25,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:26:25,586 INFO L85 PathProgramCache]: Analyzing trace with hash -302139334, now seen corresponding path program 1 times [2025-03-08 04:26:25,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:26:25,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816093654] [2025-03-08 04:26:25,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:26:25,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:26:25,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-08 04:26:25,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 04:26:25,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:26:25,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:26:25,825 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-08 04:26:25,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:26:25,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816093654] [2025-03-08 04:26:25,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816093654] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:26:25,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [788407723] [2025-03-08 04:26:25,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:26:25,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:26:25,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:26:25,829 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-08 04:26:25,831 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-08 04:26:25,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-08 04:26:25,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 04:26:25,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:26:25,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:26:25,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-08 04:26:25,993 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:26:25,998 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-08 04:26:26,075 WARN L851 $PredicateComparison]: unable to prove that (and (or (exists ((|v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_3| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_3| |c_#memory_$Pointer$#2.offset|))) (and (= (select (select |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_3| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0) (= (store |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_3| .cse0 (select |c_#memory_$Pointer$#2.offset| .cse0)) |c_#memory_$Pointer$#2.offset|) (not (= |c_ULTIMATE.start_main_~#normal_queue~0#1.base| .cse0))))) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0)) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0)) is different from false [2025-03-08 04:26:26,077 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_3| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_3| |c_#memory_$Pointer$#2.offset|))) (and (= (select (select |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_3| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0) (= (store |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_3| .cse0 (select |c_#memory_$Pointer$#2.offset| .cse0)) |c_#memory_$Pointer$#2.offset|) (not (= |c_ULTIMATE.start_main_~#normal_queue~0#1.base| .cse0))))) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0)) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0)) is different from true [2025-03-08 04:26:26,146 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-08 04:26:26,147 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:26:26,220 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_909 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#prio_queue~0#1.base| v_ArrVal_909) |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0)) (forall ((v_ArrVal_910 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#prio_queue~0#1.base| v_ArrVal_910) |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0))) is different from false [2025-03-08 04:26:26,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [788407723] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:26:26,221 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 04:26:26,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 9 [2025-03-08 04:26:26,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198082961] [2025-03-08 04:26:26,222 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 04:26:26,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 04:26:26,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:26:26,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 04:26:26,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=40, Unknown=3, NotChecked=26, Total=90 [2025-03-08 04:26:26,222 INFO L87 Difference]: Start difference. First operand 118 states and 153 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, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 04:26:26,410 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select (select |c_#memory_$Pointer$#2.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|)) .cse0 (or (exists ((|v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_3| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_3| |c_#memory_$Pointer$#2.offset|))) (and (= (select (select |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_3| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0) (= (store |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_3| .cse1 (select |c_#memory_$Pointer$#2.offset| .cse1)) |c_#memory_$Pointer$#2.offset|) (not (= |c_ULTIMATE.start_main_~#normal_queue~0#1.base| .cse1))))) .cse0) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0))) is different from false [2025-03-08 04:26:26,412 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select (select |c_#memory_$Pointer$#2.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|)) .cse0 (or (exists ((|v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_3| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_3| |c_#memory_$Pointer$#2.offset|))) (and (= (select (select |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_3| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0) (= (store |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_3| .cse1 (select |c_#memory_$Pointer$#2.offset| .cse1)) |c_#memory_$Pointer$#2.offset|) (not (= |c_ULTIMATE.start_main_~#normal_queue~0#1.base| .cse1))))) .cse0) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0))) is different from true [2025-03-08 04:26:26,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:26:26,529 INFO L93 Difference]: Finished difference Result 192 states and 248 transitions. [2025-03-08 04:26:26,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 04:26:26,529 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, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 31 [2025-03-08 04:26:26,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:26:26,530 INFO L225 Difference]: With dead ends: 192 [2025-03-08 04:26:26,530 INFO L226 Difference]: Without dead ends: 147 [2025-03-08 04:26:26,531 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=65, Unknown=5, NotChecked=54, Total=156 [2025-03-08 04:26:26,531 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 50 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 119 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 04:26:26,531 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 252 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 90 Invalid, 0 Unknown, 119 Unchecked, 0.3s Time] [2025-03-08 04:26:26,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2025-03-08 04:26:26,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 129. [2025-03-08 04:26:26,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 112 states have (on average 1.2946428571428572) internal successors, (145), 113 states have internal predecessors, (145), 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-08 04:26:26,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 169 transitions. [2025-03-08 04:26:26,546 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 169 transitions. Word has length 31 [2025-03-08 04:26:26,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:26:26,546 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 169 transitions. [2025-03-08 04:26:26,546 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, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 04:26:26,546 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 169 transitions. [2025-03-08 04:26:26,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-08 04:26:26,547 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:26:26,547 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, 1] [2025-03-08 04:26:26,561 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 04:26:26,754 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-08 04:26:26,754 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:26:26,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:26:26,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1652185220, now seen corresponding path program 1 times [2025-03-08 04:26:26,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:26:26,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806982519] [2025-03-08 04:26:26,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:26:26,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:26:26,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-08 04:26:26,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-08 04:26:26,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:26:26,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:26:28,056 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-08 04:26:28,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:26:28,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806982519] [2025-03-08 04:26:28,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806982519] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:26:28,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [285797667] [2025-03-08 04:26:28,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:26:28,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:26:28,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:26:28,059 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-08 04:26:28,060 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-08 04:26:28,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-08 04:26:28,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-08 04:26:28,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:26:28,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:26:28,270 INFO L256 TraceCheckSpWp]: Trace formula consists of 555 conjuncts, 113 conjuncts are in the unsatisfiable core [2025-03-08 04:26:28,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:26:28,290 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-08 04:26:28,332 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-08 04:26:28,339 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-08 04:26:28,352 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-08 04:26:28,364 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-08 04:26:28,364 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 11 treesize of output 9 [2025-03-08 04:26:28,535 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-08 04:26:28,597 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-08 04:26:28,600 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-08 04:26:28,609 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-08 04:26:28,618 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-08 04:26:28,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 25 treesize of output 7 [2025-03-08 04:26:28,628 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 23 treesize of output 15 [2025-03-08 04:26:28,719 INFO L349 Elim1Store]: treesize reduction 68, result has 28.4 percent of original size [2025-03-08 04:26:28,720 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 4 case distinctions, treesize of input 42 treesize of output 45 [2025-03-08 04:26:28,800 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-08 04:26:28,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:26:28,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:26:28,871 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-08 04:26:28,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:26:28,880 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-08 04:26:29,086 INFO L349 Elim1Store]: treesize reduction 13, result has 60.6 percent of original size [2025-03-08 04:26:29,087 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-08 04:26:29,094 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-08 04:26:29,099 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 36 treesize of output 27 [2025-03-08 04:26:29,105 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 11 [2025-03-08 04:26:29,178 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 19 treesize of output 11 [2025-03-08 04:26:29,201 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-08 04:26:29,201 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:26:29,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [285797667] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:26:29,413 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 04:26:29,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 28 [2025-03-08 04:26:29,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795701294] [2025-03-08 04:26:29,413 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 04:26:29,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-08 04:26:29,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:26:29,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-08 04:26:29,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=817, Unknown=0, NotChecked=0, Total=930 [2025-03-08 04:26:29,414 INFO L87 Difference]: Start difference. First operand 129 states and 169 transitions. Second operand has 28 states, 26 states have (on average 2.0) internal successors, (52), 26 states have internal predecessors, (52), 4 states have call successors, (4), 3 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-08 04:26:33,915 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-08 04:26:37,969 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-08 04:26:42,004 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-08 04:26:46,217 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] [2025-03-08 04:26:50,910 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-08 04:26:52,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:26:52,165 INFO L93 Difference]: Finished difference Result 209 states and 277 transitions. [2025-03-08 04:26:52,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-08 04:26:52,166 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 2.0) internal successors, (52), 26 states have internal predecessors, (52), 4 states have call successors, (4), 3 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-08 04:26:52,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:26:52,167 INFO L225 Difference]: With dead ends: 209 [2025-03-08 04:26:52,167 INFO L226 Difference]: Without dead ends: 185 [2025-03-08 04:26:52,168 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 642 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=407, Invalid=2563, Unknown=0, NotChecked=0, Total=2970 [2025-03-08 04:26:52,168 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 79 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 1232 mSolverCounterSat, 23 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 1260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1232 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.9s IncrementalHoareTripleChecker+Time [2025-03-08 04:26:52,168 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 600 Invalid, 1260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1232 Invalid, 5 Unknown, 0 Unchecked, 21.9s Time] [2025-03-08 04:26:52,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2025-03-08 04:26:52,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 141. [2025-03-08 04:26:52,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 123 states have (on average 1.3089430894308942) internal successors, (161), 124 states have internal predecessors, (161), 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-08 04:26:52,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 187 transitions. [2025-03-08 04:26:52,182 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 187 transitions. Word has length 32 [2025-03-08 04:26:52,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:26:52,183 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 187 transitions. [2025-03-08 04:26:52,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 26 states have (on average 2.0) internal successors, (52), 26 states have internal predecessors, (52), 4 states have call successors, (4), 3 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-08 04:26:52,183 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 187 transitions. [2025-03-08 04:26:52,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-08 04:26:52,185 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:26:52,185 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:26:52,192 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-08 04:26:52,386 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-08 04:26:52,386 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:26:52,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:26:52,386 INFO L85 PathProgramCache]: Analyzing trace with hash -847250975, now seen corresponding path program 1 times [2025-03-08 04:26:52,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:26:52,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213290746] [2025-03-08 04:26:52,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:26:52,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:26:52,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-08 04:26:52,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-08 04:26:52,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:26:52,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:26:52,954 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-08 04:26:52,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:26:52,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213290746] [2025-03-08 04:26:52,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213290746] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:26:52,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [820885969] [2025-03-08 04:26:52,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:26:52,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:26:52,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:26:52,957 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-08 04:26:52,958 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-08 04:26:53,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-08 04:26:53,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-08 04:26:53,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:26:53,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:26:53,144 INFO L256 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-03-08 04:26:53,147 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:26:53,178 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-08 04:26:53,184 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-08 04:26:53,187 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-08 04:26:53,197 WARN L873 $PredicateComparison]: unable to prove that (exists ((v_append_to_queue_~q.offset_27 Int)) (let ((.cse1 (select |c_old(#memory_$Pointer$#2.offset)| |c_append_to_queue_#in~q.base|)) (.cse2 (select |c_old(#memory_$Pointer$#2.base)| |c_append_to_queue_#in~q.base|)) (.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_append_to_queue_#in~q.base|) v_append_to_queue_~q.offset_27))) (and (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 12) (select .cse1 v_append_to_queue_~q.offset_27)) (= (select (select |c_#memory_$Pointer$#1.base| .cse0) 12) (select .cse2 v_append_to_queue_~q.offset_27)) (= |c_#memory_$Pointer$#2.offset| (store |c_old(#memory_$Pointer$#2.offset)| |c_append_to_queue_#in~q.base| (store .cse1 v_append_to_queue_~q.offset_27 0))) (= (store |c_old(#memory_$Pointer$#2.base)| |c_append_to_queue_#in~q.base| (store .cse2 v_append_to_queue_~q.offset_27 .cse0)) |c_#memory_$Pointer$#2.base|)))) is different from true [2025-03-08 04:26:53,222 INFO L349 Elim1Store]: treesize reduction 16, result has 50.0 percent of original size [2025-03-08 04:26:53,223 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-08 04:26:53,242 INFO L349 Elim1Store]: treesize reduction 16, result has 55.6 percent of original size [2025-03-08 04:26:53,243 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-08 04:26:53,510 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:26:53,510 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-08 04:26:53,544 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:26:53,544 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-08 04:26:53,946 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-08 04:26:53,947 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:26:54,146 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-08 04:26:54,151 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 180 treesize of output 176 [2025-03-08 04:26:54,158 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 320 treesize of output 300 [2025-03-08 04:26:54,328 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 04:26:54,329 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-08 04:26:54,334 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-08 04:26:54,351 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-08 04:26:54,355 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-08 04:26:54,414 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 04:26:54,415 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-08 04:26:54,431 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-08 04:26:54,550 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-08 04:26:54,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [820885969] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:26:54,550 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 04:26:54,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 9] total 18 [2025-03-08 04:26:54,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828812674] [2025-03-08 04:26:54,550 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 04:26:54,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-08 04:26:54,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:26:54,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-08 04:26:54,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=223, Unknown=1, NotChecked=30, Total=306 [2025-03-08 04:26:54,551 INFO L87 Difference]: Start difference. First operand 141 states and 187 transitions. Second operand has 18 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 16 states have internal predecessors, (58), 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-08 04:26:55,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:26:55,058 INFO L93 Difference]: Finished difference Result 178 states and 240 transitions. [2025-03-08 04:26:55,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 04:26:55,058 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 16 states have internal predecessors, (58), 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 32 [2025-03-08 04:26:55,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:26:55,059 INFO L225 Difference]: With dead ends: 178 [2025-03-08 04:26:55,059 INFO L226 Difference]: Without dead ends: 154 [2025-03-08 04:26:55,059 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=68, Invalid=315, Unknown=1, NotChecked=36, Total=420 [2025-03-08 04:26:55,060 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 30 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 111 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 04:26:55,060 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 419 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 219 Invalid, 0 Unknown, 111 Unchecked, 0.4s Time] [2025-03-08 04:26:55,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-03-08 04:26:55,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 139. [2025-03-08 04:26:55,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 121 states have (on average 1.3057851239669422) internal successors, (158), 122 states have internal predecessors, (158), 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-08 04:26:55,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 184 transitions. [2025-03-08 04:26:55,072 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 184 transitions. Word has length 32 [2025-03-08 04:26:55,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:26:55,072 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 184 transitions. [2025-03-08 04:26:55,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 16 states have internal predecessors, (58), 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-08 04:26:55,072 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 184 transitions. [2025-03-08 04:26:55,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-08 04:26:55,073 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:26:55,073 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] [2025-03-08 04:26:55,081 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-08 04:26:55,273 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-08 04:26:55,274 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:26:55,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:26:55,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1503807628, now seen corresponding path program 1 times [2025-03-08 04:26:55,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:26:55,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262984118] [2025-03-08 04:26:55,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:26:55,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:26:55,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-08 04:26:55,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-08 04:26:55,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:26:55,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:26:56,312 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-08 04:26:56,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:26:56,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262984118] [2025-03-08 04:26:56,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262984118] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:26:56,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [819849868] [2025-03-08 04:26:56,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:26:56,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:26:56,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:26:56,314 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-08 04:26:56,316 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-08 04:26:56,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-08 04:26:56,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-08 04:26:56,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:26:56,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:26:56,637 INFO L256 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 111 conjuncts are in the unsatisfiable core [2025-03-08 04:26:56,641 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:26:56,646 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-08 04:26:56,815 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 26 treesize of output 14 [2025-03-08 04:26:56,873 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 42 treesize of output 35 [2025-03-08 04:26:56,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:26:56,878 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2025-03-08 04:26:56,886 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 45 treesize of output 11 [2025-03-08 04:26:56,893 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-08 04:26:56,940 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-08 04:26:57,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:26:57,022 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-08 04:26:57,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:26:57,109 INFO L349 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2025-03-08 04:26:57,109 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 24 [2025-03-08 04:26:57,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:26:57,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2025-03-08 04:26:57,222 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2025-03-08 04:26:57,298 INFO L349 Elim1Store]: treesize reduction 13, result has 60.6 percent of original size [2025-03-08 04:26:57,298 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-08 04:26:57,302 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 51 treesize of output 40 [2025-03-08 04:26:57,310 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 35 treesize of output 24 [2025-03-08 04:26:57,322 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 18 [2025-03-08 04:26:57,436 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 34 treesize of output 22 [2025-03-08 04:26:57,478 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-08 04:26:57,479 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:26:57,604 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:26:57,604 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 38 [2025-03-08 04:26:57,617 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_append_to_queue_~node~0.base_39 Int) (v_ArrVal_1748 Int) (v_arrayElimArr_4 (Array Int Int)) (|v_append_to_queue_~#p.base_62| Int) (v_ArrVal_1749 (Array Int Int))) (or (< (mod (select (select (store |c_#memory_int#1| v_append_to_queue_~node~0.base_39 v_arrayElimArr_4) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#normal_queue~0#1.base| v_ArrVal_1749) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|)) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#normal_queue~0#1.base| (store (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset| 0)) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|)) 4294967296) 500) (not (= 0 (select (store |c_#valid| |v_append_to_queue_~#p.base_62| v_ArrVal_1748) v_append_to_queue_~node~0.base_39))) (not (= 0 (select |c_#valid| |v_append_to_queue_~#p.base_62|))))) is different from false [2025-03-08 04:26:57,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [819849868] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:26:57,618 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 04:26:57,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 30 [2025-03-08 04:26:57,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426241770] [2025-03-08 04:26:57,618 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 04:26:57,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-08 04:26:57,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:26:57,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-08 04:26:57,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=859, Unknown=1, NotChecked=60, Total=1056 [2025-03-08 04:26:57,620 INFO L87 Difference]: Start difference. First operand 139 states and 184 transitions. Second operand has 30 states, 28 states have (on average 1.9642857142857142) internal successors, (55), 28 states have internal predecessors, (55), 4 states have call successors, (4), 3 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-08 04:26:59,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:26:59,260 INFO L93 Difference]: Finished difference Result 185 states and 254 transitions. [2025-03-08 04:26:59,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-08 04:26:59,260 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 28 states have (on average 1.9642857142857142) internal successors, (55), 28 states have internal predecessors, (55), 4 states have call successors, (4), 3 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 33 [2025-03-08 04:26:59,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:26:59,262 INFO L225 Difference]: With dead ends: 185 [2025-03-08 04:26:59,262 INFO L226 Difference]: Without dead ends: 183 [2025-03-08 04:26:59,263 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 644 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=417, Invalid=2238, Unknown=1, NotChecked=100, Total=2756 [2025-03-08 04:26:59,263 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 59 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 1240 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 1261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:26:59,263 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 498 Invalid, 1261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1240 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 04:26:59,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2025-03-08 04:26:59,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 151. [2025-03-08 04:26:59,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 132 states have (on average 1.3257575757575757) internal successors, (175), 133 states have internal predecessors, (175), 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-08 04:26:59,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 203 transitions. [2025-03-08 04:26:59,274 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 203 transitions. Word has length 33 [2025-03-08 04:26:59,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:26:59,274 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 203 transitions. [2025-03-08 04:26:59,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 28 states have (on average 1.9642857142857142) internal successors, (55), 28 states have internal predecessors, (55), 4 states have call successors, (4), 3 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-08 04:26:59,274 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 203 transitions. [2025-03-08 04:26:59,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-08 04:26:59,275 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:26:59,275 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] [2025-03-08 04:26:59,285 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-08 04:26:59,475 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-08 04:26:59,476 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:26:59,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:26:59,476 INFO L85 PathProgramCache]: Analyzing trace with hash -417292140, now seen corresponding path program 2 times [2025-03-08 04:26:59,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:26:59,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216676154] [2025-03-08 04:26:59,476 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 04:26:59,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:26:59,500 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-03-08 04:26:59,513 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-03-08 04:26:59,513 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 04:26:59,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:26:59,800 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-08 04:26:59,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:26:59,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216676154] [2025-03-08 04:26:59,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216676154] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:26:59,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [955537278] [2025-03-08 04:26:59,800 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 04:26:59,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:26:59,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:26:59,802 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-08 04:26:59,803 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-08 04:26:59,973 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-03-08 04:27:00,020 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-03-08 04:27:00,020 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 04:27:00,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:27:00,022 INFO L256 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-03-08 04:27:00,024 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:27:00,029 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-08 04:27:00,087 WARN L851 $PredicateComparison]: unable to prove that (and (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$#2.offset| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0) (exists ((|v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_9| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_9| |c_#memory_$Pointer$#2.offset|))) (and (= (select (select |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_9| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0) (= .cse0 |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) (= |c_#memory_$Pointer$#2.offset| (store |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_9| .cse0 (select |c_#memory_$Pointer$#2.offset| .cse0))))))) (= (select (select |c_#memory_$Pointer$#2.base| |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-08 04:27:00,088 WARN L873 $PredicateComparison]: unable to prove that (and (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$#2.offset| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0) (exists ((|v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_9| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_9| |c_#memory_$Pointer$#2.offset|))) (and (= (select (select |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_9| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0) (= .cse0 |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) (= |c_#memory_$Pointer$#2.offset| (store |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_9| .cse0 (select |c_#memory_$Pointer$#2.offset| .cse0))))))) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0)) is different from true [2025-03-08 04:27:00,159 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-08 04:27:00,159 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:27:00,192 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2041 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#normal_queue~0#1.base| v_ArrVal_2041) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0)) (forall ((v_ArrVal_2040 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#normal_queue~0#1.base| v_ArrVal_2040) |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-08 04:27:00,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [955537278] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:27:00,193 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 04:27:00,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 8 [2025-03-08 04:27:00,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689885470] [2025-03-08 04:27:00,193 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 04:27:00,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 04:27:00,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:27:00,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 04:27:00,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=30, Unknown=3, NotChecked=22, Total=72 [2025-03-08 04:27:00,194 INFO L87 Difference]: Start difference. First operand 151 states and 203 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 04:27:00,257 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0))) (and .cse0 (not (= |c_ULTIMATE.start_main_~#normal_queue~0#1.base| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|)) (or .cse0 (exists ((|v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_9| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_9| |c_#memory_$Pointer$#2.offset|))) (and (= (select (select |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_9| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0) (= .cse1 |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) (= |c_#memory_$Pointer$#2.offset| (store |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_9| .cse1 (select |c_#memory_$Pointer$#2.offset| .cse1))))))) (= (select (select |c_#memory_$Pointer$#2.base| |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-08 04:27:00,259 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0))) (and .cse0 (not (= |c_ULTIMATE.start_main_~#normal_queue~0#1.base| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|)) (or .cse0 (exists ((|v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_9| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_9| |c_#memory_$Pointer$#2.offset|))) (and (= (select (select |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_9| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0) (= .cse1 |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) (= |c_#memory_$Pointer$#2.offset| (store |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_9| .cse1 (select |c_#memory_$Pointer$#2.offset| .cse1))))))) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0))) is different from true [2025-03-08 04:27:00,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:27:00,298 INFO L93 Difference]: Finished difference Result 188 states and 252 transitions. [2025-03-08 04:27:00,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 04:27:00,299 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 33 [2025-03-08 04:27:00,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:27:00,300 INFO L225 Difference]: With dead ends: 188 [2025-03-08 04:27:00,300 INFO L226 Difference]: Without dead ends: 164 [2025-03-08 04:27:00,300 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=30, Unknown=5, NotChecked=36, Total=90 [2025-03-08 04:27:00,300 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 8 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 72 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 04:27:00,300 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 183 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 65 Invalid, 0 Unknown, 72 Unchecked, 0.1s Time] [2025-03-08 04:27:00,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-03-08 04:27:00,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 162. [2025-03-08 04:27:00,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 142 states have (on average 1.3309859154929577) internal successors, (189), 143 states have internal predecessors, (189), 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-08 04:27:00,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 219 transitions. [2025-03-08 04:27:00,312 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 219 transitions. Word has length 33 [2025-03-08 04:27:00,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:27:00,312 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 219 transitions. [2025-03-08 04:27:00,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 04:27:00,313 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 219 transitions. [2025-03-08 04:27:00,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-08 04:27:00,313 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:27:00,313 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, 1] [2025-03-08 04:27:00,320 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-08 04:27:00,513 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-08 04:27:00,514 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:27:00,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:27:00,514 INFO L85 PathProgramCache]: Analyzing trace with hash 794554326, now seen corresponding path program 2 times [2025-03-08 04:27:00,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:27:00,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342603089] [2025-03-08 04:27:00,515 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 04:27:00,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:27:00,541 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-03-08 04:27:00,585 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-03-08 04:27:00,589 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 04:27:00,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:27:02,224 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:27:02,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:27:02,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342603089] [2025-03-08 04:27:02,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342603089] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:27:02,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1003421141] [2025-03-08 04:27:02,225 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 04:27:02,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:27:02,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:27:02,226 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-08 04:27:02,227 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-08 04:27:02,398 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-03-08 04:27:02,445 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-03-08 04:27:02,446 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 04:27:02,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:27:02,448 INFO L256 TraceCheckSpWp]: Trace formula consists of 633 conjuncts, 98 conjuncts are in the unsatisfiable core [2025-03-08 04:27:02,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:27:02,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 29 treesize of output 1 [2025-03-08 04:27:02,461 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 32 treesize of output 20 [2025-03-08 04:27:02,491 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-08 04:27:02,497 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-08 04:27:02,500 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-08 04:27:02,504 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-08 04:27:02,538 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-08 04:27:02,544 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-08 04:27:02,546 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-08 04:27:02,585 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-08 04:27:02,588 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 42 treesize of output 19 [2025-03-08 04:27:02,597 INFO L349 Elim1Store]: treesize reduction 37, result has 43.9 percent of original size [2025-03-08 04:27:02,597 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 32 treesize of output 35 [2025-03-08 04:27:02,645 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 30 [2025-03-08 04:27:02,897 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 27 treesize of output 15 [2025-03-08 04:27:02,899 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-08 04:27:02,939 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-08 04:27:02,939 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:27:03,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1003421141] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:27:03,341 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 04:27:03,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17] total 28 [2025-03-08 04:27:03,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535354772] [2025-03-08 04:27:03,341 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 04:27:03,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-08 04:27:03,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:27:03,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-08 04:27:03,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1013, Unknown=7, NotChecked=0, Total=1122 [2025-03-08 04:27:03,342 INFO L87 Difference]: Start difference. First operand 162 states and 219 transitions. Second operand has 28 states, 26 states have (on average 2.1538461538461537) internal successors, (56), 27 states have internal predecessors, (56), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-08 04:27:07,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:27:07,490 INFO L93 Difference]: Finished difference Result 285 states and 378 transitions. [2025-03-08 04:27:07,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-03-08 04:27:07,490 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 2.1538461538461537) internal successors, (56), 27 states have internal predecessors, (56), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 40 [2025-03-08 04:27:07,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:27:07,492 INFO L225 Difference]: With dead ends: 285 [2025-03-08 04:27:07,492 INFO L226 Difference]: Without dead ends: 264 [2025-03-08 04:27:07,494 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 692 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=342, Invalid=3191, Unknown=7, NotChecked=0, Total=3540 [2025-03-08 04:27:07,494 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 112 mSDsluCounter, 955 mSDsCounter, 0 mSdLazyCounter, 1731 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 1015 SdHoareTripleChecker+Invalid, 1757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2025-03-08 04:27:07,495 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 1015 Invalid, 1757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1731 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2025-03-08 04:27:07,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2025-03-08 04:27:07,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 205. [2025-03-08 04:27:07,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 179 states have (on average 1.324022346368715) internal successors, (237), 180 states have internal predecessors, (237), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-08 04:27:07,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 277 transitions. [2025-03-08 04:27:07,515 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 277 transitions. Word has length 40 [2025-03-08 04:27:07,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:27:07,515 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 277 transitions. [2025-03-08 04:27:07,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 26 states have (on average 2.1538461538461537) internal successors, (56), 27 states have internal predecessors, (56), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-08 04:27:07,516 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 277 transitions. [2025-03-08 04:27:07,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-08 04:27:07,516 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:27:07,516 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:27:07,525 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-08 04:27:07,716 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-08 04:27:07,717 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:27:07,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:27:07,717 INFO L85 PathProgramCache]: Analyzing trace with hash -721320783, now seen corresponding path program 1 times [2025-03-08 04:27:07,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:27:07,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545903281] [2025-03-08 04:27:07,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:27:07,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:27:07,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-08 04:27:07,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-08 04:27:07,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:27:07,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:27:09,044 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:27:09,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:27:09,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545903281] [2025-03-08 04:27:09,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545903281] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:27:09,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [353544597] [2025-03-08 04:27:09,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:27:09,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:27:09,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:27:09,047 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-08 04:27:09,048 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-08 04:27:09,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-08 04:27:09,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-08 04:27:09,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:27:09,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:27:09,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 638 conjuncts, 106 conjuncts are in the unsatisfiable core [2025-03-08 04:27:09,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:27:09,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 29 treesize of output 1 [2025-03-08 04:27:09,302 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 32 treesize of output 20 [2025-03-08 04:27:09,334 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-08 04:27:09,343 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-08 04:27:09,348 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 42 treesize of output 35 [2025-03-08 04:27:09,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:27:09,352 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2025-03-08 04:27:09,358 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 45 treesize of output 11 [2025-03-08 04:27:09,362 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-08 04:27:09,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:27:09,413 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-08 04:27:09,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:27:09,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:27:09,447 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-08 04:27:09,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:27:09,469 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-08 04:27:09,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 30 treesize of output 31 [2025-03-08 04:27:09,543 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-08 04:27:09,551 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-08 04:27:09,628 INFO L349 Elim1Store]: treesize reduction 17, result has 58.5 percent of original size [2025-03-08 04:27:09,628 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 45 treesize of output 54 [2025-03-08 04:27:09,632 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 28 treesize of output 15 [2025-03-08 04:27:09,639 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 62 treesize of output 31 [2025-03-08 04:27:09,657 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-08 04:27:09,717 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 30 [2025-03-08 04:27:09,845 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 27 treesize of output 15 [2025-03-08 04:27:09,848 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 7 treesize of output 3 [2025-03-08 04:27:09,866 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:27:09,866 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:27:10,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [353544597] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:27:10,103 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 04:27:10,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 24 [2025-03-08 04:27:10,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344954998] [2025-03-08 04:27:10,103 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 04:27:10,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-08 04:27:10,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:27:10,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-08 04:27:10,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=677, Unknown=0, NotChecked=0, Total=756 [2025-03-08 04:27:10,104 INFO L87 Difference]: Start difference. First operand 205 states and 277 transitions. Second operand has 24 states, 23 states have (on average 2.608695652173913) internal successors, (60), 23 states have internal predecessors, (60), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-08 04:27:13,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:27:13,501 INFO L93 Difference]: Finished difference Result 302 states and 400 transitions. [2025-03-08 04:27:13,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-03-08 04:27:13,501 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.608695652173913) internal successors, (60), 23 states have internal predecessors, (60), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 41 [2025-03-08 04:27:13,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:27:13,503 INFO L225 Difference]: With dead ends: 302 [2025-03-08 04:27:13,503 INFO L226 Difference]: Without dead ends: 281 [2025-03-08 04:27:13,503 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 535 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=325, Invalid=2431, Unknown=0, NotChecked=0, Total=2756 [2025-03-08 04:27:13,504 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 95 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 1362 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 1387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-03-08 04:27:13,505 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 624 Invalid, 1387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1362 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-03-08 04:27:13,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2025-03-08 04:27:13,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 205. [2025-03-08 04:27:13,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 179 states have (on average 1.324022346368715) internal successors, (237), 180 states have internal predecessors, (237), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-08 04:27:13,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 277 transitions. [2025-03-08 04:27:13,527 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 277 transitions. Word has length 41 [2025-03-08 04:27:13,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:27:13,528 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 277 transitions. [2025-03-08 04:27:13,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.608695652173913) internal successors, (60), 23 states have internal predecessors, (60), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-08 04:27:13,528 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 277 transitions. [2025-03-08 04:27:13,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-08 04:27:13,528 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:27:13,528 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, 1] [2025-03-08 04:27:13,538 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-08 04:27:13,729 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-08 04:27:13,729 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:27:13,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:27:13,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1319250704, now seen corresponding path program 1 times [2025-03-08 04:27:13,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:27:13,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264467600] [2025-03-08 04:27:13,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:27:13,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:27:13,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-08 04:27:13,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-08 04:27:13,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:27:13,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:27:15,724 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-08 04:27:15,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:27:15,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264467600] [2025-03-08 04:27:15,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264467600] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:27:15,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [604604570] [2025-03-08 04:27:15,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:27:15,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:27:15,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:27:15,726 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-08 04:27:15,727 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-08 04:27:15,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-08 04:27:15,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-08 04:27:15,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:27:15,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:27:15,988 INFO L256 TraceCheckSpWp]: Trace formula consists of 635 conjuncts, 110 conjuncts are in the unsatisfiable core [2025-03-08 04:27:15,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:27:15,996 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-08 04:27:16,020 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-08 04:27:16,024 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-08 04:27:16,057 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-08 04:27:16,062 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-08 04:27:16,300 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 38 treesize of output 35 [2025-03-08 04:27:16,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 25 treesize of output 7 [2025-03-08 04:27:16,309 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:27:16,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 18 [2025-03-08 04:27:16,313 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 29 treesize of output 7 [2025-03-08 04:27:16,372 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-08 04:27:16,383 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-03-08 04:27:16,384 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-08 04:27:16,393 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-03-08 04:27:16,393 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-08 04:27:16,408 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-08 04:27:16,469 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-08 04:27:16,512 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:27:16,512 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-08 04:27:16,628 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-08 04:27:16,629 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:27:16,924 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:27:16,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 26 treesize of output 8 [2025-03-08 04:27:16,930 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:27:16,930 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 1 case distinctions, treesize of input 25 treesize of output 13 [2025-03-08 04:27:16,939 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:27:16,939 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 35 treesize of output 36 [2025-03-08 04:27:17,020 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (not (= (mod (+ (* 4294967295 |c_ULTIMATE.start_main_#t~mem43#1|) 1) 4294967296) 0)))) (and (forall ((v_ArrVal_3121 (Array Int Int)) (v_ArrVal_3122 (Array Int Int)) (v_ArrVal_3119 (Array Int Int)) (v_append_to_queue_~node~0.base_68 Int)) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#normal_queue~0#1.base| v_ArrVal_3121) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|))) (or (= (select (select (store |c_#memory_$Pointer$#1.base| v_append_to_queue_~node~0.base_68 v_ArrVal_3122) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#normal_queue~0#1.base| v_ArrVal_3119) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|)) (+ .cse0 12)) 0) (= .cse0 0)))) (or (forall ((v_ArrVal_3120 (Array Int Int)) (v_ArrVal_3121 (Array Int Int)) (v_ArrVal_3119 (Array Int Int)) (v_append_to_queue_~node~0.base_68 Int)) (= (select (select (store |c_#memory_$Pointer$#1.offset| v_append_to_queue_~node~0.base_68 v_ArrVal_3120) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#normal_queue~0#1.base| v_ArrVal_3119) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#normal_queue~0#1.base| v_ArrVal_3121) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 12)) 0)) .cse1) (forall ((v_ArrVal_3120 (Array Int Int)) (v_ArrVal_3121 (Array Int Int)) (v_ArrVal_3119 (Array Int Int)) (v_append_to_queue_~node~0.base_68 Int)) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#normal_queue~0#1.base| v_ArrVal_3119) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|))) (or (= .cse2 v_append_to_queue_~node~0.base_68) (= (select (select (store |c_#memory_$Pointer$#1.offset| v_append_to_queue_~node~0.base_68 v_ArrVal_3120) .cse2) (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#normal_queue~0#1.base| v_ArrVal_3121) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 12)) 0)))) (forall ((v_ArrVal_3121 (Array Int Int)) (v_ArrVal_3122 (Array Int Int)) (v_ArrVal_3119 (Array Int Int)) (v_append_to_queue_~node~0.base_68 Int)) (let ((.cse3 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#normal_queue~0#1.base| v_ArrVal_3119) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|))) (or (= .cse3 v_append_to_queue_~node~0.base_68) (= (select (select (store |c_#memory_$Pointer$#1.base| v_append_to_queue_~node~0.base_68 v_ArrVal_3122) .cse3) (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#normal_queue~0#1.base| v_ArrVal_3121) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 12)) 0)))) (forall ((v_ArrVal_3120 (Array Int Int)) (v_ArrVal_3121 (Array Int Int)) (v_ArrVal_3119 (Array Int Int)) (v_append_to_queue_~node~0.base_68 Int)) (let ((.cse4 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#normal_queue~0#1.base| v_ArrVal_3121) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|))) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| v_append_to_queue_~node~0.base_68 v_ArrVal_3120) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#normal_queue~0#1.base| v_ArrVal_3119) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|)) (+ .cse4 12)) 0) (= .cse4 0)))) (or (forall ((v_ArrVal_3121 (Array Int Int)) (v_ArrVal_3122 (Array Int Int)) (v_ArrVal_3119 (Array Int Int)) (v_append_to_queue_~node~0.base_68 Int)) (= (select (select (store |c_#memory_$Pointer$#1.base| v_append_to_queue_~node~0.base_68 v_ArrVal_3122) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#normal_queue~0#1.base| v_ArrVal_3119) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#normal_queue~0#1.base| v_ArrVal_3121) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 12)) 0)) .cse1))) is different from false [2025-03-08 04:27:17,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [604604570] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:27:17,024 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 04:27:17,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 19] total 26 [2025-03-08 04:27:17,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691552584] [2025-03-08 04:27:17,024 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 04:27:17,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-08 04:27:17,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:27:17,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-08 04:27:17,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=762, Unknown=1, NotChecked=56, Total=930 [2025-03-08 04:27:17,027 INFO L87 Difference]: Start difference. First operand 205 states and 277 transitions. Second operand has 26 states, 25 states have (on average 2.4) internal successors, (60), 23 states have internal predecessors, (60), 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-08 04:27:19,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:27:19,903 INFO L93 Difference]: Finished difference Result 458 states and 628 transitions. [2025-03-08 04:27:19,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-08 04:27:19,904 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.4) internal successors, (60), 23 states have internal predecessors, (60), 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 41 [2025-03-08 04:27:19,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:27:19,910 INFO L225 Difference]: With dead ends: 458 [2025-03-08 04:27:19,910 INFO L226 Difference]: Without dead ends: 426 [2025-03-08 04:27:19,911 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 451 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=258, Invalid=1907, Unknown=1, NotChecked=90, Total=2256 [2025-03-08 04:27:19,912 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 117 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 931 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 1024 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 931 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:27:19,912 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 548 Invalid, 1024 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 931 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-08 04:27:19,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2025-03-08 04:27:19,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 314. [2025-03-08 04:27:19,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 276 states have (on average 1.3333333333333333) internal successors, (368), 277 states have internal predecessors, (368), 31 states have call successors, (31), 5 states have call predecessors, (31), 5 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-08 04:27:19,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 430 transitions. [2025-03-08 04:27:19,983 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 430 transitions. Word has length 41 [2025-03-08 04:27:19,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:27:19,984 INFO L471 AbstractCegarLoop]: Abstraction has 314 states and 430 transitions. [2025-03-08 04:27:19,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.4) internal successors, (60), 23 states have internal predecessors, (60), 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-08 04:27:19,984 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 430 transitions. [2025-03-08 04:27:19,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-08 04:27:19,987 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:27:19,987 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, 1] [2025-03-08 04:27:19,999 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-08 04:27:20,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-08 04:27:20,188 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:27:20,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:27:20,188 INFO L85 PathProgramCache]: Analyzing trace with hash 19488454, now seen corresponding path program 1 times [2025-03-08 04:27:20,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:27:20,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934964881] [2025-03-08 04:27:20,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:27:20,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:27:20,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-08 04:27:20,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-08 04:27:20,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:27:20,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:27:21,672 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-08 04:27:21,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:27:21,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934964881] [2025-03-08 04:27:21,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934964881] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:27:21,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1324151350] [2025-03-08 04:27:21,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:27:21,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:27:21,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:27:21,674 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 04:27:21,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-08 04:27:21,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-08 04:27:21,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-08 04:27:21,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:27:21,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:27:21,989 INFO L256 TraceCheckSpWp]: Trace formula consists of 635 conjuncts, 130 conjuncts are in the unsatisfiable core [2025-03-08 04:27:21,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:27:22,081 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-08 04:27:22,143 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-08 04:27:22,156 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-08 04:27:22,162 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-08 04:27:22,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 15 treesize of output 11 [2025-03-08 04:27:22,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:27:22,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:27:22,171 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 25 treesize of output 13 [2025-03-08 04:27:22,243 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-08 04:27:22,247 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-08 04:27:22,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:27:22,297 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-08 04:27:22,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:27:22,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:27:22,371 INFO L349 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2025-03-08 04:27:22,371 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 24 [2025-03-08 04:27:22,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:27:22,379 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-08 04:27:22,429 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 54 treesize of output 34 [2025-03-08 04:27:22,433 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-08 04:27:22,437 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-08 04:27:22,440 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 9 treesize of output 5 [2025-03-08 04:27:22,443 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 5 treesize of output 3 [2025-03-08 04:27:22,480 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-08 04:27:22,485 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-08 04:27:22,615 INFO L349 Elim1Store]: treesize reduction 17, result has 58.5 percent of original size [2025-03-08 04:27:22,616 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 45 treesize of output 54 [2025-03-08 04:27:22,622 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 28 treesize of output 15 [2025-03-08 04:27:22,637 INFO L349 Elim1Store]: treesize reduction 16, result has 50.0 percent of original size [2025-03-08 04:27:22,637 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-08 04:27:22,668 INFO L349 Elim1Store]: treesize reduction 16, result has 55.6 percent of original size [2025-03-08 04:27:22,668 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 86 treesize of output 66 [2025-03-08 04:27:22,675 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 24 treesize of output 11 [2025-03-08 04:27:22,679 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 26 treesize of output 13 [2025-03-08 04:27:22,935 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:27:22,936 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 172 treesize of output 136 [2025-03-08 04:27:22,952 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:27:22,952 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 116 treesize of output 128 [2025-03-08 04:27:23,320 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:27:23,321 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 76 treesize of output 63 [2025-03-08 04:27:23,327 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:27:23,327 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-08 04:27:23,448 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:27:23,448 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:27:23,831 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:27:23,831 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 152 treesize of output 148 [2025-03-08 04:27:23,838 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:27:23,839 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 132 treesize of output 128 [2025-03-08 04:27:24,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1324151350] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:27:24,119 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 04:27:24,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 31 [2025-03-08 04:27:24,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517314027] [2025-03-08 04:27:24,119 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 04:27:24,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-08 04:27:24,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:27:24,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-08 04:27:24,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1150, Unknown=2, NotChecked=0, Total=1260 [2025-03-08 04:27:24,121 INFO L87 Difference]: Start difference. First operand 314 states and 430 transitions. Second operand has 31 states, 29 states have (on average 2.310344827586207) internal successors, (67), 28 states have internal predecessors, (67), 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-08 04:27:29,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:27:29,338 INFO L93 Difference]: Finished difference Result 495 states and 681 transitions. [2025-03-08 04:27:29,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2025-03-08 04:27:29,339 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 29 states have (on average 2.310344827586207) internal successors, (67), 28 states have internal predecessors, (67), 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 41 [2025-03-08 04:27:29,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:27:29,342 INFO L225 Difference]: With dead ends: 495 [2025-03-08 04:27:29,342 INFO L226 Difference]: Without dead ends: 493 [2025-03-08 04:27:29,345 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2338 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=768, Invalid=8158, Unknown=4, NotChecked=0, Total=8930 [2025-03-08 04:27:29,346 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 139 mSDsluCounter, 864 mSDsCounter, 0 mSdLazyCounter, 2387 mSolverCounterSat, 34 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 935 SdHoareTripleChecker+Invalid, 2430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 2387 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-08 04:27:29,347 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 935 Invalid, 2430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 2387 Invalid, 9 Unknown, 0 Unchecked, 2.6s Time] [2025-03-08 04:27:29,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2025-03-08 04:27:29,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 379. [2025-03-08 04:27:29,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 332 states have (on average 1.322289156626506) internal successors, (439), 333 states have internal predecessors, (439), 39 states have call successors, (39), 6 states have call predecessors, (39), 6 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-08 04:27:29,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 517 transitions. [2025-03-08 04:27:29,396 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 517 transitions. Word has length 41 [2025-03-08 04:27:29,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:27:29,396 INFO L471 AbstractCegarLoop]: Abstraction has 379 states and 517 transitions. [2025-03-08 04:27:29,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 29 states have (on average 2.310344827586207) internal successors, (67), 28 states have internal predecessors, (67), 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-08 04:27:29,396 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 517 transitions. [2025-03-08 04:27:29,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-08 04:27:29,398 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:27:29,398 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, 1, 1] [2025-03-08 04:27:29,406 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-08 04:27:29,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:27:29,598 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:27:29,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:27:29,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1232321131, now seen corresponding path program 2 times [2025-03-08 04:27:29,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:27:29,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187807463] [2025-03-08 04:27:29,600 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 04:27:29,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:27:29,626 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-03-08 04:27:29,635 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-03-08 04:27:29,635 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 04:27:29,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:27:29,895 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-08 04:27:29,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:27:29,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187807463] [2025-03-08 04:27:29,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187807463] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:27:29,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1844103018] [2025-03-08 04:27:29,896 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 04:27:29,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:27:29,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:27:29,897 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 04:27:29,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-08 04:27:30,153 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-03-08 04:27:30,205 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-03-08 04:27:30,205 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 04:27:30,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:27:30,207 INFO L256 TraceCheckSpWp]: Trace formula consists of 653 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-03-08 04:27:30,209 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:27:30,213 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-08 04:27:30,266 WARN L851 $PredicateComparison]: unable to prove that (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$#2.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$#2.offset| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0) (exists ((|v_#memory_$Pointer$#2.offset_BEFORE_CALL_34| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_$Pointer$#2.offset_BEFORE_CALL_34| |c_#memory_$Pointer$#2.offset|))) (and (= (select (select |v_#memory_$Pointer$#2.offset_BEFORE_CALL_34| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0) (= .cse0 |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) (= (store |v_#memory_$Pointer$#2.offset_BEFORE_CALL_34| .cse0 (select |c_#memory_$Pointer$#2.offset| .cse0)) |c_#memory_$Pointer$#2.offset|)))))) is different from false [2025-03-08 04:27:30,268 WARN L873 $PredicateComparison]: unable to prove that (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$#2.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$#2.offset| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0) (exists ((|v_#memory_$Pointer$#2.offset_BEFORE_CALL_34| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_$Pointer$#2.offset_BEFORE_CALL_34| |c_#memory_$Pointer$#2.offset|))) (and (= (select (select |v_#memory_$Pointer$#2.offset_BEFORE_CALL_34| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0) (= .cse0 |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) (= (store |v_#memory_$Pointer$#2.offset_BEFORE_CALL_34| .cse0 (select |c_#memory_$Pointer$#2.offset| .cse0)) |c_#memory_$Pointer$#2.offset|)))))) is different from true [2025-03-08 04:27:30,325 WARN L851 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0) (or (exists ((|v_#memory_$Pointer$#2.base_BEFORE_CALL_34| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_$Pointer$#2.base_BEFORE_CALL_34| |c_#memory_$Pointer$#2.base|))) (and (= (select (select |v_#memory_$Pointer$#2.base_BEFORE_CALL_34| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0) (= (store |v_#memory_$Pointer$#2.base_BEFORE_CALL_34| .cse0 (select |c_#memory_$Pointer$#2.base| .cse0)) |c_#memory_$Pointer$#2.base|) (not (= |c_ULTIMATE.start_main_~#normal_queue~0#1.base| .cse0))))) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0))) is different from false [2025-03-08 04:27:30,327 WARN L873 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0) (or (exists ((|v_#memory_$Pointer$#2.base_BEFORE_CALL_34| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_$Pointer$#2.base_BEFORE_CALL_34| |c_#memory_$Pointer$#2.base|))) (and (= (select (select |v_#memory_$Pointer$#2.base_BEFORE_CALL_34| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0) (= (store |v_#memory_$Pointer$#2.base_BEFORE_CALL_34| .cse0 (select |c_#memory_$Pointer$#2.base| .cse0)) |c_#memory_$Pointer$#2.base|) (not (= |c_ULTIMATE.start_main_~#normal_queue~0#1.base| .cse0))))) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0))) is different from true [2025-03-08 04:27:30,376 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-08 04:27:30,376 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:27:30,424 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3834 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#prio_queue~0#1.base| v_ArrVal_3834) |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0)) (forall ((v_ArrVal_3833 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#prio_queue~0#1.base| v_ArrVal_3833) |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0))) is different from false [2025-03-08 04:27:30,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1844103018] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:27:30,425 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 04:27:30,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10] total 10 [2025-03-08 04:27:30,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890681423] [2025-03-08 04:27:30,426 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 04:27:30,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 04:27:30,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:27:30,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 04:27:30,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=40, Unknown=5, NotChecked=42, Total=110 [2025-03-08 04:27:30,426 INFO L87 Difference]: Start difference. First operand 379 states and 517 transitions. Second operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 7 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 04:27:30,590 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0)) (.cse0 (= (select (select |c_#memory_$Pointer$#2.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|)) .cse0 .cse1 (or (exists ((|v_#memory_$Pointer$#2.base_BEFORE_CALL_34| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_$Pointer$#2.base_BEFORE_CALL_34| |c_#memory_$Pointer$#2.base|))) (and (= (select (select |v_#memory_$Pointer$#2.base_BEFORE_CALL_34| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0) (= (store |v_#memory_$Pointer$#2.base_BEFORE_CALL_34| .cse2 (select |c_#memory_$Pointer$#2.base| .cse2)) |c_#memory_$Pointer$#2.base|) (not (= |c_ULTIMATE.start_main_~#normal_queue~0#1.base| .cse2))))) .cse1) (or .cse0 (exists ((|v_#memory_$Pointer$#2.offset_BEFORE_CALL_34| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_#memory_$Pointer$#2.offset_BEFORE_CALL_34| |c_#memory_$Pointer$#2.offset|))) (and (= (select (select |v_#memory_$Pointer$#2.offset_BEFORE_CALL_34| |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|) (= (store |v_#memory_$Pointer$#2.offset_BEFORE_CALL_34| .cse3 (select |c_#memory_$Pointer$#2.offset| .cse3)) |c_#memory_$Pointer$#2.offset|))))))) is different from false [2025-03-08 04:27:30,593 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0)) (.cse0 (= (select (select |c_#memory_$Pointer$#2.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|)) .cse0 .cse1 (or (exists ((|v_#memory_$Pointer$#2.base_BEFORE_CALL_34| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_$Pointer$#2.base_BEFORE_CALL_34| |c_#memory_$Pointer$#2.base|))) (and (= (select (select |v_#memory_$Pointer$#2.base_BEFORE_CALL_34| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0) (= (store |v_#memory_$Pointer$#2.base_BEFORE_CALL_34| .cse2 (select |c_#memory_$Pointer$#2.base| .cse2)) |c_#memory_$Pointer$#2.base|) (not (= |c_ULTIMATE.start_main_~#normal_queue~0#1.base| .cse2))))) .cse1) (or .cse0 (exists ((|v_#memory_$Pointer$#2.offset_BEFORE_CALL_34| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_#memory_$Pointer$#2.offset_BEFORE_CALL_34| |c_#memory_$Pointer$#2.offset|))) (and (= (select (select |v_#memory_$Pointer$#2.offset_BEFORE_CALL_34| |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|) (= (store |v_#memory_$Pointer$#2.offset_BEFORE_CALL_34| .cse3 (select |c_#memory_$Pointer$#2.offset| .cse3)) |c_#memory_$Pointer$#2.offset|))))))) is different from true [2025-03-08 04:27:30,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:27:30,694 INFO L93 Difference]: Finished difference Result 487 states and 661 transitions. [2025-03-08 04:27:30,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 04:27:30,694 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 7 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) Word has length 42 [2025-03-08 04:27:30,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:27:30,696 INFO L225 Difference]: With dead ends: 487 [2025-03-08 04:27:30,696 INFO L226 Difference]: Without dead ends: 463 [2025-03-08 04:27:30,696 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 61 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=65, Unknown=7, NotChecked=76, Total=182 [2025-03-08 04:27:30,697 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 29 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 171 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 04:27:30,697 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 191 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 66 Invalid, 0 Unknown, 171 Unchecked, 0.2s Time] [2025-03-08 04:27:30,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2025-03-08 04:27:30,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 419. [2025-03-08 04:27:30,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 367 states have (on average 1.3215258855585832) internal successors, (485), 368 states have internal predecessors, (485), 43 states have call successors, (43), 7 states have call predecessors, (43), 7 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2025-03-08 04:27:30,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 571 transitions. [2025-03-08 04:27:30,738 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 571 transitions. Word has length 42 [2025-03-08 04:27:30,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:27:30,738 INFO L471 AbstractCegarLoop]: Abstraction has 419 states and 571 transitions. [2025-03-08 04:27:30,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 7 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 04:27:30,738 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 571 transitions. [2025-03-08 04:27:30,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-08 04:27:30,740 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:27:30,740 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:27:30,748 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-08 04:27:30,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:27:30,941 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:27:30,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:27:30,941 INFO L85 PathProgramCache]: Analyzing trace with hash 381884390, now seen corresponding path program 1 times [2025-03-08 04:27:30,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:27:30,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270040168] [2025-03-08 04:27:30,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:27:30,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:27:30,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-08 04:27:30,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-08 04:27:30,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:27:30,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:27:31,193 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 04:27:31,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:27:31,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270040168] [2025-03-08 04:27:31,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270040168] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:27:31,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [73291801] [2025-03-08 04:27:31,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:27:31,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:27:31,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:27:31,196 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 04:27:31,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-08 04:27:31,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-08 04:27:31,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-08 04:27:31,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:27:31,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:27:31,517 INFO L256 TraceCheckSpWp]: Trace formula consists of 658 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-08 04:27:31,519 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:27:31,520 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-08 04:27:31,527 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 15 treesize of output 1 [2025-03-08 04:27:31,568 WARN L851 $PredicateComparison]: unable to prove that (or (not (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0)) (exists ((|v_#memory_$Pointer$#2.base_BEFORE_CALL_36| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_$Pointer$#2.base_BEFORE_CALL_36| |c_#memory_$Pointer$#2.base|))) (and (not (= .cse0 |c_ULTIMATE.start_main_~#prio_queue~0#1.base|)) (not (= (select (select |v_#memory_$Pointer$#2.base_BEFORE_CALL_36| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0)) (= (store |v_#memory_$Pointer$#2.base_BEFORE_CALL_36| .cse0 (select |c_#memory_$Pointer$#2.base| .cse0)) |c_#memory_$Pointer$#2.base|))))) is different from false [2025-03-08 04:27:31,570 WARN L873 $PredicateComparison]: unable to prove that (or (not (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0)) (exists ((|v_#memory_$Pointer$#2.base_BEFORE_CALL_36| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_$Pointer$#2.base_BEFORE_CALL_36| |c_#memory_$Pointer$#2.base|))) (and (not (= .cse0 |c_ULTIMATE.start_main_~#prio_queue~0#1.base|)) (not (= (select (select |v_#memory_$Pointer$#2.base_BEFORE_CALL_36| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0)) (= (store |v_#memory_$Pointer$#2.base_BEFORE_CALL_36| .cse0 (select |c_#memory_$Pointer$#2.base| .cse0)) |c_#memory_$Pointer$#2.base|))))) is different from true [2025-03-08 04:27:31,577 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 16 treesize of output 8 [2025-03-08 04:27:31,579 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 04:27:31,579 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:27:31,597 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4156 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#normal_queue~0#1.base| v_ArrVal_4156) |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-08 04:27:31,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [73291801] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:27:31,597 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 04:27:31,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 10 [2025-03-08 04:27:31,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603954280] [2025-03-08 04:27:31,598 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 04:27:31,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 04:27:31,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:27:31,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 04:27:31,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=55, Unknown=3, NotChecked=30, Total=110 [2025-03-08 04:27:31,598 INFO L87 Difference]: Start difference. First operand 419 states and 571 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 8 states have internal predecessors, (38), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-08 04:27:31,748 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_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|)) .cse0 (or .cse0 (exists ((|v_#memory_$Pointer$#2.base_BEFORE_CALL_36| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_$Pointer$#2.base_BEFORE_CALL_36| |c_#memory_$Pointer$#2.base|))) (and (not (= .cse1 |c_ULTIMATE.start_main_~#prio_queue~0#1.base|)) (not (= (select (select |v_#memory_$Pointer$#2.base_BEFORE_CALL_36| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0)) (= (store |v_#memory_$Pointer$#2.base_BEFORE_CALL_36| .cse1 (select |c_#memory_$Pointer$#2.base| .cse1)) |c_#memory_$Pointer$#2.base|))))))) is different from false [2025-03-08 04:27:31,749 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_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|)) .cse0 (or .cse0 (exists ((|v_#memory_$Pointer$#2.base_BEFORE_CALL_36| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_$Pointer$#2.base_BEFORE_CALL_36| |c_#memory_$Pointer$#2.base|))) (and (not (= .cse1 |c_ULTIMATE.start_main_~#prio_queue~0#1.base|)) (not (= (select (select |v_#memory_$Pointer$#2.base_BEFORE_CALL_36| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0)) (= (store |v_#memory_$Pointer$#2.base_BEFORE_CALL_36| .cse1 (select |c_#memory_$Pointer$#2.base| .cse1)) |c_#memory_$Pointer$#2.base|))))))) is different from true [2025-03-08 04:27:31,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:27:31,869 INFO L93 Difference]: Finished difference Result 597 states and 810 transitions. [2025-03-08 04:27:31,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 04:27:31,870 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 8 states have internal predecessors, (38), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 43 [2025-03-08 04:27:31,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:27:31,871 INFO L225 Difference]: With dead ends: 597 [2025-03-08 04:27:31,871 INFO L226 Difference]: Without dead ends: 556 [2025-03-08 04:27:31,872 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=101, Unknown=5, NotChecked=66, Total=210 [2025-03-08 04:27:31,872 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 62 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 152 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 04:27:31,872 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 365 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 136 Invalid, 0 Unknown, 152 Unchecked, 0.2s Time] [2025-03-08 04:27:31,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2025-03-08 04:27:31,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 469. [2025-03-08 04:27:31,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 411 states have (on average 1.3187347931873479) internal successors, (542), 412 states have internal predecessors, (542), 49 states have call successors, (49), 7 states have call predecessors, (49), 7 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2025-03-08 04:27:31,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 640 transitions. [2025-03-08 04:27:31,925 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 640 transitions. Word has length 43 [2025-03-08 04:27:31,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:27:31,925 INFO L471 AbstractCegarLoop]: Abstraction has 469 states and 640 transitions. [2025-03-08 04:27:31,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 8 states have internal predecessors, (38), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-08 04:27:31,925 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 640 transitions. [2025-03-08 04:27:31,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-08 04:27:31,926 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:27:31,926 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:27:31,934 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-08 04:27:32,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-03-08 04:27:32,127 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:27:32,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:27:32,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1002194523, now seen corresponding path program 1 times [2025-03-08 04:27:32,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:27:32,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015033545] [2025-03-08 04:27:32,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:27:32,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:27:32,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-08 04:27:32,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-08 04:27:32,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:27:32,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:27:33,061 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 04:27:33,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:27:33,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015033545] [2025-03-08 04:27:33,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015033545] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:27:33,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [605955843] [2025-03-08 04:27:33,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:27:33,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:27:33,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:27:33,063 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 04:27:33,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-08 04:27:33,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-08 04:27:33,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-08 04:27:33,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:27:33,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:27:33,372 INFO L256 TraceCheckSpWp]: Trace formula consists of 655 conjuncts, 129 conjuncts are in the unsatisfiable core [2025-03-08 04:27:33,376 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:27:33,379 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-08 04:27:33,500 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-08 04:27:33,503 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-08 04:27:33,509 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-08 04:27:33,664 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:27:33,665 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 23 treesize of output 23 [2025-03-08 04:27:33,817 INFO L349 Elim1Store]: treesize reduction 6, result has 85.4 percent of original size [2025-03-08 04:27:33,817 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 62 treesize of output 66 [2025-03-08 04:27:33,939 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 18 [2025-03-08 04:27:33,960 INFO L349 Elim1Store]: treesize reduction 33, result has 41.1 percent of original size [2025-03-08 04:27:33,960 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 74 treesize of output 29 [2025-03-08 04:27:33,965 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 43 treesize of output 27 [2025-03-08 04:27:34,846 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:27:34,847 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 79 treesize of output 91 [2025-03-08 04:27:34,869 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:27:34,869 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 59 treesize of output 83 [2025-03-08 04:27:35,093 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-08 04:27:35,093 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 59 treesize of output 39 [2025-03-08 04:27:35,098 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:27:35,098 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:27:35,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [605955843] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:27:35,696 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 04:27:35,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 23] total 35 [2025-03-08 04:27:35,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195291094] [2025-03-08 04:27:35,696 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 04:27:35,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-03-08 04:27:35,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:27:35,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-08 04:27:35,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=1551, Unknown=0, NotChecked=0, Total=1722 [2025-03-08 04:27:35,697 INFO L87 Difference]: Start difference. First operand 469 states and 640 transitions. Second operand has 35 states, 32 states have (on average 2.15625) internal successors, (69), 32 states have internal predecessors, (69), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-08 04:27:42,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:27:42,389 INFO L93 Difference]: Finished difference Result 794 states and 1065 transitions. [2025-03-08 04:27:42,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2025-03-08 04:27:42,390 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 32 states have (on average 2.15625) internal successors, (69), 32 states have internal predecessors, (69), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Word has length 43 [2025-03-08 04:27:42,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:27:42,394 INFO L225 Difference]: With dead ends: 794 [2025-03-08 04:27:42,394 INFO L226 Difference]: Without dead ends: 792 [2025-03-08 04:27:42,396 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2314 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=931, Invalid=7999, Unknown=0, NotChecked=0, Total=8930 [2025-03-08 04:27:42,398 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 240 mSDsluCounter, 851 mSDsCounter, 0 mSdLazyCounter, 1965 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 903 SdHoareTripleChecker+Invalid, 2011 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 1965 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2025-03-08 04:27:42,398 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 903 Invalid, 2011 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 1965 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2025-03-08 04:27:42,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2025-03-08 04:27:42,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 641. [2025-03-08 04:27:42,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 641 states, 570 states have (on average 1.3228070175438595) internal successors, (754), 571 states have internal predecessors, (754), 58 states have call successors, (58), 11 states have call predecessors, (58), 11 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-08 04:27:42,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 870 transitions. [2025-03-08 04:27:42,483 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 870 transitions. Word has length 43 [2025-03-08 04:27:42,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:27:42,484 INFO L471 AbstractCegarLoop]: Abstraction has 641 states and 870 transitions. [2025-03-08 04:27:42,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 32 states have (on average 2.15625) internal successors, (69), 32 states have internal predecessors, (69), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-08 04:27:42,484 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 870 transitions. [2025-03-08 04:27:42,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-08 04:27:42,486 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:27:42,486 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:27:42,494 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0