./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/heap-manipulation/bubble_sort_linux-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/heap-manipulation/bubble_sort_linux-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 a38de44f112a10364737c35b840e673503a211a020b9f494a50e4a32c8fe31c0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 14:32:16,863 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 14:32:16,943 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 14:32:16,949 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 14:32:16,949 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 14:32:16,974 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 14:32:16,976 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 14:32:16,976 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 14:32:16,977 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 14:32:16,977 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 14:32:16,978 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 14:32:16,978 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 14:32:16,978 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 14:32:16,978 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 14:32:16,979 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 14:32:16,979 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 14:32:16,979 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 14:32:16,979 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 14:32:16,979 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 14:32:16,979 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 14:32:16,980 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 14:32:16,980 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 14:32:16,980 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 14:32:16,980 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 14:32:16,980 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 14:32:16,980 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 14:32:16,980 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 14:32:16,980 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 14:32:16,981 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 14:32:16,981 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 14:32:16,981 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 14:32:16,981 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 14:32:16,982 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 14:32:16,982 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 14:32:16,982 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 14:32:16,982 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 14:32:16,982 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 14:32:16,982 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 14:32:16,982 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 14:32:16,982 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 14:32:16,982 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 14:32:16,983 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 14:32:16,983 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 14:32:16,983 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-jdk21/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 -> a38de44f112a10364737c35b840e673503a211a020b9f494a50e4a32c8fe31c0 [2025-02-05 14:32:17,274 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 14:32:17,287 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 14:32:17,289 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 14:32:17,292 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 14:32:17,292 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 14:32:17,294 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-manipulation/bubble_sort_linux-1.i [2025-02-05 14:32:18,666 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c797d906e/c848e2645bf54414b2cc75fcd5d1628b/FLAG73fe7eeaa [2025-02-05 14:32:19,042 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 14:32:19,047 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-1.i [2025-02-05 14:32:19,070 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c797d906e/c848e2645bf54414b2cc75fcd5d1628b/FLAG73fe7eeaa [2025-02-05 14:32:19,089 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c797d906e/c848e2645bf54414b2cc75fcd5d1628b [2025-02-05 14:32:19,092 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 14:32:19,094 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 14:32:19,096 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 14:32:19,096 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 14:32:19,102 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 14:32:19,103 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 02:32:19" (1/1) ... [2025-02-05 14:32:19,105 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c948422 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:32:19, skipping insertion in model container [2025-02-05 14:32:19,105 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 02:32:19" (1/1) ... [2025-02-05 14:32:19,152 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 14:32:19,454 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-1.i[33822,33835] [2025-02-05 14:32:19,510 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 14:32:19,520 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 14:32:19,564 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-1.i[33822,33835] [2025-02-05 14:32:19,591 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 14:32:19,639 INFO L204 MainTranslator]: Completed translation [2025-02-05 14:32:19,640 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:32:19 WrapperNode [2025-02-05 14:32:19,640 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 14:32:19,641 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 14:32:19,641 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 14:32:19,641 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 14:32:19,646 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:32:19" (1/1) ... [2025-02-05 14:32:19,663 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:32:19" (1/1) ... [2025-02-05 14:32:19,684 INFO L138 Inliner]: procedures = 232, calls = 75, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 114 [2025-02-05 14:32:19,684 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 14:32:19,685 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 14:32:19,685 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 14:32:19,685 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 14:32:19,692 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:32:19" (1/1) ... [2025-02-05 14:32:19,692 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:32:19" (1/1) ... [2025-02-05 14:32:19,696 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:32:19" (1/1) ... [2025-02-05 14:32:19,722 INFO L175 MemorySlicer]: Split 37 memory accesses to 2 slices as follows [2, 35]. 95 percent of accesses are in the largest equivalence class. The 4 initializations are split as follows [2, 2]. The 10 writes are split as follows [0, 10]. [2025-02-05 14:32:19,722 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:32:19" (1/1) ... [2025-02-05 14:32:19,723 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:32:19" (1/1) ... [2025-02-05 14:32:19,737 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:32:19" (1/1) ... [2025-02-05 14:32:19,738 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:32:19" (1/1) ... [2025-02-05 14:32:19,740 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:32:19" (1/1) ... [2025-02-05 14:32:19,741 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:32:19" (1/1) ... [2025-02-05 14:32:19,743 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 14:32:19,745 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 14:32:19,745 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 14:32:19,745 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 14:32:19,746 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:32:19" (1/1) ... [2025-02-05 14:32:19,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 14:32:19,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:32:19,778 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 14:32:19,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 14:32:19,802 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-05 14:32:19,802 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-05 14:32:19,803 INFO L130 BoogieDeclarations]: Found specification of procedure inspect [2025-02-05 14:32:19,803 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect [2025-02-05 14:32:19,803 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-05 14:32:19,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-05 14:32:19,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-05 14:32:19,803 INFO L130 BoogieDeclarations]: Found specification of procedure val_from_node [2025-02-05 14:32:19,803 INFO L138 BoogieDeclarations]: Found implementation of procedure val_from_node [2025-02-05 14:32:19,803 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-05 14:32:19,803 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-05 14:32:19,803 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2025-02-05 14:32:19,803 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2025-02-05 14:32:19,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-05 14:32:19,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-05 14:32:19,803 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-05 14:32:19,803 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 14:32:19,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-05 14:32:19,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-05 14:32:19,804 INFO L130 BoogieDeclarations]: Found specification of procedure list_add [2025-02-05 14:32:19,804 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add [2025-02-05 14:32:19,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 14:32:19,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 14:32:19,804 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 14:32:19,805 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 14:32:19,917 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 14:32:19,919 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 14:32:19,958 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L923: havoc #t~mem54; [2025-02-05 14:32:20,331 INFO L? ?]: Removed 67 outVars from TransFormulas that were not future-live. [2025-02-05 14:32:20,331 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 14:32:20,347 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 14:32:20,350 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 14:32:20,350 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 02:32:20 BoogieIcfgContainer [2025-02-05 14:32:20,350 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 14:32:20,355 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 14:32:20,356 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 14:32:20,360 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 14:32:20,360 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 02:32:19" (1/3) ... [2025-02-05 14:32:20,361 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66c136d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 02:32:20, skipping insertion in model container [2025-02-05 14:32:20,361 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:32:19" (2/3) ... [2025-02-05 14:32:20,362 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66c136d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 02:32:20, skipping insertion in model container [2025-02-05 14:32:20,363 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 02:32:20" (3/3) ... [2025-02-05 14:32:20,364 INFO L128 eAbstractionObserver]: Analyzing ICFG bubble_sort_linux-1.i [2025-02-05 14:32:20,380 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 14:32:20,382 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bubble_sort_linux-1.i that has 5 procedures, 123 locations, 1 initial locations, 23 loop locations, and 1 error locations. [2025-02-05 14:32:20,444 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 14:32:20,455 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;@579e0122, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 14:32:20,455 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 14:32:20,461 INFO L276 IsEmpty]: Start isEmpty. Operand has 123 states, 94 states have (on average 1.6914893617021276) internal successors, (159), 113 states have internal predecessors, (159), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-02-05 14:32:20,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-05 14:32:20,467 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:32:20,468 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:32:20,468 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:32:20,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:32:20,475 INFO L85 PathProgramCache]: Analyzing trace with hash 357163825, now seen corresponding path program 1 times [2025-02-05 14:32:20,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:32:20,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460818536] [2025-02-05 14:32:20,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:32:20,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:32:20,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-05 14:32:20,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-05 14:32:20,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:32:20,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:32:20,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:32:20,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:32:20,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460818536] [2025-02-05 14:32:20,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460818536] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:32:20,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:32:20,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 14:32:20,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512630838] [2025-02-05 14:32:20,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:32:20,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 14:32:20,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:32:20,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 14:32:20,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 14:32:20,676 INFO L87 Difference]: Start difference. First operand has 123 states, 94 states have (on average 1.6914893617021276) internal successors, (159), 113 states have internal predecessors, (159), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:32:20,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:32:20,719 INFO L93 Difference]: Finished difference Result 240 states and 405 transitions. [2025-02-05 14:32:20,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 14:32:20,723 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), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-02-05 14:32:20,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:32:20,730 INFO L225 Difference]: With dead ends: 240 [2025-02-05 14:32:20,730 INFO L226 Difference]: Without dead ends: 112 [2025-02-05 14:32:20,737 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-02-05 14:32:20,740 INFO L435 NwaCegarLoop]: 141 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, 141 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-02-05 14:32:20,741 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 14:32:20,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-02-05 14:32:20,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2025-02-05 14:32:20,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 87 states have (on average 1.2298850574712643) internal successors, (107), 102 states have internal predecessors, (107), 21 states have call successors, (21), 4 states have call predecessors, (21), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-05 14:32:20,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 133 transitions. [2025-02-05 14:32:20,788 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 133 transitions. Word has length 10 [2025-02-05 14:32:20,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:32:20,789 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 133 transitions. [2025-02-05 14:32:20,790 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), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:32:20,790 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 133 transitions. [2025-02-05 14:32:20,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-05 14:32:20,792 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:32:20,792 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:32:20,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 14:32:20,792 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:32:20,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:32:20,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1258694378, now seen corresponding path program 1 times [2025-02-05 14:32:20,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:32:20,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876980643] [2025-02-05 14:32:20,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:32:20,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:32:20,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-05 14:32:20,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-05 14:32:20,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:32:20,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:32:21,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:32:21,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:32:21,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876980643] [2025-02-05 14:32:21,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876980643] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:32:21,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:32:21,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 14:32:21,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526296959] [2025-02-05 14:32:21,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:32:21,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 14:32:21,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:32:21,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 14:32:21,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 14:32:21,224 INFO L87 Difference]: Start difference. First operand 112 states and 133 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 14:32:21,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:32:21,386 INFO L93 Difference]: Finished difference Result 114 states and 134 transitions. [2025-02-05 14:32:21,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 14:32:21,389 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2025-02-05 14:32:21,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:32:21,391 INFO L225 Difference]: With dead ends: 114 [2025-02-05 14:32:21,391 INFO L226 Difference]: Without dead ends: 111 [2025-02-05 14:32:21,391 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 14:32:21,392 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 187 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 14:32:21,392 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 258 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 14:32:21,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-02-05 14:32:21,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2025-02-05 14:32:21,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 87 states have (on average 1.2183908045977012) internal successors, (106), 101 states have internal predecessors, (106), 20 states have call successors, (20), 4 states have call predecessors, (20), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-05 14:32:21,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 131 transitions. [2025-02-05 14:32:21,416 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 131 transitions. Word has length 21 [2025-02-05 14:32:21,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:32:21,417 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 131 transitions. [2025-02-05 14:32:21,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 14:32:21,418 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 131 transitions. [2025-02-05 14:32:21,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-05 14:32:21,418 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:32:21,418 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:32:21,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 14:32:21,419 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:32:21,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:32:21,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1536977201, now seen corresponding path program 1 times [2025-02-05 14:32:21,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:32:21,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486575322] [2025-02-05 14:32:21,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:32:21,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:32:21,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-05 14:32:21,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-05 14:32:21,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:32:21,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:32:21,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:32:21,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:32:21,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486575322] [2025-02-05 14:32:21,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486575322] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:32:21,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:32:21,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-05 14:32:21,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686869697] [2025-02-05 14:32:21,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:32:21,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 14:32:21,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:32:21,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 14:32:21,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-02-05 14:32:21,992 INFO L87 Difference]: Start difference. First operand 111 states and 131 transitions. Second operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 14:32:22,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:32:22,627 INFO L93 Difference]: Finished difference Result 209 states and 246 transitions. [2025-02-05 14:32:22,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-05 14:32:22,628 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2025-02-05 14:32:22,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:32:22,631 INFO L225 Difference]: With dead ends: 209 [2025-02-05 14:32:22,631 INFO L226 Difference]: Without dead ends: 203 [2025-02-05 14:32:22,632 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2025-02-05 14:32:22,633 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 383 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 14:32:22,633 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [384 Valid, 556 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 14:32:22,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2025-02-05 14:32:22,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 183. [2025-02-05 14:32:22,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 155 states have (on average 1.2258064516129032) internal successors, (190), 169 states have internal predecessors, (190), 23 states have call successors, (23), 6 states have call predecessors, (23), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-05 14:32:22,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 220 transitions. [2025-02-05 14:32:22,679 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 220 transitions. Word has length 24 [2025-02-05 14:32:22,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:32:22,679 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 220 transitions. [2025-02-05 14:32:22,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 14:32:22,679 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 220 transitions. [2025-02-05 14:32:22,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-05 14:32:22,680 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:32:22,680 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:32:22,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 14:32:22,680 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:32:22,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:32:22,680 INFO L85 PathProgramCache]: Analyzing trace with hash -621649773, now seen corresponding path program 1 times [2025-02-05 14:32:22,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:32:22,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831990027] [2025-02-05 14:32:22,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:32:22,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:32:22,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-05 14:32:22,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-05 14:32:22,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:32:22,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:32:24,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:32:24,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:32:24,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831990027] [2025-02-05 14:32:24,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831990027] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:32:24,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:32:24,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-05 14:32:24,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384860217] [2025-02-05 14:32:24,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:32:24,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 14:32:24,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:32:24,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 14:32:24,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-02-05 14:32:24,022 INFO L87 Difference]: Start difference. First operand 183 states and 220 transitions. Second operand has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 9 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 14:32:25,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:32:25,174 INFO L93 Difference]: Finished difference Result 290 states and 345 transitions. [2025-02-05 14:32:25,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 14:32:25,175 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 9 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2025-02-05 14:32:25,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:32:25,177 INFO L225 Difference]: With dead ends: 290 [2025-02-05 14:32:25,178 INFO L226 Difference]: Without dead ends: 287 [2025-02-05 14:32:25,179 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2025-02-05 14:32:25,180 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 337 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 1101 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 1140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 14:32:25,181 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 243 Invalid, 1140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1101 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 14:32:25,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2025-02-05 14:32:25,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 269. [2025-02-05 14:32:25,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 234 states have (on average 1.2222222222222223) internal successors, (286), 249 states have internal predecessors, (286), 28 states have call successors, (28), 8 states have call predecessors, (28), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-05 14:32:25,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 325 transitions. [2025-02-05 14:32:25,236 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 325 transitions. Word has length 27 [2025-02-05 14:32:25,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:32:25,236 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 325 transitions. [2025-02-05 14:32:25,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 9 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 14:32:25,237 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 325 transitions. [2025-02-05 14:32:25,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-02-05 14:32:25,238 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:32:25,238 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:32:25,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 14:32:25,239 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:32:25,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:32:25,240 INFO L85 PathProgramCache]: Analyzing trace with hash -446688366, now seen corresponding path program 1 times [2025-02-05 14:32:25,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:32:25,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651389535] [2025-02-05 14:32:25,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:32:25,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:32:25,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-05 14:32:25,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-05 14:32:25,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:32:25,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:32:25,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:32:25,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:32:25,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651389535] [2025-02-05 14:32:25,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651389535] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:32:25,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:32:25,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-05 14:32:25,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835987968] [2025-02-05 14:32:25,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:32:25,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 14:32:25,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:32:25,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 14:32:25,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-02-05 14:32:25,959 INFO L87 Difference]: Start difference. First operand 269 states and 325 transitions. Second operand has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 7 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 14:32:26,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:32:26,876 INFO L93 Difference]: Finished difference Result 289 states and 343 transitions. [2025-02-05 14:32:26,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 14:32:26,877 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 7 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2025-02-05 14:32:26,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:32:26,879 INFO L225 Difference]: With dead ends: 289 [2025-02-05 14:32:26,879 INFO L226 Difference]: Without dead ends: 286 [2025-02-05 14:32:26,879 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2025-02-05 14:32:26,880 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 374 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 1005 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 1042 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1005 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 14:32:26,880 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 227 Invalid, 1042 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1005 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 14:32:26,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2025-02-05 14:32:26,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 269. [2025-02-05 14:32:26,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 234 states have (on average 1.2179487179487178) internal successors, (285), 249 states have internal predecessors, (285), 28 states have call successors, (28), 8 states have call predecessors, (28), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-05 14:32:26,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 324 transitions. [2025-02-05 14:32:26,929 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 324 transitions. Word has length 31 [2025-02-05 14:32:26,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:32:26,929 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 324 transitions. [2025-02-05 14:32:26,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 7 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 14:32:26,929 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 324 transitions. [2025-02-05 14:32:26,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-02-05 14:32:26,930 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:32:26,930 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:32:26,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 14:32:26,930 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:32:26,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:32:26,931 INFO L85 PathProgramCache]: Analyzing trace with hash -1558150741, now seen corresponding path program 1 times [2025-02-05 14:32:26,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:32:26,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419626459] [2025-02-05 14:32:26,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:32:26,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:32:26,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-05 14:32:26,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-05 14:32:26,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:32:26,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:32:27,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:32:27,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:32:27,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419626459] [2025-02-05 14:32:27,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419626459] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:32:27,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:32:27,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-05 14:32:27,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331429443] [2025-02-05 14:32:27,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:32:27,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 14:32:27,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:32:27,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 14:32:27,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-02-05 14:32:27,889 INFO L87 Difference]: Start difference. First operand 269 states and 324 transitions. Second operand has 12 states, 12 states have (on average 2.5) internal successors, (30), 8 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 14:32:28,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:32:28,918 INFO L93 Difference]: Finished difference Result 288 states and 341 transitions. [2025-02-05 14:32:28,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 14:32:28,918 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5) internal successors, (30), 8 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2025-02-05 14:32:28,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:32:28,920 INFO L225 Difference]: With dead ends: 288 [2025-02-05 14:32:28,920 INFO L226 Difference]: Without dead ends: 285 [2025-02-05 14:32:28,921 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2025-02-05 14:32:28,921 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 368 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 1097 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 1132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1097 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 14:32:28,924 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [371 Valid, 243 Invalid, 1132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1097 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 14:32:28,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2025-02-05 14:32:28,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 269. [2025-02-05 14:32:28,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 234 states have (on average 1.2136752136752136) internal successors, (284), 249 states have internal predecessors, (284), 28 states have call successors, (28), 8 states have call predecessors, (28), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-05 14:32:28,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 323 transitions. [2025-02-05 14:32:28,958 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 323 transitions. Word has length 34 [2025-02-05 14:32:28,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:32:28,958 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 323 transitions. [2025-02-05 14:32:28,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.5) internal successors, (30), 8 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 14:32:28,959 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 323 transitions. [2025-02-05 14:32:28,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-02-05 14:32:28,960 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:32:28,960 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:32:28,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 14:32:28,960 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:32:28,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:32:28,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1059254863, now seen corresponding path program 1 times [2025-02-05 14:32:28,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:32:28,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040353935] [2025-02-05 14:32:28,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:32:28,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:32:28,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-05 14:32:28,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-05 14:32:28,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:32:28,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:32:29,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:32:29,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:32:29,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040353935] [2025-02-05 14:32:29,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040353935] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:32:29,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:32:29,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-05 14:32:29,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293125099] [2025-02-05 14:32:29,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:32:29,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 14:32:29,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:32:29,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 14:32:29,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-02-05 14:32:29,896 INFO L87 Difference]: Start difference. First operand 269 states and 323 transitions. Second operand has 12 states, 12 states have (on average 2.75) internal successors, (33), 8 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 14:32:30,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:32:30,997 INFO L93 Difference]: Finished difference Result 287 states and 339 transitions. [2025-02-05 14:32:31,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 14:32:31,000 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 8 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2025-02-05 14:32:31,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:32:31,002 INFO L225 Difference]: With dead ends: 287 [2025-02-05 14:32:31,002 INFO L226 Difference]: Without dead ends: 284 [2025-02-05 14:32:31,003 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2025-02-05 14:32:31,003 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 361 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 1116 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 1149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 14:32:31,007 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 250 Invalid, 1149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1116 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 14:32:31,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2025-02-05 14:32:31,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 269. [2025-02-05 14:32:31,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 234 states have (on average 1.2094017094017093) internal successors, (283), 249 states have internal predecessors, (283), 28 states have call successors, (28), 8 states have call predecessors, (28), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-05 14:32:31,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 322 transitions. [2025-02-05 14:32:31,041 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 322 transitions. Word has length 37 [2025-02-05 14:32:31,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:32:31,042 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 322 transitions. [2025-02-05 14:32:31,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 8 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 14:32:31,043 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 322 transitions. [2025-02-05 14:32:31,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-02-05 14:32:31,044 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:32:31,044 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:32:31,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 14:32:31,046 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:32:31,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:32:31,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1792349983, now seen corresponding path program 1 times [2025-02-05 14:32:31,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:32:31,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044228225] [2025-02-05 14:32:31,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:32:31,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:32:31,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-05 14:32:31,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-05 14:32:31,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:32:31,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:32:32,888 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-05 14:32:32,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:32:32,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044228225] [2025-02-05 14:32:32,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044228225] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:32:32,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1161888414] [2025-02-05 14:32:32,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:32:32,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:32:32,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:32:32,893 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 14:32:32,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 14:32:33,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-05 14:32:33,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-05 14:32:33,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:32:33,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:32:33,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 118 conjuncts are in the unsatisfiable core [2025-02-05 14:32:33,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:32:33,176 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-05 14:32:33,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-02-05 14:32:33,271 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-02-05 14:32:33,282 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-02-05 14:32:33,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2025-02-05 14:32:33,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 43 [2025-02-05 14:32:33,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:32:33,648 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 14 [2025-02-05 14:32:33,657 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 29 treesize of output 27 [2025-02-05 14:32:33,808 INFO L349 Elim1Store]: treesize reduction 24, result has 41.5 percent of original size [2025-02-05 14:32:33,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 29 [2025-02-05 14:32:33,885 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 25 [2025-02-05 14:32:34,298 INFO L349 Elim1Store]: treesize reduction 180, result has 11.8 percent of original size [2025-02-05 14:32:34,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 115 treesize of output 92 [2025-02-05 14:32:34,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:32:34,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:32:34,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:32:34,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 44 [2025-02-05 14:32:34,328 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:32:34,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 45 treesize of output 31 [2025-02-05 14:32:34,336 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 0 case distinctions, treesize of input 39 treesize of output 35 [2025-02-05 14:32:34,346 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 7 treesize of output 3 [2025-02-05 14:32:34,438 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2025-02-05 14:32:34,438 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 59 [2025-02-05 14:32:34,793 INFO L349 Elim1Store]: treesize reduction 26, result has 3.7 percent of original size [2025-02-05 14:32:34,794 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 4 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 22 [2025-02-05 14:32:34,837 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:32:34,837 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 14:32:34,954 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_415 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_415) |c_~#gl_list~0.base|) (+ |c_~#gl_list~0.offset| 4)) |c_~#gl_list~0.base|))) is different from false [2025-02-05 14:32:35,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1161888414] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:32:35,187 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 14:32:35,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 29 [2025-02-05 14:32:35,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131074518] [2025-02-05 14:32:35,187 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 14:32:35,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-02-05 14:32:35,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:32:35,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-02-05 14:32:35,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=957, Unknown=2, NotChecked=62, Total=1122 [2025-02-05 14:32:35,189 INFO L87 Difference]: Start difference. First operand 269 states and 322 transitions. Second operand has 30 states, 30 states have (on average 2.1) internal successors, (63), 20 states have internal predecessors, (63), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-05 14:32:40,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:32:40,574 INFO L93 Difference]: Finished difference Result 409 states and 476 transitions. [2025-02-05 14:32:40,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-02-05 14:32:40,575 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.1) internal successors, (63), 20 states have internal predecessors, (63), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 39 [2025-02-05 14:32:40,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:32:40,578 INFO L225 Difference]: With dead ends: 409 [2025-02-05 14:32:40,578 INFO L226 Difference]: Without dead ends: 406 [2025-02-05 14:32:40,580 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 578 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=442, Invalid=3100, Unknown=2, NotChecked=116, Total=3660 [2025-02-05 14:32:40,581 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 1461 mSDsluCounter, 722 mSDsCounter, 0 mSdLazyCounter, 4023 mSolverCounterSat, 253 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1464 SdHoareTripleChecker+Valid, 769 SdHoareTripleChecker+Invalid, 4276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 253 IncrementalHoareTripleChecker+Valid, 4023 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-02-05 14:32:40,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1464 Valid, 769 Invalid, 4276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [253 Valid, 4023 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-02-05 14:32:40,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2025-02-05 14:32:40,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 281. [2025-02-05 14:32:40,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 243 states have (on average 1.1975308641975309) internal successors, (291), 259 states have internal predecessors, (291), 29 states have call successors, (29), 10 states have call predecessors, (29), 8 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-05 14:32:40,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 332 transitions. [2025-02-05 14:32:40,641 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 332 transitions. Word has length 39 [2025-02-05 14:32:40,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:32:40,642 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 332 transitions. [2025-02-05 14:32:40,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.1) internal successors, (63), 20 states have internal predecessors, (63), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-05 14:32:40,642 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 332 transitions. [2025-02-05 14:32:40,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-02-05 14:32:40,643 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:32:40,643 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:32:40,651 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 14:32:40,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:32:40,844 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:32:40,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:32:40,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1700035378, now seen corresponding path program 1 times [2025-02-05 14:32:40,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:32:40,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256148637] [2025-02-05 14:32:40,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:32:40,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:32:40,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-05 14:32:40,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-05 14:32:40,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:32:40,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:32:41,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:32:41,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:32:41,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256148637] [2025-02-05 14:32:41,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256148637] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:32:41,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:32:41,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-05 14:32:41,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175580237] [2025-02-05 14:32:41,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:32:41,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 14:32:41,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:32:41,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 14:32:41,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-02-05 14:32:41,439 INFO L87 Difference]: Start difference. First operand 281 states and 332 transitions. Second operand has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 8 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 14:32:42,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:32:42,317 INFO L93 Difference]: Finished difference Result 295 states and 344 transitions. [2025-02-05 14:32:42,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-05 14:32:42,318 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 8 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2025-02-05 14:32:42,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:32:42,319 INFO L225 Difference]: With dead ends: 295 [2025-02-05 14:32:42,319 INFO L226 Difference]: Without dead ends: 292 [2025-02-05 14:32:42,320 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=105, Invalid=447, Unknown=0, NotChecked=0, Total=552 [2025-02-05 14:32:42,320 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 446 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 1030 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 449 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 1079 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1030 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 14:32:42,320 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [449 Valid, 234 Invalid, 1079 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1030 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 14:32:42,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2025-02-05 14:32:42,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 281. [2025-02-05 14:32:42,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 243 states have (on average 1.1934156378600822) internal successors, (290), 259 states have internal predecessors, (290), 29 states have call successors, (29), 10 states have call predecessors, (29), 8 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-05 14:32:42,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 331 transitions. [2025-02-05 14:32:42,361 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 331 transitions. Word has length 41 [2025-02-05 14:32:42,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:32:42,361 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 331 transitions. [2025-02-05 14:32:42,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 8 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 14:32:42,361 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 331 transitions. [2025-02-05 14:32:42,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-02-05 14:32:42,362 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:32:42,362 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:32:42,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 14:32:42,363 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:32:42,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:32:42,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1062427618, now seen corresponding path program 1 times [2025-02-05 14:32:42,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:32:42,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312954487] [2025-02-05 14:32:42,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:32:42,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:32:42,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-05 14:32:42,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-05 14:32:42,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:32:42,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:32:43,560 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-05 14:32:43,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:32:43,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312954487] [2025-02-05 14:32:43,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312954487] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:32:43,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [382792582] [2025-02-05 14:32:43,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:32:43,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:32:43,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:32:43,564 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 14:32:43,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 14:32:43,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-05 14:32:43,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-05 14:32:43,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:32:43,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:32:43,717 INFO L256 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 124 conjuncts are in the unsatisfiable core [2025-02-05 14:32:43,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:32:43,785 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-05 14:32:43,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-02-05 14:32:43,841 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-02-05 14:32:43,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2025-02-05 14:32:43,950 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 14:32:43,954 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 50 treesize of output 36 [2025-02-05 14:32:43,958 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 0 case distinctions, treesize of input 12 treesize of output 1 [2025-02-05 14:32:43,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 37 [2025-02-05 14:32:43,991 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 0 case distinctions, treesize of input 12 treesize of output 1 [2025-02-05 14:32:44,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 39 [2025-02-05 14:32:44,041 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 0 case distinctions, treesize of input 12 treesize of output 1 [2025-02-05 14:32:44,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 37 [2025-02-05 14:32:44,093 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 0 case distinctions, treesize of input 12 treesize of output 1 [2025-02-05 14:32:44,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 44 [2025-02-05 14:32:44,162 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 0 case distinctions, treesize of input 12 treesize of output 1 [2025-02-05 14:32:44,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:32:44,205 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 20 treesize of output 12 [2025-02-05 14:32:44,208 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 0 case distinctions, treesize of input 12 treesize of output 1 [2025-02-05 14:32:44,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 39 [2025-02-05 14:32:44,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:32:44,230 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 57 treesize of output 36 [2025-02-05 14:32:44,244 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 23 treesize of output 1 [2025-02-05 14:32:44,260 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 0 case distinctions, treesize of input 12 treesize of output 1 [2025-02-05 14:33:00,956 WARN L286 SmtUtils]: Spent 7.07s on a formula simplification that was a NOOP. DAG size: 192 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-02-05 14:33:01,962 INFO L349 Elim1Store]: treesize reduction 341, result has 5.0 percent of original size [2025-02-05 14:33:01,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 8 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 11 new quantified variables, introduced 9 case distinctions, treesize of input 518 treesize of output 646 [2025-02-05 14:33:02,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:33:02,063 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 14:33:02,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 6 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 239 treesize of output 372 [2025-02-05 14:33:04,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:33:04,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 6 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 415 treesize of output 592 [2025-02-05 14:33:04,137 INFO L349 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2025-02-05 14:33:04,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 373 treesize of output 395 [2025-02-05 14:33:04,185 INFO L349 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2025-02-05 14:33:04,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 368 treesize of output 394 [2025-02-05 14:33:05,013 INFO L349 Elim1Store]: treesize reduction 58, result has 10.8 percent of original size [2025-02-05 14:33:05,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 356 treesize of output 351 [2025-02-05 14:33:05,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 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 393 treesize of output 377 [2025-02-05 14:33:05,569 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 22 treesize of output 20 [2025-02-05 14:33:05,628 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 14:33:05,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 79 treesize of output 61 [2025-02-05 14:33:05,846 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 38 treesize of output 36 [2025-02-05 14:33:06,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:33:06,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:33:08,420 INFO L349 Elim1Store]: treesize reduction 192, result has 22.0 percent of original size [2025-02-05 14:33:08,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 11 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 10 new quantified variables, introduced 17 case distinctions, treesize of input 745 treesize of output 1534 [2025-02-05 14:33:23,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:33:23,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:33:23,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:33:23,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:33:23,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:33:23,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:33:23,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 992 treesize of output 942 [2025-02-05 14:33:23,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:33:23,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:33:23,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:33:23,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:33:23,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:33:23,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:33:23,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 303 treesize of output 287 [2025-02-05 14:33:23,735 INFO L349 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2025-02-05 14:33:23,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 55 [2025-02-05 14:33:23,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:33:23,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:33:23,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:33:23,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:33:23,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:33:23,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:33:23,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 299 treesize of output 263 [2025-02-05 14:33:23,766 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 14 treesize of output 18 [2025-02-05 14:33:23,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 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 110 treesize of output 146 [2025-02-05 14:33:23,779 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 57 treesize of output 11 [2025-02-05 14:33:23,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2025-02-05 14:33:24,335 INFO L349 Elim1Store]: treesize reduction 64, result has 28.9 percent of original size [2025-02-05 14:33:24,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 26 [2025-02-05 14:33:24,992 INFO L349 Elim1Store]: treesize reduction 88, result has 9.3 percent of original size [2025-02-05 14:33:24,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 964 treesize of output 977 [2025-02-05 14:33:25,780 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 14:33:27,255 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 14:33:28,606 INFO L224 Elim1Store]: Index analysis took 3503 ms [2025-02-05 14:33:28,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 8 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 551 treesize of output 633 [2025-02-05 14:33:37,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:33:37,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:33:37,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 317 treesize of output 292 [2025-02-05 14:33:37,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:33:37,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:33:37,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 226 treesize of output 212 [2025-02-05 14:33:37,631 INFO L349 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2025-02-05 14:33:37,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 84 treesize of output 64 [2025-02-05 14:33:37,678 INFO L349 Elim1Store]: treesize reduction 64, result has 28.9 percent of original size [2025-02-05 14:33:37,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 26 [2025-02-05 14:33:42,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:33:42,896 INFO L349 Elim1Store]: treesize reduction 301, result has 17.3 percent of original size [2025-02-05 14:33:42,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 18 case distinctions, treesize of input 16462 treesize of output 15852 [2025-02-05 14:33:42,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:33:42,963 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 1865 treesize of output 1646 [2025-02-05 14:33:43,029 INFO L349 Elim1Store]: treesize reduction 48, result has 18.6 percent of original size [2025-02-05 14:33:43,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 1826 treesize of output 1846